{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LXLCSIFKZ75CKNVLOTVRYAVQVG","short_pith_number":"pith:LXLCSIFK","schema_version":"1.0","canonical_sha256":"5dd62920aacffa2536ab74eb1c02b0a9b58f07799e228aca826a9998eda2f3e2","source":{"kind":"arxiv","id":"1307.2205","version":3},"attestation_state":"computed","paper":{"title":"Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Madry","submitted_at":"2013-07-08T19:13:00Z","abstract_excerpt":"We present an $\\tilde{O}(m^{10/7})=\\tilde{O}(m^{1.43})$-time algorithm for the maximum s-t flow and the minimum s-t cut problems in directed graphs with unit capacities. This is the first improvement over the sparse-graph case of the long-standing $O(m \\min(\\sqrt{m},n^{2/3}))$ time bound due to Even and Tarjan [EvenT75]. By well-known reductions, this also establishes an $\\tilde{O}(m^{10/7})$-time algorithm for the maximum-cardinality bipartite matching problem. That, in turn, gives an improvement over the celebrated celebrated $O(m \\sqrt{n})$ time bound of Hopcroft and Karp [HK73] whenever th"},"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":"1307.2205","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-08T19:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"634efaf8cf0e3c4e723dff3755bb3313089a558c7c1454b4b7c22f38336b5173","abstract_canon_sha256":"d9e2f1942d5421adb0623e8a4673010bd29e1353a030790d20ef353a09864b96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:11.715619Z","signature_b64":"u/Y24L2U5WsNZKg5/g6Yinkfw5wpTN0cbxsCv9dYrvrJXFD+b4Wo23eUWr7eFbMHOq6HR+BOv5J4eTBeylnUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dd62920aacffa2536ab74eb1c02b0a9b58f07799e228aca826a9998eda2f3e2","last_reissued_at":"2026-05-18T03:09:11.714842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:11.714842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Madry","submitted_at":"2013-07-08T19:13:00Z","abstract_excerpt":"We present an $\\tilde{O}(m^{10/7})=\\tilde{O}(m^{1.43})$-time algorithm for the maximum s-t flow and the minimum s-t cut problems in directed graphs with unit capacities. This is the first improvement over the sparse-graph case of the long-standing $O(m \\min(\\sqrt{m},n^{2/3}))$ time bound due to Even and Tarjan [EvenT75]. By well-known reductions, this also establishes an $\\tilde{O}(m^{10/7})$-time algorithm for the maximum-cardinality bipartite matching problem. That, in turn, gives an improvement over the celebrated celebrated $O(m \\sqrt{n})$ time bound of Hopcroft and Karp [HK73] whenever th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2205","kind":"arxiv","version":3},"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":"1307.2205","created_at":"2026-05-18T03:09:11.714954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2205v3","created_at":"2026-05-18T03:09:11.714954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2205","created_at":"2026-05-18T03:09:11.714954+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXLCSIFKZ75C","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXLCSIFKZ75CKNVL","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXLCSIFK","created_at":"2026-05-18T12:27:51.066281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19898","citing_title":"Distributed Sparsest Cut via Eigenvalue Estimation","ref_index":262,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG","json":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG.json","graph_json":"https://pith.science/api/pith-number/LXLCSIFKZ75CKNVLOTVRYAVQVG/graph.json","events_json":"https://pith.science/api/pith-number/LXLCSIFKZ75CKNVLOTVRYAVQVG/events.json","paper":"https://pith.science/paper/LXLCSIFK"},"agent_actions":{"view_html":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG","download_json":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG.json","view_paper":"https://pith.science/paper/LXLCSIFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2205&json=true","fetch_graph":"https://pith.science/api/pith-number/LXLCSIFKZ75CKNVLOTVRYAVQVG/graph.json","fetch_events":"https://pith.science/api/pith-number/LXLCSIFKZ75CKNVLOTVRYAVQVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/action/storage_attestation","attest_author":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/action/author_attestation","sign_citation":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/action/citation_signature","submit_replication":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/action/replication_record"}},"created_at":"2026-05-18T03:09:11.714954+00:00","updated_at":"2026-05-18T03:09:11.714954+00:00"}