{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2U3WQLIK47ON46Z5IC5X3MQE3T","short_pith_number":"pith:2U3WQLIK","schema_version":"1.0","canonical_sha256":"d537682d0ae7dcde7b3d40bb7db204dce85d9c2bd21e452072548e6e41799751","source":{"kind":"arxiv","id":"1507.01196","version":1},"attestation_state":"computed","paper":{"title":"Explicit Expanding Expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Asaf Valadarsky, Michael Dinitz, Michael Schapira","submitted_at":"2015-07-05T11:22:45Z","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"},"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":"1507.01196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-05T11:22:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5b01e6e8bd08257d3230a2ba5dbec73ca2db7e6946081fd4a8c278c6073ee216","abstract_canon_sha256":"fa81273466f5ec8651627292ceb2cf2bbce905334af81a816cce4fbbab6e5130"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:17.766253Z","signature_b64":"y5+2QcRa0n4B41+rfAoxYchmHlzTcc4GjVhhnI5zpEPjCeeIRZueRWPVxFAcAoNkl+ACnTI2jrH6EtP+HugCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d537682d0ae7dcde7b3d40bb7db204dce85d9c2bd21e452072548e6e41799751","last_reissued_at":"2026-05-18T01:37:17.765551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:17.765551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Expanding Expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Asaf Valadarsky, Michael Dinitz, Michael Schapira","submitted_at":"2015-07-05T11:22:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01196","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":""},"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":"1507.01196","created_at":"2026-05-18T01:37:17.765644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01196v1","created_at":"2026-05-18T01:37:17.765644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01196","created_at":"2026-05-18T01:37:17.765644+00:00"},{"alias_kind":"pith_short_12","alias_value":"2U3WQLIK47ON","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2U3WQLIK47ON46Z5","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2U3WQLIK","created_at":"2026-05-18T12:29:02.477457+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/2U3WQLIK47ON46Z5IC5X3MQE3T","json":"https://pith.science/pith/2U3WQLIK47ON46Z5IC5X3MQE3T.json","graph_json":"https://pith.science/api/pith-number/2U3WQLIK47ON46Z5IC5X3MQE3T/graph.json","events_json":"https://pith.science/api/pith-number/2U3WQLIK47ON46Z5IC5X3MQE3T/events.json","paper":"https://pith.science/paper/2U3WQLIK"},"agent_actions":{"view_html":"https://pith.science/pith/2U3WQLIK47ON46Z5IC5X3MQE3T","download_json":"https://pith.science/pith/2U3WQLIK47ON46Z5IC5X3MQE3T.json","view_paper":"https://pith.science/paper/2U3WQLIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01196&json=true","fetch_graph":"https://pith.science/api/pith-number/2U3WQLIK47ON46Z5IC5X3MQE3T/graph.json","fetch_events":"https://pith.science/api/pith-number/2U3WQLIK47ON46Z5IC5X3MQE3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2U3WQLIK47ON46Z5IC5X3MQE3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2U3WQLIK47ON46Z5IC5X3MQE3T/action/storage_attestation","attest_author":"https://pith.science/pith/2U3WQLIK47ON46Z5IC5X3MQE3T/action/author_attestation","sign_citation":"https://pith.science/pith/2U3WQLIK47ON46Z5IC5X3MQE3T/action/citation_signature","submit_replication":"https://pith.science/pith/2U3WQLIK47ON46Z5IC5X3MQE3T/action/replication_record"}},"created_at":"2026-05-18T01:37:17.765644+00:00","updated_at":"2026-05-18T01:37:17.765644+00:00"}