{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PLMULCPGQBVKY3AD7JX7XO32AY","short_pith_number":"pith:PLMULCPG","schema_version":"1.0","canonical_sha256":"7ad94589e6806aac6c03fa6ffbbb7a0605b2855972110272547ff562cefc4ba7","source":{"kind":"arxiv","id":"2105.08335","version":2},"attestation_state":"computed","paper":{"title":"Interference-free Walks in Time: Temporally Disjoint Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"George B. Mertzios, Hendrik Molter, Nina Klobas, Philipp Zschoche, Rolf Niedermeier","submitted_at":"2021-05-18T07:59:07Z","abstract_excerpt":"We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically increasing time steps. Two paths (or walks) are temporally disjoint if they never use the same vertex at the same time; otherwise, they interfere. This reflects applications in robotics, traffic routing, or finding safe pathways in dynamically changing networks. On the one extreme, we show that on general graphs the problem is computationally hard. The \"walk ver"},"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":"2105.08335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T07:59:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"73d1a4eb3d1090e17879a48e03927b1bd4b174e1e690508f949173aeb4a4b8dd","abstract_canon_sha256":"4eed978b12aa62789c97195a6674857b4dd2f12c16ae4130cb3be2f91e3a58bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:15.133909Z","signature_b64":"0m5Othm6JWV5I4jW/VkxYSZhscOsxa02DWREz4VoqpoMj7gM27ZBZ0dxmB0gu6zSD582IfTl9NXWRWljTbSiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ad94589e6806aac6c03fa6ffbbb7a0605b2855972110272547ff562cefc4ba7","last_reissued_at":"2026-07-05T02:42:15.133497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:15.133497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference-free Walks in Time: Temporally Disjoint Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"George B. Mertzios, Hendrik Molter, Nina Klobas, Philipp Zschoche, Rolf Niedermeier","submitted_at":"2021-05-18T07:59:07Z","abstract_excerpt":"We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically increasing time steps. Two paths (or walks) are temporally disjoint if they never use the same vertex at the same time; otherwise, they interfere. This reflects applications in robotics, traffic routing, or finding safe pathways in dynamically changing networks. On the one extreme, we show that on general graphs the problem is computationally hard. The \"walk ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.08335","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.08335/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.08335","created_at":"2026-07-05T02:42:15.133559+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.08335v2","created_at":"2026-07-05T02:42:15.133559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08335","created_at":"2026-07-05T02:42:15.133559+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLMULCPGQBVK","created_at":"2026-07-05T02:42:15.133559+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLMULCPGQBVKY3AD","created_at":"2026-07-05T02:42:15.133559+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLMULCPG","created_at":"2026-07-05T02:42:15.133559+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14980","citing_title":"FedWCM: Unleashing the Potential of Momentum-based Federated Learning in Long-Tailed Scenarios","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY","json":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY.json","graph_json":"https://pith.science/api/pith-number/PLMULCPGQBVKY3AD7JX7XO32AY/graph.json","events_json":"https://pith.science/api/pith-number/PLMULCPGQBVKY3AD7JX7XO32AY/events.json","paper":"https://pith.science/paper/PLMULCPG"},"agent_actions":{"view_html":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY","download_json":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY.json","view_paper":"https://pith.science/paper/PLMULCPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.08335&json=true","fetch_graph":"https://pith.science/api/pith-number/PLMULCPGQBVKY3AD7JX7XO32AY/graph.json","fetch_events":"https://pith.science/api/pith-number/PLMULCPGQBVKY3AD7JX7XO32AY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/action/storage_attestation","attest_author":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/action/author_attestation","sign_citation":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/action/citation_signature","submit_replication":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/action/replication_record"}},"created_at":"2026-07-05T02:42:15.133559+00:00","updated_at":"2026-07-05T02:42:15.133559+00:00"}