{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NYEDX737SU3XKB45F4BVSIDQXY","short_pith_number":"pith:NYEDX737","schema_version":"1.0","canonical_sha256":"6e083bff7f953775079d2f03592070be366f8f68e3f6c85f78a94c0584b8934b","source":{"kind":"arxiv","id":"2504.14258","version":1},"attestation_state":"computed","paper":{"title":"Temporal Graph Realization With Bounded Stretch","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis","submitted_at":"2025-04-19T10:35:43Z","abstract_excerpt":"A periodic temporal graph, in its simplest form, is a graph in which every edge appears exactly once in the first $\\Delta$ time steps, and then it reappears recurrently every $\\Delta$ time steps, where $\\Delta$ is a given period length. This model offers a natural abstraction of transportation networks where each transportation link connects two destinations periodically. From a network design perspective, a crucial task is to assign the time-labels on the edges in a way that optimizes some criterion. In this paper we introduce a very natural optimality criterion that captures how the temporal"},"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":"2504.14258","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-19T10:35:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e23c0f850e1d751f653e8f494674f49a5cb9df30279930b322833707141ed10f","abstract_canon_sha256":"64a1766251faac2be18466c58072c4e99010594c6592b91653938f60ba469a4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:40.750240Z","signature_b64":"N3Z+xXBKrG0s2vhc6jwA9XRUPeNSR+aRkO/q6ibc0Hjel1VKe93++DcLiYZ5QmPe0KHabUwwbcr4yqpObJ4QAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e083bff7f953775079d2f03592070be366f8f68e3f6c85f78a94c0584b8934b","last_reissued_at":"2026-07-05T10:51:40.749752Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:40.749752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Graph Realization With Bounded Stretch","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis","submitted_at":"2025-04-19T10:35:43Z","abstract_excerpt":"A periodic temporal graph, in its simplest form, is a graph in which every edge appears exactly once in the first $\\Delta$ time steps, and then it reappears recurrently every $\\Delta$ time steps, where $\\Delta$ is a given period length. This model offers a natural abstraction of transportation networks where each transportation link connects two destinations periodically. From a network design perspective, a crucial task is to assign the time-labels on the edges in a way that optimizes some criterion. In this paper we introduce a very natural optimality criterion that captures how the temporal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.14258","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/2504.14258/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":"2504.14258","created_at":"2026-07-05T10:51:40.749810+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.14258v1","created_at":"2026-07-05T10:51:40.749810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.14258","created_at":"2026-07-05T10:51:40.749810+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYEDX737SU3X","created_at":"2026-07-05T10:51:40.749810+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYEDX737SU3XKB45","created_at":"2026-07-05T10:51:40.749810+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYEDX737","created_at":"2026-07-05T10:51:40.749810+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":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY","json":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY.json","graph_json":"https://pith.science/api/pith-number/NYEDX737SU3XKB45F4BVSIDQXY/graph.json","events_json":"https://pith.science/api/pith-number/NYEDX737SU3XKB45F4BVSIDQXY/events.json","paper":"https://pith.science/paper/NYEDX737"},"agent_actions":{"view_html":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY","download_json":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY.json","view_paper":"https://pith.science/paper/NYEDX737","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.14258&json=true","fetch_graph":"https://pith.science/api/pith-number/NYEDX737SU3XKB45F4BVSIDQXY/graph.json","fetch_events":"https://pith.science/api/pith-number/NYEDX737SU3XKB45F4BVSIDQXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY/action/storage_attestation","attest_author":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY/action/author_attestation","sign_citation":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY/action/citation_signature","submit_replication":"https://pith.science/pith/NYEDX737SU3XKB45F4BVSIDQXY/action/replication_record"}},"created_at":"2026-07-05T10:51:40.749810+00:00","updated_at":"2026-07-05T10:51:40.749810+00:00"}