{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QYPKOAPJPX6IVVRG5XGUSGX7PS","short_pith_number":"pith:QYPKOAPJ","schema_version":"1.0","canonical_sha256":"861ea701e97dfc8ad626edcd491aff7c84b0e6af46a95427e1a82ce200903efa","source":{"kind":"arxiv","id":"1107.4896","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.4896","created_at":"2026-05-18T02:58:00.717269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4896v2","created_at":"2026-05-18T02:58:00.717269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4896","created_at":"2026-05-18T02:58:00.717269+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYPKOAPJPX6I","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYPKOAPJPX6IVVRG","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYPKOAPJ","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS","json":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS.json","graph_json":"https://pith.science/api/pith-number/QYPKOAPJPX6IVVRG5XGUSGX7PS/graph.json","events_json":"https://pith.science/api/pith-number/QYPKOAPJPX6IVVRG5XGUSGX7PS/events.json","paper":"https://pith.science/paper/QYPKOAPJ"},"agent_actions":{"view_html":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS","download_json":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS.json","view_paper":"https://pith.science/paper/QYPKOAPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4896&json=true","fetch_graph":"https://pith.science/api/pith-number/QYPKOAPJPX6IVVRG5XGUSGX7PS/graph.json","fetch_events":"https://pith.science/api/pith-number/QYPKOAPJPX6IVVRG5XGUSGX7PS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/action/storage_attestation","attest_author":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/action/author_attestation","sign_citation":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/action/citation_signature","submit_replication":"https://pith.science/pith/QYPKOAPJPX6IVVRG5XGUSGX7PS/action/replication_record"}},"created_at":"2026-05-18T02:58:00.717269+00:00","updated_at":"2026-05-18T02:58:00.717269+00:00"}