{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:K7GK7NYKQJ5GA45OTS7MNEVJX3","short_pith_number":"pith:K7GK7NYK","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"},"canonical_sha256":"57ccafb70a827a6073ae9cbec692a9bec51392576697b984bad7248fd3b2ed32","source":{"kind":"arxiv","id":"1502.04382","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04382","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04382v2","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04382","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"pith_short_12","alias_value":"K7GK7NYKQJ5G","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K7GK7NYKQJ5GA45O","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K7GK7NYK","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:K7GK7NYKQJ5GA45OTS7MNEVJX3","target":"record","payload":{"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"},"canonical_sha256":"57ccafb70a827a6073ae9cbec692a9bec51392576697b984bad7248fd3b2ed32","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"},"source_kind":"arxiv","source_id":"1502.04382","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-05-18T00:12:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kEQVzGILGi6krC2rBLL8VnQLg+qyVqVUOhs4tn5aPW2N4kPtJNmGjkvgA3cJl4IHn7ClONX7a+9cclGNW1e2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:55:37.900172Z"},"content_sha256":"05ac88a0ad21e9ba5fbf3fee1a92ccf0db8093019db74363340b29d415b8d362","schema_version":"1.0","event_id":"sha256:05ac88a0ad21e9ba5fbf3fee1a92ccf0db8093019db74363340b29d415b8d362"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:K7GK7NYKQJ5GA45OTS7MNEVJX3","target":"graph","payload":{"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"},"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-05-18T00:12:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+5muVsI0b9BRLY8UNlFLcky1QVZXscSbdmJABSdd7wWnzH14i7TMC68TdwmOCNy81kn3Z7BJTiAXjIcfA1lAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:55:37.900744Z"},"content_sha256":"a231c96995e98698d91fb7a3c59445b0fd43920972c315caae7d272864b30523","schema_version":"1.0","event_id":"sha256:a231c96995e98698d91fb7a3c59445b0fd43920972c315caae7d272864b30523"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/bundle.json","state_url":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/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-06-04T02:55:37Z","links":{"resolver":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3","bundle":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/bundle.json","state":"https://pith.science/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7GK7NYKQJ5GA45OTS7MNEVJX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:K7GK7NYKQJ5GA45OTS7MNEVJX3","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":"5f3b001e399d1f0700e6fbaf9dae0e52aea817fef66f4e9613a4724abce9a112","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-15T23:23:27Z","title_canon_sha256":"ae3bf8f7bafa2098c379ea5a292052bfd2d1a4c15bf96b806f8d779697dc1a54"},"schema_version":"1.0","source":{"id":"1502.04382","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04382","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04382v2","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04382","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"pith_short_12","alias_value":"K7GK7NYKQJ5G","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K7GK7NYKQJ5GA45O","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K7GK7NYK","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:a231c96995e98698d91fb7a3c59445b0fd43920972c315caae7d272864b30523","target":"graph","created_at":"2026-05-18T00:12:06Z","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"},"paper":{"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","authors_text":"George B. Mertzios, Othon Michail, Paul G. Spirakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-15T23:23:27Z","title":"Temporal Network Optimization Subject to Connectivity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04382","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:05ac88a0ad21e9ba5fbf3fee1a92ccf0db8093019db74363340b29d415b8d362","target":"record","created_at":"2026-05-18T00:12:06Z","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":"5f3b001e399d1f0700e6fbaf9dae0e52aea817fef66f4e9613a4724abce9a112","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-15T23:23:27Z","title_canon_sha256":"ae3bf8f7bafa2098c379ea5a292052bfd2d1a4c15bf96b806f8d779697dc1a54"},"schema_version":"1.0","source":{"id":"1502.04382","kind":"arxiv","version":2}},"canonical_sha256":"57ccafb70a827a6073ae9cbec692a9bec51392576697b984bad7248fd3b2ed32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57ccafb70a827a6073ae9cbec692a9bec51392576697b984bad7248fd3b2ed32","first_computed_at":"2026-05-18T00:12:06.658614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:06.658614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z5sxrJFgFKratke1OeprW7xkMp8OAjgtKe9HECUuBmU5ED56HvaCg7NiwB4iut+7kizbnkiDZnLgoeVHSAACBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:06.659260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04382","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05ac88a0ad21e9ba5fbf3fee1a92ccf0db8093019db74363340b29d415b8d362","sha256:a231c96995e98698d91fb7a3c59445b0fd43920972c315caae7d272864b30523"],"state_sha256":"885979b7fd16936811f269a9716631eaf22386e796f601d661f13d54ab5f931d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYu9CBMes+xcDxGha6gkOaB4MN7zCYKoYk1bPvyUVc2e1iNgxfmBOpZSqvMFpvMlvTBu+4xtRIGU1ONGsKsVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:55:37.903009Z","bundle_sha256":"da86b99499b8b37dd4b91c0425eab6b7d9ad699135ccbf1a231f2ff08fcd74d8"}}