{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HHOULELY55VAVEPLYKRNPOD5NO","short_pith_number":"pith:HHOULELY","schema_version":"1.0","canonical_sha256":"39dd459178ef6a0a91ebc2a2d7b87d6baf10f6a134034f81273ac1bab4012dcc","source":{"kind":"arxiv","id":"2606.23579","version":1},"attestation_state":"computed","paper":{"title":"Optimal Small Set Expanders and Their Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Marcelo Fiori, Mauricio Velasco, Pedro Raigorodsky, Tristram Bogart","submitted_at":"2026-06-22T16:46:20Z","abstract_excerpt":"A left-regular bipartite graph $G$ of degree $d$ is called a $(t,\\alpha)$-small-set-expander if every subset $X$ of left vertices of size at most $t$ has at least $\\alpha |X|$ neighbors. Such a graph is an optimal small-set expander if small subsets have as many neighbors as possible. We characterize optimal expanders combinatorially via girth and prove the existence of $s$-optimal expanders for every $s$. We also prove that $s$-optimality yields new \"transfer\" lower bounds on the number of neighbors of sets of size $h\\geq s$. Finally, as an application, we discuss the use of optimal small-set"},"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":"2606.23579","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T16:46:20Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"857769cc5e66f30da2627e76cce8e4d84c05708fabc051c509ed3540bc5edfa9","abstract_canon_sha256":"1c2cd49936bba7c5ca516dd0dea2e679e61eaac7cf852c429014a7500db2e0ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:31.375737Z","signature_b64":"Yx/aV8AVdon3hhDovUnnKEC0kHRgfw38poCNk7EfKiklzxhOdF8Kw6olMLVXrD/M5cWQt9TFuQr78HHAzyKYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39dd459178ef6a0a91ebc2a2d7b87d6baf10f6a134034f81273ac1bab4012dcc","last_reissued_at":"2026-06-23T03:14:31.375342Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:31.375342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Small Set Expanders and Their Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Marcelo Fiori, Mauricio Velasco, Pedro Raigorodsky, Tristram Bogart","submitted_at":"2026-06-22T16:46:20Z","abstract_excerpt":"A left-regular bipartite graph $G$ of degree $d$ is called a $(t,\\alpha)$-small-set-expander if every subset $X$ of left vertices of size at most $t$ has at least $\\alpha |X|$ neighbors. Such a graph is an optimal small-set expander if small subsets have as many neighbors as possible. We characterize optimal expanders combinatorially via girth and prove the existence of $s$-optimal expanders for every $s$. We also prove that $s$-optimality yields new \"transfer\" lower bounds on the number of neighbors of sets of size $h\\geq s$. Finally, as an application, we discuss the use of optimal small-set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23579","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/2606.23579/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":"2606.23579","created_at":"2026-06-23T03:14:31.375402+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23579v1","created_at":"2026-06-23T03:14:31.375402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23579","created_at":"2026-06-23T03:14:31.375402+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHOULELY55VA","created_at":"2026-06-23T03:14:31.375402+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHOULELY55VAVEPL","created_at":"2026-06-23T03:14:31.375402+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHOULELY","created_at":"2026-06-23T03:14:31.375402+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/HHOULELY55VAVEPLYKRNPOD5NO","json":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO.json","graph_json":"https://pith.science/api/pith-number/HHOULELY55VAVEPLYKRNPOD5NO/graph.json","events_json":"https://pith.science/api/pith-number/HHOULELY55VAVEPLYKRNPOD5NO/events.json","paper":"https://pith.science/paper/HHOULELY"},"agent_actions":{"view_html":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO","download_json":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO.json","view_paper":"https://pith.science/paper/HHOULELY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23579&json=true","fetch_graph":"https://pith.science/api/pith-number/HHOULELY55VAVEPLYKRNPOD5NO/graph.json","fetch_events":"https://pith.science/api/pith-number/HHOULELY55VAVEPLYKRNPOD5NO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/action/storage_attestation","attest_author":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/action/author_attestation","sign_citation":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/action/citation_signature","submit_replication":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/action/replication_record"}},"created_at":"2026-06-23T03:14:31.375402+00:00","updated_at":"2026-06-23T03:14:31.375402+00:00"}