{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4","short_pith_number":"pith:Q3SUYW5G","canonical_record":{"source":{"id":"1305.5823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-24T18:42:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"74d90c1a23149c43092a3716a4185bebeb0b9cabbeb75d9f748744c569ef4f7b","abstract_canon_sha256":"248dc955f960fc3914e4b0c179e7cc7a6503846d216c4046a8989be4f871b43a"},"schema_version":"1.0"},"canonical_sha256":"86e54c5ba6ad5a5cef292272853644cf0e5e5cfc2707342054c3ce40df8fd28d","source":{"kind":"arxiv","id":"1305.5823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5823","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5823v1","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5823","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"Q3SUYW5GVVNF","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q3SUYW5GVVNFZ3ZJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q3SUYW5G","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-24T18:42:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"74d90c1a23149c43092a3716a4185bebeb0b9cabbeb75d9f748744c569ef4f7b","abstract_canon_sha256":"248dc955f960fc3914e4b0c179e7cc7a6503846d216c4046a8989be4f871b43a"},"schema_version":"1.0"},"canonical_sha256":"86e54c5ba6ad5a5cef292272853644cf0e5e5cfc2707342054c3ce40df8fd28d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:54.715109Z","signature_b64":"ZqwWzSoqiWxSVQa04/xHAuEBfacKwGPjhxYl/J2sE3YuxB3NSQsVdRGNCJBQqW9o7ejOxCAfBZ8JgMEZ+u1iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e54c5ba6ad5a5cef292272853644cf0e5e5cfc2707342054c3ce40df8fd28d","last_reissued_at":"2026-05-18T03:24:54.714338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:54.714338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5823","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-18T03:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6UKJEPvWSYY/8zWbD2kMTOjeGb3EufVgHpNp042XAc8oC/KbzQVsbOL41Er57ZIOq79X16YBp179I7TALx0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:49:02.100287Z"},"content_sha256":"ad5807a22db8181077cccbda09079a01732b3589309466be5b2f9216edc87321","schema_version":"1.0","event_id":"sha256:ad5807a22db8181077cccbda09079a01732b3589309466be5b2f9216edc87321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum st-flow in directed planar graphs via shortest paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Anna Harutyunyan, Glencora Borradaile","submitted_at":"2013-05-24T18:42:49Z","abstract_excerpt":"Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no constraints on the source and sink. We believe this a promising avenue for developing algorithms that are more practical than the current asymptotically best algorithms for maximum st-flow."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5823","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-18T03:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSZ5Pef2rK1obaxWjOsb97j4x9CygbXKchtVHPHIFt3+sIxT31vgmc1ApH3mH+OrhchyrJweIWKKAEWQRzgBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:49:02.100682Z"},"content_sha256":"7d11c7c748af811b4af887016e8b064de15e1a45613d8a33bed1227bfd6f1085","schema_version":"1.0","event_id":"sha256:7d11c7c748af811b4af887016e8b064de15e1a45613d8a33bed1227bfd6f1085"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/bundle.json","state_url":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/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-06-27T21:49:02Z","links":{"resolver":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4","bundle":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/bundle.json","state":"https://pith.science/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q3SUYW5GVVNFZ3ZJEJZIKNSEZ4","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":"248dc955f960fc3914e4b0c179e7cc7a6503846d216c4046a8989be4f871b43a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-24T18:42:49Z","title_canon_sha256":"74d90c1a23149c43092a3716a4185bebeb0b9cabbeb75d9f748744c569ef4f7b"},"schema_version":"1.0","source":{"id":"1305.5823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5823","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5823v1","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5823","created_at":"2026-05-18T03:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"Q3SUYW5GVVNF","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q3SUYW5GVVNFZ3ZJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q3SUYW5G","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:7d11c7c748af811b4af887016e8b064de15e1a45613d8a33bed1227bfd6f1085","target":"graph","created_at":"2026-05-18T03:24:54Z","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":"Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no constraints on the source and sink. We believe this a promising avenue for developing algorithms that are more practical than the current asymptotically best algorithms for maximum st-flow.","authors_text":"Anna Harutyunyan, Glencora Borradaile","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-24T18:42:49Z","title":"Maximum st-flow in directed planar graphs via shortest paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5823","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:ad5807a22db8181077cccbda09079a01732b3589309466be5b2f9216edc87321","target":"record","created_at":"2026-05-18T03:24:54Z","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":"248dc955f960fc3914e4b0c179e7cc7a6503846d216c4046a8989be4f871b43a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-24T18:42:49Z","title_canon_sha256":"74d90c1a23149c43092a3716a4185bebeb0b9cabbeb75d9f748744c569ef4f7b"},"schema_version":"1.0","source":{"id":"1305.5823","kind":"arxiv","version":1}},"canonical_sha256":"86e54c5ba6ad5a5cef292272853644cf0e5e5cfc2707342054c3ce40df8fd28d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86e54c5ba6ad5a5cef292272853644cf0e5e5cfc2707342054c3ce40df8fd28d","first_computed_at":"2026-05-18T03:24:54.714338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:54.714338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZqwWzSoqiWxSVQa04/xHAuEBfacKwGPjhxYl/J2sE3YuxB3NSQsVdRGNCJBQqW9o7ejOxCAfBZ8JgMEZ+u1iCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:54.715109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad5807a22db8181077cccbda09079a01732b3589309466be5b2f9216edc87321","sha256:7d11c7c748af811b4af887016e8b064de15e1a45613d8a33bed1227bfd6f1085"],"state_sha256":"cbcb4efcd952e5c1ac8359a6340ba91d92a3af6200f7989992cef28c79745f7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2/LjDFu0xwmHaSJfj/Iv2n7AZ3TuY9y3+mfe/ubjhk6/KDmowqU6A1cJhNqj9BpPg6FDO7v5wRvQB3nSguDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T21:49:02.102507Z","bundle_sha256":"6a9c1957a11442d1ec0a9822cdc849a3599d681f12408be2de9a4ab2b39aa6df"}}