{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AL7XYT6YOJDDHQ7VWYTMCFMZRC","short_pith_number":"pith:AL7XYT6Y","schema_version":"1.0","canonical_sha256":"02ff7c4fd8724633c3f5b626c1159988aca0ae640f4c7b1e5e73c72d272d9ae6","source":{"kind":"arxiv","id":"1412.3498","version":3},"attestation_state":"computed","paper":{"title":"On degree sequences forcing the square of a Hamilton cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Katherine Staden","submitted_at":"2014-12-10T23:47:38Z","abstract_excerpt":"A famous conjecture of P\\'osa from 1962 asserts that every graph on $n$ vertices and with minimum degree at least $2n/3$ contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi. In this paper we prove a degree sequence version of P\\'osa's conjecture: Given any $\\eta >0$, every graph $G$ of sufficiently large order $n$ contains the square of a Hamilton cycle if its degree sequence $d_1\\leq \\dots \\leq d_n$ satisfies $d_i \\geq (1/3+\\eta)n+i$ for all $i \\leq n/3$. The degree sequence condition here is asymptotically best "},"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":"1412.3498","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-10T23:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"3bfcbf2eabb5e7d7552f1a65ded449012d90e7fec49f713d0c8d10cd9bec7fa7","abstract_canon_sha256":"994f2d010bbe528d181c47a9c9f91f4d94ce9265bbe79e1a2964ba901a3c59a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:46.895906Z","signature_b64":"/IK7un9XgS4l6dJMevlyD5gsFDbUCLDf17eYWZw/TpwnXEVsygm7RZPXCHwWEkS6uIPhX6Vq3JEUleL5jiAmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02ff7c4fd8724633c3f5b626c1159988aca0ae640f4c7b1e5e73c72d272d9ae6","last_reissued_at":"2026-05-18T00:56:46.895245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:46.895245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On degree sequences forcing the square of a Hamilton cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Katherine Staden","submitted_at":"2014-12-10T23:47:38Z","abstract_excerpt":"A famous conjecture of P\\'osa from 1962 asserts that every graph on $n$ vertices and with minimum degree at least $2n/3$ contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi. In this paper we prove a degree sequence version of P\\'osa's conjecture: Given any $\\eta >0$, every graph $G$ of sufficiently large order $n$ contains the square of a Hamilton cycle if its degree sequence $d_1\\leq \\dots \\leq d_n$ satisfies $d_i \\geq (1/3+\\eta)n+i$ for all $i \\leq n/3$. The degree sequence condition here is asymptotically best "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3498","kind":"arxiv","version":3},"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":"1412.3498","created_at":"2026-05-18T00:56:46.895352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3498v3","created_at":"2026-05-18T00:56:46.895352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3498","created_at":"2026-05-18T00:56:46.895352+00:00"},{"alias_kind":"pith_short_12","alias_value":"AL7XYT6YOJDD","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AL7XYT6YOJDDHQ7V","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AL7XYT6Y","created_at":"2026-05-18T12:28:19.803747+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/AL7XYT6YOJDDHQ7VWYTMCFMZRC","json":"https://pith.science/pith/AL7XYT6YOJDDHQ7VWYTMCFMZRC.json","graph_json":"https://pith.science/api/pith-number/AL7XYT6YOJDDHQ7VWYTMCFMZRC/graph.json","events_json":"https://pith.science/api/pith-number/AL7XYT6YOJDDHQ7VWYTMCFMZRC/events.json","paper":"https://pith.science/paper/AL7XYT6Y"},"agent_actions":{"view_html":"https://pith.science/pith/AL7XYT6YOJDDHQ7VWYTMCFMZRC","download_json":"https://pith.science/pith/AL7XYT6YOJDDHQ7VWYTMCFMZRC.json","view_paper":"https://pith.science/paper/AL7XYT6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3498&json=true","fetch_graph":"https://pith.science/api/pith-number/AL7XYT6YOJDDHQ7VWYTMCFMZRC/graph.json","fetch_events":"https://pith.science/api/pith-number/AL7XYT6YOJDDHQ7VWYTMCFMZRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AL7XYT6YOJDDHQ7VWYTMCFMZRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AL7XYT6YOJDDHQ7VWYTMCFMZRC/action/storage_attestation","attest_author":"https://pith.science/pith/AL7XYT6YOJDDHQ7VWYTMCFMZRC/action/author_attestation","sign_citation":"https://pith.science/pith/AL7XYT6YOJDDHQ7VWYTMCFMZRC/action/citation_signature","submit_replication":"https://pith.science/pith/AL7XYT6YOJDDHQ7VWYTMCFMZRC/action/replication_record"}},"created_at":"2026-05-18T00:56:46.895352+00:00","updated_at":"2026-05-18T00:56:46.895352+00:00"}