{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:T6KMF4QPCFZJU7545U62VNWCUW","short_pith_number":"pith:T6KMF4QP","canonical_record":{"source":{"id":"1107.2554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T14:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"64aee1258adbbd1d73b7b8f8e5da193701161b08508f74b45df0ef5b957d5082","abstract_canon_sha256":"b9f92ccab96b99bcfab776e4038890ee2990bde39c56cd0e54500cc4491dc099"},"schema_version":"1.0"},"canonical_sha256":"9f94c2f20f11729a7fbced3daab6c2a5b98bf053d53fd2bb3641cfe5c88c2161","source":{"kind":"arxiv","id":"1107.2554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2554","created_at":"2026-05-18T04:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2554v1","created_at":"2026-05-18T04:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2554","created_at":"2026-05-18T04:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"T6KMF4QPCFZJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T6KMF4QPCFZJU754","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T6KMF4QP","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:T6KMF4QPCFZJU7545U62VNWCUW","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T14:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"64aee1258adbbd1d73b7b8f8e5da193701161b08508f74b45df0ef5b957d5082","abstract_canon_sha256":"b9f92ccab96b99bcfab776e4038890ee2990bde39c56cd0e54500cc4491dc099"},"schema_version":"1.0"},"canonical_sha256":"9f94c2f20f11729a7fbced3daab6c2a5b98bf053d53fd2bb3641cfe5c88c2161","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:22.843521Z","signature_b64":"lyY7Ec7Oa0qr0MNVnPjbyjtTM22ugha95Ig5XpEnK5Ioo9OeaPHGKCtqHukuK24ILw59ke6ut++1CBsSOM8gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f94c2f20f11729a7fbced3daab6c2a5b98bf053d53fd2bb3641cfe5c88c2161","last_reissued_at":"2026-05-18T04:18:22.842945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:22.842945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2554","source_version":1,"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-18T04:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwIK6AD04lj2SbCfA0sYcdZ/z7yKYbzlZ56to5FmzCzaIn0lQG27NzeMIS0roCcVc58TtgB+cuWVCA63H2+aBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:19:12.250607Z"},"content_sha256":"ac873d0b92f2b2cf069f515de0e4a6a0f2a4ed5e1570bde706dd6e16bbf7acbe","schema_version":"1.0","event_id":"sha256:ac873d0b92f2b2cf069f515de0e4a6a0f2a4ed5e1570bde706dd6e16bbf7acbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:T6KMF4QPCFZJU7545U62VNWCUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing in Undirected Graphs with Constant Congestion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Julia Chuzhoy","submitted_at":"2011-07-13T14:04:11Z","abstract_excerpt":"Given an undirected graph G=(V,E), a collection (s_1,t_1),...,(s_k,t_k) of k source-sink pairs, and an integer c, the goal in the Edge Disjoint Paths with Congestion problem is to connect maximum possible number of the source-sink pairs by paths, so that the maximum load on any edge (called edge congestion) does not exceed c.\n  We show an efficient randomized algorithm to route $\\Omega(OPT/\\poly\\log k)$ source-sink pairs with congestion at most 14, where OPT is the maximum number of pairs that can be simultaneously routed on edge-disjoint paths. The best previous algorithm that routed $\\Omega("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2554","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"},"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-18T04:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FX+rsgygnrCT5Y9DuaD8e1TyLaOJxdw57CzEkfa4miUxa1Qxp1GD4NBmzdZocEFy433voW88Ojp2mV6wxFYWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:19:12.250966Z"},"content_sha256":"8d38f255990e0357e1ad5f48a4c20e792a6538d240299588e6ebb7e88f681b2e","schema_version":"1.0","event_id":"sha256:8d38f255990e0357e1ad5f48a4c20e792a6538d240299588e6ebb7e88f681b2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6KMF4QPCFZJU7545U62VNWCUW/bundle.json","state_url":"https://pith.science/pith/T6KMF4QPCFZJU7545U62VNWCUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6KMF4QPCFZJU7545U62VNWCUW/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-11T11:19:12Z","links":{"resolver":"https://pith.science/pith/T6KMF4QPCFZJU7545U62VNWCUW","bundle":"https://pith.science/pith/T6KMF4QPCFZJU7545U62VNWCUW/bundle.json","state":"https://pith.science/pith/T6KMF4QPCFZJU7545U62VNWCUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6KMF4QPCFZJU7545U62VNWCUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:T6KMF4QPCFZJU7545U62VNWCUW","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":"b9f92ccab96b99bcfab776e4038890ee2990bde39c56cd0e54500cc4491dc099","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T14:04:11Z","title_canon_sha256":"64aee1258adbbd1d73b7b8f8e5da193701161b08508f74b45df0ef5b957d5082"},"schema_version":"1.0","source":{"id":"1107.2554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2554","created_at":"2026-05-18T04:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2554v1","created_at":"2026-05-18T04:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2554","created_at":"2026-05-18T04:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"T6KMF4QPCFZJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T6KMF4QPCFZJU754","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T6KMF4QP","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:8d38f255990e0357e1ad5f48a4c20e792a6538d240299588e6ebb7e88f681b2e","target":"graph","created_at":"2026-05-18T04:18:22Z","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":"Given an undirected graph G=(V,E), a collection (s_1,t_1),...,(s_k,t_k) of k source-sink pairs, and an integer c, the goal in the Edge Disjoint Paths with Congestion problem is to connect maximum possible number of the source-sink pairs by paths, so that the maximum load on any edge (called edge congestion) does not exceed c.\n  We show an efficient randomized algorithm to route $\\Omega(OPT/\\poly\\log k)$ source-sink pairs with congestion at most 14, where OPT is the maximum number of pairs that can be simultaneously routed on edge-disjoint paths. The best previous algorithm that routed $\\Omega(","authors_text":"Julia Chuzhoy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T14:04:11Z","title":"Routing in Undirected Graphs with Constant Congestion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2554","kind":"arxiv","version":1},"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:ac873d0b92f2b2cf069f515de0e4a6a0f2a4ed5e1570bde706dd6e16bbf7acbe","target":"record","created_at":"2026-05-18T04:18:22Z","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":"b9f92ccab96b99bcfab776e4038890ee2990bde39c56cd0e54500cc4491dc099","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T14:04:11Z","title_canon_sha256":"64aee1258adbbd1d73b7b8f8e5da193701161b08508f74b45df0ef5b957d5082"},"schema_version":"1.0","source":{"id":"1107.2554","kind":"arxiv","version":1}},"canonical_sha256":"9f94c2f20f11729a7fbced3daab6c2a5b98bf053d53fd2bb3641cfe5c88c2161","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f94c2f20f11729a7fbced3daab6c2a5b98bf053d53fd2bb3641cfe5c88c2161","first_computed_at":"2026-05-18T04:18:22.842945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:22.842945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lyY7Ec7Oa0qr0MNVnPjbyjtTM22ugha95Ig5XpEnK5Ioo9OeaPHGKCtqHukuK24ILw59ke6ut++1CBsSOM8gAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:22.843521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac873d0b92f2b2cf069f515de0e4a6a0f2a4ed5e1570bde706dd6e16bbf7acbe","sha256:8d38f255990e0357e1ad5f48a4c20e792a6538d240299588e6ebb7e88f681b2e"],"state_sha256":"67df1e99690a4ccefb8443de942ed1ea2fef751d37efbfaecd80d2e27e66dec6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFJcyCBAGyevaaMPp7uo2TozOPnknl6VuNht4aWPAc2B+U8xSz/jOwPr2IArCw0x9O/n9X334O6mPHSso7roBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:19:12.253116Z","bundle_sha256":"1b8b51564ab1040bd2144ac807b273f74b8c0fd4ac7ad521af0e068e6537811a"}}