{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7VAELKGTELGSP3U5R4GGF2TEJN","short_pith_number":"pith:7VAELKGT","schema_version":"1.0","canonical_sha256":"fd4045a8d322cd27ee9d8f0c62ea644b67d5914692bbff87142de2093c4d492d","source":{"kind":"arxiv","id":"1705.03673","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Routing with Few Collisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Marco Morik, Till Fluschnik","submitted_at":"2017-05-10T09:38:03Z","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"},"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":"1705.03673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T09:38:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a83080e1b413fca7b038a88f9fc9c4971a87fa11d4b1ac866fa905fb62f3765c","abstract_canon_sha256":"03db8ca4a3bbf5982c895982e20daa0a6d73a6c519457ba34aa61d44c59eec4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.246092Z","signature_b64":"scxgBLqLD0egGml1BA381YGPG5TaHkVHGPl72ujH3zb3YQ6GDn7+D6SGL5LTEP2wianqPhhgmEdFWG+PGCvICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd4045a8d322cd27ee9d8f0c62ea644b67d5914692bbff87142de2093c4d492d","last_reissued_at":"2026-05-18T00:44:43.245601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.245601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Routing with Few Collisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Marco Morik, Till Fluschnik","submitted_at":"2017-05-10T09:38:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03673","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":"1705.03673","created_at":"2026-05-18T00:44:43.245685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03673v1","created_at":"2026-05-18T00:44:43.245685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03673","created_at":"2026-05-18T00:44:43.245685+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VAELKGTELGS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VAELKGTELGSP3U5","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VAELKGT","created_at":"2026-05-18T12:31:05.417338+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/7VAELKGTELGSP3U5R4GGF2TEJN","json":"https://pith.science/pith/7VAELKGTELGSP3U5R4GGF2TEJN.json","graph_json":"https://pith.science/api/pith-number/7VAELKGTELGSP3U5R4GGF2TEJN/graph.json","events_json":"https://pith.science/api/pith-number/7VAELKGTELGSP3U5R4GGF2TEJN/events.json","paper":"https://pith.science/paper/7VAELKGT"},"agent_actions":{"view_html":"https://pith.science/pith/7VAELKGTELGSP3U5R4GGF2TEJN","download_json":"https://pith.science/pith/7VAELKGTELGSP3U5R4GGF2TEJN.json","view_paper":"https://pith.science/paper/7VAELKGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03673&json=true","fetch_graph":"https://pith.science/api/pith-number/7VAELKGTELGSP3U5R4GGF2TEJN/graph.json","fetch_events":"https://pith.science/api/pith-number/7VAELKGTELGSP3U5R4GGF2TEJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VAELKGTELGSP3U5R4GGF2TEJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VAELKGTELGSP3U5R4GGF2TEJN/action/storage_attestation","attest_author":"https://pith.science/pith/7VAELKGTELGSP3U5R4GGF2TEJN/action/author_attestation","sign_citation":"https://pith.science/pith/7VAELKGTELGSP3U5R4GGF2TEJN/action/citation_signature","submit_replication":"https://pith.science/pith/7VAELKGTELGSP3U5R4GGF2TEJN/action/replication_record"}},"created_at":"2026-05-18T00:44:43.245685+00:00","updated_at":"2026-05-18T00:44:43.245685+00:00"}