{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SKRDMHV4AQTXN5FSC3IXUQLF2F","short_pith_number":"pith:SKRDMHV4","canonical_record":{"source":{"id":"1303.4897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-20T10:30:17Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"b195273f18156c04ff3a4808ac9c92a9e843b30740a29326edec757ed17c5901","abstract_canon_sha256":"44dd589082a54c2ca6cd0b7046878bed94deb348099daf4f73acf9761833ae97"},"schema_version":"1.0"},"canonical_sha256":"92a2361ebc042776f4b216d17a4165d17469e70dd7a68baa3c0f8ef52907a577","source":{"kind":"arxiv","id":"1303.4897","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4897","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4897v1","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4897","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"SKRDMHV4AQTX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SKRDMHV4AQTXN5FS","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SKRDMHV4","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SKRDMHV4AQTXN5FSC3IXUQLF2F","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-20T10:30:17Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"b195273f18156c04ff3a4808ac9c92a9e843b30740a29326edec757ed17c5901","abstract_canon_sha256":"44dd589082a54c2ca6cd0b7046878bed94deb348099daf4f73acf9761833ae97"},"schema_version":"1.0"},"canonical_sha256":"92a2361ebc042776f4b216d17a4165d17469e70dd7a68baa3c0f8ef52907a577","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:15.762359Z","signature_b64":"qXnMqdverLvagNvtBxG0PjIQJeHvtB1UG80d5yOvkX4it5Czq1bEV4/AzVBqslGC9RXp2bUybX9aDH2exkePDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92a2361ebc042776f4b216d17a4165d17469e70dd7a68baa3c0f8ef52907a577","last_reissued_at":"2026-05-18T03:30:15.761375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:15.761375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4897","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-18T03:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZI2XzO0u+3bUJc7mcln5hSwsfr+E8OXjIusaDkvHS8lRZ95HNHgoDfmZlj61hfNU5WOyjsq+ruED7hNBaefBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:31:25.728481Z"},"content_sha256":"a38e19c5acf210a9e31c04d9f256cb8ec0d4b8477123426ee08ead1df0b1260a","schema_version":"1.0","event_id":"sha256:a38e19c5acf210a9e31c04d9f256cb8ec0d4b8477123426ee08ead1df0b1260a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SKRDMHV4AQTXN5FSC3IXUQLF2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Edge-Disjoint Paths in $k$-sums of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Chandra Chekuri, F. Bruce Shepherd, Guyslain Naves","submitted_at":"2013-03-20T10:30:17Z","abstract_excerpt":"We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be $\\Omega(\\sqrt{n})$ even for planar graphs due to a simple topological obstruction and a major focus, following earlier work, has been understanding the gap if some constant congestion is allowed.\n  In this context, it is natural to ask for which classes of graphs does a constant-factor constant-congestion property hold. It is easy to deduce that for given cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4897","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-18T03:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L06KyRkRBtYnq92YdQxEISYYBWSC2yH5AV87ggOQ7JNrciE4+90WFJ28Uw2qqAPvOuUf1omO5ap3PoC/h+dDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:31:25.729063Z"},"content_sha256":"dd750a9f5914a4bfdbd64c1228de610193c6491024993d4f253f5be7a7ed5b1a","schema_version":"1.0","event_id":"sha256:dd750a9f5914a4bfdbd64c1228de610193c6491024993d4f253f5be7a7ed5b1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKRDMHV4AQTXN5FSC3IXUQLF2F/bundle.json","state_url":"https://pith.science/pith/SKRDMHV4AQTXN5FSC3IXUQLF2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKRDMHV4AQTXN5FSC3IXUQLF2F/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-05-27T06:31:25Z","links":{"resolver":"https://pith.science/pith/SKRDMHV4AQTXN5FSC3IXUQLF2F","bundle":"https://pith.science/pith/SKRDMHV4AQTXN5FSC3IXUQLF2F/bundle.json","state":"https://pith.science/pith/SKRDMHV4AQTXN5FSC3IXUQLF2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKRDMHV4AQTXN5FSC3IXUQLF2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SKRDMHV4AQTXN5FSC3IXUQLF2F","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":"44dd589082a54c2ca6cd0b7046878bed94deb348099daf4f73acf9761833ae97","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-20T10:30:17Z","title_canon_sha256":"b195273f18156c04ff3a4808ac9c92a9e843b30740a29326edec757ed17c5901"},"schema_version":"1.0","source":{"id":"1303.4897","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4897","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4897v1","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4897","created_at":"2026-05-18T03:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"SKRDMHV4AQTX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SKRDMHV4AQTXN5FS","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SKRDMHV4","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:dd750a9f5914a4bfdbd64c1228de610193c6491024993d4f253f5be7a7ed5b1a","target":"graph","created_at":"2026-05-18T03:30:15Z","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 consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be $\\Omega(\\sqrt{n})$ even for planar graphs due to a simple topological obstruction and a major focus, following earlier work, has been understanding the gap if some constant congestion is allowed.\n  In this context, it is natural to ask for which classes of graphs does a constant-factor constant-congestion property hold. It is easy to deduce that for given cons","authors_text":"Chandra Chekuri, F. Bruce Shepherd, Guyslain Naves","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-20T10:30:17Z","title":"Maximum Edge-Disjoint Paths in $k$-sums of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4897","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:a38e19c5acf210a9e31c04d9f256cb8ec0d4b8477123426ee08ead1df0b1260a","target":"record","created_at":"2026-05-18T03:30:15Z","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":"44dd589082a54c2ca6cd0b7046878bed94deb348099daf4f73acf9761833ae97","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-20T10:30:17Z","title_canon_sha256":"b195273f18156c04ff3a4808ac9c92a9e843b30740a29326edec757ed17c5901"},"schema_version":"1.0","source":{"id":"1303.4897","kind":"arxiv","version":1}},"canonical_sha256":"92a2361ebc042776f4b216d17a4165d17469e70dd7a68baa3c0f8ef52907a577","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92a2361ebc042776f4b216d17a4165d17469e70dd7a68baa3c0f8ef52907a577","first_computed_at":"2026-05-18T03:30:15.761375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:15.761375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qXnMqdverLvagNvtBxG0PjIQJeHvtB1UG80d5yOvkX4it5Czq1bEV4/AzVBqslGC9RXp2bUybX9aDH2exkePDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:15.762359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4897","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a38e19c5acf210a9e31c04d9f256cb8ec0d4b8477123426ee08ead1df0b1260a","sha256:dd750a9f5914a4bfdbd64c1228de610193c6491024993d4f253f5be7a7ed5b1a"],"state_sha256":"e5839e57c43a5f5f28c4b655429218760b4e8a94c58ea321a5a24598536672a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGZD/kVJNMgMNvjPV8ayAny/bTftATTU30F8tIr2PG3iPSzyRw6au51KJu/PDYfRhLPVAtDRZb1cUkrnZM7JAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:31:25.732060Z","bundle_sha256":"0ffd91d676fa91b34119a3b13b796e0f60cce7f3cd8f8b1c2539db6e4dda635f"}}