{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K7GK7NYKQJ5GA45OTS7MNEVJX3","short_pith_number":"pith:K7GK7NYK","schema_version":"1.0","canonical_sha256":"57ccafb70a827a6073ae9cbec692a9bec51392576697b984bad7248fd3b2ed32","source":{"kind":"arxiv","id":"1502.04382","version":2},"attestation_state":"computed","paper":{"title":"Temporal Network Optimization Subject to Connectivity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"George B. Mertzios, Othon Michail, Paul G. Spirakis","submitted_at":"2015-02-15T23:23:27Z","abstract_excerpt":"In this work we consider \\emph{temporal networks}, i.e. networks defined by a \\emph{labeling} $\\lambda$ assigning to each edge of an \\emph{underlying graph} $G$ a set of \\emph{discrete} time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at which the edge is available. We focus on \\emph{path problems} of temporal networks. In particular, we consider \\emph{time-respecting} paths, i.e. paths whose edges are assigned by $\\lambda$ a strictly increasing sequence of labels. We begin by giving two efficient algorithms for computing shortest time-respectin"},"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":"1502.04382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-15T23:23:27Z","cross_cats_sorted":[],"title_canon_sha256":"ae3bf8f7bafa2098c379ea5a292052bfd2d1a4c15bf96b806f8d779697dc1a54","abstract_canon_sha256":"5f3b001e399d1f0700e6fbaf9dae0e52aea817fef66f4e9613a4724abce9a112"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:06.659260Z","signature_b64":"Z5sxrJFgFKratke1OeprW7xkMp8OAjgtKe9HECUuBmU5ED56HvaCg7NiwB4iut+7kizbnkiDZnLgoeVHSAACBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57ccafb70a827a6073ae9cbec692a9bec51392576697b984bad7248fd3b2ed32","last_reissued_at":"2026-05-18T00:12:06.658614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:06.658614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Network Optimization Subject to Connectivity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"George B. Mertzios, Othon Michail, Paul G. Spirakis","submitted_at":"2015-02-15T23:23:27Z","abstract_excerpt":"In this work we consider \\emph{temporal networks}, i.e. networks defined by a \\emph{labeling} $\\lambda$ assigning to each edge of an \\emph{underlying graph} $G$ a set of \\emph{discrete} time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at which the edge is available. We focus on \\emph{path problems} of temporal networks. In particular, we consider \\emph{time-respecting} paths, i.e. paths whose edges are assigned by $\\lambda$ a strictly increasing sequence of labels. We begin by giving two efficient algorithms for computing shortest time-respectin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04382","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":""},"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":"1502.04382","created_at":"2026-05-18T00:12:06.658715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04382v2","created_at":"2026-05-18T00:12:06.658715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04382","created_at":"2026-05-18T00:12:06.658715+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7GK7NYKQJ5G","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7GK7NYKQJ5GA45O","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7GK7NYK","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3","json":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3.json","graph_json":"https://pith.science/api/pith-number/K7GK7NYKQJ5GA45OTS7MNEVJX3/graph.json","events_json":"https://pith.science/api/pith-number/K7GK7NYKQJ5GA45OTS7MNEVJX3/events.json","paper":"https://pith.science/paper/K7GK7NYK"},"agent_actions":{"view_html":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3","download_json":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3.json","view_paper":"https://pith.science/paper/K7GK7NYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04382&json=true","fetch_graph":"https://pith.science/api/pith-number/K7GK7NYKQJ5GA45OTS7MNEVJX3/graph.json","fetch_events":"https://pith.science/api/pith-number/K7GK7NYKQJ5GA45OTS7MNEVJX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/action/storage_attestation","attest_author":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/action/author_attestation","sign_citation":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/action/citation_signature","submit_replication":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/action/replication_record"}},"created_at":"2026-05-18T00:12:06.658715+00:00","updated_at":"2026-05-18T00:12:06.658715+00:00"}