{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:V6P56R5L433NUFTVQ7OMPXFN67","short_pith_number":"pith:V6P56R5L","canonical_record":{"source":{"id":"1805.04713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T12:48:05Z","cross_cats_sorted":[],"title_canon_sha256":"ee1183a526c3baae7ee1a70fbf40a4c8caf273206bc81384f86d4bfd6c022d20","abstract_canon_sha256":"0d10ea79f1ac818dd4c05836a3883d260a1cf7bd0c0ab06744af9d86a4e5b257"},"schema_version":"1.0"},"canonical_sha256":"af9fdf47abe6f6da167587dcc7dcadf7d6fc45dd6a4f31a4b37ad089aff39738","source":{"kind":"arxiv","id":"1805.04713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04713","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04713v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04713","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"V6P56R5L433N","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"V6P56R5L433NUFTV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"V6P56R5L","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:V6P56R5L433NUFTVQ7OMPXFN67","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T12:48:05Z","cross_cats_sorted":[],"title_canon_sha256":"ee1183a526c3baae7ee1a70fbf40a4c8caf273206bc81384f86d4bfd6c022d20","abstract_canon_sha256":"0d10ea79f1ac818dd4c05836a3883d260a1cf7bd0c0ab06744af9d86a4e5b257"},"schema_version":"1.0"},"canonical_sha256":"af9fdf47abe6f6da167587dcc7dcadf7d6fc45dd6a4f31a4b37ad089aff39738","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.731689Z","signature_b64":"jFWbM3zuNZeAMbz3SX4hhV5HXhT3juRPHQpW/vT+8Kv3CYlFOp6XW+rY9yrafViD6tyn07ktD4kbflSffBF5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af9fdf47abe6f6da167587dcc7dcadf7d6fc45dd6a4f31a4b37ad089aff39738","last_reissued_at":"2026-05-18T00:16:04.731254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.731254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04713","source_version":1,"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:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yR8PRmY2PO0LNAVuSVtQ07lSKj8TofHgkrMDV29A6oRWJ0ko0o8MtHseprnu67RdEPtcf0Q+uQ9NOCg4j05KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:28:27.216677Z"},"content_sha256":"91fdbd17280b5e20ac3c77cca89fd4b634780371da9192296fb72bb3da574347","schema_version":"1.0","event_id":"sha256:91fdbd17280b5e20ac3c77cca89fd4b634780371da9192296fb72bb3da574347"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:V6P56R5L433NUFTVQ7OMPXFN67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The temporal explorer who returns to the base","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis","submitted_at":"2018-05-12T12:48:05Z","abstract_excerpt":"In this paper we study the problem of exploring a temporal graph (i.e. a graph that changes over time), in the fundamental case where the underlying static graph is a star. The aim of the exploration problem in a temporal star is to find a temporal walk which starts at the center of the star, visits all leafs, and eventually returns back to the center. We initiate a systematic study of the computational complexity of this problem, depending on the number k of time-labels that every edge is allowed to have; that is, on the number k of time points where every edge can be present in the graph. To"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04713","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":""},"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:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BM7D5Oed1YIF99fImzab6QH72bi5x4zuBzvxMERDeYju9tn2OWdnXpxSFeXOWsInp3Qp0mYK4Z8CXt1Hn9psCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:28:27.217219Z"},"content_sha256":"2e16bac7e79a24653b1eb789d35c2dec8609c1b15a863a1afebff1d0b61e738c","schema_version":"1.0","event_id":"sha256:2e16bac7e79a24653b1eb789d35c2dec8609c1b15a863a1afebff1d0b61e738c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/bundle.json","state_url":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6P56R5L433NUFTVQ7OMPXFN67/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-05-31T12:28:27Z","links":{"resolver":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67","bundle":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/bundle.json","state":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6P56R5L433NUFTVQ7OMPXFN67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:V6P56R5L433NUFTVQ7OMPXFN67","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":"0d10ea79f1ac818dd4c05836a3883d260a1cf7bd0c0ab06744af9d86a4e5b257","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T12:48:05Z","title_canon_sha256":"ee1183a526c3baae7ee1a70fbf40a4c8caf273206bc81384f86d4bfd6c022d20"},"schema_version":"1.0","source":{"id":"1805.04713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04713","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04713v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04713","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"V6P56R5L433N","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"V6P56R5L433NUFTV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"V6P56R5L","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:2e16bac7e79a24653b1eb789d35c2dec8609c1b15a863a1afebff1d0b61e738c","target":"graph","created_at":"2026-05-18T00:16:04Z","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 paper we study the problem of exploring a temporal graph (i.e. a graph that changes over time), in the fundamental case where the underlying static graph is a star. The aim of the exploration problem in a temporal star is to find a temporal walk which starts at the center of the star, visits all leafs, and eventually returns back to the center. We initiate a systematic study of the computational complexity of this problem, depending on the number k of time-labels that every edge is allowed to have; that is, on the number k of time points where every edge can be present in the graph. To","authors_text":"Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T12:48:05Z","title":"The temporal explorer who returns to the base"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04713","kind":"arxiv","version":1},"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:91fdbd17280b5e20ac3c77cca89fd4b634780371da9192296fb72bb3da574347","target":"record","created_at":"2026-05-18T00:16:04Z","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":"0d10ea79f1ac818dd4c05836a3883d260a1cf7bd0c0ab06744af9d86a4e5b257","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T12:48:05Z","title_canon_sha256":"ee1183a526c3baae7ee1a70fbf40a4c8caf273206bc81384f86d4bfd6c022d20"},"schema_version":"1.0","source":{"id":"1805.04713","kind":"arxiv","version":1}},"canonical_sha256":"af9fdf47abe6f6da167587dcc7dcadf7d6fc45dd6a4f31a4b37ad089aff39738","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af9fdf47abe6f6da167587dcc7dcadf7d6fc45dd6a4f31a4b37ad089aff39738","first_computed_at":"2026-05-18T00:16:04.731254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:04.731254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jFWbM3zuNZeAMbz3SX4hhV5HXhT3juRPHQpW/vT+8Kv3CYlFOp6XW+rY9yrafViD6tyn07ktD4kbflSffBF5Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:04.731689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91fdbd17280b5e20ac3c77cca89fd4b634780371da9192296fb72bb3da574347","sha256:2e16bac7e79a24653b1eb789d35c2dec8609c1b15a863a1afebff1d0b61e738c"],"state_sha256":"6d99efa274bfe6b60a79ae736440cbcab18aae56a2dc3e399aa37f207833ae88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdeVPWySvh55YkPzEfEU8DUuXROnQJnkTJidvpniCdmgssmieDBJ7GCtZD3PVfxfRrFyJdvRqmxOxygOx2MnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:28:27.220711Z","bundle_sha256":"9dd3e16431c573847d7a98cf993e05ada9f278fb57f920e9c09a5a58195cd3b8"}}