{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DOTZV55DUEJLJ4DON7OERSTM3P","short_pith_number":"pith:DOTZV55D","schema_version":"1.0","canonical_sha256":"1ba79af7a3a112b4f06e6fdc48ca6cdbd0ea9d777fc5c2e92edd2e981e5b2870","source":{"kind":"arxiv","id":"2302.08340","version":1},"attestation_state":"computed","paper":{"title":"The hitting time of clique factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Annika Heckel, Marc Kaufmann, Matija Pasch, Noela M\\\"uller","submitted_at":"2023-02-16T14:50:20Z","abstract_excerpt":"In a recent paper, Kahn gave the strongest possible, affirmative, answer to Shamir's problem, which had been open since the late 1970s: Let $r \\ge 3 $ and let $n$ be divisible by $r$. Then, in the random $r$-uniform hypergraph process on $n$ vertices, as soon as the last isolated vertex disappears, a perfect matching emerges. In the present work, we transfer this hitting time result to the setting of clique factors in the random graph process: At the time that the last vertex joins a copy of the complete graph $K_r$, the random graph process contains a $K_r$-factor. Our proof draws on a novel "},"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":"2302.08340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-16T14:50:20Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"cbb3c686715aa5df1128dbbbefeb17fedee7d22c8f6d46e5a79335957262feaa","abstract_canon_sha256":"667c20bdb86ddc055e54763c9f19b7ccfece2d77098798bc7c80db0e1cc31b0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:42:37.027377Z","signature_b64":"BCFAEpx2aRuIVJswc9nmiyLOEx6uhOQrXrdf0F9CF7qn9OKgaEEZnVyJ9lGhQU04lHapHcceZs/1uSBkgqfFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba79af7a3a112b4f06e6fdc48ca6cdbd0ea9d777fc5c2e92edd2e981e5b2870","last_reissued_at":"2026-07-05T05:42:37.027015Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:42:37.027015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The hitting time of clique factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Annika Heckel, Marc Kaufmann, Matija Pasch, Noela M\\\"uller","submitted_at":"2023-02-16T14:50:20Z","abstract_excerpt":"In a recent paper, Kahn gave the strongest possible, affirmative, answer to Shamir's problem, which had been open since the late 1970s: Let $r \\ge 3 $ and let $n$ be divisible by $r$. Then, in the random $r$-uniform hypergraph process on $n$ vertices, as soon as the last isolated vertex disappears, a perfect matching emerges. In the present work, we transfer this hitting time result to the setting of clique factors in the random graph process: At the time that the last vertex joins a copy of the complete graph $K_r$, the random graph process contains a $K_r$-factor. Our proof draws on a novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08340","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.08340/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2302.08340","created_at":"2026-07-05T05:42:37.027077+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.08340v1","created_at":"2026-07-05T05:42:37.027077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08340","created_at":"2026-07-05T05:42:37.027077+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOTZV55DUEJL","created_at":"2026-07-05T05:42:37.027077+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOTZV55DUEJLJ4DO","created_at":"2026-07-05T05:42:37.027077+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOTZV55D","created_at":"2026-07-05T05:42:37.027077+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/DOTZV55DUEJLJ4DON7OERSTM3P","json":"https://pith.science/pith/DOTZV55DUEJLJ4DON7OERSTM3P.json","graph_json":"https://pith.science/api/pith-number/DOTZV55DUEJLJ4DON7OERSTM3P/graph.json","events_json":"https://pith.science/api/pith-number/DOTZV55DUEJLJ4DON7OERSTM3P/events.json","paper":"https://pith.science/paper/DOTZV55D"},"agent_actions":{"view_html":"https://pith.science/pith/DOTZV55DUEJLJ4DON7OERSTM3P","download_json":"https://pith.science/pith/DOTZV55DUEJLJ4DON7OERSTM3P.json","view_paper":"https://pith.science/paper/DOTZV55D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.08340&json=true","fetch_graph":"https://pith.science/api/pith-number/DOTZV55DUEJLJ4DON7OERSTM3P/graph.json","fetch_events":"https://pith.science/api/pith-number/DOTZV55DUEJLJ4DON7OERSTM3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOTZV55DUEJLJ4DON7OERSTM3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOTZV55DUEJLJ4DON7OERSTM3P/action/storage_attestation","attest_author":"https://pith.science/pith/DOTZV55DUEJLJ4DON7OERSTM3P/action/author_attestation","sign_citation":"https://pith.science/pith/DOTZV55DUEJLJ4DON7OERSTM3P/action/citation_signature","submit_replication":"https://pith.science/pith/DOTZV55DUEJLJ4DON7OERSTM3P/action/replication_record"}},"created_at":"2026-07-05T05:42:37.027077+00:00","updated_at":"2026-07-05T05:42:37.027077+00:00"}