{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JESOXAUFN6BXRLDH5AEN4FMLHF","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":"651a7a6c8958d4e0acaada131fef9cbf6f11b52f1803fff24f53262342b64bdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-06T20:35:37Z","title_canon_sha256":"a4c7616526af26ead4f66d83c9d0d13460b335d4016524cc652ed4b21096a562"},"schema_version":"1.0","source":{"id":"1512.01829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01829","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01829v1","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01829","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"JESOXAUFN6BX","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JESOXAUFN6BXRLDH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JESOXAUF","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:b0923a92ccd62e368325eeae73ec0b137087c2c42a3695a77243188378afa831","target":"graph","created_at":"2026-05-18T01:25:10Z","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 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","authors_text":"Alina Ene, Andrej Risteski, Marcin Pilipczuk, Matthias Mnich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-06T20:35:37Z","title":"On Routing Disjoint Paths in Bounded Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01829","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:79923ca67b961b269ea50585a31c4c68d5649ad23ab9fb83e8101623f76b4a5d","target":"record","created_at":"2026-05-18T01:25:10Z","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":"651a7a6c8958d4e0acaada131fef9cbf6f11b52f1803fff24f53262342b64bdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-06T20:35:37Z","title_canon_sha256":"a4c7616526af26ead4f66d83c9d0d13460b335d4016524cc652ed4b21096a562"},"schema_version":"1.0","source":{"id":"1512.01829","kind":"arxiv","version":1}},"canonical_sha256":"4924eb82856f8378ac67e808de158b397ac7abdfcf70df4e2f4034283a758d30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4924eb82856f8378ac67e808de158b397ac7abdfcf70df4e2f4034283a758d30","first_computed_at":"2026-05-18T01:25:10.238743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:10.238743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NFpteIS1VvOTtUkJ8Dnpt7t6cT9hHLw7uk+T71+25ju9F7u5DFs51PA+38kR0TR6UcVTThahOP6IClPUbstaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:10.239265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79923ca67b961b269ea50585a31c4c68d5649ad23ab9fb83e8101623f76b4a5d","sha256:b0923a92ccd62e368325eeae73ec0b137087c2c42a3695a77243188378afa831"],"state_sha256":"67fdd23212d597f0b61af48be9b8739606568b67d4954580e146d837402c444a"}