{"baseline":{"bytes":15999,"sha256":"bfb6fb2832a2659c24ba67576edc7a9373ae0f7d80e024ba921c88b481945a4f"},"course_id":"C130","native_alignment_authority":{"exporter":{"bytes":152116,"function_lines":{"alignment_parts":[1793,1832],"nonempty_blocks":[1292,1308]},"member":"scripts/export_backend.py","sha256":"3edee807a41c766c84efbda2a67b209b3d41a8afa7dbf00252ee3cdd846eedb9"},"input":{"bytes":448536,"member":"backend/input/backend-input.json","sha256":"c70da303e2feade5dd52092b8e15b722d0ea8cd5e26be63d8cb001739b55daba"}},"native_records_changed":false,"overall_backend_complete":false,"records":[{"after_target_verification":{"alignment":{"authority":{"exporter":{"bytes":152116,"function_lines":{"alignment_parts":[1793,1832],"nonempty_blocks":[1292,1308]},"member":"scripts/export_backend.py","sha256":"3edee807a41c766c84efbda2a67b209b3d41a8afa7dbf00252ee3cdd846eedb9"},"input":{"bytes":448536,"member":"backend/input/backend-input.json","sha256":"c70da303e2feade5dd52092b8e15b722d0ea8cd5e26be63d8cb001739b55daba"}},"contract":"frozen-native-exporter-strip-each-declared-part-then-double-LF-join","parts":[{"line_range":[423,439],"raw_line_slice_sha256":"c233c537f11d08078ef944efdacc7f321ba68597f006cc4b3d90fdedec9c7e5e","stripped_part_sha256":"c233c537f11d08078ef944efdacc7f321ba68597f006cc4b3d90fdedec9c7e5e","target_block_index":49},{"line_range":[441,450],"raw_line_slice_sha256":"b1bd179e32b25303b929643ad7b32083ff749f29f5da739d77eb3985fad5ce83","stripped_part_sha256":"e1c0522e6d5adf8ba74a09f05e07fd8e18912117d8ec9de6c86082c9a541599b","target_block_index":50},{"line_range":[452,457],"raw_line_slice_sha256":"a5cdd97fde0a24476ef7b75b022d3501e3efe05d7209fc381c9fd2cc4159cf2e","stripped_part_sha256":"67045c794a0a7d0aace2fb2d7eafd96c7fd2cefb63542c436f6917f5ec82ae1e","target_block_index":51}],"reconstructed_content_sha256":"aa0c34dc200523a7165956a1d129b23a0c2a28e1561fe014c6ca590d58413681","source_block_index":44,"target_file_guard":{"native_expected_sha256":"110af1e063e78a0cb26b8abd3f9df2e3201ad8b361756a38314f33d9de6a3c4b","released_file":{"bytes":32978,"sha256":"110af1e063e78a0cb26b8abd3f9df2e3201ad8b361756a38314f33d9de6a3c4b"},"whole_file_guard_matches":true}},"archive":"source","line_range":[423,457],"member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"declared_native_alignment_parts_exact_text"},"before_target_verification":{"archive":"source","member":"source/visualizations/source/network_flow_demo.jsx","native_text_digest_matches":true,"state":"text_not_found"},"id":"segment.r017.book1.ch04.interactive.block-044","native_record_sha256":"4efa53e32efa1623ecb83c38e609e604e35174c05d62a2c4534f1164b5f1ea05","reason":"explicit_native_alignment_parts","source_file":{"archive":"source","bytes":32978,"member":"source/visualizations/source/network_flow_demo.jsx","normalized_sha256":"110af1e063e78a0cb26b8abd3f9df2e3201ad8b361756a38314f33d9de6a3c4b","sha256":"110af1e063e78a0cb26b8abd3f9df2e3201ad8b361756a38314f33d9de6a3c4b"}},{"after_target_verification":{"alignment":{"authority":{"exporter":{"bytes":152116,"function_lines":{"alignment_parts":[1793,1832],"nonempty_blocks":[1292,1308]},"member":"scripts/export_backend.py","sha256":"3edee807a41c766c84efbda2a67b209b3d41a8afa7dbf00252ee3cdd846eedb9"},"input":{"bytes":448536,"member":"backend/input/backend-input.json","sha256":"c70da303e2feade5dd52092b8e15b722d0ea8cd5e26be63d8cb001739b55daba"}},"contract":"frozen-native-exporter-strip-each-declared-part-then-double-LF-join","parts":[{"line_range":[768,774],"raw_line_slice_sha256":"29e03e27b08cc57bf2d56f5248ba051150ef57fc99a776c76876204cb5eab2c4","stripped_part_sha256":"dd12488480cc4c8c26eecaf91160b7d8b04d7afd0eba9fc991fcb7db9db5299b","target_block_index":133},{"line_range":[776,784],"raw_line_slice_sha256":"8e937810f68e82c88cf19f7c5961c4f4ef7e727cc0d9575366d469fc292602fa","stripped_part_sha256":"a72653ce4674a12c5b5a7592cd0a5ef192b465a94bbef33982dc243e9b8ec847","target_block_index":134}],"reconstructed_content_sha256":"fd19fda62a75986ef5c4d03e7bc0bc2c2ca16c507625e0ba064ef20ee4d124ca","source_block_index":133,"target_file_guard":{"native_expected_sha256":"b18eac29969fdce112da5ceb83b74518138d1bcaa22efe52aeee2411676b9b7c","released_file":{"bytes":136863,"sha256":"42c1640cd736a36e55d812fa58c696edbaa56958b02a2cd17c2cc301d0b30179"},"whole_file_guard_matches":false}},"archive":"source","line_range":[768,784],"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"declared_native_alignment_parts_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","native_text_digest_matches":true,"state":"text_not_found"},"id":"segment.r017.book1.ch07.text.block-133","native_record_sha256":"92c363c5f79506883f41e520897c0fd5dae3176ee6be065b2860d2606575044b","reason":"explicit_native_alignment_parts","source_file":{"archive":"source","bytes":136863,"member":"source/Intro-Math-Programming/baseText/book/part1-linear-programming/ch06-simplex/simplex-basis-driven.tex","normalized_sha256":"42c1640cd736a36e55d812fa58c696edbaa56958b02a2cd17c2cc301d0b30179","sha256":"42c1640cd736a36e55d812fa58c696edbaa56958b02a2cd17c2cc301d0b30179"}},{"after_target_verification":{"archive":"source","line_range":[1778,1778],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-236","native_record_sha256":"b06ecd870af51c05a65342cc34037c77a761275d8120b02d418ac5c07b7ef6d0","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[1809,1809],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-242","native_record_sha256":"de1f9e9162efe46fbe47e199bfe45b2f5e0fc73e8458adff7a8279a1d4fc99e9","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[1828,1828],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-244","native_record_sha256":"3475af0710b76fc50c08bf3242059589b8d8b3a14aaebe850adc11d6bcfa598c","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[1830,1830],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-245","native_record_sha256":"0a059c6b0ab30fc4dd315b3a691bea7473f9f6494d57b6fb3bb133abafd9cc68","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[1847,1847],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-247","native_record_sha256":"4771bf3f9a51f7ee71cd9ddff198084f81f7db74319e2b5099eaa645fd347f7e","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2051,2051],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-267","native_record_sha256":"081908937efa9fc6fe34feeb1b4fed09d60b58a8174323c1f2c09ddd2231414d","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2094,2094],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-272","native_record_sha256":"a3c61eb5b8cc58ed881f011446778cbd93c7392fe5b358ae6c64a93afc1a38fd","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2279,2282],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-290","native_record_sha256":"20e3fbaca86cd6d644c9d31222154d7254ad724fb85bd3cbcc8d11a7d371c6d4","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2294,2295],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-292","native_record_sha256":"23cb65c46cc0a5ebfb9ea9ff4c3a50aab3fffd590fbea46d24234e462d45cc89","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2320,2322],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-295","native_record_sha256":"24baf255f15aa545702729128486a0101028ebdde1bddc3339d85c67c21d4ac4","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2324,2325],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-296","native_record_sha256":"a102e148e172d93c524f8c1c9c050d9834e6c234ab1f85e8f7a4bbc780552a8e","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2398,2398],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-303","native_record_sha256":"39087c8a9603986098066ba6e4d15c32b7c125436be5a38cf5cd9455747a480f","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2673,2687],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-324","native_record_sha256":"656f970cec15e7ad5bc4fad88389a7381f56cb04d1ab15a7d673669eddcd3cc7","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2767,2767],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-332","native_record_sha256":"b97f9ef2d6ec4540a503ca536cf694b51662c96cbb927475b0f34cccb36b9786","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2810,2810],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-342","native_record_sha256":"64a338e1817f603f2792048420307ab97895dfa97ffaf91b8f656a3a96fdc880","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2840,2840],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-347","native_record_sha256":"d96b1882a20304e92b2fdb32ac851a3e447f1835147cec8ce89aafe07ba1996e","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2887,2887],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-356","native_record_sha256":"1c5031bedabf8b2d57b4c5c4e4396c7f724c153027d510d308da18c7c721044b","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[2987,2987],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-377","native_record_sha256":"63358b401844bf939a9e69bb7ab1e4156c83d8fb804d0567af940f3eba102d78","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}},{"after_target_verification":{"archive":"source","line_range":[3139,3139],"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"declared_lines_exact_text"},"before_target_verification":{"archive":"source","member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","native_text_digest_matches":true,"state":"ambiguous_text_occurrences"},"id":"segment.r017.book1.ch14.text.block-397","native_record_sha256":"5c933fd566b63422b6ade672add954d0e021d97b64ecc0aa9e12850ca82f1020","reason":"lf_not_unicode_line_boundaries","source_file":{"archive":"source","bytes":160339,"member":"source/Intro-Math-Programming/baseText/book/part2-discrete-algorithms/ch10-graph-theory/graphtheory-dor1.tex","normalized_sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd","sha256":"bf10472a5ceb75aebe1702ecfb0e90c5d81242174858c28651196c9c169aa6bd"}}],"schema":"c130-location-review/1","semantic_canon_review":false,"whole_native_rebuild":false}