{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:PLMULCPGQBVKY3AD7JX7XO32AY","short_pith_number":"pith:PLMULCPG","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"},"canonical_sha256":"7ad94589e6806aac6c03fa6ffbbb7a0605b2855972110272547ff562cefc4ba7","source":{"kind":"arxiv","id":"2105.08335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.08335","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"2105.08335v2","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08335","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"PLMULCPGQBVK","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"pith_short_16","alias_value":"PLMULCPGQBVKY3AD","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"pith_short_8","alias_value":"PLMULCPG","created_at":"2026-07-05T02:42:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:PLMULCPGQBVKY3AD7JX7XO32AY","target":"record","payload":{"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"},"canonical_sha256":"7ad94589e6806aac6c03fa6ffbbb7a0605b2855972110272547ff562cefc4ba7","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"},"source_kind":"arxiv","source_id":"2105.08335","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qp//KqzeLos4aAW/kAyINwLTFC9RgVnSg9ixqr5qHxLbA0H5VAC4z7z0MF8M5cDmkM1c+xAeXqVfX0azH6IYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T20:26:56.509451Z"},"content_sha256":"eb287fefcfe5d8e4e258f14293f3bac9ff0da7f22b6f5edf87b634f732460f9b","schema_version":"1.0","event_id":"sha256:eb287fefcfe5d8e4e258f14293f3bac9ff0da7f22b6f5edf87b634f732460f9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:PLMULCPGQBVKY3AD7JX7XO32AY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xYX0CiEwX+xzqdNZ7C8cwhRlVrLkimwPUxRCZSemqOxKnp3Iz7qMfqiKxCPq/4twO1v7J1mE08tyt7aDrMzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T20:26:56.509954Z"},"content_sha256":"ed0fb8b909b468f3aa17d78100f39bdbe764ddf8d7605c9dc4cb0d715e322bce","schema_version":"1.0","event_id":"sha256:ed0fb8b909b468f3aa17d78100f39bdbe764ddf8d7605c9dc4cb0d715e322bce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/bundle.json","state_url":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLMULCPGQBVKY3AD7JX7XO32AY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T20:26:56Z","links":{"resolver":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY","bundle":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/bundle.json","state":"https://pith.science/pith/PLMULCPGQBVKY3AD7JX7XO32AY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLMULCPGQBVKY3AD7JX7XO32AY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:PLMULCPGQBVKY3AD7JX7XO32AY","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":"4eed978b12aa62789c97195a6674857b4dd2f12c16ae4130cb3be2f91e3a58bd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T07:59:07Z","title_canon_sha256":"73d1a4eb3d1090e17879a48e03927b1bd4b174e1e690508f949173aeb4a4b8dd"},"schema_version":"1.0","source":{"id":"2105.08335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.08335","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"2105.08335v2","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08335","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"PLMULCPGQBVK","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"pith_short_16","alias_value":"PLMULCPGQBVKY3AD","created_at":"2026-07-05T02:42:15Z"},{"alias_kind":"pith_short_8","alias_value":"PLMULCPG","created_at":"2026-07-05T02:42:15Z"}],"graph_snapshots":[{"event_id":"sha256:ed0fb8b909b468f3aa17d78100f39bdbe764ddf8d7605c9dc4cb0d715e322bce","target":"graph","created_at":"2026-07-05T02:42:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.08335/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"George B. Mertzios, Hendrik Molter, Nina Klobas, Philipp Zschoche, Rolf Niedermeier","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T07:59:07Z","title":"Interference-free Walks in Time: Temporally Disjoint Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.08335","kind":"arxiv","version":2},"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:eb287fefcfe5d8e4e258f14293f3bac9ff0da7f22b6f5edf87b634f732460f9b","target":"record","created_at":"2026-07-05T02:42:15Z","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":"4eed978b12aa62789c97195a6674857b4dd2f12c16ae4130cb3be2f91e3a58bd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-18T07:59:07Z","title_canon_sha256":"73d1a4eb3d1090e17879a48e03927b1bd4b174e1e690508f949173aeb4a4b8dd"},"schema_version":"1.0","source":{"id":"2105.08335","kind":"arxiv","version":2}},"canonical_sha256":"7ad94589e6806aac6c03fa6ffbbb7a0605b2855972110272547ff562cefc4ba7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ad94589e6806aac6c03fa6ffbbb7a0605b2855972110272547ff562cefc4ba7","first_computed_at":"2026-07-05T02:42:15.133497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:42:15.133497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0m5Othm6JWV5I4jW/VkxYSZhscOsxa02DWREz4VoqpoMj7gM27ZBZ0dxmB0gu6zSD582IfTl9NXWRWljTbSiDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:42:15.133909Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.08335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb287fefcfe5d8e4e258f14293f3bac9ff0da7f22b6f5edf87b634f732460f9b","sha256:ed0fb8b909b468f3aa17d78100f39bdbe764ddf8d7605c9dc4cb0d715e322bce"],"state_sha256":"b1906d46207e2b4d5692dafaec52cff4cc4aa2ef0c2a451a3d583d2f651ed600"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cio6F/6B1LtuMsArA15KDJfCxG8Pc2oceHE9vzPm1NUjb2T4LL4BXeXUZyeAc0/E3CW0wJ7vdId3AQut1Ea9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T20:26:56.514914Z","bundle_sha256":"9d9c8be1387c0f6002ade4519039dfe848c9cc263dc6363ce14fdd373d92ef41"}}