{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RECZ76ANDHSDRNNSLZFJT2B5JP","short_pith_number":"pith:RECZ76AN","schema_version":"1.0","canonical_sha256":"89059ff80d19e438b5b25e4a99e83d4bfd3c93b963c1f12fb4f1b810a7b2100d","source":{"kind":"arxiv","id":"1104.4728","version":2},"attestation_state":"computed","paper":{"title":"Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Philip N. Klein, Shay Mozes","submitted_at":"2011-04-25T14:44:26Z","abstract_excerpt":"We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniques for flow problems. This gives rise to an O(diameter*n*log(n)) algorithm for the problem."},"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":"1104.4728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-25T14:44:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0909a84c027d9f08f1199cca9ac7fe4941438f448e4977713c7c945121f4982f","abstract_canon_sha256":"a1651bd4e76adab1cd3fb501020576275b3f89ebfd8d171b2497821f21b6e719"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:31.657853Z","signature_b64":"K7VnDfXZOrD9Syc9TMCdZuksxRWykxcaiYHnOmPtJwGlw0mJIzrN1xZDwTLEjJ1V/O4EzB2HFBDPGU6AvZV1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89059ff80d19e438b5b25e4a99e83d4bfd3c93b963c1f12fb4f1b810a7b2100d","last_reissued_at":"2026-05-18T04:22:31.657438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:31.657438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Philip N. Klein, Shay Mozes","submitted_at":"2011-04-25T14:44:26Z","abstract_excerpt":"We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniques for flow problems. This gives rise to an O(diameter*n*log(n)) algorithm for the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4728","kind":"arxiv","version":2},"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":"1104.4728","created_at":"2026-05-18T04:22:31.657513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4728v2","created_at":"2026-05-18T04:22:31.657513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4728","created_at":"2026-05-18T04:22:31.657513+00:00"},{"alias_kind":"pith_short_12","alias_value":"RECZ76ANDHSD","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RECZ76ANDHSDRNNS","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RECZ76AN","created_at":"2026-05-18T12:26:41.206345+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/RECZ76ANDHSDRNNSLZFJT2B5JP","json":"https://pith.science/pith/RECZ76ANDHSDRNNSLZFJT2B5JP.json","graph_json":"https://pith.science/api/pith-number/RECZ76ANDHSDRNNSLZFJT2B5JP/graph.json","events_json":"https://pith.science/api/pith-number/RECZ76ANDHSDRNNSLZFJT2B5JP/events.json","paper":"https://pith.science/paper/RECZ76AN"},"agent_actions":{"view_html":"https://pith.science/pith/RECZ76ANDHSDRNNSLZFJT2B5JP","download_json":"https://pith.science/pith/RECZ76ANDHSDRNNSLZFJT2B5JP.json","view_paper":"https://pith.science/paper/RECZ76AN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4728&json=true","fetch_graph":"https://pith.science/api/pith-number/RECZ76ANDHSDRNNSLZFJT2B5JP/graph.json","fetch_events":"https://pith.science/api/pith-number/RECZ76ANDHSDRNNSLZFJT2B5JP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RECZ76ANDHSDRNNSLZFJT2B5JP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RECZ76ANDHSDRNNSLZFJT2B5JP/action/storage_attestation","attest_author":"https://pith.science/pith/RECZ76ANDHSDRNNSLZFJT2B5JP/action/author_attestation","sign_citation":"https://pith.science/pith/RECZ76ANDHSDRNNSLZFJT2B5JP/action/citation_signature","submit_replication":"https://pith.science/pith/RECZ76ANDHSDRNNSLZFJT2B5JP/action/replication_record"}},"created_at":"2026-05-18T04:22:31.657513+00:00","updated_at":"2026-05-18T04:22:31.657513+00:00"}