{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PV55665KVK7VDEJ4KUZVUZW3TI","short_pith_number":"pith:PV55665K","canonical_record":{"source":{"id":"1902.10342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"d6607b0d8a752566337cfeaeb7b75393068bbdcb5c4008fe072d8e088403897f","abstract_canon_sha256":"27bb1dce0f91d291e09c67939364fe1aaf8b871c9c4a8ee6b809a96974a13d95"},"schema_version":"1.0"},"canonical_sha256":"7d7bdf7baaaabf51913c55335a66db9a05cb1947e2077bff61aa546152c79179","source":{"kind":"arxiv","id":"1902.10342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10342","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10342v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10342","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"PV55665KVK7V","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PV55665KVK7VDEJ4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PV55665K","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PV55665KVK7VDEJ4KUZVUZW3TI","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"d6607b0d8a752566337cfeaeb7b75393068bbdcb5c4008fe072d8e088403897f","abstract_canon_sha256":"27bb1dce0f91d291e09c67939364fe1aaf8b871c9c4a8ee6b809a96974a13d95"},"schema_version":"1.0"},"canonical_sha256":"7d7bdf7baaaabf51913c55335a66db9a05cb1947e2077bff61aa546152c79179","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.149197Z","signature_b64":"IEnHi+V/nH9TE4axdCYZQqF36smJW8X/i0NIqldkJnY5ivLeE5GQkL852dBANjENlns58XDKIN4zrESWrnkzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d7bdf7baaaabf51913c55335a66db9a05cb1947e2077bff61aa546152c79179","last_reissued_at":"2026-05-17T23:52:31.148768Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.148768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10342","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLqaIuUH/QgmroEbkxU6w3+KSieW7ylBaJQZcjbXm7aAnK2ALp3g0MYX8aFpLyVAMuZF5MS3nDFRqnvyVeZlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:59:53.322711Z"},"content_sha256":"e3e4a1c49ac653ce95805e277fd451384b544d335364f9cb986b0d568ab58a30","schema_version":"1.0","event_id":"sha256:e3e4a1c49ac653ce95805e277fd451384b544d335364f9cb986b0d568ab58a30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PV55665KVK7VDEJ4KUZVUZW3TI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Heuristic for Detecting Non-Hamiltonicity in Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy A Filar, Michael Haythorpe, Serguei Rossomakhine","submitted_at":"2019-02-27T06:03:44Z","abstract_excerpt":"We analyse a polyhedron which contains the convex hull of all Hamiltonian cycles of a given undirected connected cubic graph. Our constructed polyhedron is defined by polynomially-many linear constraints in polynomially-many continuous (relaxed) variables. Clearly, the emptiness of the constructed polyhedron implies that the graph is non-Hamiltonian. However, whenever a constructed polyhedron is non-empty, the result is inconclusive. Hence, the following natural question arises: if we assume that a non-empty polyhedron implies Hamiltonicity, how frequently is this diagnosis incorrect? We prove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10342","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGqRuaFfWK0wag57cbLZ7HeROpWXcG8izMQ5b9xqdQdWS/vIJxmQ4KD8/5emKehkr6X/eNCwhboRB+U0Z83pAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:59:53.323049Z"},"content_sha256":"981fd1734717b5a5355b16dd4a53d33c8c76487e359006ff4d1b27140ff39146","schema_version":"1.0","event_id":"sha256:981fd1734717b5a5355b16dd4a53d33c8c76487e359006ff4d1b27140ff39146"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PV55665KVK7VDEJ4KUZVUZW3TI/bundle.json","state_url":"https://pith.science/pith/PV55665KVK7VDEJ4KUZVUZW3TI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PV55665KVK7VDEJ4KUZVUZW3TI/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-06-26T18:59:53Z","links":{"resolver":"https://pith.science/pith/PV55665KVK7VDEJ4KUZVUZW3TI","bundle":"https://pith.science/pith/PV55665KVK7VDEJ4KUZVUZW3TI/bundle.json","state":"https://pith.science/pith/PV55665KVK7VDEJ4KUZVUZW3TI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PV55665KVK7VDEJ4KUZVUZW3TI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PV55665KVK7VDEJ4KUZVUZW3TI","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":"27bb1dce0f91d291e09c67939364fe1aaf8b871c9c4a8ee6b809a96974a13d95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:03:44Z","title_canon_sha256":"d6607b0d8a752566337cfeaeb7b75393068bbdcb5c4008fe072d8e088403897f"},"schema_version":"1.0","source":{"id":"1902.10342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10342","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10342v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10342","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"PV55665KVK7V","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PV55665KVK7VDEJ4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PV55665K","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:981fd1734717b5a5355b16dd4a53d33c8c76487e359006ff4d1b27140ff39146","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"We analyse a polyhedron which contains the convex hull of all Hamiltonian cycles of a given undirected connected cubic graph. Our constructed polyhedron is defined by polynomially-many linear constraints in polynomially-many continuous (relaxed) variables. Clearly, the emptiness of the constructed polyhedron implies that the graph is non-Hamiltonian. However, whenever a constructed polyhedron is non-empty, the result is inconclusive. Hence, the following natural question arises: if we assume that a non-empty polyhedron implies Hamiltonicity, how frequently is this diagnosis incorrect? We prove","authors_text":"Jerzy A Filar, Michael Haythorpe, Serguei Rossomakhine","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:03:44Z","title":"A New Heuristic for Detecting Non-Hamiltonicity in Cubic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10342","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:e3e4a1c49ac653ce95805e277fd451384b544d335364f9cb986b0d568ab58a30","target":"record","created_at":"2026-05-17T23:52:31Z","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":"27bb1dce0f91d291e09c67939364fe1aaf8b871c9c4a8ee6b809a96974a13d95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T06:03:44Z","title_canon_sha256":"d6607b0d8a752566337cfeaeb7b75393068bbdcb5c4008fe072d8e088403897f"},"schema_version":"1.0","source":{"id":"1902.10342","kind":"arxiv","version":1}},"canonical_sha256":"7d7bdf7baaaabf51913c55335a66db9a05cb1947e2077bff61aa546152c79179","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d7bdf7baaaabf51913c55335a66db9a05cb1947e2077bff61aa546152c79179","first_computed_at":"2026-05-17T23:52:31.148768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.148768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IEnHi+V/nH9TE4axdCYZQqF36smJW8X/i0NIqldkJnY5ivLeE5GQkL852dBANjENlns58XDKIN4zrESWrnkzDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.149197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3e4a1c49ac653ce95805e277fd451384b544d335364f9cb986b0d568ab58a30","sha256:981fd1734717b5a5355b16dd4a53d33c8c76487e359006ff4d1b27140ff39146"],"state_sha256":"5211a7e7a917595d677dd5c8973409c69dc6a8363c56b2ca7d4d3df968973004"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZkfkV5YwoiLlHjYvrUZ5YXL4H56+8efbb8kRNs1ZqKJpZerPYKtFQ5cCaip24ZTohBcWpwjisnM6v+8vMb8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T18:59:53.325078Z","bundle_sha256":"6afb219aafb7be9f9637c451a0285b749e1e3d69feaa8c9f4f1f2af0c4570cf2"}}