{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2BALXFEE2WD5ISH52AFTMIMCCH","short_pith_number":"pith:2BALXFEE","schema_version":"1.0","canonical_sha256":"d040bb9484d587d448fdd00b36218211f0115585bcc5b2051c6afbd43d20c60c","source":{"kind":"arxiv","id":"1711.01692","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01692","created_at":"2026-05-18T00:31:17.114901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01692v1","created_at":"2026-05-18T00:31:17.114901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01692","created_at":"2026-05-18T00:31:17.114901+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BALXFEE2WD5","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BALXFEE2WD5ISH5","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BALXFEE","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH","json":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH.json","graph_json":"https://pith.science/api/pith-number/2BALXFEE2WD5ISH52AFTMIMCCH/graph.json","events_json":"https://pith.science/api/pith-number/2BALXFEE2WD5ISH52AFTMIMCCH/events.json","paper":"https://pith.science/paper/2BALXFEE"},"agent_actions":{"view_html":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH","download_json":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH.json","view_paper":"https://pith.science/paper/2BALXFEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01692&json=true","fetch_graph":"https://pith.science/api/pith-number/2BALXFEE2WD5ISH52AFTMIMCCH/graph.json","fetch_events":"https://pith.science/api/pith-number/2BALXFEE2WD5ISH52AFTMIMCCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/action/storage_attestation","attest_author":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/action/author_attestation","sign_citation":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/action/citation_signature","submit_replication":"https://pith.science/pith/2BALXFEE2WD5ISH52AFTMIMCCH/action/replication_record"}},"created_at":"2026-05-18T00:31:17.114901+00:00","updated_at":"2026-05-18T00:31:17.114901+00:00"}