{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DQPVW2276BLZU4A4ULEEQZXTJ5","short_pith_number":"pith:DQPVW227","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"},"canonical_sha256":"1c1f5b6b5ff0579a701ca2c84866f34f50a0134c76c283ba7938270a978f30b9","source":{"kind":"arxiv","id":"1804.01045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01045","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01045v1","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01045","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"DQPVW2276BLZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DQPVW2276BLZU4A4","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DQPVW227","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DQPVW2276BLZU4A4ULEEQZXTJ5","target":"record","payload":{"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"},"canonical_sha256":"1c1f5b6b5ff0579a701ca2c84866f34f50a0134c76c283ba7938270a978f30b9","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"},"source_kind":"arxiv","source_id":"1804.01045","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2Ndsk3S8ERgaZoV23W4C08iue5E+7sSOf/g7efhN8mZawd39XprhZ/h3qEMTWFbzfnuqMmiOVVqBGpDAXIwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:54.881412Z"},"content_sha256":"e8101bf45f479f714638426e62faa72b5f876219f9f38ab41794639b382a8e56","schema_version":"1.0","event_id":"sha256:e8101bf45f479f714638426e62faa72b5f876219f9f38ab41794639b382a8e56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DQPVW2276BLZU4A4ULEEQZXTJ5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFf9pAzSZwi7zufoTKYVid6V4XXyv9PlEeHlQYlmyEgggjVAZ+uWMdD4HTu6gnAtEJsIo/v8qVVOWoXZCA9sCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:54.881940Z"},"content_sha256":"385c603d0d49f8d5745da176579b292a9ff24ae61075c2551be16a7c4d3c3557","schema_version":"1.0","event_id":"sha256:385c603d0d49f8d5745da176579b292a9ff24ae61075c2551be16a7c4d3c3557"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/bundle.json","state_url":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T08:53:54Z","links":{"resolver":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5","bundle":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/bundle.json","state":"https://pith.science/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQPVW2276BLZU4A4ULEEQZXTJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DQPVW2276BLZU4A4ULEEQZXTJ5","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":"d27d01afe08eaff7d61484be9d3ef25d1a22819d452f56bb785da64959a809fc","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-03T15:50:09Z","title_canon_sha256":"ceab5424d9842f24de872a55b82474e965c88c651462b206edf65ba0ff023a3b"},"schema_version":"1.0","source":{"id":"1804.01045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01045","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01045v1","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01045","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"DQPVW2276BLZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DQPVW2276BLZU4A4","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DQPVW227","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:385c603d0d49f8d5745da176579b292a9ff24ae61075c2551be16a7c4d3c3557","target":"graph","created_at":"2026-05-18T00:19:31Z","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":"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","authors_text":"Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-03T15:50:09Z","title":"Holiest Minimum-Cost Paths and Flows in Surface Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01045","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:e8101bf45f479f714638426e62faa72b5f876219f9f38ab41794639b382a8e56","target":"record","created_at":"2026-05-18T00:19:31Z","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":"d27d01afe08eaff7d61484be9d3ef25d1a22819d452f56bb785da64959a809fc","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-03T15:50:09Z","title_canon_sha256":"ceab5424d9842f24de872a55b82474e965c88c651462b206edf65ba0ff023a3b"},"schema_version":"1.0","source":{"id":"1804.01045","kind":"arxiv","version":1}},"canonical_sha256":"1c1f5b6b5ff0579a701ca2c84866f34f50a0134c76c283ba7938270a978f30b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c1f5b6b5ff0579a701ca2c84866f34f50a0134c76c283ba7938270a978f30b9","first_computed_at":"2026-05-18T00:19:31.470303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:31.470303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y3NSDz4THleXof8jAF6OXYjf+gTGeRDsr2N/7oaxXDtmF6Kxt4X3jCxPxXo+gx6oN4rW1e3tVNalj2fOZGR+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:31.470871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8101bf45f479f714638426e62faa72b5f876219f9f38ab41794639b382a8e56","sha256:385c603d0d49f8d5745da176579b292a9ff24ae61075c2551be16a7c4d3c3557"],"state_sha256":"94c90baebefb6c8eb64d0153187d5c826efad2444f2e82fddf1a686d5f43fe0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/a5hZLPCqGzPx6yi7y56s0hI5qljO6cKJzdWgOuaEM8qKlgfA2iOLJURDxYmBAhQ8YtS9qiszZXYsbC6K1XCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:53:54.885026Z","bundle_sha256":"5bf7915b4911dc0ef15c78bf90abb86178db96502f7f261301545131c53ccc28"}}