{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZZBBSD6FCCECX76KGJQ7DXYLTP","short_pith_number":"pith:ZZBBSD6F","schema_version":"1.0","canonical_sha256":"ce42190fc510882bffca3261f1df0b9bcf05ce55d0ff6f9e628cc4d902c5a89b","source":{"kind":"arxiv","id":"2607.08261","version":1},"attestation_state":"computed","paper":{"title":"Optimal Sparsifiers for Abelian Cayley Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Arpon Basu, Pravesh K. Kothari, Raghu Meka, Stefan Tudose","submitted_at":"2026-07-09T09:05:00Z","abstract_excerpt":"We prove that for every Cayley graph $\\mathcal{G}$ over any finite abelian group $G$, there is a weighted Cayley graph with $O(\\log |G|)$ generators that is a spectral sparsifier for $\\mathcal{G}$. This bound is optimal. Applying our bound to the group $G = \\mathbb{F}_2^n$, yields, as a corollary, $O(n/\\varepsilon^2)$-sized code sparsifiers for $\\mathbb{F}_2$-linear codes, improving on the work of Khanna, Putterman and Sudan (SODA'24) who obtained a similar result with an additional $\\mathrm{polylog}(n)$ loss.\n  Our proof is strongly inspired by a recent work of Reis and Rothvoss for the const"},"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":"2607.08261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T09:05:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"10eeedae30ae2daf32f3a47c85a904952c1e3fa31bdc0b629ba1853c75db2e1a","abstract_canon_sha256":"fa570d5647bd3da4b3793a7fb602ca4be18674aeaa8d031cf69361f5b06f7a1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:31.175443Z","signature_b64":"ddobAksPuX69k9XwVhD6oikrUskV1hA2iaOMCQm7VOH+es3uQsKncFj8Pt0n9+ngAHf75egCNFQocX3R82RoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce42190fc510882bffca3261f1df0b9bcf05ce55d0ff6f9e628cc4d902c5a89b","last_reissued_at":"2026-07-10T01:19:31.175044Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:31.175044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sparsifiers for Abelian Cayley Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Arpon Basu, Pravesh K. Kothari, Raghu Meka, Stefan Tudose","submitted_at":"2026-07-09T09:05:00Z","abstract_excerpt":"We prove that for every Cayley graph $\\mathcal{G}$ over any finite abelian group $G$, there is a weighted Cayley graph with $O(\\log |G|)$ generators that is a spectral sparsifier for $\\mathcal{G}$. This bound is optimal. Applying our bound to the group $G = \\mathbb{F}_2^n$, yields, as a corollary, $O(n/\\varepsilon^2)$-sized code sparsifiers for $\\mathbb{F}_2$-linear codes, improving on the work of Khanna, Putterman and Sudan (SODA'24) who obtained a similar result with an additional $\\mathrm{polylog}(n)$ loss.\n  Our proof is strongly inspired by a recent work of Reis and Rothvoss for the const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08261","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.08261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.08261","created_at":"2026-07-10T01:19:31.175102+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08261v1","created_at":"2026-07-10T01:19:31.175102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08261","created_at":"2026-07-10T01:19:31.175102+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZBBSD6FCCEC","created_at":"2026-07-10T01:19:31.175102+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZBBSD6FCCECX76K","created_at":"2026-07-10T01:19:31.175102+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZBBSD6F","created_at":"2026-07-10T01:19:31.175102+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/ZZBBSD6FCCECX76KGJQ7DXYLTP","json":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP.json","graph_json":"https://pith.science/api/pith-number/ZZBBSD6FCCECX76KGJQ7DXYLTP/graph.json","events_json":"https://pith.science/api/pith-number/ZZBBSD6FCCECX76KGJQ7DXYLTP/events.json","paper":"https://pith.science/paper/ZZBBSD6F"},"agent_actions":{"view_html":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP","download_json":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP.json","view_paper":"https://pith.science/paper/ZZBBSD6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08261&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZBBSD6FCCECX76KGJQ7DXYLTP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZBBSD6FCCECX76KGJQ7DXYLTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/action/storage_attestation","attest_author":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/action/author_attestation","sign_citation":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/action/citation_signature","submit_replication":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/action/replication_record"}},"created_at":"2026-07-10T01:19:31.175102+00:00","updated_at":"2026-07-10T01:19:31.175102+00:00"}