{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2U3WQLIK47ON46Z5IC5X3MQE3T","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":"fa81273466f5ec8651627292ceb2cf2bbce905334af81a816cce4fbbab6e5130","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-05T11:22:45Z","title_canon_sha256":"5b01e6e8bd08257d3230a2ba5dbec73ca2db7e6946081fd4a8c278c6073ee216"},"schema_version":"1.0","source":{"id":"1507.01196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01196","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01196v1","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01196","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"2U3WQLIK47ON","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2U3WQLIK47ON46Z5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2U3WQLIK","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:ad54047dde4b76d367226f3a77b930d1a9da655bcbcf95f39ba169b945add6df","target":"graph","created_at":"2026-05-18T01:37:17Z","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":"Deterministic constructions of expander graphs have been an important topic of research in computer science and mathematics, with many well-studied constructions of infinite families of expanders. In some applications, though, an infinite family is not enough: we need expanders which are \"close\" to each other. We study the following question: Construct an an infinite sequence of expanders $G_0,G_1,\\dots$, such that for every two consecutive graphs $G_i$ and $G_{i+1}$, $G_{i+1}$ can be obtained from $G_i$ by adding a single vertex and inserting/removing a small number of edges, which we call th","authors_text":"Asaf Valadarsky, Michael Dinitz, Michael Schapira","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-05T11:22:45Z","title":"Explicit Expanding Expanders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01196","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:e26a20f50f1e3093059098d8a509fd38565e314b83fe7bdbe5506d81f3e6bc85","target":"record","created_at":"2026-05-18T01:37:17Z","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":"fa81273466f5ec8651627292ceb2cf2bbce905334af81a816cce4fbbab6e5130","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-05T11:22:45Z","title_canon_sha256":"5b01e6e8bd08257d3230a2ba5dbec73ca2db7e6946081fd4a8c278c6073ee216"},"schema_version":"1.0","source":{"id":"1507.01196","kind":"arxiv","version":1}},"canonical_sha256":"d537682d0ae7dcde7b3d40bb7db204dce85d9c2bd21e452072548e6e41799751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d537682d0ae7dcde7b3d40bb7db204dce85d9c2bd21e452072548e6e41799751","first_computed_at":"2026-05-18T01:37:17.765551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:17.765551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y5+2QcRa0n4B41+rfAoxYchmHlzTcc4GjVhhnI5zpEPjCeeIRZueRWPVxFAcAoNkl+ACnTI2jrH6EtP+HugCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:17.766253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e26a20f50f1e3093059098d8a509fd38565e314b83fe7bdbe5506d81f3e6bc85","sha256:ad54047dde4b76d367226f3a77b930d1a9da655bcbcf95f39ba169b945add6df"],"state_sha256":"5d3dd9f60624b495fc9a639703378d721ddc924ecdcb20b68d02d7bdc9fc2ebb"}