{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WJEP3JA4SZPHPJWRUZU7UYFYRH","short_pith_number":"pith:WJEP3JA4","schema_version":"1.0","canonical_sha256":"b248fda41c965e77a6d1a669fa60b889d645be342002e333db5de80c69310e62","source":{"kind":"arxiv","id":"1611.09466","version":1},"attestation_state":"computed","paper":{"title":"On Koml\\'os' tiling theorem in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nemanja \\v{S}kori\\'c, Rajko Nenadov","submitted_at":"2016-11-29T03:27:56Z","abstract_excerpt":"Conlon, Gowers, Samotij, and Schacht showed that for a given graph $H$ and a constant $\\gamma > 0$, there exists $C > 0$ such that if $p \\ge Cn^{-1/m_2(H)}$ then asymptotically almost surely every spanning subgraph $G$ of the random graph $\\mathcal{G}(n,p)$ with minimum degree at least $\\delta(G) \\ge (1 - 1/\\chi_{\\mathrm{cr}}(H) + \\gamma )np$ contains an $H$-packing that covers all but at most $\\gamma n$ vertices. Here, $\\chi_{\\mathrm{cr}}(H)$ denotes the critical chromatic threshold, a parameter introduced by Koml\\'os. We show that this theorem can be bootstraped to obtain an $H$-packing cove"},"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":"1611.09466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T03:27:56Z","cross_cats_sorted":[],"title_canon_sha256":"fa789d6c636c9125f5e76b2ff61199251af04a525c069750572442fc07fccfeb","abstract_canon_sha256":"82e74a6dd1bfac755ec17b577e14d817d5b438657a007a06a36b45ca291f1264"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:18.427565Z","signature_b64":"9sq72iiDOAV/i6ZnSwyWnzO/NwNBKcptWY6c+2ZfekBsSpqv29JZbFNcTQjyLyyqaDn1698N280AIrj/MWuEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b248fda41c965e77a6d1a669fa60b889d645be342002e333db5de80c69310e62","last_reissued_at":"2026-05-18T00:56:18.426812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:18.426812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Koml\\'os' tiling theorem in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nemanja \\v{S}kori\\'c, Rajko Nenadov","submitted_at":"2016-11-29T03:27:56Z","abstract_excerpt":"Conlon, Gowers, Samotij, and Schacht showed that for a given graph $H$ and a constant $\\gamma > 0$, there exists $C > 0$ such that if $p \\ge Cn^{-1/m_2(H)}$ then asymptotically almost surely every spanning subgraph $G$ of the random graph $\\mathcal{G}(n,p)$ with minimum degree at least $\\delta(G) \\ge (1 - 1/\\chi_{\\mathrm{cr}}(H) + \\gamma )np$ contains an $H$-packing that covers all but at most $\\gamma n$ vertices. Here, $\\chi_{\\mathrm{cr}}(H)$ denotes the critical chromatic threshold, a parameter introduced by Koml\\'os. We show that this theorem can be bootstraped to obtain an $H$-packing cove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09466","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":"1611.09466","created_at":"2026-05-18T00:56:18.426914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09466v1","created_at":"2026-05-18T00:56:18.426914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09466","created_at":"2026-05-18T00:56:18.426914+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJEP3JA4SZPH","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJEP3JA4SZPHPJWR","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJEP3JA4","created_at":"2026-05-18T12:30:48.956258+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/WJEP3JA4SZPHPJWRUZU7UYFYRH","json":"https://pith.science/pith/WJEP3JA4SZPHPJWRUZU7UYFYRH.json","graph_json":"https://pith.science/api/pith-number/WJEP3JA4SZPHPJWRUZU7UYFYRH/graph.json","events_json":"https://pith.science/api/pith-number/WJEP3JA4SZPHPJWRUZU7UYFYRH/events.json","paper":"https://pith.science/paper/WJEP3JA4"},"agent_actions":{"view_html":"https://pith.science/pith/WJEP3JA4SZPHPJWRUZU7UYFYRH","download_json":"https://pith.science/pith/WJEP3JA4SZPHPJWRUZU7UYFYRH.json","view_paper":"https://pith.science/paper/WJEP3JA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09466&json=true","fetch_graph":"https://pith.science/api/pith-number/WJEP3JA4SZPHPJWRUZU7UYFYRH/graph.json","fetch_events":"https://pith.science/api/pith-number/WJEP3JA4SZPHPJWRUZU7UYFYRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJEP3JA4SZPHPJWRUZU7UYFYRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJEP3JA4SZPHPJWRUZU7UYFYRH/action/storage_attestation","attest_author":"https://pith.science/pith/WJEP3JA4SZPHPJWRUZU7UYFYRH/action/author_attestation","sign_citation":"https://pith.science/pith/WJEP3JA4SZPHPJWRUZU7UYFYRH/action/citation_signature","submit_replication":"https://pith.science/pith/WJEP3JA4SZPHPJWRUZU7UYFYRH/action/replication_record"}},"created_at":"2026-05-18T00:56:18.426914+00:00","updated_at":"2026-05-18T00:56:18.426914+00:00"}