{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CJE6PZFDDDCHSWQCZUP3XKBBUL","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":"f92743abef032adf621ef74ff5ae980731de5cf81e67581f62eb1d10ddc637f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-23T09:45:51Z","title_canon_sha256":"7a9740710507ad852133fb42834b438406a68500db2a9916b6b47ce0bc0537fb"},"schema_version":"1.0","source":{"id":"1306.5391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5391","created_at":"2026-05-18T03:20:08Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5391v1","created_at":"2026-05-18T03:20:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5391","created_at":"2026-05-18T03:20:08Z"},{"alias_kind":"pith_short_12","alias_value":"CJE6PZFDDDCH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CJE6PZFDDDCHSWQC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CJE6PZFD","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:0da8d91488147eb911d4f9101be364cf5f6d91cf45f858036d98b3f47f69f4c0","target":"graph","created_at":"2026-05-18T03:20:08Z","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":"We give an iterative algorithm for finding the maximum flow between a set of sources and sinks that lie on the boundary of a planar graph. Our algorithm uses only O(n) queries to simple data structures, achieving an O(n log n) running time that we expect to be practical given the use of simple primitives. The only existing algorithm for this problem uses divide and conquer and, in order to achieve an O(n log n) running time, requires the use of the (complicated) linear-time shortest-paths algorithm for planar graphs.","authors_text":"Anna Harutyunyan, Glencora Borradaile","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-23T09:45:51Z","title":"Boundary-to-boundary flows in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5391","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:d425fb8fd8ee2bb802112d4fdf34704ec94e1382d0f6e270c157189768c828db","target":"record","created_at":"2026-05-18T03:20:08Z","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":"f92743abef032adf621ef74ff5ae980731de5cf81e67581f62eb1d10ddc637f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-23T09:45:51Z","title_canon_sha256":"7a9740710507ad852133fb42834b438406a68500db2a9916b6b47ce0bc0537fb"},"schema_version":"1.0","source":{"id":"1306.5391","kind":"arxiv","version":1}},"canonical_sha256":"1249e7e4a318c4795a02cd1fbba821a2f485421cd8a84762fa0f85243992ec75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1249e7e4a318c4795a02cd1fbba821a2f485421cd8a84762fa0f85243992ec75","first_computed_at":"2026-05-18T03:20:08.312491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:08.312491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CYLUe0RelDyhsz3tNTosEdZ5ytkrkoDBUWNf+VwpbqHcHPtYtx1E6JqefeSIqQF2N4crIT21Moa7tGLVkOMoBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:08.313047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d425fb8fd8ee2bb802112d4fdf34704ec94e1382d0f6e270c157189768c828db","sha256:0da8d91488147eb911d4f9101be364cf5f6d91cf45f858036d98b3f47f69f4c0"],"state_sha256":"7c0bae142ec7861501eb6a55b339509c1ede6bfefdd28a2a9c3710ffd31929a0"}