{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WAS24E3KRWIN7M4WZC35LJF2BT","short_pith_number":"pith:WAS24E3K","schema_version":"1.0","canonical_sha256":"b025ae136a8d90dfb396c8b7d5a4ba0cce9827fcbc416b15ecf5374b5d5cfc7e","source":{"kind":"arxiv","id":"1904.03500","version":2},"attestation_state":"computed","paper":{"title":"$X$-Ramanujan Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ryan O'Donnell, Sidhanth Mohanty","submitted_at":"2019-04-06T17:36:33Z","abstract_excerpt":"Let $X$ be an infinite graph of bounded degree; e.g., the Cayley graph of a free product of finite groups. If $G$ is a finite graph covered by $X$, it is said to be $X$-Ramanujan if its second-largest eigenvalue $\\lambda_2(G)$ is at most the spectral radius $\\rho(X)$ of $X$, and more generally $k$-quasi-$X$-Ramanujan if $\\lambda_k(G)$ is at most $\\rho(X)$. In case $X$ is the infinite $\\Delta$-regular tree, this reduces to the well known notion of a finite $\\Delta$-regular graph being Ramanujan. Inspired by the Interlacing Polynomials method of Marcus, Spielman, and Srivastava, we show the exis"},"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":"1904.03500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-06T17:36:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"de4dc9eea90272944abc95c1ca5fa781255a560e4d967564f7ae859bb5ff67b9","abstract_canon_sha256":"3c57238e17f1a0e8768678c96988e3e053cceb8fe2688952b5ff16b6e3855104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:49.889128Z","signature_b64":"ddD/lcAdhZggeN8CqazihY6tQ9TsvnS8/ZXlmh6EvrhIa6MDYlNrahmPGqrJ3+rDfxmDynP5YAGQvby+MGIQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b025ae136a8d90dfb396c8b7d5a4ba0cce9827fcbc416b15ecf5374b5d5cfc7e","last_reissued_at":"2026-05-17T23:48:49.888478Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:49.888478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$X$-Ramanujan Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ryan O'Donnell, Sidhanth Mohanty","submitted_at":"2019-04-06T17:36:33Z","abstract_excerpt":"Let $X$ be an infinite graph of bounded degree; e.g., the Cayley graph of a free product of finite groups. If $G$ is a finite graph covered by $X$, it is said to be $X$-Ramanujan if its second-largest eigenvalue $\\lambda_2(G)$ is at most the spectral radius $\\rho(X)$ of $X$, and more generally $k$-quasi-$X$-Ramanujan if $\\lambda_k(G)$ is at most $\\rho(X)$. In case $X$ is the infinite $\\Delta$-regular tree, this reduces to the well known notion of a finite $\\Delta$-regular graph being Ramanujan. Inspired by the Interlacing Polynomials method of Marcus, Spielman, and Srivastava, we show the exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03500","kind":"arxiv","version":2},"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":"1904.03500","created_at":"2026-05-17T23:48:49.888600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03500v2","created_at":"2026-05-17T23:48:49.888600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03500","created_at":"2026-05-17T23:48:49.888600+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAS24E3KRWIN","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAS24E3KRWIN7M4W","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAS24E3K","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.20721","citing_title":"Ramanujan Graphs and Interlacing Families","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT","json":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT.json","graph_json":"https://pith.science/api/pith-number/WAS24E3KRWIN7M4WZC35LJF2BT/graph.json","events_json":"https://pith.science/api/pith-number/WAS24E3KRWIN7M4WZC35LJF2BT/events.json","paper":"https://pith.science/paper/WAS24E3K"},"agent_actions":{"view_html":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT","download_json":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT.json","view_paper":"https://pith.science/paper/WAS24E3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03500&json=true","fetch_graph":"https://pith.science/api/pith-number/WAS24E3KRWIN7M4WZC35LJF2BT/graph.json","fetch_events":"https://pith.science/api/pith-number/WAS24E3KRWIN7M4WZC35LJF2BT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT/action/storage_attestation","attest_author":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT/action/author_attestation","sign_citation":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT/action/citation_signature","submit_replication":"https://pith.science/pith/WAS24E3KRWIN7M4WZC35LJF2BT/action/replication_record"}},"created_at":"2026-05-17T23:48:49.888600+00:00","updated_at":"2026-05-17T23:48:49.888600+00:00"}