{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RSCOE24G24VLMPBIHTDMZRI3YD","short_pith_number":"pith:RSCOE24G","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"},"canonical_sha256":"8c84e26b86d72ab63c283cc6ccc51bc0c6be1d17bfc28d3e004593127ab89545","source":{"kind":"arxiv","id":"1608.00713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00713","created_at":"2026-05-18T01:10:01Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00713v1","created_at":"2026-05-18T01:10:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00713","created_at":"2026-05-18T01:10:01Z"},{"alias_kind":"pith_short_12","alias_value":"RSCOE24G24VL","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RSCOE24G24VLMPBI","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RSCOE24G","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RSCOE24G24VLMPBIHTDMZRI3YD","target":"record","payload":{"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"},"canonical_sha256":"8c84e26b86d72ab63c283cc6ccc51bc0c6be1d17bfc28d3e004593127ab89545","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"},"source_kind":"arxiv","source_id":"1608.00713","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-18T01:10:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVtNnBSfE+E/5P0bX9R1gF2gkKvc0f6lt0f0FTMEPXG1EHS5qhrLY3P+K2+AafTkHWFOO9J5hycvKduGHXscCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:17:58.060723Z"},"content_sha256":"10e5281b8b08352c5ab8018f6a5e239d8383892318ebba3206f63bdff9391dcc","schema_version":"1.0","event_id":"sha256:10e5281b8b08352c5ab8018f6a5e239d8383892318ebba3206f63bdff9391dcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RSCOE24G24VLMPBIHTDMZRI3YD","target":"graph","payload":{"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"},"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-18T01:10:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kb1aGsM6+VC9/ppSaAsZS8Jtm0lulaWBxm4imGGskffeslHo3wxJ1cwymAqGWEbZ+s3plCHor9DoCEC8n6DQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:17:58.061099Z"},"content_sha256":"806862ec8037387fe98bc28043dc03c70ae6e3f49d8c1869b551ac03b6944888","schema_version":"1.0","event_id":"sha256:806862ec8037387fe98bc28043dc03c70ae6e3f49d8c1869b551ac03b6944888"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/bundle.json","state_url":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSCOE24G24VLMPBIHTDMZRI3YD/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-31T23:17:58Z","links":{"resolver":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD","bundle":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/bundle.json","state":"https://pith.science/pith/RSCOE24G24VLMPBIHTDMZRI3YD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSCOE24G24VLMPBIHTDMZRI3YD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RSCOE24G24VLMPBIHTDMZRI3YD","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":"fe26cf5bb0cc3723975eae28afbe0565d4fe2901ecc048f58b9a8a264c4d3e8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-02T07:00:56Z","title_canon_sha256":"27a4ff13e1543b7f0dd45feea06385c9a18251460fa7a8e6ed97032f609b4542"},"schema_version":"1.0","source":{"id":"1608.00713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00713","created_at":"2026-05-18T01:10:01Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00713v1","created_at":"2026-05-18T01:10:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00713","created_at":"2026-05-18T01:10:01Z"},{"alias_kind":"pith_short_12","alias_value":"RSCOE24G24VL","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RSCOE24G24VLMPBI","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RSCOE24G","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:806862ec8037387fe98bc28043dc03c70ae6e3f49d8c1869b551ac03b6944888","target":"graph","created_at":"2026-05-18T01:10:01Z","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":"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","authors_text":"Michael Haythorpe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-02T07:00:56Z","title":"On the Minimum Number of Hamiltonian Cycles in Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00713","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:10e5281b8b08352c5ab8018f6a5e239d8383892318ebba3206f63bdff9391dcc","target":"record","created_at":"2026-05-18T01:10:01Z","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":"fe26cf5bb0cc3723975eae28afbe0565d4fe2901ecc048f58b9a8a264c4d3e8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-02T07:00:56Z","title_canon_sha256":"27a4ff13e1543b7f0dd45feea06385c9a18251460fa7a8e6ed97032f609b4542"},"schema_version":"1.0","source":{"id":"1608.00713","kind":"arxiv","version":1}},"canonical_sha256":"8c84e26b86d72ab63c283cc6ccc51bc0c6be1d17bfc28d3e004593127ab89545","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c84e26b86d72ab63c283cc6ccc51bc0c6be1d17bfc28d3e004593127ab89545","first_computed_at":"2026-05-18T01:10:01.263462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:01.263462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oarysKCB9J4UqljaVqhMXzAt+dkrG6Nt/LaKs9rVhQ/9Jxy5Kh9gRrfqgPUu1WqDuIQSoC6icxccZQYaaZVVDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:01.264072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10e5281b8b08352c5ab8018f6a5e239d8383892318ebba3206f63bdff9391dcc","sha256:806862ec8037387fe98bc28043dc03c70ae6e3f49d8c1869b551ac03b6944888"],"state_sha256":"c2f82f77e64164468772dcf45cb5d81dab3caf2e9eb7c451f3ed173dbc272456"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pspqR7LFdhwmWpzXwalBSEgVGIbbRfjzPYX6AT4+mOEAY+vupjYJ4iMfECOaT9DaxbDWaXjTYH+gILr9BfD4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:17:58.064369Z","bundle_sha256":"16ce8db06e84906ee9b037b425a31423ff45f077112cf2b2c687c62d43c22955"}}