{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5EAYII7OF5GOROHFTCJHRCSXQT","short_pith_number":"pith:5EAYII7O","schema_version":"1.0","canonical_sha256":"e9018423ee2f4ce8b8e59892788a5784fed3a3b3bd7ef5a0a7cc7b9db394c896","source":{"kind":"arxiv","id":"1211.0752","version":2},"attestation_state":"computed","paper":{"title":"Faster Approximation of Max Flow for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Cheng Wang","submitted_at":"2012-11-05T03:34:45Z","abstract_excerpt":"I extend the methods in \"Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs, with Paul Christiano, Jonathan Kelner, Daniel Spielman, and Shang-Hua Teng\" to directed graphs with a variation of the framework in the paper, which lead to an algorithm that approximately solves the directed max flow problem in nearly-linear time."},"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":"1211.0752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-05T03:34:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d7bfc2351033c422159726459ee4537c759c0b9a2fcdc030512ef51be7d1d7f6","abstract_canon_sha256":"eb5c582e49dec28904ca1ff6599ba520bd6f47bc8dcce272fbf8b4e51d5fef84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:35.685907Z","signature_b64":"73e0D+RPIEto2m4qjMNgnCdPfXmQgwFPCWW+huzsNMAF6AXMwpoTptxfej0K1ZMkaCLhmyuM4D8hA4D7+nTpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9018423ee2f4ce8b8e59892788a5784fed3a3b3bd7ef5a0a7cc7b9db394c896","last_reissued_at":"2026-05-18T03:40:35.682419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:35.682419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Approximation of Max Flow for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Cheng Wang","submitted_at":"2012-11-05T03:34:45Z","abstract_excerpt":"I extend the methods in \"Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs, with Paul Christiano, Jonathan Kelner, Daniel Spielman, and Shang-Hua Teng\" to directed graphs with a variation of the framework in the paper, which lead to an algorithm that approximately solves the directed max flow problem in nearly-linear time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0752","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":"1211.0752","created_at":"2026-05-18T03:40:35.685339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0752v2","created_at":"2026-05-18T03:40:35.685339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0752","created_at":"2026-05-18T03:40:35.685339+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EAYII7OF5GO","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EAYII7OF5GOROHF","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EAYII7O","created_at":"2026-05-18T12:26:53.410803+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/5EAYII7OF5GOROHFTCJHRCSXQT","json":"https://pith.science/pith/5EAYII7OF5GOROHFTCJHRCSXQT.json","graph_json":"https://pith.science/api/pith-number/5EAYII7OF5GOROHFTCJHRCSXQT/graph.json","events_json":"https://pith.science/api/pith-number/5EAYII7OF5GOROHFTCJHRCSXQT/events.json","paper":"https://pith.science/paper/5EAYII7O"},"agent_actions":{"view_html":"https://pith.science/pith/5EAYII7OF5GOROHFTCJHRCSXQT","download_json":"https://pith.science/pith/5EAYII7OF5GOROHFTCJHRCSXQT.json","view_paper":"https://pith.science/paper/5EAYII7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0752&json=true","fetch_graph":"https://pith.science/api/pith-number/5EAYII7OF5GOROHFTCJHRCSXQT/graph.json","fetch_events":"https://pith.science/api/pith-number/5EAYII7OF5GOROHFTCJHRCSXQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EAYII7OF5GOROHFTCJHRCSXQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EAYII7OF5GOROHFTCJHRCSXQT/action/storage_attestation","attest_author":"https://pith.science/pith/5EAYII7OF5GOROHFTCJHRCSXQT/action/author_attestation","sign_citation":"https://pith.science/pith/5EAYII7OF5GOROHFTCJHRCSXQT/action/citation_signature","submit_replication":"https://pith.science/pith/5EAYII7OF5GOROHFTCJHRCSXQT/action/replication_record"}},"created_at":"2026-05-18T03:40:35.685339+00:00","updated_at":"2026-05-18T03:40:35.685339+00:00"}