{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:52KDG47IO3AQ4JLCE4XBGQVOYB","short_pith_number":"pith:52KDG47I","canonical_record":{"source":{"id":"1210.4811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-17T18:17:25Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"6b6082853d5dc051042ab69737f494bff6d39df130dba3ee482f540182fdfff6","abstract_canon_sha256":"72930e86093e4dc35a04f364997b1e9f3bb60f8d98248ab5b8efe379bd720d1f"},"schema_version":"1.0"},"canonical_sha256":"ee943373e876c10e2562272e1342aec06b82f29ea7fb0b223c0534b67d7db77c","source":{"kind":"arxiv","id":"1210.4811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4811","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4811v1","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4811","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"52KDG47IO3AQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"52KDG47IO3AQ4JLC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"52KDG47I","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:52KDG47IO3AQ4JLCE4XBGQVOYB","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-17T18:17:25Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"6b6082853d5dc051042ab69737f494bff6d39df130dba3ee482f540182fdfff6","abstract_canon_sha256":"72930e86093e4dc35a04f364997b1e9f3bb60f8d98248ab5b8efe379bd720d1f"},"schema_version":"1.0"},"canonical_sha256":"ee943373e876c10e2562272e1342aec06b82f29ea7fb0b223c0534b67d7db77c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:56.170051Z","signature_b64":"lrhf2eaHdUUyqx6VZov3b7sbPGzscij0jdwfQisYccyGj/lo/QW2epem0Uoa3FDRPkquL+FAr1Ob7BtCK1q4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee943373e876c10e2562272e1342aec06b82f29ea7fb0b223c0534b67d7db77c","last_reissued_at":"2026-05-18T03:42:56.169517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:56.169517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4811","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:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfZE7Zh6Hh3UiiNbgovfQEaPckpPEftj7n9K5BQsmcWX9KFG+Bz2efK6qFJN6X33DSNl0LDuQJ0oxdJzS7JACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:56:06.024470Z"},"content_sha256":"08f34ba53e04b94a258bac2fd4e915780bcd5d22d2bcee2358ca366e768e0770","schema_version":"1.0","event_id":"sha256:08f34ba53e04b94a258bac2fd4e915780bcd5d22d2bcee2358ca366e768e0770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:52KDG47IO3AQ4JLCE4XBGQVOYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Single Source - All Sinks Max Flows in Planar Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen, Jakub {\\L}\\k{a}cki, Piotr Sankowski, Yahav Nussbaum","submitted_at":"2012-10-17T18:17:25Z","abstract_excerpt":"Let G = (V,E) be a planar n-vertex digraph. Consider the problem of computing max st-flow values in G from a fixed source s to all sinks t in V\\{s}. We show how to solve this problem in near-linear O(n log^3 n) time. Previously, no better solution was known than running a single-source single-sink max flow algorithm n-1 times, giving a total time bound of O(n^2 log n) with the algorithm of Borradaile and Klein.\n  An important implication is that all-pairs max st-flow values in G can be computed in near-quadratic time. This is close to optimal as the output size is Theta(n^2). We give a quadrat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4811","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:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phkbdAda8jN9HdKpwkCqFk6rPMVEHiUXph+lVNMPmzHfUSqE5yBg3e0WDegJiacBd8nTLSZ6dv972tf1kekrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:56:06.025498Z"},"content_sha256":"6d2e787458187a20973a6fa8121ba48dc0ae0cbf2dde40619d40c20e6080220e","schema_version":"1.0","event_id":"sha256:6d2e787458187a20973a6fa8121ba48dc0ae0cbf2dde40619d40c20e6080220e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52KDG47IO3AQ4JLCE4XBGQVOYB/bundle.json","state_url":"https://pith.science/pith/52KDG47IO3AQ4JLCE4XBGQVOYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52KDG47IO3AQ4JLCE4XBGQVOYB/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-25T22:56:06Z","links":{"resolver":"https://pith.science/pith/52KDG47IO3AQ4JLCE4XBGQVOYB","bundle":"https://pith.science/pith/52KDG47IO3AQ4JLCE4XBGQVOYB/bundle.json","state":"https://pith.science/pith/52KDG47IO3AQ4JLCE4XBGQVOYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52KDG47IO3AQ4JLCE4XBGQVOYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:52KDG47IO3AQ4JLCE4XBGQVOYB","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":"72930e86093e4dc35a04f364997b1e9f3bb60f8d98248ab5b8efe379bd720d1f","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-17T18:17:25Z","title_canon_sha256":"6b6082853d5dc051042ab69737f494bff6d39df130dba3ee482f540182fdfff6"},"schema_version":"1.0","source":{"id":"1210.4811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4811","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4811v1","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4811","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"52KDG47IO3AQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"52KDG47IO3AQ4JLC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"52KDG47I","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:6d2e787458187a20973a6fa8121ba48dc0ae0cbf2dde40619d40c20e6080220e","target":"graph","created_at":"2026-05-18T03:42:56Z","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 = (V,E) be a planar n-vertex digraph. Consider the problem of computing max st-flow values in G from a fixed source s to all sinks t in V\\{s}. We show how to solve this problem in near-linear O(n log^3 n) time. Previously, no better solution was known than running a single-source single-sink max flow algorithm n-1 times, giving a total time bound of O(n^2 log n) with the algorithm of Borradaile and Klein.\n  An important implication is that all-pairs max st-flow values in G can be computed in near-quadratic time. This is close to optimal as the output size is Theta(n^2). We give a quadrat","authors_text":"Christian Wulff-Nilsen, Jakub {\\L}\\k{a}cki, Piotr Sankowski, Yahav Nussbaum","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-17T18:17:25Z","title":"Single Source - All Sinks Max Flows in Planar Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4811","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:08f34ba53e04b94a258bac2fd4e915780bcd5d22d2bcee2358ca366e768e0770","target":"record","created_at":"2026-05-18T03:42:56Z","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":"72930e86093e4dc35a04f364997b1e9f3bb60f8d98248ab5b8efe379bd720d1f","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-17T18:17:25Z","title_canon_sha256":"6b6082853d5dc051042ab69737f494bff6d39df130dba3ee482f540182fdfff6"},"schema_version":"1.0","source":{"id":"1210.4811","kind":"arxiv","version":1}},"canonical_sha256":"ee943373e876c10e2562272e1342aec06b82f29ea7fb0b223c0534b67d7db77c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee943373e876c10e2562272e1342aec06b82f29ea7fb0b223c0534b67d7db77c","first_computed_at":"2026-05-18T03:42:56.169517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:56.169517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lrhf2eaHdUUyqx6VZov3b7sbPGzscij0jdwfQisYccyGj/lo/QW2epem0Uoa3FDRPkquL+FAr1Ob7BtCK1q4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:56.170051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08f34ba53e04b94a258bac2fd4e915780bcd5d22d2bcee2358ca366e768e0770","sha256:6d2e787458187a20973a6fa8121ba48dc0ae0cbf2dde40619d40c20e6080220e"],"state_sha256":"20523ee688fad35b52ab4232eb43f38fe019499651acae0aa29589689d0be8a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LfnwzNqfeciuzIOPBP6hs6F0XtzO+W+Yf7ZOaRIN7W2dGbGJ3uvW1wB8I4QMJjkLXizgy3lWl65ySDCWHA4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:56:06.029489Z","bundle_sha256":"96a6f950cb2d99b7c542012a4db7947d4b17fd0d69af7b1d3ff8530ce288c5a2"}}