{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CGLKC4PNH2NYIHDXHIDDMV272H","short_pith_number":"pith:CGLKC4PN","schema_version":"1.0","canonical_sha256":"1196a171ed3e9b841c773a0636575fd1cafc4d8ca50138d1f35cb51183f7fa5c","source":{"kind":"arxiv","id":"2403.18513","version":3},"attestation_state":"computed","paper":{"title":"Realizing temporal transportation trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis","submitted_at":"2024-03-27T12:44:27Z","abstract_excerpt":"In this paper, we study the complexity of the periodic temporal graph realization problem with respect to upper bounds on the fastest path durations among its vertices. This constraint with respect to upper bounds appears naturally in transportation network design applications where, for example, a road network is given, and the goal is to appropriately schedule periodic travel routes, while not exceeding some desired upper bounds on the travel times. In our work, we focus only on underlying tree topologies, which are fundamental in many transportation network applications.\n  As it turns out, "},"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":"2403.18513","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-27T12:44:27Z","cross_cats_sorted":[],"title_canon_sha256":"0ef70bef7d20b3e904ecd8a5e5d0681582a811da5c7953b29cadf38a916aadc4","abstract_canon_sha256":"b70242c12ae6b87d6bb8816397aa555a309fdc6b1cc5132bf22268217f2f4aa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:21.046114Z","signature_b64":"b/6YVnvfw81YvzwcF4H4GBOmdP2aS7LPNzyyPK4xeGpKfgskkdTGlKZLO1DosTZy1RkkQuGcHkIdMJgG05ZFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1196a171ed3e9b841c773a0636575fd1cafc4d8ca50138d1f35cb51183f7fa5c","last_reissued_at":"2026-07-05T10:51:21.045605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:21.045605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Realizing temporal transportation trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis","submitted_at":"2024-03-27T12:44:27Z","abstract_excerpt":"In this paper, we study the complexity of the periodic temporal graph realization problem with respect to upper bounds on the fastest path durations among its vertices. This constraint with respect to upper bounds appears naturally in transportation network design applications where, for example, a road network is given, and the goal is to appropriately schedule periodic travel routes, while not exceeding some desired upper bounds on the travel times. In our work, we focus only on underlying tree topologies, which are fundamental in many transportation network applications.\n  As it turns out, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18513","kind":"arxiv","version":3},"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/2403.18513/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":"2403.18513","created_at":"2026-07-05T10:51:21.045663+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.18513v3","created_at":"2026-07-05T10:51:21.045663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18513","created_at":"2026-07-05T10:51:21.045663+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGLKC4PNH2NY","created_at":"2026-07-05T10:51:21.045663+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGLKC4PNH2NYIHDX","created_at":"2026-07-05T10:51:21.045663+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGLKC4PN","created_at":"2026-07-05T10:51:21.045663+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":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H","json":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H.json","graph_json":"https://pith.science/api/pith-number/CGLKC4PNH2NYIHDXHIDDMV272H/graph.json","events_json":"https://pith.science/api/pith-number/CGLKC4PNH2NYIHDXHIDDMV272H/events.json","paper":"https://pith.science/paper/CGLKC4PN"},"agent_actions":{"view_html":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H","download_json":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H.json","view_paper":"https://pith.science/paper/CGLKC4PN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.18513&json=true","fetch_graph":"https://pith.science/api/pith-number/CGLKC4PNH2NYIHDXHIDDMV272H/graph.json","fetch_events":"https://pith.science/api/pith-number/CGLKC4PNH2NYIHDXHIDDMV272H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H/action/storage_attestation","attest_author":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H/action/author_attestation","sign_citation":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H/action/citation_signature","submit_replication":"https://pith.science/pith/CGLKC4PNH2NYIHDXHIDDMV272H/action/replication_record"}},"created_at":"2026-07-05T10:51:21.045663+00:00","updated_at":"2026-07-05T10:51:21.045663+00:00"}