{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DNZDC52M7JEUFGGU5ALPGAAHUU","short_pith_number":"pith:DNZDC52M","canonical_record":{"source":{"id":"1003.1320","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-05T17:43:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ea9647f5265ec2b63dfa04baea68d7a678a372ca5d4e3e23bacef45ffab70a7b","abstract_canon_sha256":"94c0525adf91bddab14bddd0c94e5da23caa6c32c469d162c0088f82cf03a178"},"schema_version":"1.0"},"canonical_sha256":"1b7231774cfa494298d4e816f30007a507902f01864ab09e2a203e1f6665c940","source":{"kind":"arxiv","id":"1003.1320","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.1320","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1003.1320v4","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1320","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"DNZDC52M7JEU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DNZDC52M7JEUFGGU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DNZDC52M","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DNZDC52M7JEUFGGU5ALPGAAHUU","target":"record","payload":{"canonical_record":{"source":{"id":"1003.1320","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-05T17:43:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ea9647f5265ec2b63dfa04baea68d7a678a372ca5d4e3e23bacef45ffab70a7b","abstract_canon_sha256":"94c0525adf91bddab14bddd0c94e5da23caa6c32c469d162c0088f82cf03a178"},"schema_version":"1.0"},"canonical_sha256":"1b7231774cfa494298d4e816f30007a507902f01864ab09e2a203e1f6665c940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:58.726198Z","signature_b64":"xO8600Em/PxhIRxa5vaor+GmbceabO8WbFkjpttn7oJFz1KeK66ST9M/ZkE7pCF4F7RPTylbqrLRty57tJjcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b7231774cfa494298d4e816f30007a507902f01864ab09e2a203e1f6665c940","last_reissued_at":"2026-05-18T03:10:58.725460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:58.725460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.1320","source_version":4,"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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fO66q0IzBYMYFuhsd2G1HA04rIFme4T70/MCcjrThDkY+hkVShxuG917WxGx99ipq0DDHMTu0nx31WFYDjpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:48:17.377092Z"},"content_sha256":"b064bb72f74005be6f727abd3f780212eda58cfc98572151141f994dba76424a","schema_version":"1.0","event_id":"sha256:b064bb72f74005be6f727abd3f780212eda58cfc98572151141f994dba76424a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DNZDC52M7JEUFGGU5ALPGAAHUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen, Glencora Borradaile, Piotr Sankowski","submitted_at":"2010-03-05T17:43:56Z","abstract_excerpt":"For an undirected $n$-vertex planar graph $G$ with non-negative edge-weights, we consider the following type of query: given two vertices $s$ and $t$ in $G$, what is the weight of a min $st$-cut in $G$? We show how to answer such queries in constant time with $O(n\\log^4n)$ preprocessing time and $O(n\\log n)$ space. We use a Gomory-Hu tree to represent all the pairwise min cuts implicitly. Previously, no subquadratic time algorithm was known for this problem. Since all-pairs min cut and the minimum cycle basis are dual problems in planar graphs, we also obtain an implicit representation of a mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1320","kind":"arxiv","version":4},"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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lwEafsBHvI+yakkrohe98IxE+O6otuHX7XimLOfJ2+VbR4W1IL2H9s6XT9nJCbUhGv6U6dGqOfbEfgafGnfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:48:17.377481Z"},"content_sha256":"f575537b9117a0bbade96dc5bd86b29a91f29a48c78ae4869fa74fd1108ffa24","schema_version":"1.0","event_id":"sha256:f575537b9117a0bbade96dc5bd86b29a91f29a48c78ae4869fa74fd1108ffa24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/bundle.json","state_url":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/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-05T12:48:17Z","links":{"resolver":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU","bundle":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/bundle.json","state":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DNZDC52M7JEUFGGU5ALPGAAHUU","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":"94c0525adf91bddab14bddd0c94e5da23caa6c32c469d162c0088f82cf03a178","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-05T17:43:56Z","title_canon_sha256":"ea9647f5265ec2b63dfa04baea68d7a678a372ca5d4e3e23bacef45ffab70a7b"},"schema_version":"1.0","source":{"id":"1003.1320","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.1320","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1003.1320v4","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1320","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"DNZDC52M7JEU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DNZDC52M7JEUFGGU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DNZDC52M","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:f575537b9117a0bbade96dc5bd86b29a91f29a48c78ae4869fa74fd1108ffa24","target":"graph","created_at":"2026-05-18T03:10:58Z","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":"For an undirected $n$-vertex planar graph $G$ with non-negative edge-weights, we consider the following type of query: given two vertices $s$ and $t$ in $G$, what is the weight of a min $st$-cut in $G$? We show how to answer such queries in constant time with $O(n\\log^4n)$ preprocessing time and $O(n\\log n)$ space. We use a Gomory-Hu tree to represent all the pairwise min cuts implicitly. Previously, no subquadratic time algorithm was known for this problem. Since all-pairs min cut and the minimum cycle basis are dual problems in planar graphs, we also obtain an implicit representation of a mi","authors_text":"Christian Wulff-Nilsen, Glencora Borradaile, Piotr Sankowski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-05T17:43:56Z","title":"Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1320","kind":"arxiv","version":4},"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:b064bb72f74005be6f727abd3f780212eda58cfc98572151141f994dba76424a","target":"record","created_at":"2026-05-18T03:10:58Z","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":"94c0525adf91bddab14bddd0c94e5da23caa6c32c469d162c0088f82cf03a178","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-05T17:43:56Z","title_canon_sha256":"ea9647f5265ec2b63dfa04baea68d7a678a372ca5d4e3e23bacef45ffab70a7b"},"schema_version":"1.0","source":{"id":"1003.1320","kind":"arxiv","version":4}},"canonical_sha256":"1b7231774cfa494298d4e816f30007a507902f01864ab09e2a203e1f6665c940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b7231774cfa494298d4e816f30007a507902f01864ab09e2a203e1f6665c940","first_computed_at":"2026-05-18T03:10:58.725460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:58.725460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xO8600Em/PxhIRxa5vaor+GmbceabO8WbFkjpttn7oJFz1KeK66ST9M/ZkE7pCF4F7RPTylbqrLRty57tJjcAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:58.726198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.1320","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b064bb72f74005be6f727abd3f780212eda58cfc98572151141f994dba76424a","sha256:f575537b9117a0bbade96dc5bd86b29a91f29a48c78ae4869fa74fd1108ffa24"],"state_sha256":"cb7a881a6574932231349acec45c103ac6c24e84d77cdc8e250281af42d45e28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2llx545E4SoVRPkRhvfX+oQOw7vecUBvAJUmuJmmaOEEPbHldH1Zib8b3bClX5SAdk49VTrK4PuYpOC6HMTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:48:17.379634Z","bundle_sha256":"0f13a264f1b5c63229f6f7580f53ad9b7407cb0f89f3dd1473cf1d0efd8f7ad5"}}