{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LXLCSIFKZ75CKNVLOTVRYAVQVG","short_pith_number":"pith:LXLCSIFK","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"},"canonical_sha256":"5dd62920aacffa2536ab74eb1c02b0a9b58f07799e228aca826a9998eda2f3e2","source":{"kind":"arxiv","id":"1307.2205","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2205","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2205v3","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2205","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"LXLCSIFKZ75C","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LXLCSIFKZ75CKNVL","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LXLCSIFK","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LXLCSIFKZ75CKNVLOTVRYAVQVG","target":"record","payload":{"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"},"canonical_sha256":"5dd62920aacffa2536ab74eb1c02b0a9b58f07799e228aca826a9998eda2f3e2","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"},"source_kind":"arxiv","source_id":"1307.2205","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hhME6RdTkqiw8aXuG6UH0dzEl+QQqfzcoF8UFRlKOZs7LyWpV2niAnOojL5USN4VzKQ1w/N6P10k9nQ2TPl2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:59:59.050674Z"},"content_sha256":"5da3ac494049d83c533a2140739187875a1d10d772f284db59098f42bbb22331","schema_version":"1.0","event_id":"sha256:5da3ac494049d83c533a2140739187875a1d10d772f284db59098f42bbb22331"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LXLCSIFKZ75CKNVLOTVRYAVQVG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wK2NfYYjDO8YhK+2PfiKDLo6MH6+JAu5SuHVmQHa/Xt5nggCwer0cWWUFHUjIOPEkE9dTzBu0y9F2bq5IzYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:59:59.051118Z"},"content_sha256":"22ecce278655ebad8b69f1c29c4a95d296d7d726d1845c9c9e6e304231121589","schema_version":"1.0","event_id":"sha256:22ecce278655ebad8b69f1c29c4a95d296d7d726d1845c9c9e6e304231121589"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/bundle.json","state_url":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T11:59:59Z","links":{"resolver":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG","bundle":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/bundle.json","state":"https://pith.science/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXLCSIFKZ75CKNVLOTVRYAVQVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LXLCSIFKZ75CKNVLOTVRYAVQVG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d9e2f1942d5421adb0623e8a4673010bd29e1353a030790d20ef353a09864b96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-08T19:13:00Z","title_canon_sha256":"634efaf8cf0e3c4e723dff3755bb3313089a558c7c1454b4b7c22f38336b5173"},"schema_version":"1.0","source":{"id":"1307.2205","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2205","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2205v3","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2205","created_at":"2026-05-18T03:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"LXLCSIFKZ75C","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LXLCSIFKZ75CKNVL","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LXLCSIFK","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:22ecce278655ebad8b69f1c29c4a95d296d7d726d1845c9c9e6e304231121589","target":"graph","created_at":"2026-05-18T03:09:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aleksander Madry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-08T19:13:00Z","title":"Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2205","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5da3ac494049d83c533a2140739187875a1d10d772f284db59098f42bbb22331","target":"record","created_at":"2026-05-18T03:09:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d9e2f1942d5421adb0623e8a4673010bd29e1353a030790d20ef353a09864b96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-08T19:13:00Z","title_canon_sha256":"634efaf8cf0e3c4e723dff3755bb3313089a558c7c1454b4b7c22f38336b5173"},"schema_version":"1.0","source":{"id":"1307.2205","kind":"arxiv","version":3}},"canonical_sha256":"5dd62920aacffa2536ab74eb1c02b0a9b58f07799e228aca826a9998eda2f3e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dd62920aacffa2536ab74eb1c02b0a9b58f07799e228aca826a9998eda2f3e2","first_computed_at":"2026-05-18T03:09:11.714842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:11.714842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u/Y24L2U5WsNZKg5/g6Yinkfw5wpTN0cbxsCv9dYrvrJXFD+b4Wo23eUWr7eFbMHOq6HR+BOv5J4eTBeylnUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:11.715619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2205","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5da3ac494049d83c533a2140739187875a1d10d772f284db59098f42bbb22331","sha256:22ecce278655ebad8b69f1c29c4a95d296d7d726d1845c9c9e6e304231121589"],"state_sha256":"fa95461c6adfc8b63c1cb40db59bc2836d3aae61aabb6c5ee2e67cda25370538"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vB6soahei7kkbY7upXqQLaHN2suHyRZAl4pT9hAAH/lKBBjvJLlD/U6F9BoA3DJa8fzggmpjH4aaREe7IvERDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:59:59.055998Z","bundle_sha256":"87e38e003806aef573a425be29e60bc98ff61002e48c8bc4f8f423b2fdcc03bb"}}