{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4SHG3UYCB5SPMW46JY4GTACWNC","short_pith_number":"pith:4SHG3UYC","canonical_record":{"source":{"id":"1610.02676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-09T13:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"ce10371b80d6ffe6f794b61d7afc82787dc16db97aa98ca8e444cc0bec6861fc","abstract_canon_sha256":"d6625b5bfd9ce15eb38a2e28d731f00bf75a0ded7ae7f77083625449cdc56998"},"schema_version":"1.0"},"canonical_sha256":"e48e6dd3020f64f65b9e4e386980566895ec32ea03560e67b92f6ec9301c9867","source":{"kind":"arxiv","id":"1610.02676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02676","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02676v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02676","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"4SHG3UYCB5SP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4SHG3UYCB5SPMW46","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4SHG3UYC","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4SHG3UYCB5SPMW46JY4GTACWNC","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-09T13:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"ce10371b80d6ffe6f794b61d7afc82787dc16db97aa98ca8e444cc0bec6861fc","abstract_canon_sha256":"d6625b5bfd9ce15eb38a2e28d731f00bf75a0ded7ae7f77083625449cdc56998"},"schema_version":"1.0"},"canonical_sha256":"e48e6dd3020f64f65b9e4e386980566895ec32ea03560e67b92f6ec9301c9867","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.970493Z","signature_b64":"erTFTtyl8o88ovna6gfqHoTRkpoIAfABye+a2rYkex7kWQaSYDBgY4g/OdzXDt+/4aiyhBgXTJgiuZGCAuiaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e48e6dd3020f64f65b9e4e386980566895ec32ea03560e67b92f6ec9301c9867","last_reissued_at":"2026-05-18T01:02:50.970061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.970061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02676","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:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swwpH12bxIpTkJpxMVQwhouQMTSYHobhYUkajfdJ99j1aCQWL3EsA+OJGKLfp+WkNO7ckC/IUyYGF35SyainCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:26:33.066607Z"},"content_sha256":"3192ce642f98f9f5bccb0842ea407a0e8552c99f0ca530dd3e97ca04345057ca","schema_version":"1.0","event_id":"sha256:3192ce642f98f9f5bccb0842ea407a0e8552c99f0ca530dd3e97ca04345057ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4SHG3UYCB5SPMW46JY4GTACWNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sparse Regular Approximation Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Guy Moshkovitz","submitted_at":"2016-10-09T13:36:20Z","abstract_excerpt":"We introduce a new variant of Szemer\\'edi's regularity lemma which we call the \"sparse regular approximation lemma\" (SRAL). The input to this lemma is a graph $G$ of edge density $p$ and parameters $\\epsilon, \\delta$, where we think of $\\delta$ as a constant. The goal is to construct an $\\epsilon$-regular partition of $G$ while having the freedom to add/remove up to $\\delta |E(G)|$ edges. As we show here, this weaker variant of the regularity lemma already suffices for proving the graph removal lemma and the hypergraph regularity lemma, which are two of the main applications of the (standard) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02676","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:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWbusxJlTR0OR2UwpCKZAsW9ju009x5uxUbie4lobLacjW3KJuhRqHTrBwRaXAP8YphdbD47ea0J/Gh7xqJGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:26:33.066969Z"},"content_sha256":"2bbf91b73b37d7d1e73bfedade9f6e2d9154216e0f2e6dbe18bc2a832df926f0","schema_version":"1.0","event_id":"sha256:2bbf91b73b37d7d1e73bfedade9f6e2d9154216e0f2e6dbe18bc2a832df926f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SHG3UYCB5SPMW46JY4GTACWNC/bundle.json","state_url":"https://pith.science/pith/4SHG3UYCB5SPMW46JY4GTACWNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SHG3UYCB5SPMW46JY4GTACWNC/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-01T06:26:33Z","links":{"resolver":"https://pith.science/pith/4SHG3UYCB5SPMW46JY4GTACWNC","bundle":"https://pith.science/pith/4SHG3UYCB5SPMW46JY4GTACWNC/bundle.json","state":"https://pith.science/pith/4SHG3UYCB5SPMW46JY4GTACWNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SHG3UYCB5SPMW46JY4GTACWNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4SHG3UYCB5SPMW46JY4GTACWNC","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":"d6625b5bfd9ce15eb38a2e28d731f00bf75a0ded7ae7f77083625449cdc56998","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-09T13:36:20Z","title_canon_sha256":"ce10371b80d6ffe6f794b61d7afc82787dc16db97aa98ca8e444cc0bec6861fc"},"schema_version":"1.0","source":{"id":"1610.02676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02676","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02676v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02676","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"4SHG3UYCB5SP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4SHG3UYCB5SPMW46","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4SHG3UYC","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:2bbf91b73b37d7d1e73bfedade9f6e2d9154216e0f2e6dbe18bc2a832df926f0","target":"graph","created_at":"2026-05-18T01:02:50Z","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":"We introduce a new variant of Szemer\\'edi's regularity lemma which we call the \"sparse regular approximation lemma\" (SRAL). The input to this lemma is a graph $G$ of edge density $p$ and parameters $\\epsilon, \\delta$, where we think of $\\delta$ as a constant. The goal is to construct an $\\epsilon$-regular partition of $G$ while having the freedom to add/remove up to $\\delta |E(G)|$ edges. As we show here, this weaker variant of the regularity lemma already suffices for proving the graph removal lemma and the hypergraph regularity lemma, which are two of the main applications of the (standard) ","authors_text":"Asaf Shapira, Guy Moshkovitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-09T13:36:20Z","title":"A Sparse Regular Approximation Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02676","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:3192ce642f98f9f5bccb0842ea407a0e8552c99f0ca530dd3e97ca04345057ca","target":"record","created_at":"2026-05-18T01:02:50Z","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":"d6625b5bfd9ce15eb38a2e28d731f00bf75a0ded7ae7f77083625449cdc56998","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-09T13:36:20Z","title_canon_sha256":"ce10371b80d6ffe6f794b61d7afc82787dc16db97aa98ca8e444cc0bec6861fc"},"schema_version":"1.0","source":{"id":"1610.02676","kind":"arxiv","version":1}},"canonical_sha256":"e48e6dd3020f64f65b9e4e386980566895ec32ea03560e67b92f6ec9301c9867","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e48e6dd3020f64f65b9e4e386980566895ec32ea03560e67b92f6ec9301c9867","first_computed_at":"2026-05-18T01:02:50.970061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:50.970061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"erTFTtyl8o88ovna6gfqHoTRkpoIAfABye+a2rYkex7kWQaSYDBgY4g/OdzXDt+/4aiyhBgXTJgiuZGCAuiaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:50.970493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3192ce642f98f9f5bccb0842ea407a0e8552c99f0ca530dd3e97ca04345057ca","sha256:2bbf91b73b37d7d1e73bfedade9f6e2d9154216e0f2e6dbe18bc2a832df926f0"],"state_sha256":"5fffbcf3948da5e6d308284b19a3a83e9f193a760a27daf400629d5e48ab3b91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4ugeR8RYxLlFUKULejhwrzNmUHLWQZ1NBEIq/R0qgBfGB0LbbO+AA6UgokjPwgJQ8IfGQdLucNGC9HzBkNVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:26:33.069103Z","bundle_sha256":"84ced85573949a9f9c79f48b3c90033ecf0133aa7318e6850a834f7216cc2432"}}