{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5RTHBHEDTZ3O7PBFJCBCIQW7YB","short_pith_number":"pith:5RTHBHED","schema_version":"1.0","canonical_sha256":"ec66709c839e76efbc2548822442dfc0530e706c815b6e2c785a464a9c1cfa84","source":{"kind":"arxiv","id":"1812.05650","version":2},"attestation_state":"computed","paper":{"title":"Graphs with few Hamiltonian Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Barbara Meersman, Carol T. Zamfirescu, Jan Goedgebeur","submitted_at":"2018-12-13T19:34:53Z","abstract_excerpt":"We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \\ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm and existing algorithms with new theoretical results, revolve around graphs containing exactly one hamiltonian cycle (1H) or exactly three hamiltonian cycles (3H). Motivated by a classic result of Smith and recent work of Royle, we show that there exist nearly cubic 1H graphs of order $n$ iff $n \\ge 18$ is even. This gives the strongest form of a theorem of En"},"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":"1812.05650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T19:34:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d10e9477dd29c67f30060b8499aa97befe7d3ab6ec29ff8ddee0c7a293e4aa34","abstract_canon_sha256":"420555486d3a472fa5076c7c94b1b6bb2a4e0f9bc7d92b87d0c2268fd6e55102"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:41.373808Z","signature_b64":"AXctd4J0KlLhd774cTdk19zPHbiGBUn2uz6QOn98rNL9ZHRzdFg9bvMl2igm1e9XGm7sQ9PnUfng3/VxUdJIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec66709c839e76efbc2548822442dfc0530e706c815b6e2c785a464a9c1cfa84","last_reissued_at":"2026-05-17T23:40:41.373135Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:41.373135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with few Hamiltonian Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Barbara Meersman, Carol T. Zamfirescu, Jan Goedgebeur","submitted_at":"2018-12-13T19:34:53Z","abstract_excerpt":"We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \\ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm and existing algorithms with new theoretical results, revolve around graphs containing exactly one hamiltonian cycle (1H) or exactly three hamiltonian cycles (3H). Motivated by a classic result of Smith and recent work of Royle, we show that there exist nearly cubic 1H graphs of order $n$ iff $n \\ge 18$ is even. This gives the strongest form of a theorem of En"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05650","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":"1812.05650","created_at":"2026-05-17T23:40:41.373237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05650v2","created_at":"2026-05-17T23:40:41.373237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05650","created_at":"2026-05-17T23:40:41.373237+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RTHBHEDTZ3O","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RTHBHEDTZ3O7PBF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RTHBHED","created_at":"2026-05-18T12:32:08.215937+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/5RTHBHEDTZ3O7PBFJCBCIQW7YB","json":"https://pith.science/pith/5RTHBHEDTZ3O7PBFJCBCIQW7YB.json","graph_json":"https://pith.science/api/pith-number/5RTHBHEDTZ3O7PBFJCBCIQW7YB/graph.json","events_json":"https://pith.science/api/pith-number/5RTHBHEDTZ3O7PBFJCBCIQW7YB/events.json","paper":"https://pith.science/paper/5RTHBHED"},"agent_actions":{"view_html":"https://pith.science/pith/5RTHBHEDTZ3O7PBFJCBCIQW7YB","download_json":"https://pith.science/pith/5RTHBHEDTZ3O7PBFJCBCIQW7YB.json","view_paper":"https://pith.science/paper/5RTHBHED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05650&json=true","fetch_graph":"https://pith.science/api/pith-number/5RTHBHEDTZ3O7PBFJCBCIQW7YB/graph.json","fetch_events":"https://pith.science/api/pith-number/5RTHBHEDTZ3O7PBFJCBCIQW7YB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RTHBHEDTZ3O7PBFJCBCIQW7YB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RTHBHEDTZ3O7PBFJCBCIQW7YB/action/storage_attestation","attest_author":"https://pith.science/pith/5RTHBHEDTZ3O7PBFJCBCIQW7YB/action/author_attestation","sign_citation":"https://pith.science/pith/5RTHBHEDTZ3O7PBFJCBCIQW7YB/action/citation_signature","submit_replication":"https://pith.science/pith/5RTHBHEDTZ3O7PBFJCBCIQW7YB/action/replication_record"}},"created_at":"2026-05-17T23:40:41.373237+00:00","updated_at":"2026-05-17T23:40:41.373237+00:00"}