{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RSCOE24G24VLMPBIHTDMZRI3YD","short_pith_number":"pith:RSCOE24G","schema_version":"1.0","canonical_sha256":"8c84e26b86d72ab63c283cc6ccc51bc0c6be1d17bfc28d3e004593127ab89545","source":{"kind":"arxiv","id":"1608.00713","version":1},"attestation_state":"computed","paper":{"title":"On the Minimum Number of Hamiltonian Cycles in Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Haythorpe","submitted_at":"2016-08-02T07:00:56Z","abstract_excerpt":"A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and k, and empirical evidence is provided that suggests that this function gives a tight upper bound on the minimum number of Hamiltonian cycles in k-regular graphs on n vertices for k >= 5 and n >= k + 3. An additional graph construction for 4-regular graphs is described for which the number of Hamiltonian cycles is superior to the above function in the case wh"},"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":"1608.00713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-02T07:00:56Z","cross_cats_sorted":[],"title_canon_sha256":"27a4ff13e1543b7f0dd45feea06385c9a18251460fa7a8e6ed97032f609b4542","abstract_canon_sha256":"fe26cf5bb0cc3723975eae28afbe0565d4fe2901ecc048f58b9a8a264c4d3e8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:01.264072Z","signature_b64":"oarysKCB9J4UqljaVqhMXzAt+dkrG6Nt/LaKs9rVhQ/9Jxy5Kh9gRrfqgPUu1WqDuIQSoC6icxccZQYaaZVVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c84e26b86d72ab63c283cc6ccc51bc0c6be1d17bfc28d3e004593127ab89545","last_reissued_at":"2026-05-18T01:10:01.263462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:01.263462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Minimum Number of Hamiltonian Cycles in Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Haythorpe","submitted_at":"2016-08-02T07:00:56Z","abstract_excerpt":"A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and k, and empirical evidence is provided that suggests that this function gives a tight upper bound on the minimum number of Hamiltonian cycles in k-regular graphs on n vertices for k >= 5 and n >= k + 3. An additional graph construction for 4-regular graphs is described for which the number of Hamiltonian cycles is superior to the above function in the case wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00713","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.00713","created_at":"2026-05-18T01:10:01.263551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00713v1","created_at":"2026-05-18T01:10:01.263551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00713","created_at":"2026-05-18T01:10:01.263551+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSCOE24G24VL","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSCOE24G24VLMPBI","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSCOE24G","created_at":"2026-05-18T12:30:41.710351+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/RSCOE24G24VLMPBIHTDMZRI3YD","json":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD.json","graph_json":"https://pith.science/api/pith-number/RSCOE24G24VLMPBIHTDMZRI3YD/graph.json","events_json":"https://pith.science/api/pith-number/RSCOE24G24VLMPBIHTDMZRI3YD/events.json","paper":"https://pith.science/paper/RSCOE24G"},"agent_actions":{"view_html":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD","download_json":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD.json","view_paper":"https://pith.science/paper/RSCOE24G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00713&json=true","fetch_graph":"https://pith.science/api/pith-number/RSCOE24G24VLMPBIHTDMZRI3YD/graph.json","fetch_events":"https://pith.science/api/pith-number/RSCOE24G24VLMPBIHTDMZRI3YD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/action/storage_attestation","attest_author":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/action/author_attestation","sign_citation":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/action/citation_signature","submit_replication":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/action/replication_record"}},"created_at":"2026-05-18T01:10:01.263551+00:00","updated_at":"2026-05-18T01:10:01.263551+00:00"}