{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R7U4NYMYMFWZSRRJ2RUQ34T522","short_pith_number":"pith:R7U4NYMY","schema_version":"1.0","canonical_sha256":"8fe9c6e198616d994629d4690df27dd6a3f9b54c512e4d71520f60fe26856a96","source":{"kind":"arxiv","id":"1802.09250","version":1},"attestation_state":"computed","paper":{"title":"The minimum number of Hamilton cycles in a hamiltonian threshold graph of a prescribed order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2018-02-26T11:29:49Z","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.$"},"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":"1802.09250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-26T11:29:49Z","cross_cats_sorted":[],"title_canon_sha256":"925c0034e0ca5ad4d085066dff6eac3ca07fb9d90f235d4f8353d829055c3184","abstract_canon_sha256":"f039463c6aca0018701884ac74d19009314aecf1a27d7c6268cc6515c9eab86e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:34.281679Z","signature_b64":"vqA9Pun/fuTddDNETFIBaEUuqF2N7Mt/OXfP306oXAYKrsu7mXcUgIHMbCAM4n0boCP8XTobn7nTTQfXAq/gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fe9c6e198616d994629d4690df27dd6a3f9b54c512e4d71520f60fe26856a96","last_reissued_at":"2026-05-18T00:22:34.280972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:34.280972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum number of Hamilton cycles in a hamiltonian threshold graph of a prescribed order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2018-02-26T11:29:49Z","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.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09250","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":"1802.09250","created_at":"2026-05-18T00:22:34.281090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09250v1","created_at":"2026-05-18T00:22:34.281090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09250","created_at":"2026-05-18T00:22:34.281090+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7U4NYMYMFWZ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7U4NYMYMFWZSRRJ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7U4NYMY","created_at":"2026-05-18T12:32:50.500415+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/R7U4NYMYMFWZSRRJ2RUQ34T522","json":"https://pith.science/pith/R7U4NYMYMFWZSRRJ2RUQ34T522.json","graph_json":"https://pith.science/api/pith-number/R7U4NYMYMFWZSRRJ2RUQ34T522/graph.json","events_json":"https://pith.science/api/pith-number/R7U4NYMYMFWZSRRJ2RUQ34T522/events.json","paper":"https://pith.science/paper/R7U4NYMY"},"agent_actions":{"view_html":"https://pith.science/pith/R7U4NYMYMFWZSRRJ2RUQ34T522","download_json":"https://pith.science/pith/R7U4NYMYMFWZSRRJ2RUQ34T522.json","view_paper":"https://pith.science/paper/R7U4NYMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09250&json=true","fetch_graph":"https://pith.science/api/pith-number/R7U4NYMYMFWZSRRJ2RUQ34T522/graph.json","fetch_events":"https://pith.science/api/pith-number/R7U4NYMYMFWZSRRJ2RUQ34T522/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7U4NYMYMFWZSRRJ2RUQ34T522/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7U4NYMYMFWZSRRJ2RUQ34T522/action/storage_attestation","attest_author":"https://pith.science/pith/R7U4NYMYMFWZSRRJ2RUQ34T522/action/author_attestation","sign_citation":"https://pith.science/pith/R7U4NYMYMFWZSRRJ2RUQ34T522/action/citation_signature","submit_replication":"https://pith.science/pith/R7U4NYMYMFWZSRRJ2RUQ34T522/action/replication_record"}},"created_at":"2026-05-18T00:22:34.281090+00:00","updated_at":"2026-05-18T00:22:34.281090+00:00"}