{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QYPKOAPJPX6IVVRG5XGUSGX7PS","short_pith_number":"pith:QYPKOAPJ","canonical_record":{"source":{"id":"1107.4896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-25T11:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"602305bd12a4310162ed0b1b6bef304f89630021a47ead9d67749cbca9d386fe","abstract_canon_sha256":"aeb37371ec4e6fcb2959f484edaf786e28df54ae9d963feecf5e80498ee153cc"},"schema_version":"1.0"},"canonical_sha256":"861ea701e97dfc8ad626edcd491aff7c84b0e6af46a95427e1a82ce200903efa","source":{"kind":"arxiv","id":"1107.4896","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4896","created_at":"2026-05-18T02:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4896v2","created_at":"2026-05-18T02:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4896","created_at":"2026-05-18T02:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"QYPKOAPJPX6I","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QYPKOAPJPX6IVVRG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QYPKOAPJ","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QYPKOAPJPX6IVVRG5XGUSGX7PS","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-25T11:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"602305bd12a4310162ed0b1b6bef304f89630021a47ead9d67749cbca9d386fe","abstract_canon_sha256":"aeb37371ec4e6fcb2959f484edaf786e28df54ae9d963feecf5e80498ee153cc"},"schema_version":"1.0"},"canonical_sha256":"861ea701e97dfc8ad626edcd491aff7c84b0e6af46a95427e1a82ce200903efa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:00.717859Z","signature_b64":"u3K9bsxv0sp9SUlSFKqjyy/XFO+O8Vo9XRcy6DjYwR8iT47hr/vQVqrmO2rbg86yjNSbWSem97If+E1q0WsJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"861ea701e97dfc8ad626edcd491aff7c84b0e6af46a95427e1a82ce200903efa","last_reissued_at":"2026-05-18T02:58:00.717151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:00.717151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4896","source_version":2,"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-18T02:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/p1fJ2Vt0+WO7CsEhEE8tP20rftRwQN/T5g3D3sJ54CZqvZmneRsjNmc5SMBgNJ0LdO+3zwFbcTDYhhRDLjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:11.625982Z"},"content_sha256":"79e694fc538343eb242597545bf115975e4e8fb9e825ca03206518aaed894fb0","schema_version":"1.0","event_id":"sha256:79e694fc538343eb242597545bf115975e4e8fb9e825ca03206518aaed894fb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QYPKOAPJPX6IVVRG5XGUSGX7PS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Wowzer Type Lower Bound for the Strong Regularity Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Subrahmanyam Kalyanasundaram","submitted_at":"2011-07-25T11:14:38Z","abstract_excerpt":"The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite graphs are. Alon, Fischer, Krivelevich and Szegedy obtained a powerful variant of the regularity lemma, which allows one to have an arbitrary control on this measure of quasi-randomness. However, their proof only guaranteed to produce a partition where the number of parts is given by the Wowzer function, which is the iterated version of the Tower function. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4896","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"},"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-18T02:58:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5Fd5vMNhBalaYFr5JcYw3WR9L1sdHa+/Q8yU+YrH6bsMkdswWUAgMte0p4eU/wyAT7IsB5S8aHfIggRIR68DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:11.626345Z"},"content_sha256":"d258df1425ad12175eda7aad1ce6224ce51793db469b9f72cac222211790f34c","schema_version":"1.0","event_id":"sha256:d258df1425ad12175eda7aad1ce6224ce51793db469b9f72cac222211790f34c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/bundle.json","state_url":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/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-30T23:51:11Z","links":{"resolver":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS","bundle":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/bundle.json","state":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QYPKOAPJPX6IVVRG5XGUSGX7PS","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":"aeb37371ec4e6fcb2959f484edaf786e28df54ae9d963feecf5e80498ee153cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-25T11:14:38Z","title_canon_sha256":"602305bd12a4310162ed0b1b6bef304f89630021a47ead9d67749cbca9d386fe"},"schema_version":"1.0","source":{"id":"1107.4896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4896","created_at":"2026-05-18T02:58:00Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4896v2","created_at":"2026-05-18T02:58:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4896","created_at":"2026-05-18T02:58:00Z"},{"alias_kind":"pith_short_12","alias_value":"QYPKOAPJPX6I","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QYPKOAPJPX6IVVRG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QYPKOAPJ","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:d258df1425ad12175eda7aad1ce6224ce51793db469b9f72cac222211790f34c","target":"graph","created_at":"2026-05-18T02:58:00Z","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":"The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite graphs are. Alon, Fischer, Krivelevich and Szegedy obtained a powerful variant of the regularity lemma, which allows one to have an arbitrary control on this measure of quasi-randomness. However, their proof only guaranteed to produce a partition where the number of parts is given by the Wowzer function, which is the iterated version of the Tower function. We","authors_text":"Asaf Shapira, Subrahmanyam Kalyanasundaram","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-25T11:14:38Z","title":"A Wowzer Type Lower Bound for the Strong Regularity Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4896","kind":"arxiv","version":2},"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:79e694fc538343eb242597545bf115975e4e8fb9e825ca03206518aaed894fb0","target":"record","created_at":"2026-05-18T02:58:00Z","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":"aeb37371ec4e6fcb2959f484edaf786e28df54ae9d963feecf5e80498ee153cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-25T11:14:38Z","title_canon_sha256":"602305bd12a4310162ed0b1b6bef304f89630021a47ead9d67749cbca9d386fe"},"schema_version":"1.0","source":{"id":"1107.4896","kind":"arxiv","version":2}},"canonical_sha256":"861ea701e97dfc8ad626edcd491aff7c84b0e6af46a95427e1a82ce200903efa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"861ea701e97dfc8ad626edcd491aff7c84b0e6af46a95427e1a82ce200903efa","first_computed_at":"2026-05-18T02:58:00.717151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:00.717151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u3K9bsxv0sp9SUlSFKqjyy/XFO+O8Vo9XRcy6DjYwR8iT47hr/vQVqrmO2rbg86yjNSbWSem97If+E1q0WsJBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:00.717859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79e694fc538343eb242597545bf115975e4e8fb9e825ca03206518aaed894fb0","sha256:d258df1425ad12175eda7aad1ce6224ce51793db469b9f72cac222211790f34c"],"state_sha256":"ee23cd3c5bc81e9174ed348ef491e17238190537db104eb077f74247ad3aa4c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+9mLzeDk2pwp0kXRXugpGGpCHfyaFAgh2AKXTp/hsA51f0d3wHzGkX9Kq0PHlwMA/cmaOjN8iJfrkaB3GjHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:51:11.629399Z","bundle_sha256":"c473285ebc2912e8822bc1801aa1eacebc4e6e4913a8888bfa1d96ffde0d306c"}}