{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CLSZR5EUPYGAUM4E5GFYJEQ32Z","short_pith_number":"pith:CLSZR5EU","schema_version":"1.0","canonical_sha256":"12e598f4947e0c0a3384e98b84921bd676fa247d66f537439cf94bfc9f0432bb","source":{"kind":"arxiv","id":"1604.00733","version":4},"attestation_state":"computed","paper":{"title":"On regularity lemmas and their algorithmic applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, L\\'aszl\\'o Mikl\\'os Lov\\'asz, Yufei Zhao","submitted_at":"2016-04-04T03:54:06Z","abstract_excerpt":"Szemer\\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that the desired vertex partition in the regularity lemma is equitable has a minimal effect on the number of parts of the partition. Second, we use an algorithmic version of the (weak) Frieze--Kannan regularity lemma to give a substantially faster deterministic approximation algorithm for counting subgraphs in a graph. Previously, only an exponential dependence "},"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":"1604.00733","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-04T03:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"37b9ed47c7878c49cefa9e6e4e4b92d820ef4ea7199cf43065863904ac038776","abstract_canon_sha256":"2d8613c4a8f73f2d73ac4bc69a2c81e97de0a255ea447a65c53bc9a5918d99b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:53.303434Z","signature_b64":"Vair9VBxxPWYh65SqcqKrbduf7CKnLiaduNfL31E0/85hsiumIQFlz4SRYnfjO/GVU6tkZry1Sj+xoiCi5VjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12e598f4947e0c0a3384e98b84921bd676fa247d66f537439cf94bfc9f0432bb","last_reissued_at":"2026-05-17T23:48:53.302919Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:53.302919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On regularity lemmas and their algorithmic applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, L\\'aszl\\'o Mikl\\'os Lov\\'asz, Yufei Zhao","submitted_at":"2016-04-04T03:54:06Z","abstract_excerpt":"Szemer\\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that the desired vertex partition in the regularity lemma is equitable has a minimal effect on the number of parts of the partition. Second, we use an algorithmic version of the (weak) Frieze--Kannan regularity lemma to give a substantially faster deterministic approximation algorithm for counting subgraphs in a graph. Previously, only an exponential dependence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00733","kind":"arxiv","version":4},"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":"1604.00733","created_at":"2026-05-17T23:48:53.302995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00733v4","created_at":"2026-05-17T23:48:53.302995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00733","created_at":"2026-05-17T23:48:53.302995+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLSZR5EUPYGA","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLSZR5EUPYGAUM4E","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLSZR5EU","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/CLSZR5EUPYGAUM4E5GFYJEQ32Z","json":"https://pith.science/pith/CLSZR5EUPYGAUM4E5GFYJEQ32Z.json","graph_json":"https://pith.science/api/pith-number/CLSZR5EUPYGAUM4E5GFYJEQ32Z/graph.json","events_json":"https://pith.science/api/pith-number/CLSZR5EUPYGAUM4E5GFYJEQ32Z/events.json","paper":"https://pith.science/paper/CLSZR5EU"},"agent_actions":{"view_html":"https://pith.science/pith/CLSZR5EUPYGAUM4E5GFYJEQ32Z","download_json":"https://pith.science/pith/CLSZR5EUPYGAUM4E5GFYJEQ32Z.json","view_paper":"https://pith.science/paper/CLSZR5EU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00733&json=true","fetch_graph":"https://pith.science/api/pith-number/CLSZR5EUPYGAUM4E5GFYJEQ32Z/graph.json","fetch_events":"https://pith.science/api/pith-number/CLSZR5EUPYGAUM4E5GFYJEQ32Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLSZR5EUPYGAUM4E5GFYJEQ32Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLSZR5EUPYGAUM4E5GFYJEQ32Z/action/storage_attestation","attest_author":"https://pith.science/pith/CLSZR5EUPYGAUM4E5GFYJEQ32Z/action/author_attestation","sign_citation":"https://pith.science/pith/CLSZR5EUPYGAUM4E5GFYJEQ32Z/action/citation_signature","submit_replication":"https://pith.science/pith/CLSZR5EUPYGAUM4E5GFYJEQ32Z/action/replication_record"}},"created_at":"2026-05-17T23:48:53.302995+00:00","updated_at":"2026-05-17T23:48:53.302995+00:00"}