{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:22COVMXZGMM6YEE5OZL4OV2ODZ","short_pith_number":"pith:22COVMXZ","canonical_record":{"source":{"id":"2301.10503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-01-25T10:27:11Z","cross_cats_sorted":["cs.DM","cs.MA"],"title_canon_sha256":"8513d91fc2b02f6e5c83e7b7789ed8b39dec6e748c31a04e639c25f1ae0d3af1","abstract_canon_sha256":"44db09ce36209bbb2d22c72518023e742c6bc3b97e617b0a3bfc0611919c3390"},"schema_version":"1.0"},"canonical_sha256":"d684eab2f93319ec109d7657c7574e1e6f39d4390354bc072a38e5e828064480","source":{"kind":"arxiv","id":"2301.10503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10503","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10503v1","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10503","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"22COVMXZGMM6","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_16","alias_value":"22COVMXZGMM6YEE5","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_8","alias_value":"22COVMXZ","created_at":"2026-07-05T05:35:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:22COVMXZGMM6YEE5OZL4OV2ODZ","target":"record","payload":{"canonical_record":{"source":{"id":"2301.10503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-01-25T10:27:11Z","cross_cats_sorted":["cs.DM","cs.MA"],"title_canon_sha256":"8513d91fc2b02f6e5c83e7b7789ed8b39dec6e748c31a04e639c25f1ae0d3af1","abstract_canon_sha256":"44db09ce36209bbb2d22c72518023e742c6bc3b97e617b0a3bfc0611919c3390"},"schema_version":"1.0"},"canonical_sha256":"d684eab2f93319ec109d7657c7574e1e6f39d4390354bc072a38e5e828064480","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:51.775837Z","signature_b64":"FoqFyB0dWYhiY9RBYBU9N6QUQPJnyFxAxxBaJ7+SYT4lZ+dgIILZ93a5M1Z7/VNDApVWYRJiNlZIS8vdoYxMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d684eab2f93319ec109d7657c7574e1e6f39d4390354bc072a38e5e828064480","last_reissued_at":"2026-07-05T05:35:51.775370Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:51.775370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.10503","source_version":1,"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-05T05:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhKNg4JBUKOmfpZ1YJdjTerZe4LSIepYEI2rFQJaz+jYHjlNeWdI08QUptDbbRHrFu/K+zgO8NwH9alHBynoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:25:41.703570Z"},"content_sha256":"27cc7f5d32a851598c1e839a5031a4ab1e259009c2afe3d4d9b6490bbc2bef4b","schema_version":"1.0","event_id":"sha256:27cc7f5d32a851598c1e839a5031a4ab1e259009c2afe3d4d9b6490bbc2bef4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:22COVMXZGMM6YEE5OZL4OV2ODZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.MA"],"primary_cat":"cs.DS","authors_text":"Hendrik Molter, Meirav Zehavi, Pascal Kunz","submitted_at":"2023-01-25T10:27:11Z","abstract_excerpt":"A temporal graph has an edge set that may change over discrete time steps, and a temporal path (or walk) must traverse edges that appear at increasing time steps. Accordingly, two temporal paths (or walks) are temporally disjoint if they do not visit any vertex at the same time. The study of the computational complexity of finding temporally disjoint paths or walks in temporal graphs has recently been initiated by Klobas et al. [IJCAI '21]. This problem is motivated by applications in multi-agent path finding (MAPF), which include robotics, warehouse management, aircraft management, and traffi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10503","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.10503/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-05T05:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ReZ39bldgqKjIgLBodiZ67WTSI6Wu2nBDMaJqrgxPPB8X/ev+ty32FHqmujFoZVvVPPzdoq6zGBKzaxOxsv0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:25:41.704081Z"},"content_sha256":"7468828482378a3fc36752acfafba65f5b44c4a37d6c76d74d4f905414d9ee92","schema_version":"1.0","event_id":"sha256:7468828482378a3fc36752acfafba65f5b44c4a37d6c76d74d4f905414d9ee92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22COVMXZGMM6YEE5OZL4OV2ODZ/bundle.json","state_url":"https://pith.science/pith/22COVMXZGMM6YEE5OZL4OV2ODZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22COVMXZGMM6YEE5OZL4OV2ODZ/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-20T13:25:41Z","links":{"resolver":"https://pith.science/pith/22COVMXZGMM6YEE5OZL4OV2ODZ","bundle":"https://pith.science/pith/22COVMXZGMM6YEE5OZL4OV2ODZ/bundle.json","state":"https://pith.science/pith/22COVMXZGMM6YEE5OZL4OV2ODZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22COVMXZGMM6YEE5OZL4OV2ODZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:22COVMXZGMM6YEE5OZL4OV2ODZ","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":"44db09ce36209bbb2d22c72518023e742c6bc3b97e617b0a3bfc0611919c3390","cross_cats_sorted":["cs.DM","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-01-25T10:27:11Z","title_canon_sha256":"8513d91fc2b02f6e5c83e7b7789ed8b39dec6e748c31a04e639c25f1ae0d3af1"},"schema_version":"1.0","source":{"id":"2301.10503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10503","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10503v1","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10503","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"22COVMXZGMM6","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_16","alias_value":"22COVMXZGMM6YEE5","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_8","alias_value":"22COVMXZ","created_at":"2026-07-05T05:35:51Z"}],"graph_snapshots":[{"event_id":"sha256:7468828482378a3fc36752acfafba65f5b44c4a37d6c76d74d4f905414d9ee92","target":"graph","created_at":"2026-07-05T05:35:51Z","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/2301.10503/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A temporal graph has an edge set that may change over discrete time steps, and a temporal path (or walk) must traverse edges that appear at increasing time steps. Accordingly, two temporal paths (or walks) are temporally disjoint if they do not visit any vertex at the same time. The study of the computational complexity of finding temporally disjoint paths or walks in temporal graphs has recently been initiated by Klobas et al. [IJCAI '21]. This problem is motivated by applications in multi-agent path finding (MAPF), which include robotics, warehouse management, aircraft management, and traffi","authors_text":"Hendrik Molter, Meirav Zehavi, Pascal Kunz","cross_cats":["cs.DM","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-01-25T10:27:11Z","title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10503","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:27cc7f5d32a851598c1e839a5031a4ab1e259009c2afe3d4d9b6490bbc2bef4b","target":"record","created_at":"2026-07-05T05:35:51Z","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":"44db09ce36209bbb2d22c72518023e742c6bc3b97e617b0a3bfc0611919c3390","cross_cats_sorted":["cs.DM","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-01-25T10:27:11Z","title_canon_sha256":"8513d91fc2b02f6e5c83e7b7789ed8b39dec6e748c31a04e639c25f1ae0d3af1"},"schema_version":"1.0","source":{"id":"2301.10503","kind":"arxiv","version":1}},"canonical_sha256":"d684eab2f93319ec109d7657c7574e1e6f39d4390354bc072a38e5e828064480","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d684eab2f93319ec109d7657c7574e1e6f39d4390354bc072a38e5e828064480","first_computed_at":"2026-07-05T05:35:51.775370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:35:51.775370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FoqFyB0dWYhiY9RBYBU9N6QUQPJnyFxAxxBaJ7+SYT4lZ+dgIILZ93a5M1Z7/VNDApVWYRJiNlZIS8vdoYxMAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:35:51.775837Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.10503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27cc7f5d32a851598c1e839a5031a4ab1e259009c2afe3d4d9b6490bbc2bef4b","sha256:7468828482378a3fc36752acfafba65f5b44c4a37d6c76d74d4f905414d9ee92"],"state_sha256":"e6c5be58373863e77a0a1533cd06dee4bd29a06a0458ccd1158088b355e72712"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaF3M+Qr6SUhCD+Oz+oFRstjmeXXgDCRrxFDJh4OHvJqRI2NU4ilS7mQGofnX/IsFw1RqnBS9+eyPoewO5JrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T13:25:41.710970Z","bundle_sha256":"ec559ca58fe8155013bdd053cae11af4913b823fb3e1a4a3866014a0dba6ef2c"}}