{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KI5T42O4EJG25BHQUF7KUYA5US","short_pith_number":"pith:KI5T42O4","schema_version":"1.0","canonical_sha256":"523b3e69dc224dae84f0a17eaa601da48b53e7748922e328a67fe784c10f15e7","source":{"kind":"arxiv","id":"1612.00622","version":5},"attestation_state":"computed","paper":{"title":"Blow-up lemmas for sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiep H\\`an, Julia B\\\"ottcher, Peter Allen, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2016-12-02T10:30:22Z","abstract_excerpt":"The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal combinatorics.\n  We prove sparse analogues of the blow-up lemma for subgraphs of random and of pseudorandom graphs. Our main results are the following three sparse versions of the blow-up lemma: one for embedding spanning graphs with maximum degree $\\Delta$ in subgraphs of $G(n,p)$ with $p=C(\\log n/n)^{1/\\Delta}$; one for embedding spanning graphs with maximum degree "},"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":"1612.00622","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-12-02T10:30:22Z","cross_cats_sorted":[],"title_canon_sha256":"615531780154d07afb4914fd8c7496cbeac74079fb80ac001ae184994ae0ceaa","abstract_canon_sha256":"63d70a9674e5e6fc4b63567c255dcc3bfb21a73c75f23f76f37effafd37333ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:41.272499Z","signature_b64":"zFx5yoG4uBFdAn88LHeoKlYA56j9uMpIP28IbalRiCb1+CoPBQtlnq2xPqinmmFcR/kSp1uob/HDJP3E/fW4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523b3e69dc224dae84f0a17eaa601da48b53e7748922e328a67fe784c10f15e7","last_reissued_at":"2026-07-05T12:00:41.271861Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:41.271861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blow-up lemmas for sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiep H\\`an, Julia B\\\"ottcher, Peter Allen, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2016-12-02T10:30:22Z","abstract_excerpt":"The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal combinatorics.\n  We prove sparse analogues of the blow-up lemma for subgraphs of random and of pseudorandom graphs. Our main results are the following three sparse versions of the blow-up lemma: one for embedding spanning graphs with maximum degree $\\Delta$ in subgraphs of $G(n,p)$ with $p=C(\\log n/n)^{1/\\Delta}$; one for embedding spanning graphs with maximum degree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00622","kind":"arxiv","version":5},"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/1612.00622/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":"1612.00622","created_at":"2026-07-05T12:00:41.271928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00622v5","created_at":"2026-07-05T12:00:41.271928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00622","created_at":"2026-07-05T12:00:41.271928+00:00"},{"alias_kind":"pith_short_12","alias_value":"KI5T42O4EJG2","created_at":"2026-07-05T12:00:41.271928+00:00"},{"alias_kind":"pith_short_16","alias_value":"KI5T42O4EJG25BHQ","created_at":"2026-07-05T12:00:41.271928+00:00"},{"alias_kind":"pith_short_8","alias_value":"KI5T42O4","created_at":"2026-07-05T12:00:41.271928+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.09950","citing_title":"A rainbow blow-up lemma for almost optimally bounded edge-colourings","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US","json":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US.json","graph_json":"https://pith.science/api/pith-number/KI5T42O4EJG25BHQUF7KUYA5US/graph.json","events_json":"https://pith.science/api/pith-number/KI5T42O4EJG25BHQUF7KUYA5US/events.json","paper":"https://pith.science/paper/KI5T42O4"},"agent_actions":{"view_html":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US","download_json":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US.json","view_paper":"https://pith.science/paper/KI5T42O4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00622&json=true","fetch_graph":"https://pith.science/api/pith-number/KI5T42O4EJG25BHQUF7KUYA5US/graph.json","fetch_events":"https://pith.science/api/pith-number/KI5T42O4EJG25BHQUF7KUYA5US/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US/action/storage_attestation","attest_author":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US/action/author_attestation","sign_citation":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US/action/citation_signature","submit_replication":"https://pith.science/pith/KI5T42O4EJG25BHQUF7KUYA5US/action/replication_record"}},"created_at":"2026-07-05T12:00:41.271928+00:00","updated_at":"2026-07-05T12:00:41.271928+00:00"}