{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FRSC6HHKOLUGDPTA4AS7AHEECA","short_pith_number":"pith:FRSC6HHK","schema_version":"1.0","canonical_sha256":"2c642f1cea72e861be60e025f01c84101faa29ccaaed7762bd338a7ef1c37380","source":{"kind":"arxiv","id":"1311.5863","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.5863","created_at":"2026-05-18T02:32:14.310003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5863v2","created_at":"2026-05-18T02:32:14.310003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5863","created_at":"2026-05-18T02:32:14.310003+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRSC6HHKOLUG","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRSC6HHKOLUGDPTA","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRSC6HHK","created_at":"2026-05-18T12:27:45.050594+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/FRSC6HHKOLUGDPTA4AS7AHEECA","json":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA.json","graph_json":"https://pith.science/api/pith-number/FRSC6HHKOLUGDPTA4AS7AHEECA/graph.json","events_json":"https://pith.science/api/pith-number/FRSC6HHKOLUGDPTA4AS7AHEECA/events.json","paper":"https://pith.science/paper/FRSC6HHK"},"agent_actions":{"view_html":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA","download_json":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA.json","view_paper":"https://pith.science/paper/FRSC6HHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5863&json=true","fetch_graph":"https://pith.science/api/pith-number/FRSC6HHKOLUGDPTA4AS7AHEECA/graph.json","fetch_events":"https://pith.science/api/pith-number/FRSC6HHKOLUGDPTA4AS7AHEECA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/action/storage_attestation","attest_author":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/action/author_attestation","sign_citation":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/action/citation_signature","submit_replication":"https://pith.science/pith/FRSC6HHKOLUGDPTA4AS7AHEECA/action/replication_record"}},"created_at":"2026-05-18T02:32:14.310003+00:00","updated_at":"2026-05-18T02:32:14.310003+00:00"}