{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HHOULELY55VAVEPLYKRNPOD5NO","short_pith_number":"pith:HHOULELY","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"},"canonical_sha256":"39dd459178ef6a0a91ebc2a2d7b87d6baf10f6a134034f81273ac1bab4012dcc","source":{"kind":"arxiv","id":"2606.23579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23579","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23579v1","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23579","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_12","alias_value":"HHOULELY55VA","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_16","alias_value":"HHOULELY55VAVEPL","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_8","alias_value":"HHOULELY","created_at":"2026-06-23T03:14:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HHOULELY55VAVEPLYKRNPOD5NO","target":"record","payload":{"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"},"canonical_sha256":"39dd459178ef6a0a91ebc2a2d7b87d6baf10f6a134034f81273ac1bab4012dcc","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"},"source_kind":"arxiv","source_id":"2606.23579","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-06-23T03:14:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OALru2Fe9XZY9t8UL0cBjQOshPV4pislSfLmHPzOKVGv6OG5FydxP4KGBU9Cur+3/aSv8fukHjaXS+gsDlFbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:58:14.530914Z"},"content_sha256":"30c82c22a613edd045dcf79bfabe8939ba2ddf0126ec0e0af7a2a52f0dd8ba5d","schema_version":"1.0","event_id":"sha256:30c82c22a613edd045dcf79bfabe8939ba2ddf0126ec0e0af7a2a52f0dd8ba5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HHOULELY55VAVEPLYKRNPOD5NO","target":"graph","payload":{"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"},"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-06-23T03:14:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSRcocj8t16PANAAW5VT8Hkon2wMu+cs2zEF9hYz4Kr30NyrEcPgiUEnz1XFUhxh4bMwpQtDeJ2+XULgvxCODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:58:14.531330Z"},"content_sha256":"90a993d190d6b88f8dca25d510bef1733a87fe737f7d92939b40a914ca0b7ec1","schema_version":"1.0","event_id":"sha256:90a993d190d6b88f8dca25d510bef1733a87fe737f7d92939b40a914ca0b7ec1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/bundle.json","state_url":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHOULELY55VAVEPLYKRNPOD5NO/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-07-01T22:58:14Z","links":{"resolver":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO","bundle":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/bundle.json","state":"https://pith.science/pith/HHOULELY55VAVEPLYKRNPOD5NO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHOULELY55VAVEPLYKRNPOD5NO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HHOULELY55VAVEPLYKRNPOD5NO","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":"1c2cd49936bba7c5ca516dd0dea2e679e61eaac7cf852c429014a7500db2e0ba","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T16:46:20Z","title_canon_sha256":"857769cc5e66f30da2627e76cce8e4d84c05708fabc051c509ed3540bc5edfa9"},"schema_version":"1.0","source":{"id":"2606.23579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23579","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23579v1","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23579","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_12","alias_value":"HHOULELY55VA","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_16","alias_value":"HHOULELY55VAVEPL","created_at":"2026-06-23T03:14:31Z"},{"alias_kind":"pith_short_8","alias_value":"HHOULELY","created_at":"2026-06-23T03:14:31Z"}],"graph_snapshots":[{"event_id":"sha256:90a993d190d6b88f8dca25d510bef1733a87fe737f7d92939b40a914ca0b7ec1","target":"graph","created_at":"2026-06-23T03:14: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/2606.23579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Marcelo Fiori, Mauricio Velasco, Pedro Raigorodsky, Tristram Bogart","cross_cats":["cs.CR","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T16:46:20Z","title":"Optimal Small Set Expanders and Their Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23579","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:30c82c22a613edd045dcf79bfabe8939ba2ddf0126ec0e0af7a2a52f0dd8ba5d","target":"record","created_at":"2026-06-23T03:14: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":"1c2cd49936bba7c5ca516dd0dea2e679e61eaac7cf852c429014a7500db2e0ba","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T16:46:20Z","title_canon_sha256":"857769cc5e66f30da2627e76cce8e4d84c05708fabc051c509ed3540bc5edfa9"},"schema_version":"1.0","source":{"id":"2606.23579","kind":"arxiv","version":1}},"canonical_sha256":"39dd459178ef6a0a91ebc2a2d7b87d6baf10f6a134034f81273ac1bab4012dcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39dd459178ef6a0a91ebc2a2d7b87d6baf10f6a134034f81273ac1bab4012dcc","first_computed_at":"2026-06-23T03:14:31.375342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:31.375342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yx/aV8AVdon3hhDovUnnKEC0kHRgfw38poCNk7EfKiklzxhOdF8Kw6olMLVXrD/M5cWQt9TFuQr78HHAzyKYAA==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:31.375737Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30c82c22a613edd045dcf79bfabe8939ba2ddf0126ec0e0af7a2a52f0dd8ba5d","sha256:90a993d190d6b88f8dca25d510bef1733a87fe737f7d92939b40a914ca0b7ec1"],"state_sha256":"746f007378f610460b76fb8089c24fa64ea373f88e85a513f4a752cfadf67573"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnf1XVF0mkaQnwrT8uJc/Mt1MrOUALVfDsUihx11PcOxXytKJvzoqydr7gtPOjEhctFnorxcVSrm0zR/tAKWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:58:14.533762Z","bundle_sha256":"b7b149ce4956bbd8c939ba0df06f42a11dac7d70cf7b0855ca96ebdc91cb629f"}}