{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R7U4NYMYMFWZSRRJ2RUQ34T522","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":"f039463c6aca0018701884ac74d19009314aecf1a27d7c6268cc6515c9eab86e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-26T11:29:49Z","title_canon_sha256":"925c0034e0ca5ad4d085066dff6eac3ca07fb9d90f235d4f8353d829055c3184"},"schema_version":"1.0","source":{"id":"1802.09250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09250","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09250v1","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09250","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"R7U4NYMYMFWZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R7U4NYMYMFWZSRRJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R7U4NYMY","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:c4719e69f49aa7d30303bc591eb4e3c747252fce45f040d261d5a5d3cc34cc4c","target":"graph","created_at":"2026-05-18T00:22:34Z","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":"We prove that the minimum number of Hamilton cycles in a hamiltonian threshold graph of order $n$ is $2^{\\lfloor (n-3)/2\\rfloor}$ and this minimum number is attained uniquely by the graph with degree sequence $n-1,n-1,n-2,\\ldots,\\lceil n/2\\rceil,\\lceil n/2\\rceil,\\ldots,3,2$ of $n-2$ distinct degrees. This graph is also the unique graph of minimum size among all hamiltonian threshold graphs of order $n.$","authors_text":"Pu Qiao, Xingzhi Zhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-26T11:29:49Z","title":"The minimum number of Hamilton cycles in a hamiltonian threshold graph of a prescribed order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09250","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:c3a605a2d17a4ba625ca334bb4e23184d1eb95dbd67f3d110ce037c70b38abf5","target":"record","created_at":"2026-05-18T00:22:34Z","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":"f039463c6aca0018701884ac74d19009314aecf1a27d7c6268cc6515c9eab86e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-26T11:29:49Z","title_canon_sha256":"925c0034e0ca5ad4d085066dff6eac3ca07fb9d90f235d4f8353d829055c3184"},"schema_version":"1.0","source":{"id":"1802.09250","kind":"arxiv","version":1}},"canonical_sha256":"8fe9c6e198616d994629d4690df27dd6a3f9b54c512e4d71520f60fe26856a96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fe9c6e198616d994629d4690df27dd6a3f9b54c512e4d71520f60fe26856a96","first_computed_at":"2026-05-18T00:22:34.280972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:34.280972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqA9Pun/fuTddDNETFIBaEUuqF2N7Mt/OXfP306oXAYKrsu7mXcUgIHMbCAM4n0boCP8XTobn7nTTQfXAq/gBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:34.281679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3a605a2d17a4ba625ca334bb4e23184d1eb95dbd67f3d110ce037c70b38abf5","sha256:c4719e69f49aa7d30303bc591eb4e3c747252fce45f040d261d5a5d3cc34cc4c"],"state_sha256":"d6351785821ac1feac96d0eee01d956c18aac7a96ba3e4198add40b12186202e"}