{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FRSC6HHKOLUGDPTA4AS7AHEECA","short_pith_number":"pith:FRSC6HHK","canonical_record":{"source":{"id":"1311.5863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T20:10:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9366cbeea609e47ebca5d114808be51a641a29d3436c086d125e1b266cdae403","abstract_canon_sha256":"5b701de7c290b42f040aa868e12605ea8302c896f39cad5159ddd65cb19e944d"},"schema_version":"1.0"},"canonical_sha256":"2c642f1cea72e861be60e025f01c84101faa29ccaaed7762bd338a7ef1c37380","source":{"kind":"arxiv","id":"1311.5863","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5863","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5863v2","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5863","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"FRSC6HHKOLUG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FRSC6HHKOLUGDPTA","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FRSC6HHK","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FRSC6HHKOLUGDPTA4AS7AHEECA","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T20:10:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9366cbeea609e47ebca5d114808be51a641a29d3436c086d125e1b266cdae403","abstract_canon_sha256":"5b701de7c290b42f040aa868e12605ea8302c896f39cad5159ddd65cb19e944d"},"schema_version":"1.0"},"canonical_sha256":"2c642f1cea72e861be60e025f01c84101faa29ccaaed7762bd338a7ef1c37380","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:14.310464Z","signature_b64":"/VMUvfIrGLlcneJW3jqkKgM1QNJA6Ql/GcYFleoyTFTXZrv36G8/rWfG6DZGQOY911XCKX8cZSYeEC5FGwz6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c642f1cea72e861be60e025f01c84101faa29ccaaed7762bd338a7ef1c37380","last_reissued_at":"2026-05-18T02:32:14.309925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:14.309925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5863","source_version":2,"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-18T02:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sibiK2srxySiBJn278GXgsxrq3BfwoWHpEJSolnqbp269Dwl7XBeKaOSmVTDkTes8MzM3YSc1zPtQDNL7LRiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:16:23.758997Z"},"content_sha256":"d0b473651c4b3683ed905e6c9c6afd6ca20d4cb048d65d5f6658f85a547fcc69","schema_version":"1.0","event_id":"sha256:d0b473651c4b3683ed905e6c9c6afd6ca20d4cb048d65d5f6658f85a547fcc69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FRSC6HHKOLUGDPTA4AS7AHEECA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonian chordal graphs are not cycle extendible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ben Seamone, Manuel Lafond","submitted_at":"2013-11-22T20:10:15Z","abstract_excerpt":"In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater. We disprove this conjecture by constructing counterexamples on $n$ vertices for any $n \\geq 15$. Furthermore, we show that there exist counterexamples where the ratio of the length of a non-extendible cycle to the total number of vertices can be made arbitrarily small. We then consider cycle extendibility in Hamiltonian chordal graphs where certain induced subgraphs are forbidden, notably $P_n$ and the bull."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5863","kind":"arxiv","version":2},"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-18T02:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAMmz8cjyJUF5dYeEOLU1EAMqhMRH/1JNotpc9ChneT0PoMTV4sQHALQWkc9s0LVsS22CuiQ9gn8CZ+9kVMPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:16:23.759707Z"},"content_sha256":"8f104aeaa93339af52fcfaedcfa63f8e5b842edeb8a23f4205f54aafcb41f654","schema_version":"1.0","event_id":"sha256:8f104aeaa93339af52fcfaedcfa63f8e5b842edeb8a23f4205f54aafcb41f654"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/bundle.json","state_url":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/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-25T13:16:23Z","links":{"resolver":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA","bundle":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/bundle.json","state":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FRSC6HHKOLUGDPTA4AS7AHEECA","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":"5b701de7c290b42f040aa868e12605ea8302c896f39cad5159ddd65cb19e944d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T20:10:15Z","title_canon_sha256":"9366cbeea609e47ebca5d114808be51a641a29d3436c086d125e1b266cdae403"},"schema_version":"1.0","source":{"id":"1311.5863","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5863","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5863v2","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5863","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"FRSC6HHKOLUG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FRSC6HHKOLUGDPTA","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FRSC6HHK","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:8f104aeaa93339af52fcfaedcfa63f8e5b842edeb8a23f4205f54aafcb41f654","target":"graph","created_at":"2026-05-18T02:32:14Z","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":"In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater. We disprove this conjecture by constructing counterexamples on $n$ vertices for any $n \\geq 15$. Furthermore, we show that there exist counterexamples where the ratio of the length of a non-extendible cycle to the total number of vertices can be made arbitrarily small. We then consider cycle extendibility in Hamiltonian chordal graphs where certain induced subgraphs are forbidden, notably $P_n$ and the bull.","authors_text":"Ben Seamone, Manuel Lafond","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T20:10:15Z","title":"Hamiltonian chordal graphs are not cycle extendible"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5863","kind":"arxiv","version":2},"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:d0b473651c4b3683ed905e6c9c6afd6ca20d4cb048d65d5f6658f85a547fcc69","target":"record","created_at":"2026-05-18T02:32:14Z","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":"5b701de7c290b42f040aa868e12605ea8302c896f39cad5159ddd65cb19e944d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T20:10:15Z","title_canon_sha256":"9366cbeea609e47ebca5d114808be51a641a29d3436c086d125e1b266cdae403"},"schema_version":"1.0","source":{"id":"1311.5863","kind":"arxiv","version":2}},"canonical_sha256":"2c642f1cea72e861be60e025f01c84101faa29ccaaed7762bd338a7ef1c37380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c642f1cea72e861be60e025f01c84101faa29ccaaed7762bd338a7ef1c37380","first_computed_at":"2026-05-18T02:32:14.309925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:14.309925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/VMUvfIrGLlcneJW3jqkKgM1QNJA6Ql/GcYFleoyTFTXZrv36G8/rWfG6DZGQOY911XCKX8cZSYeEC5FGwz6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:14.310464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5863","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0b473651c4b3683ed905e6c9c6afd6ca20d4cb048d65d5f6658f85a547fcc69","sha256:8f104aeaa93339af52fcfaedcfa63f8e5b842edeb8a23f4205f54aafcb41f654"],"state_sha256":"f7f34d23516844f7e0e72654a65177d3055b5e27a12b152eb1b15b03e5607ea3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMWPQfnoQlk7h6p8MnJWM4CjB1xd0b/HAFHghDenxQ98HmGFxgGBHdkhymC5VuRE6GhnlYGO8IhTZSW/3ehNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:16:23.763505Z","bundle_sha256":"5e2808522e38c6d66c4dc0fdb8326957ffbcac1ba22ed63e01630a0fe99f9863"}}