{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EMX5AEWZTOFXAZ76Z5O57LUXOC","short_pith_number":"pith:EMX5AEWZ","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"},"canonical_sha256":"232fd012d99b8b7067fecf5ddfae9770aa290402e50f91a8864d5bd43f8c5a2c","source":{"kind":"arxiv","id":"1806.06713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06713","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06713v1","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06713","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"EMX5AEWZTOFX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EMX5AEWZTOFXAZ76","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EMX5AEWZ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EMX5AEWZTOFXAZ76Z5O57LUXOC","target":"record","payload":{"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"},"canonical_sha256":"232fd012d99b8b7067fecf5ddfae9770aa290402e50f91a8864d5bd43f8c5a2c","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"},"source_kind":"arxiv","source_id":"1806.06713","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:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRV+dG8qIRfcadt0HZlMbM0U0MZwfRZfEGLWWxGUDlLyB9R1lWuM7coObInGT9s/5o8tMv3I3KkeeZIfAeK4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:57:02.418204Z"},"content_sha256":"7731558e726930cef285fc1a10e6976b6d1424299fa655eddb288c922921c2b5","schema_version":"1.0","event_id":"sha256:7731558e726930cef285fc1a10e6976b6d1424299fa655eddb288c922921c2b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EMX5AEWZTOFXAZ76Z5O57LUXOC","target":"graph","payload":{"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"},"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:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0b6G7Z32xHnYRUSxviOTreJbamkeD3RXFN8tH7kW0XYTjIKqmUhBs5WEX6Q7BoiPIO9lYAMrGjy4bbOwJxjXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:57:02.418713Z"},"content_sha256":"6891e6a2b3e689fb176b4c6ff3d226392c3c6dac4a96e8641a88844c209e8659","schema_version":"1.0","event_id":"sha256:6891e6a2b3e689fb176b4c6ff3d226392c3c6dac4a96e8641a88844c209e8659"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/bundle.json","state_url":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/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-26T09:57:02Z","links":{"resolver":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC","bundle":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/bundle.json","state":"https://pith.science/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMX5AEWZTOFXAZ76Z5O57LUXOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EMX5AEWZTOFXAZ76Z5O57LUXOC","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":"6975e0894688d6378c8b0e8ce4411cac99005653f4be871a9734e5aef08b57ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-15T11:17:50Z","title_canon_sha256":"c0e120cc03b45fa88fbc64cee7978988de96f18ccaf5a1ecd2890e0258eb4d77"},"schema_version":"1.0","source":{"id":"1806.06713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06713","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06713v1","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06713","created_at":"2026-05-18T00:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"EMX5AEWZTOFX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EMX5AEWZTOFXAZ76","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EMX5AEWZ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:6891e6a2b3e689fb176b4c6ff3d226392c3c6dac4a96e8641a88844c209e8659","target":"graph","created_at":"2026-05-18T00:12:59Z","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":"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","authors_text":"Behrooz Bagheri Gh., Carlos Subi, Herbert Fleischner, Tomas Feder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-15T11:17:50Z","title":"On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06713","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:7731558e726930cef285fc1a10e6976b6d1424299fa655eddb288c922921c2b5","target":"record","created_at":"2026-05-18T00:12:59Z","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":"6975e0894688d6378c8b0e8ce4411cac99005653f4be871a9734e5aef08b57ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-15T11:17:50Z","title_canon_sha256":"c0e120cc03b45fa88fbc64cee7978988de96f18ccaf5a1ecd2890e0258eb4d77"},"schema_version":"1.0","source":{"id":"1806.06713","kind":"arxiv","version":1}},"canonical_sha256":"232fd012d99b8b7067fecf5ddfae9770aa290402e50f91a8864d5bd43f8c5a2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"232fd012d99b8b7067fecf5ddfae9770aa290402e50f91a8864d5bd43f8c5a2c","first_computed_at":"2026-05-18T00:12:59.359836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:59.359836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"72GtKyuVxNlWIwxV/v8kV0blhgoovmXoHnJ5Sxos2AIpYK0C+kQktzfIk3nLtesIa2up1zvqE5Yjh83o3GBJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:59.360363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7731558e726930cef285fc1a10e6976b6d1424299fa655eddb288c922921c2b5","sha256:6891e6a2b3e689fb176b4c6ff3d226392c3c6dac4a96e8641a88844c209e8659"],"state_sha256":"ec099858927eead022a0e4f887354657457c91ee15d6e158d9b6e432913e81c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsLmGOGQ+SFyV1ZSP1gWVyhTNZjoggMJU456ijbtd8vM/O//rjapp3m4aIENcZ0KtAZVuUyjXTWRJth7B4qDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:57:02.422460Z","bundle_sha256":"7d12ffaebc5e9292538817790d5b1cb69591380f22633d4b9caea98c226b0efb"}}