{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BKFM5QO4CGFWCFK44VTVLBCJ7H","short_pith_number":"pith:BKFM5QO4","canonical_record":{"source":{"id":"2201.05390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-14T11:03:24Z","cross_cats_sorted":[],"title_canon_sha256":"271b7c9d4a6de60de290a68b712ea25a3158444adbb03d94578f3604af8a8ee1","abstract_canon_sha256":"1d9845f7e6abace4d67ee719320a7a6a1612006caf4aad50fc100928387d809b"},"schema_version":"1.0"},"canonical_sha256":"0a8acec1dc118b61155ce567558449f9e1c481c8fecf0a3af824ca8796e4846e","source":{"kind":"arxiv","id":"2201.05390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.05390","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"2201.05390v1","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.05390","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"BKFM5QO4CGFW","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"pith_short_16","alias_value":"BKFM5QO4CGFWCFK4","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"pith_short_8","alias_value":"BKFM5QO4","created_at":"2026-07-05T03:48:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BKFM5QO4CGFWCFK44VTVLBCJ7H","target":"record","payload":{"canonical_record":{"source":{"id":"2201.05390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-14T11:03:24Z","cross_cats_sorted":[],"title_canon_sha256":"271b7c9d4a6de60de290a68b712ea25a3158444adbb03d94578f3604af8a8ee1","abstract_canon_sha256":"1d9845f7e6abace4d67ee719320a7a6a1612006caf4aad50fc100928387d809b"},"schema_version":"1.0"},"canonical_sha256":"0a8acec1dc118b61155ce567558449f9e1c481c8fecf0a3af824ca8796e4846e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:31.987340Z","signature_b64":"qpJVumNrTPKk0rzL4eJnvCE+UaK3HKTjZk8vGq16IKa4zPMs0pDZx0bEuyRvuE12TRbQNQBfi+gpH3WBl7haDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a8acec1dc118b61155ce567558449f9e1c481c8fecf0a3af824ca8796e4846e","last_reissued_at":"2026-07-05T03:48:31.986925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:31.986925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.05390","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-05T03:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYPL7SjQ+pxPIjR+6/gsxkaaiNLJXpp9HAL9xiaNX82kCQ4Bq1gqSINzZ07sdYqp61RefrLko9ga2WiltwSpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:37:37.055703Z"},"content_sha256":"991c17d8c23e9e6b5ad1246c8c811a8ed27e3b6a540252d58be68c1a69197933","schema_version":"1.0","event_id":"sha256:991c17d8c23e9e6b5ad1246c8c811a8ed27e3b6a540252d58be68c1a69197933"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BKFM5QO4CGFWCFK44VTVLBCJ7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay-Robust Routes in Temporal Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eugen F\\\"uchsle, Hendrik Molter, Malte Renken, Rolf Niedermeier","submitted_at":"2022-01-14T11:03:24Z","abstract_excerpt":"Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodities, this fact must be considered for the the planning of itineraries. This has already led to several well-studied algorithmic problems on temporal graphs. The difficulty of the described task is increased by the fact that connections are often unreliable -- in particular, many modes of transportation suffer from occasional delays. If these delays cause subsequent connections to be missed, the consequences can be s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.05390","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/2201.05390/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-05T03:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7jXVNaqO15kYDk14jhr+zR1NrNrHqDQ8TjahYUSMDBp9L2mtcCmOgGU7wX07s3yE//4tl2ildvuYHRExjUABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:37:37.056074Z"},"content_sha256":"a2a787e9a1c030b18954895d16b2f3616ec8505789d2171fcae2f3af4b4237cf","schema_version":"1.0","event_id":"sha256:a2a787e9a1c030b18954895d16b2f3616ec8505789d2171fcae2f3af4b4237cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKFM5QO4CGFWCFK44VTVLBCJ7H/bundle.json","state_url":"https://pith.science/pith/BKFM5QO4CGFWCFK44VTVLBCJ7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKFM5QO4CGFWCFK44VTVLBCJ7H/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-07-07T11:37:37Z","links":{"resolver":"https://pith.science/pith/BKFM5QO4CGFWCFK44VTVLBCJ7H","bundle":"https://pith.science/pith/BKFM5QO4CGFWCFK44VTVLBCJ7H/bundle.json","state":"https://pith.science/pith/BKFM5QO4CGFWCFK44VTVLBCJ7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKFM5QO4CGFWCFK44VTVLBCJ7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BKFM5QO4CGFWCFK44VTVLBCJ7H","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":"1d9845f7e6abace4d67ee719320a7a6a1612006caf4aad50fc100928387d809b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-14T11:03:24Z","title_canon_sha256":"271b7c9d4a6de60de290a68b712ea25a3158444adbb03d94578f3604af8a8ee1"},"schema_version":"1.0","source":{"id":"2201.05390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.05390","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"2201.05390v1","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.05390","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"BKFM5QO4CGFW","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"pith_short_16","alias_value":"BKFM5QO4CGFWCFK4","created_at":"2026-07-05T03:48:31Z"},{"alias_kind":"pith_short_8","alias_value":"BKFM5QO4","created_at":"2026-07-05T03:48:31Z"}],"graph_snapshots":[{"event_id":"sha256:a2a787e9a1c030b18954895d16b2f3616ec8505789d2171fcae2f3af4b4237cf","target":"graph","created_at":"2026-07-05T03:48:31Z","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/2201.05390/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodities, this fact must be considered for the the planning of itineraries. This has already led to several well-studied algorithmic problems on temporal graphs. The difficulty of the described task is increased by the fact that connections are often unreliable -- in particular, many modes of transportation suffer from occasional delays. If these delays cause subsequent connections to be missed, the consequences can be s","authors_text":"Eugen F\\\"uchsle, Hendrik Molter, Malte Renken, Rolf Niedermeier","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-14T11:03:24Z","title":"Delay-Robust Routes in Temporal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.05390","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:991c17d8c23e9e6b5ad1246c8c811a8ed27e3b6a540252d58be68c1a69197933","target":"record","created_at":"2026-07-05T03:48:31Z","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":"1d9845f7e6abace4d67ee719320a7a6a1612006caf4aad50fc100928387d809b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-14T11:03:24Z","title_canon_sha256":"271b7c9d4a6de60de290a68b712ea25a3158444adbb03d94578f3604af8a8ee1"},"schema_version":"1.0","source":{"id":"2201.05390","kind":"arxiv","version":1}},"canonical_sha256":"0a8acec1dc118b61155ce567558449f9e1c481c8fecf0a3af824ca8796e4846e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a8acec1dc118b61155ce567558449f9e1c481c8fecf0a3af824ca8796e4846e","first_computed_at":"2026-07-05T03:48:31.986925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:31.986925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qpJVumNrTPKk0rzL4eJnvCE+UaK3HKTjZk8vGq16IKa4zPMs0pDZx0bEuyRvuE12TRbQNQBfi+gpH3WBl7haDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:31.987340Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.05390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:991c17d8c23e9e6b5ad1246c8c811a8ed27e3b6a540252d58be68c1a69197933","sha256:a2a787e9a1c030b18954895d16b2f3616ec8505789d2171fcae2f3af4b4237cf"],"state_sha256":"828e5822ff336922a12036c30e4eef545ef07afe0020439fb2c56b09f065cfc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+ABCZ/qVcp+eJDz0wMWtAMWRd5/i75s+1b4TSqLbiSDA+qrbgxObra1NlBl0Pd/MKmlh6zLWHK3VNzUpfP8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:37:37.058116Z","bundle_sha256":"d934baa587f88f3d815c20048417d32e25983806a7664f2f67b3c41886c1edc1"}}