{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:P3F3AZCEIDJS7ZGUVGEYI6LJMG","short_pith_number":"pith:P3F3AZCE","schema_version":"1.0","canonical_sha256":"7ecbb0644440d32fe4d4a98984796961baa19efcedd249166440a3adf7ef504a","source":{"kind":"arxiv","id":"1008.4966","version":1},"attestation_state":"computed","paper":{"title":"Multiple source, single sink maximum flow in a planar graph","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","submitted_at":"2010-08-29T22:25:00Z","abstract_excerpt":"We give an $O(n^{1.5}\\log n)$ time algorithm for finding the maximum flow in a directed planar graph with multiple sources and a single sink. The techniques generalize to a subquadratic time algorithm for bounded genus graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1008.4966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-29T22:25:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c40cc9d3a0fc26e04efe8258bf14e78ef85a32e9cc05b73818846d44096dd3e3","abstract_canon_sha256":"98a150968905d2e90c9b779190418d7a6a63d0159ecf44b62fdd3b9a6a98ed20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:27.125062Z","signature_b64":"pkqVQe/csGZ5FVTEkoWncRJEqt376BtkN0T9nPMCoTBMHyaWKMeXFQUQnNrcsXtb6H+0cY1Dz2VH/0FnJZVpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ecbb0644440d32fe4d4a98984796961baa19efcedd249166440a3adf7ef504a","last_reissued_at":"2026-05-18T04:41:27.124351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:27.124351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple source, single sink maximum flow in a planar graph","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","submitted_at":"2010-08-29T22:25:00Z","abstract_excerpt":"We give an $O(n^{1.5}\\log n)$ time algorithm for finding the maximum flow in a directed planar graph with multiple sources and a single sink. The techniques generalize to a subquadratic time algorithm for bounded genus graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4966","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.4966","created_at":"2026-05-18T04:41:27.124461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4966v1","created_at":"2026-05-18T04:41:27.124461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4966","created_at":"2026-05-18T04:41:27.124461+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3F3AZCEIDJS","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3F3AZCEIDJS7ZGU","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3F3AZCE","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG","json":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG.json","graph_json":"https://pith.science/api/pith-number/P3F3AZCEIDJS7ZGUVGEYI6LJMG/graph.json","events_json":"https://pith.science/api/pith-number/P3F3AZCEIDJS7ZGUVGEYI6LJMG/events.json","paper":"https://pith.science/paper/P3F3AZCE"},"agent_actions":{"view_html":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG","download_json":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG.json","view_paper":"https://pith.science/paper/P3F3AZCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4966&json=true","fetch_graph":"https://pith.science/api/pith-number/P3F3AZCEIDJS7ZGUVGEYI6LJMG/graph.json","fetch_events":"https://pith.science/api/pith-number/P3F3AZCEIDJS7ZGUVGEYI6LJMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG/action/storage_attestation","attest_author":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG/action/author_attestation","sign_citation":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG/action/citation_signature","submit_replication":"https://pith.science/pith/P3F3AZCEIDJS7ZGUVGEYI6LJMG/action/replication_record"}},"created_at":"2026-05-18T04:41:27.124461+00:00","updated_at":"2026-05-18T04:41:27.124461+00:00"}