{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZZBBSD6FCCECX76KGJQ7DXYLTP","short_pith_number":"pith:ZZBBSD6F","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"},"canonical_sha256":"ce42190fc510882bffca3261f1df0b9bcf05ce55d0ff6f9e628cc4d902c5a89b","source":{"kind":"arxiv","id":"2607.08261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08261","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08261v1","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08261","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZZBBSD6FCCEC","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZZBBSD6FCCECX76K","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZZBBSD6F","created_at":"2026-07-10T01:19:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZZBBSD6FCCECX76KGJQ7DXYLTP","target":"record","payload":{"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"},"canonical_sha256":"ce42190fc510882bffca3261f1df0b9bcf05ce55d0ff6f9e628cc4d902c5a89b","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"},"source_kind":"arxiv","source_id":"2607.08261","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-07-10T01:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+egDResP3V0rit6Y60ptA8Dwd2VlUGkM8BLU6kYYA15tTs0IAPlex3xz7C28Mh6TUMX2RMZYPaE4Km3vocflAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:19:30.246767Z"},"content_sha256":"75d13cbd88c33711597f661337e4c170b35b51c80f747f378856726b5c9e9996","schema_version":"1.0","event_id":"sha256:75d13cbd88c33711597f661337e4c170b35b51c80f747f378856726b5c9e9996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZZBBSD6FCCECX76KGJQ7DXYLTP","target":"graph","payload":{"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"},"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-07-10T01:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bjtM9hjbP9OGNM73HT32bJ9Esy9KTzaZbRm/JZ2uXTRnfjYhxBg5IDP5jHS8xp/521dFMSWNZo2STCUgWA0SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:19:30.247635Z"},"content_sha256":"d7a165d6c5b0efea4b68f35400b89dc8ee965c50394d3e5a586bb2f391c7d172","schema_version":"1.0","event_id":"sha256:d7a165d6c5b0efea4b68f35400b89dc8ee965c50394d3e5a586bb2f391c7d172"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/bundle.json","state_url":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/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-08-05T13:19:30Z","links":{"resolver":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP","bundle":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/bundle.json","state":"https://pith.science/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZBBSD6FCCECX76KGJQ7DXYLTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZZBBSD6FCCECX76KGJQ7DXYLTP","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":"fa570d5647bd3da4b3793a7fb602ca4be18674aeaa8d031cf69361f5b06f7a1a","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T09:05:00Z","title_canon_sha256":"10eeedae30ae2daf32f3a47c85a904952c1e3fa31bdc0b629ba1853c75db2e1a"},"schema_version":"1.0","source":{"id":"2607.08261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08261","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08261v1","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08261","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZZBBSD6FCCEC","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZZBBSD6FCCECX76K","created_at":"2026-07-10T01:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZZBBSD6F","created_at":"2026-07-10T01:19:31Z"}],"graph_snapshots":[{"event_id":"sha256:d7a165d6c5b0efea4b68f35400b89dc8ee965c50394d3e5a586bb2f391c7d172","target":"graph","created_at":"2026-07-10T01:19:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.08261/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Arpon Basu, Pravesh K. Kothari, Raghu Meka, Stefan Tudose","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T09:05:00Z","title":"Optimal Sparsifiers for Abelian Cayley Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08261","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:75d13cbd88c33711597f661337e4c170b35b51c80f747f378856726b5c9e9996","target":"record","created_at":"2026-07-10T01:19:31Z","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":"fa570d5647bd3da4b3793a7fb602ca4be18674aeaa8d031cf69361f5b06f7a1a","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T09:05:00Z","title_canon_sha256":"10eeedae30ae2daf32f3a47c85a904952c1e3fa31bdc0b629ba1853c75db2e1a"},"schema_version":"1.0","source":{"id":"2607.08261","kind":"arxiv","version":1}},"canonical_sha256":"ce42190fc510882bffca3261f1df0b9bcf05ce55d0ff6f9e628cc4d902c5a89b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce42190fc510882bffca3261f1df0b9bcf05ce55d0ff6f9e628cc4d902c5a89b","first_computed_at":"2026-07-10T01:19:31.175044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T01:19:31.175044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ddobAksPuX69k9XwVhD6oikrUskV1hA2iaOMCQm7VOH+es3uQsKncFj8Pt0n9+ngAHf75egCNFQocX3R82RoDQ==","signature_status":"signed_v1","signed_at":"2026-07-10T01:19:31.175443Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.08261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75d13cbd88c33711597f661337e4c170b35b51c80f747f378856726b5c9e9996","sha256:d7a165d6c5b0efea4b68f35400b89dc8ee965c50394d3e5a586bb2f391c7d172"],"state_sha256":"6a06cdb012b726c349559f3c0629cff5d166f7833278162bcd6c54f3ad542ee9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5midaweJQyMCMU8M+2GlsxoGj2b7jShzlFrG8PXuMp+oW1rZdWoq83iU5mlRJYa8KR3B8mXyU3BvzT3+5DZRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:19:30.261875Z","bundle_sha256":"7e6292655a6a4dd02fa60a879ae30ab60fe0795c770dc58199fa92ed4cb7b3e6"}}