{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SQJ5ROZG5WYCIZW2XBML5Q5JEL","short_pith_number":"pith:SQJ5ROZG","schema_version":"1.0","canonical_sha256":"9413d8bb26edb02466dab858bec3a922fd86de91a6348553bb08be1192e12df7","source":{"kind":"arxiv","id":"1909.06988","version":3},"attestation_state":"computed","paper":{"title":"Explicit near-Ramanujan graphs of every degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Pedro Paredes, Ryan O'Donnell, Sidhanth Mohanty","submitted_at":"2019-09-16T05:03:38Z","abstract_excerpt":"For every constant $d \\geq 3$ and $\\epsilon > 0$, we give a deterministic $\\mathrm{poly}(n)$-time algorithm that outputs a $d$-regular graph on $\\Theta(n)$ vertices that is $\\epsilon$-near-Ramanujan; i.e., its eigenvalues are bounded in magnitude by $2\\sqrt{d-1} + \\epsilon$ (excluding the single trivial eigenvalue of~$d$)."},"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":"1909.06988","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-16T05:03:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8b3d93a1ed3e1cb8074eeb22e6d8f1ded4003006142dd96e14ef49fe1b04f75a","abstract_canon_sha256":"6d452649b8b559bb34eb679ab846db9d01e1e3268c96484bf62763e9feb01d8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:31.951855Z","signature_b64":"qh5clChPr3NnRelpga+d6YsBRxvWizZ1Ohwr9uHPiDzHo5QNDfa8mYALURIeLwdLm9Hb/AMS2QVr4paRwdNRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9413d8bb26edb02466dab858bec3a922fd86de91a6348553bb08be1192e12df7","last_reissued_at":"2026-07-05T05:19:31.951413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:31.951413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit near-Ramanujan graphs of every degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Pedro Paredes, Ryan O'Donnell, Sidhanth Mohanty","submitted_at":"2019-09-16T05:03:38Z","abstract_excerpt":"For every constant $d \\geq 3$ and $\\epsilon > 0$, we give a deterministic $\\mathrm{poly}(n)$-time algorithm that outputs a $d$-regular graph on $\\Theta(n)$ vertices that is $\\epsilon$-near-Ramanujan; i.e., its eigenvalues are bounded in magnitude by $2\\sqrt{d-1} + \\epsilon$ (excluding the single trivial eigenvalue of~$d$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06988","kind":"arxiv","version":3},"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/1909.06988/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":"1909.06988","created_at":"2026-07-05T05:19:31.951481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.06988v3","created_at":"2026-07-05T05:19:31.951481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06988","created_at":"2026-07-05T05:19:31.951481+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQJ5ROZG5WYC","created_at":"2026-07-05T05:19:31.951481+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQJ5ROZG5WYCIZW2","created_at":"2026-07-05T05:19:31.951481+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQJ5ROZG","created_at":"2026-07-05T05:19:31.951481+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/SQJ5ROZG5WYCIZW2XBML5Q5JEL","json":"https://pith.science/pith/SQJ5ROZG5WYCIZW2XBML5Q5JEL.json","graph_json":"https://pith.science/api/pith-number/SQJ5ROZG5WYCIZW2XBML5Q5JEL/graph.json","events_json":"https://pith.science/api/pith-number/SQJ5ROZG5WYCIZW2XBML5Q5JEL/events.json","paper":"https://pith.science/paper/SQJ5ROZG"},"agent_actions":{"view_html":"https://pith.science/pith/SQJ5ROZG5WYCIZW2XBML5Q5JEL","download_json":"https://pith.science/pith/SQJ5ROZG5WYCIZW2XBML5Q5JEL.json","view_paper":"https://pith.science/paper/SQJ5ROZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.06988&json=true","fetch_graph":"https://pith.science/api/pith-number/SQJ5ROZG5WYCIZW2XBML5Q5JEL/graph.json","fetch_events":"https://pith.science/api/pith-number/SQJ5ROZG5WYCIZW2XBML5Q5JEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQJ5ROZG5WYCIZW2XBML5Q5JEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQJ5ROZG5WYCIZW2XBML5Q5JEL/action/storage_attestation","attest_author":"https://pith.science/pith/SQJ5ROZG5WYCIZW2XBML5Q5JEL/action/author_attestation","sign_citation":"https://pith.science/pith/SQJ5ROZG5WYCIZW2XBML5Q5JEL/action/citation_signature","submit_replication":"https://pith.science/pith/SQJ5ROZG5WYCIZW2XBML5Q5JEL/action/replication_record"}},"created_at":"2026-07-05T05:19:31.951481+00:00","updated_at":"2026-07-05T05:19:31.951481+00:00"}