{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7VAELKGTELGSP3U5R4GGF2TEJN","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":"03db8ca4a3bbf5982c895982e20daa0a6d73a6c519457ba34aa61d44c59eec4e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T09:38:03Z","title_canon_sha256":"a83080e1b413fca7b038a88f9fc9c4971a87fa11d4b1ac866fa905fb62f3765c"},"schema_version":"1.0","source":{"id":"1705.03673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03673","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03673v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03673","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"7VAELKGTELGS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VAELKGTELGSP3U5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VAELKGT","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:274114c1638b9e3dc43905fd3f81743d5be5f51dc91afdf5c0d45558ff03698c","target":"graph","created_at":"2026-05-18T00:44:43Z","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 computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is whether one can connect the terminals by at least $p$ routes (e.g. paths) such that at most $k$ edges are time-wise shared among them. We study three types of routes: traverse each vertex at most once (paths), each edge at most once (trails), or no such restrictions (walks). We prove that for paths and trails the problem is NP-complete on undirected and direc","authors_text":"Manuel Sorge, Marco Morik, Till Fluschnik","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T09:38:03Z","title":"The Complexity of Routing with Few Collisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03673","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:1d8442d225bd5e41b3e5ad08a416babd77b9d001657c91c8a418f8774e069a20","target":"record","created_at":"2026-05-18T00:44:43Z","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":"03db8ca4a3bbf5982c895982e20daa0a6d73a6c519457ba34aa61d44c59eec4e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T09:38:03Z","title_canon_sha256":"a83080e1b413fca7b038a88f9fc9c4971a87fa11d4b1ac866fa905fb62f3765c"},"schema_version":"1.0","source":{"id":"1705.03673","kind":"arxiv","version":1}},"canonical_sha256":"fd4045a8d322cd27ee9d8f0c62ea644b67d5914692bbff87142de2093c4d492d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd4045a8d322cd27ee9d8f0c62ea644b67d5914692bbff87142de2093c4d492d","first_computed_at":"2026-05-18T00:44:43.245601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:43.245601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"scxgBLqLD0egGml1BA381YGPG5TaHkVHGPl72ujH3zb3YQ6GDn7+D6SGL5LTEP2wianqPhhgmEdFWG+PGCvICw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:43.246092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d8442d225bd5e41b3e5ad08a416babd77b9d001657c91c8a418f8774e069a20","sha256:274114c1638b9e3dc43905fd3f81743d5be5f51dc91afdf5c0d45558ff03698c"],"state_sha256":"8b8378171dd464ab86d879daebf3adb436a94d490a9ab971dca4d8a01b58a99a"}