{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4XT2UOWU24J4S5BPLZUQ4KHWNP","short_pith_number":"pith:4XT2UOWU","schema_version":"1.0","canonical_sha256":"e5e7aa3ad4d713c9742f5e690e28f66be9ebaa7c10758db3eb123a34fa99f8e6","source":{"kind":"arxiv","id":"1802.07700","version":2},"attestation_state":"computed","paper":{"title":"A rainbow blow-up lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Stefan Glock","submitted_at":"2018-02-21T17:57:50Z","abstract_excerpt":"We prove a rainbow version of the blow-up lemma of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi for $\\mu n$-bounded edge colourings. This enables the systematic study of rainbow embeddings of bounded degree spanning subgraphs. As one application, we show how our blow-up lemma can be used to transfer the bandwidth theorem of B\\\"ottcher, Schacht and Taraz to the rainbow setting. It can also be employed as a tool beyond the setting of $\\mu n$-bounded edge colourings. Kim, K\\\"uhn, Kupavskii and Osthus exploit this to prove several rainbow decomposition results. Our proof methods include the strategy of a"},"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":"1802.07700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-21T17:57:50Z","cross_cats_sorted":[],"title_canon_sha256":"d43055d330dfa858fb8949e68201912bac6773b0c3cfc62e837aed3bcb9b4a4f","abstract_canon_sha256":"9a7f3a5393f54f6351e14f1e2d240fc7ebe7b24b24d98d8498a99512a471828e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:50.750530Z","signature_b64":"a+JvCIdwZwrtJUF4f1E+BdyXVGmh0JFrFTuJoNmPn+or56qZfo9T9RJEJ+JxkEtkOtBt5TVieMVEG3Yk98WTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5e7aa3ad4d713c9742f5e690e28f66be9ebaa7c10758db3eb123a34fa99f8e6","last_reissued_at":"2026-05-18T00:13:50.748074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:50.748074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A rainbow blow-up lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Stefan Glock","submitted_at":"2018-02-21T17:57:50Z","abstract_excerpt":"We prove a rainbow version of the blow-up lemma of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi for $\\mu n$-bounded edge colourings. This enables the systematic study of rainbow embeddings of bounded degree spanning subgraphs. As one application, we show how our blow-up lemma can be used to transfer the bandwidth theorem of B\\\"ottcher, Schacht and Taraz to the rainbow setting. It can also be employed as a tool beyond the setting of $\\mu n$-bounded edge colourings. Kim, K\\\"uhn, Kupavskii and Osthus exploit this to prove several rainbow decomposition results. Our proof methods include the strategy of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07700","kind":"arxiv","version":2},"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":"1802.07700","created_at":"2026-05-18T00:13:50.749718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07700v2","created_at":"2026-05-18T00:13:50.749718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07700","created_at":"2026-05-18T00:13:50.749718+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XT2UOWU24J4","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XT2UOWU24J4S5BP","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XT2UOWU","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09950","citing_title":"A rainbow blow-up lemma for almost optimally bounded edge-colourings","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP","json":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP.json","graph_json":"https://pith.science/api/pith-number/4XT2UOWU24J4S5BPLZUQ4KHWNP/graph.json","events_json":"https://pith.science/api/pith-number/4XT2UOWU24J4S5BPLZUQ4KHWNP/events.json","paper":"https://pith.science/paper/4XT2UOWU"},"agent_actions":{"view_html":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP","download_json":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP.json","view_paper":"https://pith.science/paper/4XT2UOWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07700&json=true","fetch_graph":"https://pith.science/api/pith-number/4XT2UOWU24J4S5BPLZUQ4KHWNP/graph.json","fetch_events":"https://pith.science/api/pith-number/4XT2UOWU24J4S5BPLZUQ4KHWNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP/action/storage_attestation","attest_author":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP/action/author_attestation","sign_citation":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP/action/citation_signature","submit_replication":"https://pith.science/pith/4XT2UOWU24J4S5BPLZUQ4KHWNP/action/replication_record"}},"created_at":"2026-05-18T00:13:50.749718+00:00","updated_at":"2026-05-18T00:13:50.749718+00:00"}