{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JESOXAUFN6BXRLDH5AEN4FMLHF","short_pith_number":"pith:JESOXAUF","schema_version":"1.0","canonical_sha256":"4924eb82856f8378ac67e808de158b397ac7abdfcf70df4e2f4034283a758d30","source":{"kind":"arxiv","id":"1512.01829","version":1},"attestation_state":"computed","paper":{"title":"On Routing Disjoint Paths in Bounded Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alina Ene, Andrej Risteski, Marcin Pilipczuk, Matthias Mnich","submitted_at":"2015-12-06T20:35:37Z","abstract_excerpt":"We study the problem of routing on disjoint paths in bounded treewidth graphs with both edge and node capacities. The input consists of a capacitated graph $G$ and a collection of $k$ source-destination pairs $\\mathcal{M} = \\{(s_1, t_1), \\dots, (s_k, t_k)\\}$. The goal is to maximize the number of pairs that can be routed subject to the capacities in the graph. A routing of a subset $\\mathcal{M}'$ of the pairs is a collection $\\mathcal{P}$ of paths such that, for each pair $(s_i, t_i) \\in \\mathcal{M}'$, there is a path in $\\mathcal{P}$ connecting $s_i$ to $t_i$. In the Maximum Edge Disjoint Pat"},"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":"1512.01829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-06T20:35:37Z","cross_cats_sorted":[],"title_canon_sha256":"a4c7616526af26ead4f66d83c9d0d13460b335d4016524cc652ed4b21096a562","abstract_canon_sha256":"651a7a6c8958d4e0acaada131fef9cbf6f11b52f1803fff24f53262342b64bdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:10.239265Z","signature_b64":"NFpteIS1VvOTtUkJ8Dnpt7t6cT9hHLw7uk+T71+25ju9F7u5DFs51PA+38kR0TR6UcVTThahOP6IClPUbstaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4924eb82856f8378ac67e808de158b397ac7abdfcf70df4e2f4034283a758d30","last_reissued_at":"2026-05-18T01:25:10.238743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:10.238743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Routing Disjoint Paths in Bounded Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alina Ene, Andrej Risteski, Marcin Pilipczuk, Matthias Mnich","submitted_at":"2015-12-06T20:35:37Z","abstract_excerpt":"We study the problem of routing on disjoint paths in bounded treewidth graphs with both edge and node capacities. The input consists of a capacitated graph $G$ and a collection of $k$ source-destination pairs $\\mathcal{M} = \\{(s_1, t_1), \\dots, (s_k, t_k)\\}$. The goal is to maximize the number of pairs that can be routed subject to the capacities in the graph. A routing of a subset $\\mathcal{M}'$ of the pairs is a collection $\\mathcal{P}$ of paths such that, for each pair $(s_i, t_i) \\in \\mathcal{M}'$, there is a path in $\\mathcal{P}$ connecting $s_i$ to $t_i$. In the Maximum Edge Disjoint Pat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01829","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":"1512.01829","created_at":"2026-05-18T01:25:10.238842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01829v1","created_at":"2026-05-18T01:25:10.238842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01829","created_at":"2026-05-18T01:25:10.238842+00:00"},{"alias_kind":"pith_short_12","alias_value":"JESOXAUFN6BX","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JESOXAUFN6BXRLDH","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JESOXAUF","created_at":"2026-05-18T12:29:27.538025+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/JESOXAUFN6BXRLDH5AEN4FMLHF","json":"https://pith.science/pith/JESOXAUFN6BXRLDH5AEN4FMLHF.json","graph_json":"https://pith.science/api/pith-number/JESOXAUFN6BXRLDH5AEN4FMLHF/graph.json","events_json":"https://pith.science/api/pith-number/JESOXAUFN6BXRLDH5AEN4FMLHF/events.json","paper":"https://pith.science/paper/JESOXAUF"},"agent_actions":{"view_html":"https://pith.science/pith/JESOXAUFN6BXRLDH5AEN4FMLHF","download_json":"https://pith.science/pith/JESOXAUFN6BXRLDH5AEN4FMLHF.json","view_paper":"https://pith.science/paper/JESOXAUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01829&json=true","fetch_graph":"https://pith.science/api/pith-number/JESOXAUFN6BXRLDH5AEN4FMLHF/graph.json","fetch_events":"https://pith.science/api/pith-number/JESOXAUFN6BXRLDH5AEN4FMLHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JESOXAUFN6BXRLDH5AEN4FMLHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JESOXAUFN6BXRLDH5AEN4FMLHF/action/storage_attestation","attest_author":"https://pith.science/pith/JESOXAUFN6BXRLDH5AEN4FMLHF/action/author_attestation","sign_citation":"https://pith.science/pith/JESOXAUFN6BXRLDH5AEN4FMLHF/action/citation_signature","submit_replication":"https://pith.science/pith/JESOXAUFN6BXRLDH5AEN4FMLHF/action/replication_record"}},"created_at":"2026-05-18T01:25:10.238842+00:00","updated_at":"2026-05-18T01:25:10.238842+00:00"}