{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:O7DSWTX4RQCVUAHXAX5RNSNOVV","short_pith_number":"pith:O7DSWTX4","schema_version":"1.0","canonical_sha256":"77c72b4efc8c055a00f705fb16c9aead5c6ab46d3ffce0e25ff0970b94c24840","source":{"kind":"arxiv","id":"1310.8062","version":1},"attestation_state":"computed","paper":{"title":"Replacement Paths via Row Minima of Concise Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cheng-Wei Lee, Hsueh-I Lu","submitted_at":"2013-10-30T08:20:10Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1310.8062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-30T08:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"e2dc2a159b011264d000c1dafd014d4544cf01fbe890011eef3bb2d8463a9b0c","abstract_canon_sha256":"218f654df785c3a81e4de74777110b269dd179568b18cb31a2fde452c57704a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:26.333211Z","signature_b64":"r4l6wHHaCNa9IoEzKXisHgmozNNEToyFbZdfrLYHfWZyocAiQ6MbU0C+Mm5P9f7HlkdbYxL0qRLZ8DsLs/V/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77c72b4efc8c055a00f705fb16c9aead5c6ab46d3ffce0e25ff0970b94c24840","last_reissued_at":"2026-05-18T02:57:26.332559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:26.332559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Replacement Paths via Row Minima of Concise Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cheng-Wei Lee, Hsueh-I Lu","submitted_at":"2013-10-30T08:20:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8062","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.8062","created_at":"2026-05-18T02:57:26.332658+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.8062v1","created_at":"2026-05-18T02:57:26.332658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8062","created_at":"2026-05-18T02:57:26.332658+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7DSWTX4RQCV","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7DSWTX4RQCVUAHX","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7DSWTX4","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV","json":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV.json","graph_json":"https://pith.science/api/pith-number/O7DSWTX4RQCVUAHXAX5RNSNOVV/graph.json","events_json":"https://pith.science/api/pith-number/O7DSWTX4RQCVUAHXAX5RNSNOVV/events.json","paper":"https://pith.science/paper/O7DSWTX4"},"agent_actions":{"view_html":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV","download_json":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV.json","view_paper":"https://pith.science/paper/O7DSWTX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.8062&json=true","fetch_graph":"https://pith.science/api/pith-number/O7DSWTX4RQCVUAHXAX5RNSNOVV/graph.json","fetch_events":"https://pith.science/api/pith-number/O7DSWTX4RQCVUAHXAX5RNSNOVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV/action/storage_attestation","attest_author":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV/action/author_attestation","sign_citation":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV/action/citation_signature","submit_replication":"https://pith.science/pith/O7DSWTX4RQCVUAHXAX5RNSNOVV/action/replication_record"}},"created_at":"2026-05-18T02:57:26.332658+00:00","updated_at":"2026-05-18T02:57:26.332658+00:00"}