{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:V6P56R5L433NUFTVQ7OMPXFN67","short_pith_number":"pith:V6P56R5L","schema_version":"1.0","canonical_sha256":"af9fdf47abe6f6da167587dcc7dcadf7d6fc45dd6a4f31a4b37ad089aff39738","source":{"kind":"arxiv","id":"1805.04713","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.04713","created_at":"2026-05-18T00:16:04.731333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04713v1","created_at":"2026-05-18T00:16:04.731333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04713","created_at":"2026-05-18T00:16:04.731333+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6P56R5L433N","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6P56R5L433NUFTV","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6P56R5L","created_at":"2026-05-18T12:32:59.047623+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/V6P56R5L433NUFTVQ7OMPXFN67","json":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67.json","graph_json":"https://pith.science/api/pith-number/V6P56R5L433NUFTVQ7OMPXFN67/graph.json","events_json":"https://pith.science/api/pith-number/V6P56R5L433NUFTVQ7OMPXFN67/events.json","paper":"https://pith.science/paper/V6P56R5L"},"agent_actions":{"view_html":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67","download_json":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67.json","view_paper":"https://pith.science/paper/V6P56R5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04713&json=true","fetch_graph":"https://pith.science/api/pith-number/V6P56R5L433NUFTVQ7OMPXFN67/graph.json","fetch_events":"https://pith.science/api/pith-number/V6P56R5L433NUFTVQ7OMPXFN67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/action/storage_attestation","attest_author":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/action/author_attestation","sign_citation":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/action/citation_signature","submit_replication":"https://pith.science/pith/V6P56R5L433NUFTVQ7OMPXFN67/action/replication_record"}},"created_at":"2026-05-18T00:16:04.731333+00:00","updated_at":"2026-05-18T00:16:04.731333+00:00"}