{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C4PAJJX7X7UAIJ4JHSU4OYZBTX","short_pith_number":"pith:C4PAJJX7","schema_version":"1.0","canonical_sha256":"171e04a6ffbfe80427893ca9c763219dd0896e6c867d01d79abab0b6150183a9","source":{"kind":"arxiv","id":"1611.02099","version":2},"attestation_state":"computed","paper":{"title":"Hereditary quasirandomness without regularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","submitted_at":"2016-11-07T15:18:10Z","abstract_excerpt":"A result of Simonovits and S\\'os states that for any fixed graph $H$ and any $\\epsilon > 0$ there exists $\\delta > 0$ such that if $G$ is an $n$-vertex graph with the property that every $S \\subseteq V(G)$ contains $p^{e(H)} |S|^{v(H)} \\pm \\delta n^{v(H)}$ labeled copies of $H$, then $G$ is quasirandom in the sense that every $S \\subseteq V(G)$ contains $\\frac{1}{2} p |S|^2 \\pm \\epsilon n^2$ edges. The original proof of this result makes heavy use of the regularity lemma, resulting in a bound on $\\delta^{-1}$ which is a tower of twos of height polynomial in $\\epsilon^{-1}$. We give an alternat"},"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":"1611.02099","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T15:18:10Z","cross_cats_sorted":[],"title_canon_sha256":"ac0475236f1169f51fce870ce1439a4a289f07037ef6d26a6be6e1ba2524c7e7","abstract_canon_sha256":"03ef65f07fb93bcb13f1c2db4f5287adb56bb5771bc3160d5954b82f704e1b54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:10.405077Z","signature_b64":"wGtHCtQn7mW7CW6elZePlvQ3BTOCj+1dCpEFzPF+qF8EdMyVedbMzk6soVlfTGLlpUv0lraL4jOEP9vW6b+NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"171e04a6ffbfe80427893ca9c763219dd0896e6c867d01d79abab0b6150183a9","last_reissued_at":"2026-05-18T00:54:10.404634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:10.404634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hereditary quasirandomness without regularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","submitted_at":"2016-11-07T15:18:10Z","abstract_excerpt":"A result of Simonovits and S\\'os states that for any fixed graph $H$ and any $\\epsilon > 0$ there exists $\\delta > 0$ such that if $G$ is an $n$-vertex graph with the property that every $S \\subseteq V(G)$ contains $p^{e(H)} |S|^{v(H)} \\pm \\delta n^{v(H)}$ labeled copies of $H$, then $G$ is quasirandom in the sense that every $S \\subseteq V(G)$ contains $\\frac{1}{2} p |S|^2 \\pm \\epsilon n^2$ edges. The original proof of this result makes heavy use of the regularity lemma, resulting in a bound on $\\delta^{-1}$ which is a tower of twos of height polynomial in $\\epsilon^{-1}$. We give an alternat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02099","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":"1611.02099","created_at":"2026-05-18T00:54:10.404707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02099v2","created_at":"2026-05-18T00:54:10.404707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02099","created_at":"2026-05-18T00:54:10.404707+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4PAJJX7X7UA","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4PAJJX7X7UAIJ4J","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4PAJJX7","created_at":"2026-05-18T12:30:09.641336+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/C4PAJJX7X7UAIJ4JHSU4OYZBTX","json":"https://pith.science/pith/C4PAJJX7X7UAIJ4JHSU4OYZBTX.json","graph_json":"https://pith.science/api/pith-number/C4PAJJX7X7UAIJ4JHSU4OYZBTX/graph.json","events_json":"https://pith.science/api/pith-number/C4PAJJX7X7UAIJ4JHSU4OYZBTX/events.json","paper":"https://pith.science/paper/C4PAJJX7"},"agent_actions":{"view_html":"https://pith.science/pith/C4PAJJX7X7UAIJ4JHSU4OYZBTX","download_json":"https://pith.science/pith/C4PAJJX7X7UAIJ4JHSU4OYZBTX.json","view_paper":"https://pith.science/paper/C4PAJJX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02099&json=true","fetch_graph":"https://pith.science/api/pith-number/C4PAJJX7X7UAIJ4JHSU4OYZBTX/graph.json","fetch_events":"https://pith.science/api/pith-number/C4PAJJX7X7UAIJ4JHSU4OYZBTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4PAJJX7X7UAIJ4JHSU4OYZBTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4PAJJX7X7UAIJ4JHSU4OYZBTX/action/storage_attestation","attest_author":"https://pith.science/pith/C4PAJJX7X7UAIJ4JHSU4OYZBTX/action/author_attestation","sign_citation":"https://pith.science/pith/C4PAJJX7X7UAIJ4JHSU4OYZBTX/action/citation_signature","submit_replication":"https://pith.science/pith/C4PAJJX7X7UAIJ4JHSU4OYZBTX/action/replication_record"}},"created_at":"2026-05-18T00:54:10.404707+00:00","updated_at":"2026-05-18T00:54:10.404707+00:00"}