{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LKWAXJBVLOXWXRXS5P7IITVZNY","short_pith_number":"pith:LKWAXJBV","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"},"canonical_sha256":"5aac0ba4355baf6bc6f2ebfe844eb96e17460ff3fe011afdf83c7f669dd263ff","source":{"kind":"arxiv","id":"2003.11673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.11673","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"arxiv_version","alias_value":"2003.11673v1","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11673","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"pith_short_12","alias_value":"LKWAXJBVLOXW","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"pith_short_16","alias_value":"LKWAXJBVLOXWXRXS","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"pith_short_8","alias_value":"LKWAXJBV","created_at":"2026-07-05T00:50:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LKWAXJBVLOXWXRXS5P7IITVZNY","target":"record","payload":{"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"},"canonical_sha256":"5aac0ba4355baf6bc6f2ebfe844eb96e17460ff3fe011afdf83c7f669dd263ff","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"},"source_kind":"arxiv","source_id":"2003.11673","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-07-05T00:50:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bd7ySNQHLeeLf24CQRtTGnp3U3TEiwPtJNmjsoUv1R7/MsyvYsJQy7h18w2qDacZQjLUo4XdZsGT1/yIYPREBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:44:55.611687Z"},"content_sha256":"b93e666c3ee39fbc6c4192e7c780043219efa59fc759b943a24abb0c4ef4c3fa","schema_version":"1.0","event_id":"sha256:b93e666c3ee39fbc6c4192e7c780043219efa59fc759b943a24abb0c4ef4c3fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LKWAXJBVLOXWXRXS5P7IITVZNY","target":"graph","payload":{"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"},"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-07-05T00:50:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvrS9JAULfe9/MU3P9SVa6GFHhw4CMGTLIQC5tDWPwg5JOm/1UpTYmTXqQy58fbn/LnJ7WD63wVRjMoHw/AmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:44:55.612212Z"},"content_sha256":"deeaca3b01d9d2d31ad9ab26babf7a2ffa508179a440192ddcec70d3105552fc","schema_version":"1.0","event_id":"sha256:deeaca3b01d9d2d31ad9ab26babf7a2ffa508179a440192ddcec70d3105552fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/bundle.json","state_url":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/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-08-03T15:44:55Z","links":{"resolver":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY","bundle":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/bundle.json","state":"https://pith.science/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKWAXJBVLOXWXRXS5P7IITVZNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LKWAXJBVLOXWXRXS5P7IITVZNY","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":"77392a34b96fdc4f99717f774bcae3e9372bd92cd30c84a2f6f597bf8f4d5f80","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T23:13:50Z","title_canon_sha256":"f6570fef66752a71aa5c24f747ac5833c49adbc7cb4967683684738a7cfabf0c"},"schema_version":"1.0","source":{"id":"2003.11673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.11673","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"arxiv_version","alias_value":"2003.11673v1","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11673","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"pith_short_12","alias_value":"LKWAXJBVLOXW","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"pith_short_16","alias_value":"LKWAXJBVLOXWXRXS","created_at":"2026-07-05T00:50:46Z"},{"alias_kind":"pith_short_8","alias_value":"LKWAXJBV","created_at":"2026-07-05T00:50:46Z"}],"graph_snapshots":[{"event_id":"sha256:deeaca3b01d9d2d31ad9ab26babf7a2ffa508179a440192ddcec70d3105552fc","target":"graph","created_at":"2026-07-05T00:50:46Z","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/2003.11673/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)} +","authors_text":"Noga Alon","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T23:13:50Z","title":"Explicit expanders of every degree and size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11673","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:b93e666c3ee39fbc6c4192e7c780043219efa59fc759b943a24abb0c4ef4c3fa","target":"record","created_at":"2026-07-05T00:50:46Z","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":"77392a34b96fdc4f99717f774bcae3e9372bd92cd30c84a2f6f597bf8f4d5f80","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T23:13:50Z","title_canon_sha256":"f6570fef66752a71aa5c24f747ac5833c49adbc7cb4967683684738a7cfabf0c"},"schema_version":"1.0","source":{"id":"2003.11673","kind":"arxiv","version":1}},"canonical_sha256":"5aac0ba4355baf6bc6f2ebfe844eb96e17460ff3fe011afdf83c7f669dd263ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5aac0ba4355baf6bc6f2ebfe844eb96e17460ff3fe011afdf83c7f669dd263ff","first_computed_at":"2026-07-05T00:50:46.541961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:50:46.541961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fQGroqir4SWknLuX13kT2eqK6+RE4TpIxwCU42Z9bkacuLrM4M3t1QYbvpccakDEuOVittPCx1S6u+xnz/amDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:50:46.542396Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.11673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b93e666c3ee39fbc6c4192e7c780043219efa59fc759b943a24abb0c4ef4c3fa","sha256:deeaca3b01d9d2d31ad9ab26babf7a2ffa508179a440192ddcec70d3105552fc"],"state_sha256":"d2838b9c4b5dcbdfbb39590e0f31b89e4791bb4b4b32e619cd22c8a6e50b4de7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isR/Mi7hC/BjPqEN1z04CmgvX3z701xuAseiLWvnw2wypvT2hVVY1f1QIxzn+YfWCTRBdORoItRDjHTpstOdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:44:55.618987Z","bundle_sha256":"190f8f2fb568d64b3ce6329758a4750b578a3f78ecebaa253b72436e14d9c771"}}