{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3PB2MRZMTBVGUQ2DYIYJZH2JPN","short_pith_number":"pith:3PB2MRZM","canonical_record":{"source":{"id":"1901.01412","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-05T13:20:46Z","cross_cats_sorted":[],"title_canon_sha256":"f3644d24e97ec5cd1b3677795b0fc55b52d823995b2f7ca80f1b0d0d494889b8","abstract_canon_sha256":"914b4d7ef3aa798038279a209020d96efa0aad9bf71644aa8b628557e2ea1815"},"schema_version":"1.0"},"canonical_sha256":"dbc3a6472c986a6a4343c2309c9f497b7b45786cef865b686623570949c6e0b3","source":{"kind":"arxiv","id":"1901.01412","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01412","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01412v4","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01412","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"3PB2MRZMTBVG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3PB2MRZMTBVGUQ2D","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3PB2MRZM","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3PB2MRZMTBVGUQ2DYIYJZH2JPN","target":"record","payload":{"canonical_record":{"source":{"id":"1901.01412","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-05T13:20:46Z","cross_cats_sorted":[],"title_canon_sha256":"f3644d24e97ec5cd1b3677795b0fc55b52d823995b2f7ca80f1b0d0d494889b8","abstract_canon_sha256":"914b4d7ef3aa798038279a209020d96efa0aad9bf71644aa8b628557e2ea1815"},"schema_version":"1.0"},"canonical_sha256":"dbc3a6472c986a6a4343c2309c9f497b7b45786cef865b686623570949c6e0b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:00.939064Z","signature_b64":"tgIfY9o12UPHUj6UKHV9b2mtSrQPXWPicWP5F4QWjTf8IVsC63tki+HZz5jB4Fo0gry7Sadf0mHD7KetzphnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc3a6472c986a6a4343c2309c9f497b7b45786cef865b686623570949c6e0b3","last_reissued_at":"2026-05-17T23:41:00.938437Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:00.938437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.01412","source_version":4,"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-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRERSdxoIKssV849+1GfpYWsGtp6A0AMKuiAiIrVSi6Ct/93IlbxxdcznhGMTgy33l2zFGenRkkosTcGvXmmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:21:54.190081Z"},"content_sha256":"fd87d87ae1ebd190fd313b631ae8c43744743717917e42550ffaf34e7f72ad72","schema_version":"1.0","event_id":"sha256:fd87d87ae1ebd190fd313b631ae8c43744743717917e42550ffaf34e7f72ad72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3PB2MRZMTBVGUQ2DYIYJZH2JPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Ohad Trabelsi, Robert Krauthgamer","submitted_at":"2019-01-05T13:20:46Z","abstract_excerpt":"We investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with $n$ nodes and $m$ edges, compute for all pairs of nodes the maximum-flow value between them. If Max-Flow (the version with a given source-sink pair $s,t$) can be solved in time $T(m)$, then an $O(n^2) \\cdot T(m)$ is a trivial upper bound. But can we do better?\n  For directed graphs, recent results in fine-grained complexity suggest that this time bound is essentially optimal. In contrast, for undirected graphs with edge capacities, a seminal algorithm of Gomory and Hu (1961) runs in much faster time $O(n)\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01412","kind":"arxiv","version":4},"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-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ScB3dmhVyi6EgVgtA2lYLWknWLgts04VpGTwOTJXOgeHrKsxY1hBiel9VEowRh51thaym9KnaDXUxOLuiFu8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:21:54.190437Z"},"content_sha256":"a8ed712c32edfdcf10ce7ff79fdf92a19c4f2337b00debb34786ddc05d22b87e","schema_version":"1.0","event_id":"sha256:a8ed712c32edfdcf10ce7ff79fdf92a19c4f2337b00debb34786ddc05d22b87e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/bundle.json","state_url":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/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-06-02T00:21:54Z","links":{"resolver":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN","bundle":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/bundle.json","state":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3PB2MRZMTBVGUQ2DYIYJZH2JPN","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":"914b4d7ef3aa798038279a209020d96efa0aad9bf71644aa8b628557e2ea1815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-05T13:20:46Z","title_canon_sha256":"f3644d24e97ec5cd1b3677795b0fc55b52d823995b2f7ca80f1b0d0d494889b8"},"schema_version":"1.0","source":{"id":"1901.01412","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01412","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01412v4","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01412","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"3PB2MRZMTBVG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3PB2MRZMTBVGUQ2D","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3PB2MRZM","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:a8ed712c32edfdcf10ce7ff79fdf92a19c4f2337b00debb34786ddc05d22b87e","target":"graph","created_at":"2026-05-17T23:41:00Z","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 investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with $n$ nodes and $m$ edges, compute for all pairs of nodes the maximum-flow value between them. If Max-Flow (the version with a given source-sink pair $s,t$) can be solved in time $T(m)$, then an $O(n^2) \\cdot T(m)$ is a trivial upper bound. But can we do better?\n  For directed graphs, recent results in fine-grained complexity suggest that this time bound is essentially optimal. In contrast, for undirected graphs with edge capacities, a seminal algorithm of Gomory and Hu (1961) runs in much faster time $O(n)\\","authors_text":"Amir Abboud, Ohad Trabelsi, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-05T13:20:46Z","title":"New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01412","kind":"arxiv","version":4},"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:fd87d87ae1ebd190fd313b631ae8c43744743717917e42550ffaf34e7f72ad72","target":"record","created_at":"2026-05-17T23:41:00Z","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":"914b4d7ef3aa798038279a209020d96efa0aad9bf71644aa8b628557e2ea1815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-05T13:20:46Z","title_canon_sha256":"f3644d24e97ec5cd1b3677795b0fc55b52d823995b2f7ca80f1b0d0d494889b8"},"schema_version":"1.0","source":{"id":"1901.01412","kind":"arxiv","version":4}},"canonical_sha256":"dbc3a6472c986a6a4343c2309c9f497b7b45786cef865b686623570949c6e0b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbc3a6472c986a6a4343c2309c9f497b7b45786cef865b686623570949c6e0b3","first_computed_at":"2026-05-17T23:41:00.938437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:00.938437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgIfY9o12UPHUj6UKHV9b2mtSrQPXWPicWP5F4QWjTf8IVsC63tki+HZz5jB4Fo0gry7Sadf0mHD7KetzphnBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:00.939064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01412","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd87d87ae1ebd190fd313b631ae8c43744743717917e42550ffaf34e7f72ad72","sha256:a8ed712c32edfdcf10ce7ff79fdf92a19c4f2337b00debb34786ddc05d22b87e"],"state_sha256":"3ac3c64332a3ada96f4e1558cde5249afa64c2f7f04d3ec2da632ff98e64f5f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGRSfgDQ3WBCvkFd0QiaFh180fi2/ow+R1jASGlOLPsOs8fRqcDRtqYZAiRI6KCF5BQBUnManMqbuohflRVrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:21:54.192369Z","bundle_sha256":"43542fc1b96be90282d279679d34c1d12047df8f7ff7402ce4a3ba4c04db8edf"}}