{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1996:OWBQIXFOX3TATMJ2ODTX7ZTPXZ","short_pith_number":"pith:OWBQIXFO","canonical_record":{"source":{"id":"math/9612213","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"fd2d10c72fcf2657ab7d0c3fc85b6c9ddb726b8d4ca41fb05b1952080577ac80","abstract_canon_sha256":"b4c5303677352aaaa26bf214ac021892ecd7f6b9ae7d0cfa8f722e6fe52f8b87"},"schema_version":"1.0"},"canonical_sha256":"7583045caebee609b13a70e77fe66fbe707d49a91d4d837bac22f2b5d2cdb98d","source":{"kind":"arxiv","id":"math/9612213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9612213","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"math/9612213v1","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9612213","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"OWBQIXFOX3TA","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"OWBQIXFOX3TATMJ2","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"OWBQIXFO","created_at":"2026-05-18T12:25:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1996:OWBQIXFOX3TATMJ2ODTX7ZTPXZ","target":"record","payload":{"canonical_record":{"source":{"id":"math/9612213","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"fd2d10c72fcf2657ab7d0c3fc85b6c9ddb726b8d4ca41fb05b1952080577ac80","abstract_canon_sha256":"b4c5303677352aaaa26bf214ac021892ecd7f6b9ae7d0cfa8f722e6fe52f8b87"},"schema_version":"1.0"},"canonical_sha256":"7583045caebee609b13a70e77fe66fbe707d49a91d4d837bac22f2b5d2cdb98d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:37.376331Z","signature_b64":"EkM2mIQ15K8JceuvDfKaNQiH87zh5p2M8Y6YVYaPIVOyvrJA3+haZyEFiunQgxzCw/iIrjv5qIDZErRQW+joAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7583045caebee609b13a70e77fe66fbe707d49a91d4d837bac22f2b5d2cdb98d","last_reissued_at":"2026-05-18T01:05:37.375857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:37.375857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/9612213","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-18T01:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5dKia2p1Zg5TIF5QNI63NEQ5f+DLWk3rgR2CUyjCu/EBFKiq5gVLDhCHmWE1E8PiF7D8vERuzUNYGod9xPVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:20:04.154599Z"},"content_sha256":"955b7dfd5a8d15d3c0b33e736daa14f022da21b3070a200f6545118c2a07e61f","schema_version":"1.0","event_id":"sha256:955b7dfd5a8d15d3c0b33e736daa14f022da21b3070a200f6545118c2a07e61f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1996:OWBQIXFOX3TATMJ2ODTX7ZTPXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithmic Version of the Blow-up Lemma","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Szemer\\'edi, Gabor N. Sarkozy, J\\'anos Koml\\'os","submitted_at":"1996-12-04T00:00:00Z","abstract_excerpt":"Recently we have developed a new method in graph theory based on the Regularity Lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, beside the Regularity Lemma, is the so-called Blow-up Lemma. This lemma helps to find bounded degree spanning subgraphs in $\\varepsilon$-regular graphs. Our original proof of the lemma is not algorithmic, it applies probabilistic methods. In this paper we provide an algorithmic version of the Blow-up Lemma. The desired subgraph, for an $n$-vertex graph, can be found in time $O(nM(n))$, where $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9612213","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-18T01:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xodAqUM/VwfEsHnme2/tyTO+y5UemHUtv8MkBjSgdk6ul23mN++7+A09hn5ZuGGWAm/LPZjRw2w676umyunrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:20:04.154974Z"},"content_sha256":"b590243c45eedc47d740eb6b9cfb605101adfd7ffc69ec6f3baf9456844c2e8a","schema_version":"1.0","event_id":"sha256:b590243c45eedc47d740eb6b9cfb605101adfd7ffc69ec6f3baf9456844c2e8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWBQIXFOX3TATMJ2ODTX7ZTPXZ/bundle.json","state_url":"https://pith.science/pith/OWBQIXFOX3TATMJ2ODTX7ZTPXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWBQIXFOX3TATMJ2ODTX7ZTPXZ/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-06-01T10:20:04Z","links":{"resolver":"https://pith.science/pith/OWBQIXFOX3TATMJ2ODTX7ZTPXZ","bundle":"https://pith.science/pith/OWBQIXFOX3TATMJ2ODTX7ZTPXZ/bundle.json","state":"https://pith.science/pith/OWBQIXFOX3TATMJ2ODTX7ZTPXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWBQIXFOX3TATMJ2ODTX7ZTPXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1996:OWBQIXFOX3TATMJ2ODTX7ZTPXZ","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":"b4c5303677352aaaa26bf214ac021892ecd7f6b9ae7d0cfa8f722e6fe52f8b87","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","title_canon_sha256":"fd2d10c72fcf2657ab7d0c3fc85b6c9ddb726b8d4ca41fb05b1952080577ac80"},"schema_version":"1.0","source":{"id":"math/9612213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9612213","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"math/9612213v1","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9612213","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"OWBQIXFOX3TA","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"OWBQIXFOX3TATMJ2","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"OWBQIXFO","created_at":"2026-05-18T12:25:48Z"}],"graph_snapshots":[{"event_id":"sha256:b590243c45eedc47d740eb6b9cfb605101adfd7ffc69ec6f3baf9456844c2e8a","target":"graph","created_at":"2026-05-18T01:05:37Z","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":"Recently we have developed a new method in graph theory based on the Regularity Lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, beside the Regularity Lemma, is the so-called Blow-up Lemma. This lemma helps to find bounded degree spanning subgraphs in $\\varepsilon$-regular graphs. Our original proof of the lemma is not algorithmic, it applies probabilistic methods. In this paper we provide an algorithmic version of the Blow-up Lemma. The desired subgraph, for an $n$-vertex graph, can be found in time $O(nM(n))$, where $","authors_text":"Endre Szemer\\'edi, Gabor N. Sarkozy, J\\'anos Koml\\'os","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","title":"An Algorithmic Version of the Blow-up Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9612213","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:955b7dfd5a8d15d3c0b33e736daa14f022da21b3070a200f6545118c2a07e61f","target":"record","created_at":"2026-05-18T01:05:37Z","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":"b4c5303677352aaaa26bf214ac021892ecd7f6b9ae7d0cfa8f722e6fe52f8b87","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","title_canon_sha256":"fd2d10c72fcf2657ab7d0c3fc85b6c9ddb726b8d4ca41fb05b1952080577ac80"},"schema_version":"1.0","source":{"id":"math/9612213","kind":"arxiv","version":1}},"canonical_sha256":"7583045caebee609b13a70e77fe66fbe707d49a91d4d837bac22f2b5d2cdb98d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7583045caebee609b13a70e77fe66fbe707d49a91d4d837bac22f2b5d2cdb98d","first_computed_at":"2026-05-18T01:05:37.375857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:37.375857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EkM2mIQ15K8JceuvDfKaNQiH87zh5p2M8Y6YVYaPIVOyvrJA3+haZyEFiunQgxzCw/iIrjv5qIDZErRQW+joAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:37.376331Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9612213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:955b7dfd5a8d15d3c0b33e736daa14f022da21b3070a200f6545118c2a07e61f","sha256:b590243c45eedc47d740eb6b9cfb605101adfd7ffc69ec6f3baf9456844c2e8a"],"state_sha256":"b1add064d388906f04bf7465009c548c17a07e68e94416257f208e32820db0e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFwdyG70TfExsPTEcGPWq5ciqymSfVRjZT1d2i+xp0mZo+fCqFg9HqY5iT1BWgN7IdfG7m9SdxwNUDqBjgXZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:20:04.157051Z","bundle_sha256":"7034213a4a1705b08a8e85190707bc025b5c288647e8f20a27644f999a576e80"}}