{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PUMTIJVJYIE633XWQ7RWR55D2C","short_pith_number":"pith:PUMTIJVJ","schema_version":"1.0","canonical_sha256":"7d193426a9c209edeef687e368f7a3d086e2d3fa847d64d01b98aa7ff77ed046","source":{"kind":"arxiv","id":"1008.2193","version":4},"attestation_state":"computed","paper":{"title":"Hamilton cycles in dense vertex-transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Andr\\'as M\\'ath\\'e, Demetres Christofides, Jan Hladk\\'y","submitted_at":"2010-08-12T19:24:05Z","abstract_excerpt":"A famous conjecture of Lov\\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large. In fact, we show that such graphs contain a Hamilton cycle and moreover we provide a polynomial time algorithm for finding such a cycle."},"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":"1008.2193","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-12T19:24:05Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"24110fa4f0b5624345226790ddf4b2e535f98df0864e06152b0b4650f392eb0a","abstract_canon_sha256":"b7bd9d279b932f5dfa1741a4b0213da97607f655c5f5a1afd773afc408d59519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.815928Z","signature_b64":"1ORIyWkE82FredwjUGTsKUFYQeArQX3+ASdV7oel9/xZx+N6jgHF23NG7L4e/55B9wGRoY3vB/WB50qqgnolCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d193426a9c209edeef687e368f7a3d086e2d3fa847d64d01b98aa7ff77ed046","last_reissued_at":"2026-05-18T00:39:18.815330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.815330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamilton cycles in dense vertex-transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Andr\\'as M\\'ath\\'e, Demetres Christofides, Jan Hladk\\'y","submitted_at":"2010-08-12T19:24:05Z","abstract_excerpt":"A famous conjecture of Lov\\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large. In fact, we show that such graphs contain a Hamilton cycle and moreover we provide a polynomial time algorithm for finding such a cycle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2193","kind":"arxiv","version":4},"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":"1008.2193","created_at":"2026-05-18T00:39:18.815437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.2193v4","created_at":"2026-05-18T00:39:18.815437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2193","created_at":"2026-05-18T00:39:18.815437+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUMTIJVJYIE6","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUMTIJVJYIE633XW","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUMTIJVJ","created_at":"2026-05-18T12:26:12.377268+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/PUMTIJVJYIE633XWQ7RWR55D2C","json":"https://pith.science/pith/PUMTIJVJYIE633XWQ7RWR55D2C.json","graph_json":"https://pith.science/api/pith-number/PUMTIJVJYIE633XWQ7RWR55D2C/graph.json","events_json":"https://pith.science/api/pith-number/PUMTIJVJYIE633XWQ7RWR55D2C/events.json","paper":"https://pith.science/paper/PUMTIJVJ"},"agent_actions":{"view_html":"https://pith.science/pith/PUMTIJVJYIE633XWQ7RWR55D2C","download_json":"https://pith.science/pith/PUMTIJVJYIE633XWQ7RWR55D2C.json","view_paper":"https://pith.science/paper/PUMTIJVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.2193&json=true","fetch_graph":"https://pith.science/api/pith-number/PUMTIJVJYIE633XWQ7RWR55D2C/graph.json","fetch_events":"https://pith.science/api/pith-number/PUMTIJVJYIE633XWQ7RWR55D2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUMTIJVJYIE633XWQ7RWR55D2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUMTIJVJYIE633XWQ7RWR55D2C/action/storage_attestation","attest_author":"https://pith.science/pith/PUMTIJVJYIE633XWQ7RWR55D2C/action/author_attestation","sign_citation":"https://pith.science/pith/PUMTIJVJYIE633XWQ7RWR55D2C/action/citation_signature","submit_replication":"https://pith.science/pith/PUMTIJVJYIE633XWQ7RWR55D2C/action/replication_record"}},"created_at":"2026-05-18T00:39:18.815437+00:00","updated_at":"2026-05-18T00:39:18.815437+00:00"}