{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SFFRBCNZGVKXM2SUAUGOAHHZOF","short_pith_number":"pith:SFFRBCNZ","schema_version":"1.0","canonical_sha256":"914b1089b93555766a54050ce01cf97149e07007fbbbd281ef392bc69b989384","source":{"kind":"arxiv","id":"1701.06784","version":2},"attestation_state":"computed","paper":{"title":"Proof of Koml\\'os's conjecture on Hamiltonian subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Jaehoon Kim, Katherine Staden, Maryam Sharifzadeh","submitted_at":"2017-01-24T09:47:17Z","abstract_excerpt":"Koml\\'os conjectured in 1981 that among all graphs with minimum degree at least $d$, the complete graph $K_{d+1}$ minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We prove this conjecture when $d$ is sufficiently large. In fact we prove a stronger result: for large $d$, any graph $G$ with average degree at least $d$ contains almost twice as many Hamiltonian subsets as $K_{d+1}$, unless $G$ is isomorphic to $K_{d+1}$ or a certain other graph which we specify."},"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":"1701.06784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-24T09:47:17Z","cross_cats_sorted":[],"title_canon_sha256":"004694087e61cd6e688179b0d58aa498b061ecdab546ecb61830c36ad86eb440","abstract_canon_sha256":"ad86c397d2c58346225c9ad1e20884cc23a964000cfadcbc13c56bf3cf98b0bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:37.197765Z","signature_b64":"y2qopg9toMNY4H8d/VixQyPyYWkIRoXiiJOMqBqBjSaBVL7IQ+G5x6a2b2duI3Nmpz2eXvcSRh4xov7zk2BiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"914b1089b93555766a54050ce01cf97149e07007fbbbd281ef392bc69b989384","last_reissued_at":"2026-05-18T00:39:37.197100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:37.197100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of Koml\\'os's conjecture on Hamiltonian subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Jaehoon Kim, Katherine Staden, Maryam Sharifzadeh","submitted_at":"2017-01-24T09:47:17Z","abstract_excerpt":"Koml\\'os conjectured in 1981 that among all graphs with minimum degree at least $d$, the complete graph $K_{d+1}$ minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We prove this conjecture when $d$ is sufficiently large. In fact we prove a stronger result: for large $d$, any graph $G$ with average degree at least $d$ contains almost twice as many Hamiltonian subsets as $K_{d+1}$, unless $G$ is isomorphic to $K_{d+1}$ or a certain other graph which we specify."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06784","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":"1701.06784","created_at":"2026-05-18T00:39:37.197211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06784v2","created_at":"2026-05-18T00:39:37.197211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06784","created_at":"2026-05-18T00:39:37.197211+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFFRBCNZGVKX","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFFRBCNZGVKXM2SU","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFFRBCNZ","created_at":"2026-05-18T12:31:43.269735+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/SFFRBCNZGVKXM2SUAUGOAHHZOF","json":"https://pith.science/pith/SFFRBCNZGVKXM2SUAUGOAHHZOF.json","graph_json":"https://pith.science/api/pith-number/SFFRBCNZGVKXM2SUAUGOAHHZOF/graph.json","events_json":"https://pith.science/api/pith-number/SFFRBCNZGVKXM2SUAUGOAHHZOF/events.json","paper":"https://pith.science/paper/SFFRBCNZ"},"agent_actions":{"view_html":"https://pith.science/pith/SFFRBCNZGVKXM2SUAUGOAHHZOF","download_json":"https://pith.science/pith/SFFRBCNZGVKXM2SUAUGOAHHZOF.json","view_paper":"https://pith.science/paper/SFFRBCNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06784&json=true","fetch_graph":"https://pith.science/api/pith-number/SFFRBCNZGVKXM2SUAUGOAHHZOF/graph.json","fetch_events":"https://pith.science/api/pith-number/SFFRBCNZGVKXM2SUAUGOAHHZOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFFRBCNZGVKXM2SUAUGOAHHZOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFFRBCNZGVKXM2SUAUGOAHHZOF/action/storage_attestation","attest_author":"https://pith.science/pith/SFFRBCNZGVKXM2SUAUGOAHHZOF/action/author_attestation","sign_citation":"https://pith.science/pith/SFFRBCNZGVKXM2SUAUGOAHHZOF/action/citation_signature","submit_replication":"https://pith.science/pith/SFFRBCNZGVKXM2SUAUGOAHHZOF/action/replication_record"}},"created_at":"2026-05-18T00:39:37.197211+00:00","updated_at":"2026-05-18T00:39:37.197211+00:00"}