{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G634POW47PZEOK63M2BGPYJN2Q","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":"6c7688fb922c890e740a42b5e873edbaf6d243bec4d8ff1c4383de0d0afc755a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-05-13T13:14:10Z","title_canon_sha256":"868a63ad156e82ae830183dd9b060f330076229d67d09759cc8de9bc1d642b1b"},"schema_version":"1.0","source":{"id":"2605.13488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13488","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13488v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13488","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"G634POW47PZE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"G634POW47PZEOK63","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"G634POW4","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4a49d982c3cf755119d20c16f150661bd10f5e503477068f519313e0f4452c09","target":"graph","created_at":"2026-05-18T02:44:41Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that the Gallai Vertex Problem is complete for the complexity class Θ₂^p = P^{NP[log n]}."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The polynomial-time reduction from a known Θ₂^p-complete problem to the Gallai vertex problem correctly preserves yes/no instances and runs in polynomial time."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The Gallai vertex problem is Θ₂^p-complete."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Deciding whether a graph has a vertex on all its longest paths is complete for the class Θ₂^p."}],"snapshot_sha256":"17f737627a34c8dd620236132fb204a2365fee14b24c61dcf33fa78f455c8b1c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"When a graph $G$ admits a vertex $v$ that is contained in all its longest paths, we call $v$ a Gallai vertex. These are named after Gallai, who in 1966 asked the question if it is true that every connected graph contains such a vertex. This was soon answered in the negative by Walther and Zamfirescu, who presented a graph in which every vertex is omitted by some longest path of the graph.\n  In spite of its long history, the Gallai Vertex Problem, i.e. determining whether a graph has a Gallai vertex, was until now neither known to be NP- nor co-NP-hard. In this work, we show something much stro","authors_text":"Amir Nikabadi, Eva Rotenberg, Lasse Wulf","cross_cats":[],"headline":"Deciding whether a graph has a vertex on all its longest paths is complete for the class Θ₂^p.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-05-13T13:14:10Z","title":"The Gallai Vertex Problem is $\\Theta_2^p$-Complete"},"references":{"count":55,"internal_anchors":0,"resolved_work":55,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Finding large","work_id":"ead5c1a9-e846-4f32-86f2-b75feb0237ca","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Finding large","work_id":"b880cb75-600f-4cb6-8ef1-13acef94c734","year":null},{"cited_arxiv_id":"","doi":"10.1016/j.dam.2019.03.022","is_internal_anchor":false,"ref_index":3,"title":"2020 , issn =","work_id":"9b41baca-1571-4e58-9b70-5ae8407b3a96","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"2020 , doi =","work_id":"2d34a4d4-90e9-4fae-8286-b03e092e76c7","year":2020},{"cited_arxiv_id":"","doi":"10.1016/j.disc.2022.112985","is_internal_anchor":false,"ref_index":5,"title":"2022 , issn =","work_id":"fca620cc-32c0-48a3-acb1-8e494fab7072","year":2022}],"snapshot_sha256":"98d27b2f4b602b0cf1b332fc433169561ac427c8fd4073351f83762152ed95a0"},"source":{"id":"2605.13488","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:21:15.868585Z","id":"d779d531-0376-48e6-8550-9b0a7bd04b87","model_set":{"reader":"grok-4.3"},"one_line_summary":"The Gallai vertex problem is Θ₂^p-complete.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Deciding whether a graph has a vertex on all its longest paths is complete for the class Θ₂^p.","strongest_claim":"We show that the Gallai Vertex Problem is complete for the complexity class Θ₂^p = P^{NP[log n]}.","weakest_assumption":"The polynomial-time reduction from a known Θ₂^p-complete problem to the Gallai vertex problem correctly preserves yes/no instances and runs in polynomial time."}},"verdict_id":"d779d531-0376-48e6-8550-9b0a7bd04b87"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f6d1f7a65e4d2ffd1e188c4eac64d195b40d71fd80bf00569964e3cd11d2b8e1","target":"record","created_at":"2026-05-18T02:44:41Z","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":"6c7688fb922c890e740a42b5e873edbaf6d243bec4d8ff1c4383de0d0afc755a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-05-13T13:14:10Z","title_canon_sha256":"868a63ad156e82ae830183dd9b060f330076229d67d09759cc8de9bc1d642b1b"},"schema_version":"1.0","source":{"id":"2605.13488","kind":"arxiv","version":1}},"canonical_sha256":"37b7c7badcfbf2472bdb668267e12dd43aff8edf668c08422b925836cf44aa27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37b7c7badcfbf2472bdb668267e12dd43aff8edf668c08422b925836cf44aa27","first_computed_at":"2026-05-18T02:44:41.216753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:41.216753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JZEFMotQUKndcGgU8Mp8pLk/F+G0nbbgJF2uSUVYedIYX2e3CuDJnIh52qHlobaO0ea4IfPt/cxk8fRNhVlpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:41.217218Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6d1f7a65e4d2ffd1e188c4eac64d195b40d71fd80bf00569964e3cd11d2b8e1","sha256:4a49d982c3cf755119d20c16f150661bd10f5e503477068f519313e0f4452c09"],"state_sha256":"dea92ab2bf6444ec0bbc4bdd087198da5dd39e1244424dfb143e9568be3749cd"}