{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EMX5AEWZTOFXAZ76Z5O57LUXOC","short_pith_number":"pith:EMX5AEWZ","schema_version":"1.0","canonical_sha256":"232fd012d99b8b7067fecf5ddfae9770aa290402e50f91a8864d5bd43f8c5a2c","source":{"kind":"arxiv","id":"1806.06713","version":1},"attestation_state":"computed","paper":{"title":"On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behrooz Bagheri Gh., Carlos Subi, Herbert Fleischner, Tomas Feder","submitted_at":"2018-06-15T11:17:50Z","abstract_excerpt":"It is a well-known fact that hamiltonicity in planar cubic graphs is an NP-complete problem. This implies that the existence of an A-trail in plane eulerian graphs is also an NP-complete problem even if restricted to planar 3-connected eulerian graphs. In this paper we deal with hamiltonicity in planar cubic graphs G having a facial 2-factor Q via (quasi) spanning trees of faces in G/Q and study the algorithmic complexity of finding such (quasi) spanning trees of faces. We show, in particular, that if Barnette's Conjecture is false, then hamiltonicity in 3-connected planar cubic bipartite grap"},"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":"1806.06713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-15T11:17:50Z","cross_cats_sorted":[],"title_canon_sha256":"c0e120cc03b45fa88fbc64cee7978988de96f18ccaf5a1ecd2890e0258eb4d77","abstract_canon_sha256":"6975e0894688d6378c8b0e8ce4411cac99005653f4be871a9734e5aef08b57ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:59.360363Z","signature_b64":"72GtKyuVxNlWIwxV/v8kV0blhgoovmXoHnJ5Sxos2AIpYK0C+kQktzfIk3nLtesIa2up1zvqE5Yjh83o3GBJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"232fd012d99b8b7067fecf5ddfae9770aa290402e50f91a8864d5bd43f8c5a2c","last_reissued_at":"2026-05-18T00:12:59.359836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:59.359836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behrooz Bagheri Gh., Carlos Subi, Herbert Fleischner, Tomas Feder","submitted_at":"2018-06-15T11:17:50Z","abstract_excerpt":"It is a well-known fact that hamiltonicity in planar cubic graphs is an NP-complete problem. This implies that the existence of an A-trail in plane eulerian graphs is also an NP-complete problem even if restricted to planar 3-connected eulerian graphs. In this paper we deal with hamiltonicity in planar cubic graphs G having a facial 2-factor Q via (quasi) spanning trees of faces in G/Q and study the algorithmic complexity of finding such (quasi) spanning trees of faces. We show, in particular, that if Barnette's Conjecture is false, then hamiltonicity in 3-connected planar cubic bipartite grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06713","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":"1806.06713","created_at":"2026-05-18T00:12:59.359917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06713v1","created_at":"2026-05-18T00:12:59.359917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06713","created_at":"2026-05-18T00:12:59.359917+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMX5AEWZTOFX","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMX5AEWZTOFXAZ76","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMX5AEWZ","created_at":"2026-05-18T12:32:22.470017+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/EMX5AEWZTOFXAZ76Z5O57LUXOC","json":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC.json","graph_json":"https://pith.science/api/pith-number/EMX5AEWZTOFXAZ76Z5O57LUXOC/graph.json","events_json":"https://pith.science/api/pith-number/EMX5AEWZTOFXAZ76Z5O57LUXOC/events.json","paper":"https://pith.science/paper/EMX5AEWZ"},"agent_actions":{"view_html":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC","download_json":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC.json","view_paper":"https://pith.science/paper/EMX5AEWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06713&json=true","fetch_graph":"https://pith.science/api/pith-number/EMX5AEWZTOFXAZ76Z5O57LUXOC/graph.json","fetch_events":"https://pith.science/api/pith-number/EMX5AEWZTOFXAZ76Z5O57LUXOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/action/storage_attestation","attest_author":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/action/author_attestation","sign_citation":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/action/citation_signature","submit_replication":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/action/replication_record"}},"created_at":"2026-05-18T00:12:59.359917+00:00","updated_at":"2026-05-18T00:12:59.359917+00:00"}