{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:F4QOELINA2ZBO5R26LOJT2EUWG","short_pith_number":"pith:F4QOELIN","schema_version":"1.0","canonical_sha256":"2f20e22d0d06b217763af2dc99e894b1a70b1882c907384d67e147ed25946f5d","source":{"kind":"arxiv","id":"1111.6261","version":2},"attestation_state":"computed","paper":{"title":"On the number of Hamilton cycles in pseudo-random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich","submitted_at":"2011-11-27T14:36:57Z","abstract_excerpt":"We prove that if G is an (n,d,lambda)-graph (a d-regular graph on n vertices, all of whose non-trivial eigenvalues are at most lambda) and the following conditions are satisfied:\n  1. d/lambda >= (log n)^{1+epsilon} for some constant epsilon>0; 2.log d * lod (d/lambda) >> log n, then the number of Hamilton cycles in G is n!(d/n)^n(1+o(1))^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":"1111.6261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-27T14:36:57Z","cross_cats_sorted":[],"title_canon_sha256":"e682ad9f4cb66ffed861348711943adb1dabd46989c599fbcbbe5ac4f525394f","abstract_canon_sha256":"ab8d5b9b9bbe5c9cf4cd3c01e50113cb2483387f4ad6b1322e9d4010933b79c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:03.346631Z","signature_b64":"Mm896zv4uOZbQQ/PRiR3kORN9dIRfA0FR/biHR3rjZWZVSsRfBPurv1GdR5E/Nnza+HFoHzvkoSWhnI5hIRfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f20e22d0d06b217763af2dc99e894b1a70b1882c907384d67e147ed25946f5d","last_reissued_at":"2026-05-18T04:05:03.345712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:03.345712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of Hamilton cycles in pseudo-random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich","submitted_at":"2011-11-27T14:36:57Z","abstract_excerpt":"We prove that if G is an (n,d,lambda)-graph (a d-regular graph on n vertices, all of whose non-trivial eigenvalues are at most lambda) and the following conditions are satisfied:\n  1. d/lambda >= (log n)^{1+epsilon} for some constant epsilon>0; 2.log d * lod (d/lambda) >> log n, then the number of Hamilton cycles in G is n!(d/n)^n(1+o(1))^n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6261","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":"1111.6261","created_at":"2026-05-18T04:05:03.345893+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.6261v2","created_at":"2026-05-18T04:05:03.345893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6261","created_at":"2026-05-18T04:05:03.345893+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4QOELINA2ZB","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4QOELINA2ZBO5R2","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4QOELIN","created_at":"2026-05-18T12:26:28.662955+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/F4QOELINA2ZBO5R26LOJT2EUWG","json":"https://pith.science/pith/F4QOELINA2ZBO5R26LOJT2EUWG.json","graph_json":"https://pith.science/api/pith-number/F4QOELINA2ZBO5R26LOJT2EUWG/graph.json","events_json":"https://pith.science/api/pith-number/F4QOELINA2ZBO5R26LOJT2EUWG/events.json","paper":"https://pith.science/paper/F4QOELIN"},"agent_actions":{"view_html":"https://pith.science/pith/F4QOELINA2ZBO5R26LOJT2EUWG","download_json":"https://pith.science/pith/F4QOELINA2ZBO5R26LOJT2EUWG.json","view_paper":"https://pith.science/paper/F4QOELIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.6261&json=true","fetch_graph":"https://pith.science/api/pith-number/F4QOELINA2ZBO5R26LOJT2EUWG/graph.json","fetch_events":"https://pith.science/api/pith-number/F4QOELINA2ZBO5R26LOJT2EUWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4QOELINA2ZBO5R26LOJT2EUWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4QOELINA2ZBO5R26LOJT2EUWG/action/storage_attestation","attest_author":"https://pith.science/pith/F4QOELINA2ZBO5R26LOJT2EUWG/action/author_attestation","sign_citation":"https://pith.science/pith/F4QOELINA2ZBO5R26LOJT2EUWG/action/citation_signature","submit_replication":"https://pith.science/pith/F4QOELINA2ZBO5R26LOJT2EUWG/action/replication_record"}},"created_at":"2026-05-18T04:05:03.345893+00:00","updated_at":"2026-05-18T04:05:03.345893+00:00"}