{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2BALXFEE2WD5ISH52AFTMIMCCH","short_pith_number":"pith:2BALXFEE","canonical_record":{"source":{"id":"1711.01692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T01:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"6c9991bf6654fb5ef43742214e766fccee00a5d67d65dd60d516999029d64979","abstract_canon_sha256":"53ddcca3950b72e0d9e9f051fc88074e6bd2f65d8a6f16b2c87f7fc8ad26c70b"},"schema_version":"1.0"},"canonical_sha256":"d040bb9484d587d448fdd00b36218211f0115585bcc5b2051c6afbd43d20c60c","source":{"kind":"arxiv","id":"1711.01692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01692","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01692v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01692","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"2BALXFEE2WD5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2BALXFEE2WD5ISH5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2BALXFEE","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2BALXFEE2WD5ISH52AFTMIMCCH","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T01:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"6c9991bf6654fb5ef43742214e766fccee00a5d67d65dd60d516999029d64979","abstract_canon_sha256":"53ddcca3950b72e0d9e9f051fc88074e6bd2f65d8a6f16b2c87f7fc8ad26c70b"},"schema_version":"1.0"},"canonical_sha256":"d040bb9484d587d448fdd00b36218211f0115585bcc5b2051c6afbd43d20c60c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:17.115516Z","signature_b64":"f9U+JviDR844VU29EbCunVQVgF/4eG51cUdE660p1LrtbZAL6dU9jzGjiDT9NtDUKptwHkxL4o231Jt0BKQzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d040bb9484d587d448fdd00b36218211f0115585bcc5b2051c6afbd43d20c60c","last_reissued_at":"2026-05-18T00:31:17.114817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:17.114817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01692","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-18T00:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G10HkXOjoqybgks45A9HUUmuwBYuKV06ppquij2XdgFzKATwZZd0n/bQRrWu700SgFpFSsNu1fmCi1ZuKNLbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:50:03.872404Z"},"content_sha256":"7b6d2b330c62fd8018e8c4a62cd2eff72f72e1d0028f6785cd056cd128f3c100","schema_version":"1.0","event_id":"sha256:7b6d2b330c62fd8018e8c4a62cd2eff72f72e1d0028f6785cd056cd128f3c100"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2BALXFEE2WD5ISH52AFTMIMCCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Ario Salmasi, Timothy Carpenter","submitted_at":"2017-11-06T01:31:19Z","abstract_excerpt":"The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undirected graphs [Chuzhoy and Li 2016] and [Chekuri and Ene 2013]. However, the problem is hard to approximate within polynomial factors on directed graphs, for any constant congestion [Chuzhoy, Kim and Li 2016].\n  Recently, [Chekuri, Ene and Pilipczuk 2016] have obtained a polylogarithmic approximation with constant congestion on directed planar graphs, for the special case of symmetric demands. We extend their result b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01692","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-18T00:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgAnnh1cIGH1/nEXdwfPWrDwjH7xZjE+4QuajHZozi15EO00UAXCphgsY3P17N20DBp5miEjR5QyUWrqJhQjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:50:03.872750Z"},"content_sha256":"0087b2e6a77e47ecc17f61ca632dc72f5bfac7dfaa0cececeae41722e53c1b33","schema_version":"1.0","event_id":"sha256:0087b2e6a77e47ecc17f61ca632dc72f5bfac7dfaa0cececeae41722e53c1b33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/bundle.json","state_url":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BALXFEE2WD5ISH52AFTMIMCCH/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-20T09:50:03Z","links":{"resolver":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH","bundle":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/bundle.json","state":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BALXFEE2WD5ISH52AFTMIMCCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2BALXFEE2WD5ISH52AFTMIMCCH","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":"53ddcca3950b72e0d9e9f051fc88074e6bd2f65d8a6f16b2c87f7fc8ad26c70b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T01:31:19Z","title_canon_sha256":"6c9991bf6654fb5ef43742214e766fccee00a5d67d65dd60d516999029d64979"},"schema_version":"1.0","source":{"id":"1711.01692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01692","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01692v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01692","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"2BALXFEE2WD5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2BALXFEE2WD5ISH5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2BALXFEE","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:0087b2e6a77e47ecc17f61ca632dc72f5bfac7dfaa0cececeae41722e53c1b33","target":"graph","created_at":"2026-05-18T00:31:17Z","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":"The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undirected graphs [Chuzhoy and Li 2016] and [Chekuri and Ene 2013]. However, the problem is hard to approximate within polynomial factors on directed graphs, for any constant congestion [Chuzhoy, Kim and Li 2016].\n  Recently, [Chekuri, Ene and Pilipczuk 2016] have obtained a polylogarithmic approximation with constant congestion on directed planar graphs, for the special case of symmetric demands. We extend their result b","authors_text":"Anastasios Sidiropoulos, Ario Salmasi, Timothy Carpenter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T01:31:19Z","title":"Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01692","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:7b6d2b330c62fd8018e8c4a62cd2eff72f72e1d0028f6785cd056cd128f3c100","target":"record","created_at":"2026-05-18T00:31:17Z","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":"53ddcca3950b72e0d9e9f051fc88074e6bd2f65d8a6f16b2c87f7fc8ad26c70b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T01:31:19Z","title_canon_sha256":"6c9991bf6654fb5ef43742214e766fccee00a5d67d65dd60d516999029d64979"},"schema_version":"1.0","source":{"id":"1711.01692","kind":"arxiv","version":1}},"canonical_sha256":"d040bb9484d587d448fdd00b36218211f0115585bcc5b2051c6afbd43d20c60c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d040bb9484d587d448fdd00b36218211f0115585bcc5b2051c6afbd43d20c60c","first_computed_at":"2026-05-18T00:31:17.114817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:17.114817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f9U+JviDR844VU29EbCunVQVgF/4eG51cUdE660p1LrtbZAL6dU9jzGjiDT9NtDUKptwHkxL4o231Jt0BKQzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:17.115516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b6d2b330c62fd8018e8c4a62cd2eff72f72e1d0028f6785cd056cd128f3c100","sha256:0087b2e6a77e47ecc17f61ca632dc72f5bfac7dfaa0cececeae41722e53c1b33"],"state_sha256":"9183ba623c817d762cbe3ed49ddeb51f46e5cc2455151d774480a362e2c79aca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQcwJNqy/MksRpFwg256y/2v0pVCr3Q5QVOJfr9/6xuSVRd0+cZ/sNRJ20O0RLxzSsWU1tPh7WWyJzUG9RrVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:50:03.874696Z","bundle_sha256":"2551c92b85cf52a979568119d785f9e5c74b67e5e510dc302ae223a7b4acd323"}}