{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FLL7KWTVQOF2NNKMJ6MOTHNDOW","short_pith_number":"pith:FLL7KWTV","canonical_record":{"source":{"id":"1907.09950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T15:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"010fb3548694e8404ae02076fbe1c8956139ef2702b958ef60bbaab5708a5c6b","abstract_canon_sha256":"527211df7ee6a1e178f732bc89cb8bfcf5b0005d82eb67b209ee1e268a31cee6"},"schema_version":"1.0"},"canonical_sha256":"2ad7f55a75838ba6b54c4f98e99da3758c91c7da3cbf10c6165c21d5ebfb5e9c","source":{"kind":"arxiv","id":"1907.09950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09950","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09950v1","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09950","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"FLL7KWTVQOF2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLL7KWTVQOF2NNKM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLL7KWTV","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FLL7KWTVQOF2NNKMJ6MOTHNDOW","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T15:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"010fb3548694e8404ae02076fbe1c8956139ef2702b958ef60bbaab5708a5c6b","abstract_canon_sha256":"527211df7ee6a1e178f732bc89cb8bfcf5b0005d82eb67b209ee1e268a31cee6"},"schema_version":"1.0"},"canonical_sha256":"2ad7f55a75838ba6b54c4f98e99da3758c91c7da3cbf10c6165c21d5ebfb5e9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:49.588812Z","signature_b64":"gLkHiVFLfQinEtCR5A80EmB0PNdVgt2JXMj6r0/B0l9Oikz53lkYVD9Ur0V5hsOfLKGTWxEyhw7J6N8X3wJQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ad7f55a75838ba6b54c4f98e99da3758c91c7da3cbf10c6165c21d5ebfb5e9c","last_reissued_at":"2026-05-17T23:39:49.588234Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:49.588234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09950","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ym7dnGxGt6l/j6zL278uNZ15xGFNFiGL8gJfZvADMlqXO7KCwJQwKLVIvEv5ceGL8/b6lwj8/MPgRSMoXZ31Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:51:54.113285Z"},"content_sha256":"dab41fa1587946cfecf3df1fbdce679674d00a631402eb252e8dd91359d1e7bd","schema_version":"1.0","event_id":"sha256:dab41fa1587946cfecf3df1fbdce679674d00a631402eb252e8dd91359d1e7bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FLL7KWTVQOF2NNKMJ6MOTHNDOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A rainbow blow-up lemma for almost optimally bounded edge-colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Stefan Ehard, Stefan Glock","submitted_at":"2019-07-23T15:16:03Z","abstract_excerpt":"A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi that applies to almost optimally bounded colourings. A corollary of this is that there exists a rainbow copy of any bounded-degree spanning subgraph $H$ in a quasirandom host graph $G$, assuming that the edge-colouring of $G$ fulfills a boundedness condition that is asymptotically best possible.\n  This has many applications beyond rainbow colourings, for example to graph decompositions, orthogonal double covers "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09950","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnQnz7LqDTWeKTO2CkVyTLSpIWTjqHMRpZTgqfMMvA0PFzP3QC1/cuB7hKvmNJbP1KQI49ENpKf9zpu+F09aAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:51:54.113689Z"},"content_sha256":"316fd5480fcaf677b68d39d681f3a9159fe15df28ebd8e93f00a59b9dd206d37","schema_version":"1.0","event_id":"sha256:316fd5480fcaf677b68d39d681f3a9159fe15df28ebd8e93f00a59b9dd206d37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLL7KWTVQOF2NNKMJ6MOTHNDOW/bundle.json","state_url":"https://pith.science/pith/FLL7KWTVQOF2NNKMJ6MOTHNDOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLL7KWTVQOF2NNKMJ6MOTHNDOW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T21:51:54Z","links":{"resolver":"https://pith.science/pith/FLL7KWTVQOF2NNKMJ6MOTHNDOW","bundle":"https://pith.science/pith/FLL7KWTVQOF2NNKMJ6MOTHNDOW/bundle.json","state":"https://pith.science/pith/FLL7KWTVQOF2NNKMJ6MOTHNDOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLL7KWTVQOF2NNKMJ6MOTHNDOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FLL7KWTVQOF2NNKMJ6MOTHNDOW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"527211df7ee6a1e178f732bc89cb8bfcf5b0005d82eb67b209ee1e268a31cee6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T15:16:03Z","title_canon_sha256":"010fb3548694e8404ae02076fbe1c8956139ef2702b958ef60bbaab5708a5c6b"},"schema_version":"1.0","source":{"id":"1907.09950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09950","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09950v1","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09950","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"FLL7KWTVQOF2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLL7KWTVQOF2NNKM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLL7KWTV","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:316fd5480fcaf677b68d39d681f3a9159fe15df28ebd8e93f00a59b9dd206d37","target":"graph","created_at":"2026-05-17T23:39:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi that applies to almost optimally bounded colourings. A corollary of this is that there exists a rainbow copy of any bounded-degree spanning subgraph $H$ in a quasirandom host graph $G$, assuming that the edge-colouring of $G$ fulfills a boundedness condition that is asymptotically best possible.\n  This has many applications beyond rainbow colourings, for example to graph decompositions, orthogonal double covers ","authors_text":"Felix Joos, Stefan Ehard, Stefan Glock","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T15:16:03Z","title":"A rainbow blow-up lemma for almost optimally bounded edge-colourings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09950","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dab41fa1587946cfecf3df1fbdce679674d00a631402eb252e8dd91359d1e7bd","target":"record","created_at":"2026-05-17T23:39:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"527211df7ee6a1e178f732bc89cb8bfcf5b0005d82eb67b209ee1e268a31cee6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T15:16:03Z","title_canon_sha256":"010fb3548694e8404ae02076fbe1c8956139ef2702b958ef60bbaab5708a5c6b"},"schema_version":"1.0","source":{"id":"1907.09950","kind":"arxiv","version":1}},"canonical_sha256":"2ad7f55a75838ba6b54c4f98e99da3758c91c7da3cbf10c6165c21d5ebfb5e9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ad7f55a75838ba6b54c4f98e99da3758c91c7da3cbf10c6165c21d5ebfb5e9c","first_computed_at":"2026-05-17T23:39:49.588234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:49.588234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gLkHiVFLfQinEtCR5A80EmB0PNdVgt2JXMj6r0/B0l9Oikz53lkYVD9Ur0V5hsOfLKGTWxEyhw7J6N8X3wJQCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:49.588812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dab41fa1587946cfecf3df1fbdce679674d00a631402eb252e8dd91359d1e7bd","sha256:316fd5480fcaf677b68d39d681f3a9159fe15df28ebd8e93f00a59b9dd206d37"],"state_sha256":"5a920a0159928a0d55ae28f3b1698604751aafe6a6c774b32e351990476eb95a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pg8bAiEOJO9WGj2+9/A+4wWvTihKwuP0ofCtxsVzRKflRTCvuPIXIb9hxEoVRHkgiYatpRRlkei9Ka9t09lfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:51:54.115986Z","bundle_sha256":"a3afa2191075c29da497a941dccf9d7092cb63ee510c70b514489c464fb79ab9"}}