{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:42SL2PZSELZOWOBEEWAVCYEONY","short_pith_number":"pith:42SL2PZS","schema_version":"1.0","canonical_sha256":"e6a4bd3f3222f2eb3824258151608e6e3646a98ca41ccc512df1f55646c06570","source":{"kind":"arxiv","id":"2501.18987","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.18987","created_at":"2026-07-05T10:47:00.128630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18987v2","created_at":"2026-07-05T10:47:00.128630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18987","created_at":"2026-07-05T10:47:00.128630+00:00"},{"alias_kind":"pith_short_12","alias_value":"42SL2PZSELZO","created_at":"2026-07-05T10:47:00.128630+00:00"},{"alias_kind":"pith_short_16","alias_value":"42SL2PZSELZOWOBE","created_at":"2026-07-05T10:47:00.128630+00:00"},{"alias_kind":"pith_short_8","alias_value":"42SL2PZS","created_at":"2026-07-05T10:47:00.128630+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14046","citing_title":"Exploring Temporal Graphs with Frequent and Regular Edges","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY","json":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY.json","graph_json":"https://pith.science/api/pith-number/42SL2PZSELZOWOBEEWAVCYEONY/graph.json","events_json":"https://pith.science/api/pith-number/42SL2PZSELZOWOBEEWAVCYEONY/events.json","paper":"https://pith.science/paper/42SL2PZS"},"agent_actions":{"view_html":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY","download_json":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY.json","view_paper":"https://pith.science/paper/42SL2PZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18987&json=true","fetch_graph":"https://pith.science/api/pith-number/42SL2PZSELZOWOBEEWAVCYEONY/graph.json","fetch_events":"https://pith.science/api/pith-number/42SL2PZSELZOWOBEEWAVCYEONY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/action/storage_attestation","attest_author":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/action/author_attestation","sign_citation":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/action/citation_signature","submit_replication":"https://pith.science/pith/42SL2PZSELZOWOBEEWAVCYEONY/action/replication_record"}},"created_at":"2026-07-05T10:47:00.128630+00:00","updated_at":"2026-07-05T10:47:00.128630+00:00"}