{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6ZZRBF7JDQZZAFZ7TT63DYFDBZ","short_pith_number":"pith:6ZZRBF7J","schema_version":"1.0","canonical_sha256":"f6731097e91c3390173f9cfdb1e0a30e4ee5cbdc940b04fa40edab29d2fa4f80","source":{"kind":"arxiv","id":"1806.01676","version":1},"attestation_state":"computed","paper":{"title":"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, Patrick Morris, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2018-06-05T13:22:11Z","abstract_excerpt":"We prove that for any $t\\ge 3$ there exist constants $c>0$ and $n_0$ such that any $d$-regular $n$-vertex graph $G$ with $t\\mid n\\geq n_0$ and second largest eigenvalue in absolute value $\\lambda$ satisfying $\\lambda\\le c d^{t}/n^{t-1}$ contains a $K_t$-factor, that is, vertex-disjoint copies of $K_t$ covering every vertex of $G$."},"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.01676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-05T13:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"fab5475ba6962f5227a2dfc554cbd6861ec308e0d7f16545a8f53a9e6fd1c570","abstract_canon_sha256":"05a050e630c69c409b310f1518246ef945c5f2abce9f65772a95556811c2a437"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:12.074362Z","signature_b64":"NVkrzkxT4NKgoBar5SI2UJmgCIfsHp5K/WmAJRC2A3WlaRCGtPKmrrOlkDPdeNRH6rrHVmxudvESQJrbU/RnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6731097e91c3390173f9cfdb1e0a30e4ee5cbdc940b04fa40edab29d2fa4f80","last_reissued_at":"2026-05-18T00:14:12.073635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:12.073635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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, Patrick Morris, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2018-06-05T13:22:11Z","abstract_excerpt":"We prove that for any $t\\ge 3$ there exist constants $c>0$ and $n_0$ such that any $d$-regular $n$-vertex graph $G$ with $t\\mid n\\geq n_0$ and second largest eigenvalue in absolute value $\\lambda$ satisfying $\\lambda\\le c d^{t}/n^{t-1}$ contains a $K_t$-factor, that is, vertex-disjoint copies of $K_t$ covering every vertex of $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01676","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.01676","created_at":"2026-05-18T00:14:12.073718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01676v1","created_at":"2026-05-18T00:14:12.073718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01676","created_at":"2026-05-18T00:14:12.073718+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZZRBF7JDQZZ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZZRBF7JDQZZAFZ7","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZZRBF7J","created_at":"2026-05-18T12:32:11.075285+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/6ZZRBF7JDQZZAFZ7TT63DYFDBZ","json":"https://pith.science/pith/6ZZRBF7JDQZZAFZ7TT63DYFDBZ.json","graph_json":"https://pith.science/api/pith-number/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/graph.json","events_json":"https://pith.science/api/pith-number/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/events.json","paper":"https://pith.science/paper/6ZZRBF7J"},"agent_actions":{"view_html":"https://pith.science/pith/6ZZRBF7JDQZZAFZ7TT63DYFDBZ","download_json":"https://pith.science/pith/6ZZRBF7JDQZZAFZ7TT63DYFDBZ.json","view_paper":"https://pith.science/paper/6ZZRBF7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01676&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/action/storage_attestation","attest_author":"https://pith.science/pith/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/action/author_attestation","sign_citation":"https://pith.science/pith/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/action/citation_signature","submit_replication":"https://pith.science/pith/6ZZRBF7JDQZZAFZ7TT63DYFDBZ/action/replication_record"}},"created_at":"2026-05-18T00:14:12.073718+00:00","updated_at":"2026-05-18T00:14:12.073718+00:00"}