{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:O7DSWTX4RQCVUAHXAX5RNSNOVV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"218f654df785c3a81e4de74777110b269dd179568b18cb31a2fde452c57704a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-30T08:20:10Z","title_canon_sha256":"e2dc2a159b011264d000c1dafd014d4544cf01fbe890011eef3bb2d8463a9b0c"},"schema_version":"1.0","source":{"id":"1310.8062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8062","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8062v1","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8062","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"O7DSWTX4RQCV","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O7DSWTX4RQCVUAHX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O7DSWTX4","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:d409195adafd1c8062d07c81e2373322de259a1784af9984ddc9f7cedce3cc88","target":"graph","created_at":"2026-05-18T02:57:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Matrix $M$ is {\\em $k$-concise} if the finite entries of each column of $M$ consist of $k$ or less intervals of identical numbers. We give an $O(n+m)$-time algorithm to compute the row minima of any $O(1)$-concise $n\\times m$ matrix. Our algorithm yields the first $O(n+m)$-time reductions from the replacement-paths problem on an $n$-node $m$-edge undirected graph (respectively, directed acyclic graph) to the single-source shortest-paths problem on an $O(n)$-node $O(m)$-edge undirected graph (respectively, directed acyclic graph). That is, we prove that the replacement-paths problem is no harde","authors_text":"Cheng-Wei Lee, Hsueh-I Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-30T08:20:10Z","title":"Replacement Paths via Row Minima of Concise Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8062","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dccc2a00e573bbf908382f60c07f633cc4ee9db783938b6182b6c13d8e402b73","target":"record","created_at":"2026-05-18T02:57:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"218f654df785c3a81e4de74777110b269dd179568b18cb31a2fde452c57704a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-30T08:20:10Z","title_canon_sha256":"e2dc2a159b011264d000c1dafd014d4544cf01fbe890011eef3bb2d8463a9b0c"},"schema_version":"1.0","source":{"id":"1310.8062","kind":"arxiv","version":1}},"canonical_sha256":"77c72b4efc8c055a00f705fb16c9aead5c6ab46d3ffce0e25ff0970b94c24840","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77c72b4efc8c055a00f705fb16c9aead5c6ab46d3ffce0e25ff0970b94c24840","first_computed_at":"2026-05-18T02:57:26.332559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:26.332559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r4l6wHHaCNa9IoEzKXisHgmozNNEToyFbZdfrLYHfWZyocAiQ6MbU0C+Mm5P9f7HlkdbYxL0qRLZ8DsLs/V/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:26.333211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.8062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dccc2a00e573bbf908382f60c07f633cc4ee9db783938b6182b6c13d8e402b73","sha256:d409195adafd1c8062d07c81e2373322de259a1784af9984ddc9f7cedce3cc88"],"state_sha256":"593fc95e144fe4262739f294efc3433df150898751379a041948f64643d2ea25"}