{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SULHGM6VQWW2RRXDYZ3B6QVORY","short_pith_number":"pith:SULHGM6V","schema_version":"1.0","canonical_sha256":"95167333d585ada8c6e3c6761f42ae8e05cf6478f1a6793cd5fc9ac7a7b49693","source":{"kind":"arxiv","id":"2402.17857","version":1},"attestation_state":"computed","paper":{"title":"Clique Decompositions in Random Graphs via Refined Absorption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt, Tom Kelly","submitted_at":"2024-02-27T19:44:30Z","abstract_excerpt":"We prove that if $p\\ge n^{-\\frac{1}{3}+\\beta}$ for some $\\beta > 0$, then asymptotically almost surely the binomial random graph $G(n,p)$ has a $K_3$-packing containing all but at most $n + O(1)$ edges. Similarly, we prove that if $d \\ge n^{\\frac{2}{3}+\\beta}$ for some $\\beta > 0$ and $d$ is even, then asymptotically almost surely the random $d$-regular graph $G_{n,d}$ has a triangle decomposition provided $3 \\mid d \\cdot n$. We also show that $G(n,p)$ admits a fractional $K_3$-decomposition for such a value of $p$. We prove analogous versions for a $K_q$-packing of $G(n,p)$ with $p\\ge n^{-\\fr"},"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":"2402.17857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-27T19:44:30Z","cross_cats_sorted":[],"title_canon_sha256":"eb1a4aef5ceb5aa517f7b24c6a791f0de8b73102f7e96ecd06360d48b649eac0","abstract_canon_sha256":"750c1f812e06c9a32de603c2c69ae64fca6fd6ad34b46782cbbc93394fa02972"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:09.125677Z","signature_b64":"18iymLjWCUum3LnMLmikmg6YjkFcBC9UnEEi6mQxSBm1RqDnFFLZk5PTdXXoc4dFID1olY2ItErG544nvZH2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95167333d585ada8c6e3c6761f42ae8e05cf6478f1a6793cd5fc9ac7a7b49693","last_reissued_at":"2026-07-05T07:50:09.125239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:09.125239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique Decompositions in Random Graphs via Refined Absorption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt, Tom Kelly","submitted_at":"2024-02-27T19:44:30Z","abstract_excerpt":"We prove that if $p\\ge n^{-\\frac{1}{3}+\\beta}$ for some $\\beta > 0$, then asymptotically almost surely the binomial random graph $G(n,p)$ has a $K_3$-packing containing all but at most $n + O(1)$ edges. Similarly, we prove that if $d \\ge n^{\\frac{2}{3}+\\beta}$ for some $\\beta > 0$ and $d$ is even, then asymptotically almost surely the random $d$-regular graph $G_{n,d}$ has a triangle decomposition provided $3 \\mid d \\cdot n$. We also show that $G(n,p)$ admits a fractional $K_3$-decomposition for such a value of $p$. We prove analogous versions for a $K_q$-packing of $G(n,p)$ with $p\\ge n^{-\\fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.17857","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/2402.17857/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":"2402.17857","created_at":"2026-07-05T07:50:09.125295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.17857v1","created_at":"2026-07-05T07:50:09.125295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.17857","created_at":"2026-07-05T07:50:09.125295+00:00"},{"alias_kind":"pith_short_12","alias_value":"SULHGM6VQWW2","created_at":"2026-07-05T07:50:09.125295+00:00"},{"alias_kind":"pith_short_16","alias_value":"SULHGM6VQWW2RRXD","created_at":"2026-07-05T07:50:09.125295+00:00"},{"alias_kind":"pith_short_8","alias_value":"SULHGM6V","created_at":"2026-07-05T07:50:09.125295+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25250","citing_title":"Triangle packings in randomly perturbed graphs","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY","json":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY.json","graph_json":"https://pith.science/api/pith-number/SULHGM6VQWW2RRXDYZ3B6QVORY/graph.json","events_json":"https://pith.science/api/pith-number/SULHGM6VQWW2RRXDYZ3B6QVORY/events.json","paper":"https://pith.science/paper/SULHGM6V"},"agent_actions":{"view_html":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY","download_json":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY.json","view_paper":"https://pith.science/paper/SULHGM6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.17857&json=true","fetch_graph":"https://pith.science/api/pith-number/SULHGM6VQWW2RRXDYZ3B6QVORY/graph.json","fetch_events":"https://pith.science/api/pith-number/SULHGM6VQWW2RRXDYZ3B6QVORY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY/action/storage_attestation","attest_author":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY/action/author_attestation","sign_citation":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY/action/citation_signature","submit_replication":"https://pith.science/pith/SULHGM6VQWW2RRXDYZ3B6QVORY/action/replication_record"}},"created_at":"2026-07-05T07:50:09.125295+00:00","updated_at":"2026-07-05T07:50:09.125295+00:00"}