{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YXUKED27TYQLHH632W4M4FPX7E","short_pith_number":"pith:YXUKED27","schema_version":"1.0","canonical_sha256":"c5e8a20f5f9e20b39fdbd5b8ce15f7f91fa5bfaa6298a68a8a7f91577c19662a","source":{"kind":"arxiv","id":"1807.11869","version":1},"attestation_state":"computed","paper":{"title":"On Exploring Temporal Graphs of Small Pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Hans L. Bodlaender, Tom C. van der Zanden","submitted_at":"2018-07-31T15:31:37Z","abstract_excerpt":"We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph has pathwidth 2 and at each time step, the current graph is connected."},"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":"1807.11869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-31T15:31:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"503f992345d084e59505b95ae81984fb948566e5b6a06c0963c570a150894a38","abstract_canon_sha256":"9a24a6942846a2de81ed7c34da2986c1a3603d742275453874fee00d4413b6f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:20.897891Z","signature_b64":"nFIJbeYpZieYH8keoBZLCHUb+tNP8mnm9+7O17uHqf+ABXG35/F2Is0DwWfw+T2QIZL0Lb5o059F0xFP5UelCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5e8a20f5f9e20b39fdbd5b8ce15f7f91fa5bfaa6298a68a8a7f91577c19662a","last_reissued_at":"2026-05-18T00:09:20.897389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:20.897389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Exploring Temporal Graphs of Small Pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Hans L. Bodlaender, Tom C. van der Zanden","submitted_at":"2018-07-31T15:31:37Z","abstract_excerpt":"We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph has pathwidth 2 and at each time step, the current graph is connected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11869","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":"1807.11869","created_at":"2026-05-18T00:09:20.897487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11869v1","created_at":"2026-05-18T00:09:20.897487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11869","created_at":"2026-05-18T00:09:20.897487+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXUKED27TYQL","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXUKED27TYQLHH63","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXUKED27","created_at":"2026-05-18T12:33:04.347982+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/YXUKED27TYQLHH632W4M4FPX7E","json":"https://pith.science/pith/YXUKED27TYQLHH632W4M4FPX7E.json","graph_json":"https://pith.science/api/pith-number/YXUKED27TYQLHH632W4M4FPX7E/graph.json","events_json":"https://pith.science/api/pith-number/YXUKED27TYQLHH632W4M4FPX7E/events.json","paper":"https://pith.science/paper/YXUKED27"},"agent_actions":{"view_html":"https://pith.science/pith/YXUKED27TYQLHH632W4M4FPX7E","download_json":"https://pith.science/pith/YXUKED27TYQLHH632W4M4FPX7E.json","view_paper":"https://pith.science/paper/YXUKED27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11869&json=true","fetch_graph":"https://pith.science/api/pith-number/YXUKED27TYQLHH632W4M4FPX7E/graph.json","fetch_events":"https://pith.science/api/pith-number/YXUKED27TYQLHH632W4M4FPX7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXUKED27TYQLHH632W4M4FPX7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXUKED27TYQLHH632W4M4FPX7E/action/storage_attestation","attest_author":"https://pith.science/pith/YXUKED27TYQLHH632W4M4FPX7E/action/author_attestation","sign_citation":"https://pith.science/pith/YXUKED27TYQLHH632W4M4FPX7E/action/citation_signature","submit_replication":"https://pith.science/pith/YXUKED27TYQLHH632W4M4FPX7E/action/replication_record"}},"created_at":"2026-05-18T00:09:20.897487+00:00","updated_at":"2026-05-18T00:09:20.897487+00:00"}