{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DQPVW2276BLZU4A4ULEEQZXTJ5","short_pith_number":"pith:DQPVW227","schema_version":"1.0","canonical_sha256":"1c1f5b6b5ff0579a701ca2c84866f34f50a0134c76c283ba7938270a978f30b9","source":{"kind":"arxiv","id":"1804.01045","version":1},"attestation_state":"computed","paper":{"title":"Holiest Minimum-Cost Paths and Flows in Surface Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren","submitted_at":"2018-04-03T15:50:09Z","abstract_excerpt":"Let $G$ be an edge-weighted directed graph with $n$ vertices embedded on an orientable surface of genus $g$. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows and shortest paths in $G$. The perturbations take $O(gn)$ time to compute. We use our perturbation scheme in a black box manner to derive a deterministic $O(n \\log \\log n)$ time algorithm for minimum cut in \\emph{directed} edge-weighted planar graphs and a deterministic $O(g^2 n \\log n)$ time proprocessing scheme for the multiple-source shortest paths problem of computin"},"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":"1804.01045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-03T15:50:09Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ceab5424d9842f24de872a55b82474e965c88c651462b206edf65ba0ff023a3b","abstract_canon_sha256":"d27d01afe08eaff7d61484be9d3ef25d1a22819d452f56bb785da64959a809fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:31.470871Z","signature_b64":"y3NSDz4THleXof8jAF6OXYjf+gTGeRDsr2N/7oaxXDtmF6Kxt4X3jCxPxXo+gx6oN4rW1e3tVNalj2fOZGR+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1f5b6b5ff0579a701ca2c84866f34f50a0134c76c283ba7938270a978f30b9","last_reissued_at":"2026-05-18T00:19:31.470303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:31.470303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Holiest Minimum-Cost Paths and Flows in Surface Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren","submitted_at":"2018-04-03T15:50:09Z","abstract_excerpt":"Let $G$ be an edge-weighted directed graph with $n$ vertices embedded on an orientable surface of genus $g$. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows and shortest paths in $G$. The perturbations take $O(gn)$ time to compute. We use our perturbation scheme in a black box manner to derive a deterministic $O(n \\log \\log n)$ time algorithm for minimum cut in \\emph{directed} edge-weighted planar graphs and a deterministic $O(g^2 n \\log n)$ time proprocessing scheme for the multiple-source shortest paths problem of computin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01045","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":"1804.01045","created_at":"2026-05-18T00:19:31.470422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01045v1","created_at":"2026-05-18T00:19:31.470422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01045","created_at":"2026-05-18T00:19:31.470422+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQPVW2276BLZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQPVW2276BLZU4A4","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQPVW227","created_at":"2026-05-18T12:32:19.392346+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/DQPVW2276BLZU4A4ULEEQZXTJ5","json":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5.json","graph_json":"https://pith.science/api/pith-number/DQPVW2276BLZU4A4ULEEQZXTJ5/graph.json","events_json":"https://pith.science/api/pith-number/DQPVW2276BLZU4A4ULEEQZXTJ5/events.json","paper":"https://pith.science/paper/DQPVW227"},"agent_actions":{"view_html":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5","download_json":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5.json","view_paper":"https://pith.science/paper/DQPVW227","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01045&json=true","fetch_graph":"https://pith.science/api/pith-number/DQPVW2276BLZU4A4ULEEQZXTJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/DQPVW2276BLZU4A4ULEEQZXTJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/action/storage_attestation","attest_author":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/action/author_attestation","sign_citation":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/action/citation_signature","submit_replication":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/action/replication_record"}},"created_at":"2026-05-18T00:19:31.470422+00:00","updated_at":"2026-05-18T00:19:31.470422+00:00"}