{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:42SL2PZSELZOWOBEEWAVCYEONY","short_pith_number":"pith:42SL2PZS","canonical_record":{"source":{"id":"2501.18987","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-31T09:34:44Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"ee5d53f46b0f7ecc335cf66a70105461a7b8e5633506d87eb2342afc972493dc","abstract_canon_sha256":"f21abe514770212ad673482451cbe75551a537ca4b374291840ea69af16c1d8e"},"schema_version":"1.0"},"canonical_sha256":"e6a4bd3f3222f2eb3824258151608e6e3646a98ca41ccc512df1f55646c06570","source":{"kind":"arxiv","id":"2501.18987","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18987","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18987v2","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18987","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"pith_short_12","alias_value":"42SL2PZSELZO","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"pith_short_16","alias_value":"42SL2PZSELZOWOBE","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"pith_short_8","alias_value":"42SL2PZS","created_at":"2026-07-05T10:47:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:42SL2PZSELZOWOBEEWAVCYEONY","target":"record","payload":{"canonical_record":{"source":{"id":"2501.18987","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-31T09:34:44Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"ee5d53f46b0f7ecc335cf66a70105461a7b8e5633506d87eb2342afc972493dc","abstract_canon_sha256":"f21abe514770212ad673482451cbe75551a537ca4b374291840ea69af16c1d8e"},"schema_version":"1.0"},"canonical_sha256":"e6a4bd3f3222f2eb3824258151608e6e3646a98ca41ccc512df1f55646c06570","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:00.129046Z","signature_b64":"TT/vaLAbF5Lx76viuswYN0iXyFUV3JQPPC6RVx7TmDWL4/TiL6AgrK8i27NNLTX/bepNJjS+p9oyw+THSo15DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6a4bd3f3222f2eb3824258151608e6e3646a98ca41ccc512df1f55646c06570","last_reissued_at":"2026-07-05T10:47:00.128576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:00.128576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.18987","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-05T10:47:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FM97DEfPlz63SQShR/fBzsU/5VLdWBiMSPuRNzdKkhcM6cSPIYZHxfG3a6sxfC7ZVhFHOJEMOrwPEokhDZ0TDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:20:45.513465Z"},"content_sha256":"e7f22ce2c582171d7a026bc89a35952608764fd51ee779915c24c4b3334b915f","schema_version":"1.0","event_id":"sha256:e7f22ce2c582171d7a026bc89a35952608764fd51ee779915c24c4b3334b915f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:42SL2PZSELZOWOBEEWAVCYEONY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Anouk Sommer, David C. Kutner","submitted_at":"2025-01-31T09:34:44Z","abstract_excerpt":"In train networks, carefully-chosen delays may be beneficial for certain passengers, who would otherwise miss some connection. Given a simple (directed or undirected) temporal graph and a set of passengers (each specifying a starting vertex, an ending vertex, and a desired arrival time), we ask whether it is possible to delay some of the edges of the temporal graph to realize all the passengers' demands. We call this problem DelayBetter (DB), and study it along with two variants: in $\\delta$-DelayBetter, each delay must be of at most $\\delta$; in ($\\delta$-)Path DB, passengers also fully speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18987","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/2501.18987/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-05T10:47:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xrYcpc42ZGAWCpsIeuZ8GVTjX9bb0c5VaEELvrj7vkkSMmbShd0pBgoMdwyVtDZrxTIWbGmBWYY2hD2FQ8zaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:20:45.514097Z"},"content_sha256":"724cbb65cc8687cd93cb70d1ee136f96af2e22a867503f39dff1b93251bb4daf","schema_version":"1.0","event_id":"sha256:724cbb65cc8687cd93cb70d1ee136f96af2e22a867503f39dff1b93251bb4daf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/bundle.json","state_url":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42SL2PZSELZOWOBEEWAVCYEONY/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-20T10:20:45Z","links":{"resolver":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY","bundle":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/bundle.json","state":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42SL2PZSELZOWOBEEWAVCYEONY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:42SL2PZSELZOWOBEEWAVCYEONY","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":"f21abe514770212ad673482451cbe75551a537ca4b374291840ea69af16c1d8e","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-31T09:34:44Z","title_canon_sha256":"ee5d53f46b0f7ecc335cf66a70105461a7b8e5633506d87eb2342afc972493dc"},"schema_version":"1.0","source":{"id":"2501.18987","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18987","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18987v2","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18987","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"pith_short_12","alias_value":"42SL2PZSELZO","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"pith_short_16","alias_value":"42SL2PZSELZOWOBE","created_at":"2026-07-05T10:47:00Z"},{"alias_kind":"pith_short_8","alias_value":"42SL2PZS","created_at":"2026-07-05T10:47:00Z"}],"graph_snapshots":[{"event_id":"sha256:724cbb65cc8687cd93cb70d1ee136f96af2e22a867503f39dff1b93251bb4daf","target":"graph","created_at":"2026-07-05T10:47:00Z","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/2501.18987/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In train networks, carefully-chosen delays may be beneficial for certain passengers, who would otherwise miss some connection. Given a simple (directed or undirected) temporal graph and a set of passengers (each specifying a starting vertex, an ending vertex, and a desired arrival time), we ask whether it is possible to delay some of the edges of the temporal graph to realize all the passengers' demands. We call this problem DelayBetter (DB), and study it along with two variants: in $\\delta$-DelayBetter, each delay must be of at most $\\delta$; in ($\\delta$-)Path DB, passengers also fully speci","authors_text":"Anouk Sommer, David C. Kutner","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18987","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:e7f22ce2c582171d7a026bc89a35952608764fd51ee779915c24c4b3334b915f","target":"record","created_at":"2026-07-05T10:47:00Z","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":"f21abe514770212ad673482451cbe75551a537ca4b374291840ea69af16c1d8e","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-31T09:34:44Z","title_canon_sha256":"ee5d53f46b0f7ecc335cf66a70105461a7b8e5633506d87eb2342afc972493dc"},"schema_version":"1.0","source":{"id":"2501.18987","kind":"arxiv","version":2}},"canonical_sha256":"e6a4bd3f3222f2eb3824258151608e6e3646a98ca41ccc512df1f55646c06570","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6a4bd3f3222f2eb3824258151608e6e3646a98ca41ccc512df1f55646c06570","first_computed_at":"2026-07-05T10:47:00.128576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:47:00.128576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TT/vaLAbF5Lx76viuswYN0iXyFUV3JQPPC6RVx7TmDWL4/TiL6AgrK8i27NNLTX/bepNJjS+p9oyw+THSo15DA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:47:00.129046Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.18987","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7f22ce2c582171d7a026bc89a35952608764fd51ee779915c24c4b3334b915f","sha256:724cbb65cc8687cd93cb70d1ee136f96af2e22a867503f39dff1b93251bb4daf"],"state_sha256":"4fa1d1c11d60a6e5e75ff92dd512a953f5d28dac94b3097414743a901a5f67c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"atirImq2hF3iCYlYPhhaw1KJHEqySKDV0FSW3ULTnAkfy1apbMZspm47OQckd2ecbqWsuyLXgkA3z/6o8WtWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T10:20:45.519606Z","bundle_sha256":"bb0c7d0d4447e98287a0e4465fffbb10c186b1b4b49675d7489b75c4ced486d7"}}