{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VRJRAB5CNFY7CAGIMB2WZ7TWPM","short_pith_number":"pith:VRJRAB5C","schema_version":"1.0","canonical_sha256":"ac531007a26971f100c860756cfe767b3d6fd6b6e3aafd90cc24a9b5e9ac7645","source":{"kind":"arxiv","id":"1012.5870","version":1},"attestation_state":"computed","paper":{"title":"Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \\log n)$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Shay Mozes","submitted_at":"2010-12-29T04:53:17Z","abstract_excerpt":"We give an $O(n^{1.5} \\log n)$ algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a set of sink nodes, finds a maximum flow from the sources to the sinks."},"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":"1012.5870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-29T04:53:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2716e3c6171c993775694078f72cd1d80bcdc20bdca9463d76d02f526ec8d855","abstract_canon_sha256":"6afe7d11a610a45c949f4e4b31ef3ec3a6ac9c6423e418f868fcd30ac841f5e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:21.281370Z","signature_b64":"ELhpYDNflwtthdAoR2bqpwqmi156RX8/+UbUyz+jf+pNvZrSUSF3GWtUiARwDM71VIxwQWaaajTLTz3H22XoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac531007a26971f100c860756cfe767b3d6fd6b6e3aafd90cc24a9b5e9ac7645","last_reissued_at":"2026-05-18T04:32:21.280585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:21.280585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \\log n)$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Shay Mozes","submitted_at":"2010-12-29T04:53:17Z","abstract_excerpt":"We give an $O(n^{1.5} \\log n)$ algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a set of sink nodes, finds a maximum flow from the sources to the sinks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5870","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":"1012.5870","created_at":"2026-05-18T04:32:21.280691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5870v1","created_at":"2026-05-18T04:32:21.280691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5870","created_at":"2026-05-18T04:32:21.280691+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRJRAB5CNFY7","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRJRAB5CNFY7CAGI","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRJRAB5C","created_at":"2026-05-18T12:26:15.391820+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/VRJRAB5CNFY7CAGIMB2WZ7TWPM","json":"https://pith.science/pith/VRJRAB5CNFY7CAGIMB2WZ7TWPM.json","graph_json":"https://pith.science/api/pith-number/VRJRAB5CNFY7CAGIMB2WZ7TWPM/graph.json","events_json":"https://pith.science/api/pith-number/VRJRAB5CNFY7CAGIMB2WZ7TWPM/events.json","paper":"https://pith.science/paper/VRJRAB5C"},"agent_actions":{"view_html":"https://pith.science/pith/VRJRAB5CNFY7CAGIMB2WZ7TWPM","download_json":"https://pith.science/pith/VRJRAB5CNFY7CAGIMB2WZ7TWPM.json","view_paper":"https://pith.science/paper/VRJRAB5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5870&json=true","fetch_graph":"https://pith.science/api/pith-number/VRJRAB5CNFY7CAGIMB2WZ7TWPM/graph.json","fetch_events":"https://pith.science/api/pith-number/VRJRAB5CNFY7CAGIMB2WZ7TWPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRJRAB5CNFY7CAGIMB2WZ7TWPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRJRAB5CNFY7CAGIMB2WZ7TWPM/action/storage_attestation","attest_author":"https://pith.science/pith/VRJRAB5CNFY7CAGIMB2WZ7TWPM/action/author_attestation","sign_citation":"https://pith.science/pith/VRJRAB5CNFY7CAGIMB2WZ7TWPM/action/citation_signature","submit_replication":"https://pith.science/pith/VRJRAB5CNFY7CAGIMB2WZ7TWPM/action/replication_record"}},"created_at":"2026-05-18T04:32:21.280691+00:00","updated_at":"2026-05-18T04:32:21.280691+00:00"}