{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LKWAXJBVLOXWXRXS5P7IITVZNY","short_pith_number":"pith:LKWAXJBV","schema_version":"1.0","canonical_sha256":"5aac0ba4355baf6bc6f2ebfe844eb96e17460ff3fe011afdf83c7f669dd263ff","source":{"kind":"arxiv","id":"2003.11673","version":1},"attestation_state":"computed","paper":{"title":"Explicit expanders of every degree and size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Noga Alon","submitted_at":"2020-03-25T23:13:50Z","abstract_excerpt":"An $(n,d,\\lambda)$-graph is a $d$ regular graph on $n$ vertices in which the absolute value of any nontrivial eigenvalue is at most $\\lambda$. For any constant $d \\geq 3$, $\\epsilon>0$ and all sufficiently large $n$ we show that there is a deterministic poly(n) time algorithm that outputs an $(n,d, \\lambda)$-graph (on exactly $n$ vertices) with $\\lambda \\leq 2 \\sqrt{d-1}+\\epsilon$. For any $d=p+2$ with $p \\equiv 1 \\bmod 4$ prime and all sufficiently large $n$, we describe a strongly explicit construction of an $(n,d, \\lambda)$-graph (on exactly $n$ vertices) with $\\lambda \\leq \\sqrt {2(d-1)} +"},"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":"2003.11673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T23:13:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f6570fef66752a71aa5c24f747ac5833c49adbc7cb4967683684738a7cfabf0c","abstract_canon_sha256":"77392a34b96fdc4f99717f774bcae3e9372bd92cd30c84a2f6f597bf8f4d5f80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:46.542396Z","signature_b64":"fQGroqir4SWknLuX13kT2eqK6+RE4TpIxwCU42Z9bkacuLrM4M3t1QYbvpccakDEuOVittPCx1S6u+xnz/amDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aac0ba4355baf6bc6f2ebfe844eb96e17460ff3fe011afdf83c7f669dd263ff","last_reissued_at":"2026-07-05T00:50:46.541961Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:46.541961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit expanders of every degree and size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Noga Alon","submitted_at":"2020-03-25T23:13:50Z","abstract_excerpt":"An $(n,d,\\lambda)$-graph is a $d$ regular graph on $n$ vertices in which the absolute value of any nontrivial eigenvalue is at most $\\lambda$. For any constant $d \\geq 3$, $\\epsilon>0$ and all sufficiently large $n$ we show that there is a deterministic poly(n) time algorithm that outputs an $(n,d, \\lambda)$-graph (on exactly $n$ vertices) with $\\lambda \\leq 2 \\sqrt{d-1}+\\epsilon$. For any $d=p+2$ with $p \\equiv 1 \\bmod 4$ prime and all sufficiently large $n$, we describe a strongly explicit construction of an $(n,d, \\lambda)$-graph (on exactly $n$ vertices) with $\\lambda \\leq \\sqrt {2(d-1)} +"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11673","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/2003.11673/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":"2003.11673","created_at":"2026-07-05T00:50:46.542016+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.11673v1","created_at":"2026-07-05T00:50:46.542016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11673","created_at":"2026-07-05T00:50:46.542016+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKWAXJBVLOXW","created_at":"2026-07-05T00:50:46.542016+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKWAXJBVLOXWXRXS","created_at":"2026-07-05T00:50:46.542016+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKWAXJBV","created_at":"2026-07-05T00:50:46.542016+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06719","citing_title":"Macroeconomic Message Passing for Anticipating Foreign Exchange Regime Changes: A Deep Logical Learning Approach using Graph Tsetlin Machines","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY","json":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY.json","graph_json":"https://pith.science/api/pith-number/LKWAXJBVLOXWXRXS5P7IITVZNY/graph.json","events_json":"https://pith.science/api/pith-number/LKWAXJBVLOXWXRXS5P7IITVZNY/events.json","paper":"https://pith.science/paper/LKWAXJBV"},"agent_actions":{"view_html":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY","download_json":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY.json","view_paper":"https://pith.science/paper/LKWAXJBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.11673&json=true","fetch_graph":"https://pith.science/api/pith-number/LKWAXJBVLOXWXRXS5P7IITVZNY/graph.json","fetch_events":"https://pith.science/api/pith-number/LKWAXJBVLOXWXRXS5P7IITVZNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/action/storage_attestation","attest_author":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/action/author_attestation","sign_citation":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/action/citation_signature","submit_replication":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/action/replication_record"}},"created_at":"2026-07-05T00:50:46.542016+00:00","updated_at":"2026-07-05T00:50:46.542016+00:00"}