{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FWZP4LKTJTFKV46A7TPFFO7NNY","short_pith_number":"pith:FWZP4LKT","canonical_record":{"source":{"id":"1208.1272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T20:28:20Z","cross_cats_sorted":[],"title_canon_sha256":"5b2bb32fe7b72a3a8952caa61ff08fc23a3a1383b2d224d0556ba06048306f4a","abstract_canon_sha256":"082b9db740f39c83a5b6eeea39fa904405555db92a6d78f4fc8869c02cc6d24c"},"schema_version":"1.0"},"canonical_sha256":"2db2fe2d534ccaaaf3c0fcde52bbed6e295a0523bbe08553630c6925f1f686e3","source":{"kind":"arxiv","id":"1208.1272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1272","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1272v1","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1272","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"FWZP4LKTJTFK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FWZP4LKTJTFKV46A","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FWZP4LKT","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FWZP4LKTJTFKV46A7TPFFO7NNY","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T20:28:20Z","cross_cats_sorted":[],"title_canon_sha256":"5b2bb32fe7b72a3a8952caa61ff08fc23a3a1383b2d224d0556ba06048306f4a","abstract_canon_sha256":"082b9db740f39c83a5b6eeea39fa904405555db92a6d78f4fc8869c02cc6d24c"},"schema_version":"1.0"},"canonical_sha256":"2db2fe2d534ccaaaf3c0fcde52bbed6e295a0523bbe08553630c6925f1f686e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:19.434092Z","signature_b64":"anE1uhjTC8sufhI2IWLm1Xi+gljrwRwVeAXm+GwsokelIxa0AKLdK5mZKYOn8M4Yn17KMfT0mO1YbtBjROGrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2db2fe2d534ccaaaf3c0fcde52bbed6e295a0523bbe08553630c6925f1f686e3","last_reissued_at":"2026-05-18T03:49:19.433602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:19.433602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1272","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:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jOhsXXiuRA1RL3EiPP738IROzAwl1S98fQ8W08rNz5IdXavuv+OvrOciA5ej1LMgdBc7iG2gekEG4DUvucKJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:19:23.194435Z"},"content_sha256":"33e4b72e1b13f258f22471fb765e5fbc9ff27fbcc8cf3a5385aa396e90432931","schema_version":"1.0","event_id":"sha256:33e4b72e1b13f258f22471fb765e5fbc9ff27fbcc8cf3a5385aa396e90432931"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FWZP4LKTJTFKV46A7TPFFO7NNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Julia Chuzhoy, Shi Li","submitted_at":"2012-08-06T20:28:20Z","abstract_excerpt":"In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected n-vertex graph G, a collection M={(s_1,t_1),...,(s_k,t_k)} of demand pairs and an integer c. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion - the number of paths sharing any edge - is bounded by c. When the maximum allowed congestion is c=1, this is the classical Edge-Disjoint Paths problem (EDP).\n  The best current approximation algorithm for EDP achieves an $O(\\sqrt n)$-approximation, by rounding the standard multi-commodity flow relaxat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1272","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:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gx/yObFadn4LHYUhCCoTuhNOCfpeAsL1NzRCpNKKYXBv+4o4Ar61BsKqnvAITV1LDT91ApE+lWDvt+VM9U96CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:19:23.194805Z"},"content_sha256":"97ee3c18125e80f50989dfe50b8d09d06fcb91cef75fd3ce884b161e03f7c640","schema_version":"1.0","event_id":"sha256:97ee3c18125e80f50989dfe50b8d09d06fcb91cef75fd3ce884b161e03f7c640"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWZP4LKTJTFKV46A7TPFFO7NNY/bundle.json","state_url":"https://pith.science/pith/FWZP4LKTJTFKV46A7TPFFO7NNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWZP4LKTJTFKV46A7TPFFO7NNY/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:23Z","links":{"resolver":"https://pith.science/pith/FWZP4LKTJTFKV46A7TPFFO7NNY","bundle":"https://pith.science/pith/FWZP4LKTJTFKV46A7TPFFO7NNY/bundle.json","state":"https://pith.science/pith/FWZP4LKTJTFKV46A7TPFFO7NNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWZP4LKTJTFKV46A7TPFFO7NNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FWZP4LKTJTFKV46A7TPFFO7NNY","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":"082b9db740f39c83a5b6eeea39fa904405555db92a6d78f4fc8869c02cc6d24c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T20:28:20Z","title_canon_sha256":"5b2bb32fe7b72a3a8952caa61ff08fc23a3a1383b2d224d0556ba06048306f4a"},"schema_version":"1.0","source":{"id":"1208.1272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1272","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1272v1","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1272","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"FWZP4LKTJTFK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FWZP4LKTJTFKV46A","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FWZP4LKT","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:97ee3c18125e80f50989dfe50b8d09d06fcb91cef75fd3ce884b161e03f7c640","target":"graph","created_at":"2026-05-18T03:49:19Z","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":"In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected n-vertex graph G, a collection M={(s_1,t_1),...,(s_k,t_k)} of demand pairs and an integer c. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion - the number of paths sharing any edge - is bounded by c. When the maximum allowed congestion is c=1, this is the classical Edge-Disjoint Paths problem (EDP).\n  The best current approximation algorithm for EDP achieves an $O(\\sqrt n)$-approximation, by rounding the standard multi-commodity flow relaxat","authors_text":"Julia Chuzhoy, Shi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T20:28:20Z","title":"A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1272","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:33e4b72e1b13f258f22471fb765e5fbc9ff27fbcc8cf3a5385aa396e90432931","target":"record","created_at":"2026-05-18T03:49:19Z","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":"082b9db740f39c83a5b6eeea39fa904405555db92a6d78f4fc8869c02cc6d24c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-06T20:28:20Z","title_canon_sha256":"5b2bb32fe7b72a3a8952caa61ff08fc23a3a1383b2d224d0556ba06048306f4a"},"schema_version":"1.0","source":{"id":"1208.1272","kind":"arxiv","version":1}},"canonical_sha256":"2db2fe2d534ccaaaf3c0fcde52bbed6e295a0523bbe08553630c6925f1f686e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2db2fe2d534ccaaaf3c0fcde52bbed6e295a0523bbe08553630c6925f1f686e3","first_computed_at":"2026-05-18T03:49:19.433602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:19.433602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"anE1uhjTC8sufhI2IWLm1Xi+gljrwRwVeAXm+GwsokelIxa0AKLdK5mZKYOn8M4Yn17KMfT0mO1YbtBjROGrAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:19.434092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33e4b72e1b13f258f22471fb765e5fbc9ff27fbcc8cf3a5385aa396e90432931","sha256:97ee3c18125e80f50989dfe50b8d09d06fcb91cef75fd3ce884b161e03f7c640"],"state_sha256":"c5c091a8763dcb3c6c07b87f02d8cf53c6e2853f858e500a08f3a9032e1297ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+H949MpTWYIhtADx18Ekr+pSQHFBNnFfD7ECqY8VJrCycy57mnagVxzMUJRCxAKD2cBqdqFjXRgYKpf8KwSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:19:23.196892Z","bundle_sha256":"6f91f308acb625167dfbc49a844e5cd494d106e9bdfc9acb2327e253af154046"}}