{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GHCFPCTESV4PXPL7YX6PNFNU4A","short_pith_number":"pith:GHCFPCTE","schema_version":"1.0","canonical_sha256":"31c4578a649578fbbd7fc5fcf695b4e0278ad5af12c6b48362996231a6ab9afc","source":{"kind":"arxiv","id":"1806.00493","version":1},"attestation_state":"computed","paper":{"title":"Near-perfect clique-factors in sparse pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2018-06-01T18:09:19Z","abstract_excerpt":"We prove that, for any $t\\ge 3$, there exists a constant $c=c(t)>0$ such that any $d$-regular $n$-vertex graph with the second largest eigenvalue in absolute value~$\\lambda$ satisfying $\\lambda\\le c d^{t-1}/n^{t-2}$ contains vertex-disjoint copies of $K_t$ covering all but at most $n^{1-1/(8t^4)}$ vertices. This provides further support for the conjecture of Krivelevich, Sudakov and Sz\\'abo [\\emph{Triangle factors in sparse pseudo-random graphs}, Combinatorica \\textbf{24} (2004), pp.~403--426] that $(n,d,\\lambda)$-graphs with $n\\in 3\\mathbb{N}$ and $\\lambda\\leq cd^{2}/n$ for a suitably small a"},"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":"1806.00493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-01T18:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"c11fd6289c8e5fc77928a6543942453858ed1ce77da80883a3e1285634fa5cf9","abstract_canon_sha256":"e95def9e95e2b613d343d6ba0a05eaa79cab2b74c2dc680a8aee8afff05cff16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:21.076149Z","signature_b64":"Ib9AdpR9B2WOvg6qD1e3SVob8oAE+IQJ0u1N8HYIjtG3JossbNA6oT5Ky8S5qAZ6VKKecAESODW2M+m2TkevCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31c4578a649578fbbd7fc5fcf695b4e0278ad5af12c6b48362996231a6ab9afc","last_reissued_at":"2026-05-18T00:14:21.075455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:21.075455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-perfect clique-factors in sparse pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2018-06-01T18:09:19Z","abstract_excerpt":"We prove that, for any $t\\ge 3$, there exists a constant $c=c(t)>0$ such that any $d$-regular $n$-vertex graph with the second largest eigenvalue in absolute value~$\\lambda$ satisfying $\\lambda\\le c d^{t-1}/n^{t-2}$ contains vertex-disjoint copies of $K_t$ covering all but at most $n^{1-1/(8t^4)}$ vertices. This provides further support for the conjecture of Krivelevich, Sudakov and Sz\\'abo [\\emph{Triangle factors in sparse pseudo-random graphs}, Combinatorica \\textbf{24} (2004), pp.~403--426] that $(n,d,\\lambda)$-graphs with $n\\in 3\\mathbb{N}$ and $\\lambda\\leq cd^{2}/n$ for a suitably small a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00493","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":"1806.00493","created_at":"2026-05-18T00:14:21.075557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00493v1","created_at":"2026-05-18T00:14:21.075557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00493","created_at":"2026-05-18T00:14:21.075557+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHCFPCTESV4P","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHCFPCTESV4PXPL7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHCFPCTE","created_at":"2026-05-18T12:32:25.280505+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/GHCFPCTESV4PXPL7YX6PNFNU4A","json":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A.json","graph_json":"https://pith.science/api/pith-number/GHCFPCTESV4PXPL7YX6PNFNU4A/graph.json","events_json":"https://pith.science/api/pith-number/GHCFPCTESV4PXPL7YX6PNFNU4A/events.json","paper":"https://pith.science/paper/GHCFPCTE"},"agent_actions":{"view_html":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A","download_json":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A.json","view_paper":"https://pith.science/paper/GHCFPCTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00493&json=true","fetch_graph":"https://pith.science/api/pith-number/GHCFPCTESV4PXPL7YX6PNFNU4A/graph.json","fetch_events":"https://pith.science/api/pith-number/GHCFPCTESV4PXPL7YX6PNFNU4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/action/storage_attestation","attest_author":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/action/author_attestation","sign_citation":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/action/citation_signature","submit_replication":"https://pith.science/pith/GHCFPCTESV4PXPL7YX6PNFNU4A/action/replication_record"}},"created_at":"2026-05-18T00:14:21.075557+00:00","updated_at":"2026-05-18T00:14:21.075557+00:00"}