{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LULHPU3RRJZJ45FGY2OLHZFAIA","short_pith_number":"pith:LULHPU3R","schema_version":"1.0","canonical_sha256":"5d1677d3718a729e74a6c69cb3e4a0400c3dc845559e501c0f4ad2e54ece59cb","source":{"kind":"arxiv","id":"1502.07410","version":3},"attestation_state":"computed","paper":{"title":"Towards Constructing Ramanujan Graphs Using Shift Lifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Ameya Velingker, Karthekeyan Chandrasekaran","submitted_at":"2015-02-26T01:06:55Z","abstract_excerpt":"In a breakthrough work, Marcus-Spielman-Srivastava recently showed that every $d$-regular bipartite Ramanujan graph has a 2-lift that is also $d$-regular bipartite Ramanujan. As a consequence, a straightforward iterative brute-force search algorithm leads to the construction of a $d$-regular bipartite Ramanujan graph on $N$ vertices in time $2^{O(dN)}$. Shift $k$-lifts studied by Agarwal-Kolla-Madan lead to a natural approach for constructing Ramanujan graphs more efficiently. The number of possible shift $k$-lifts of a $d$-regular $n$-vertex graph is $k^{nd/2}$. Suppose the following holds fo"},"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":"1502.07410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T01:06:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c2499aaabfbc5eb15798e39b9935292e7028d3f549609b215dcefce6c45e45f6","abstract_canon_sha256":"eac12de462e522415fc1d47ff59de2a9aaf23086fd04dbab991c75da783652b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:35.036694Z","signature_b64":"Xe6Q+GhyRqqIHqXemt7DU6J1ogVVmu9bDfvwgpWm4lLmtTXg3mW6q0sFT1mGvm1xPZugeADg6+MKIH1bi93lCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d1677d3718a729e74a6c69cb3e4a0400c3dc845559e501c0f4ad2e54ece59cb","last_reissued_at":"2026-05-18T01:34:35.036058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:35.036058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Constructing Ramanujan Graphs Using Shift Lifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Ameya Velingker, Karthekeyan Chandrasekaran","submitted_at":"2015-02-26T01:06:55Z","abstract_excerpt":"In a breakthrough work, Marcus-Spielman-Srivastava recently showed that every $d$-regular bipartite Ramanujan graph has a 2-lift that is also $d$-regular bipartite Ramanujan. As a consequence, a straightforward iterative brute-force search algorithm leads to the construction of a $d$-regular bipartite Ramanujan graph on $N$ vertices in time $2^{O(dN)}$. Shift $k$-lifts studied by Agarwal-Kolla-Madan lead to a natural approach for constructing Ramanujan graphs more efficiently. The number of possible shift $k$-lifts of a $d$-regular $n$-vertex graph is $k^{nd/2}$. Suppose the following holds fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07410","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":""},"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":"1502.07410","created_at":"2026-05-18T01:34:35.036176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07410v3","created_at":"2026-05-18T01:34:35.036176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07410","created_at":"2026-05-18T01:34:35.036176+00:00"},{"alias_kind":"pith_short_12","alias_value":"LULHPU3RRJZJ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LULHPU3RRJZJ45FG","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LULHPU3R","created_at":"2026-05-18T12:29:29.992203+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/LULHPU3RRJZJ45FGY2OLHZFAIA","json":"https://pith.science/pith/LULHPU3RRJZJ45FGY2OLHZFAIA.json","graph_json":"https://pith.science/api/pith-number/LULHPU3RRJZJ45FGY2OLHZFAIA/graph.json","events_json":"https://pith.science/api/pith-number/LULHPU3RRJZJ45FGY2OLHZFAIA/events.json","paper":"https://pith.science/paper/LULHPU3R"},"agent_actions":{"view_html":"https://pith.science/pith/LULHPU3RRJZJ45FGY2OLHZFAIA","download_json":"https://pith.science/pith/LULHPU3RRJZJ45FGY2OLHZFAIA.json","view_paper":"https://pith.science/paper/LULHPU3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07410&json=true","fetch_graph":"https://pith.science/api/pith-number/LULHPU3RRJZJ45FGY2OLHZFAIA/graph.json","fetch_events":"https://pith.science/api/pith-number/LULHPU3RRJZJ45FGY2OLHZFAIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LULHPU3RRJZJ45FGY2OLHZFAIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LULHPU3RRJZJ45FGY2OLHZFAIA/action/storage_attestation","attest_author":"https://pith.science/pith/LULHPU3RRJZJ45FGY2OLHZFAIA/action/author_attestation","sign_citation":"https://pith.science/pith/LULHPU3RRJZJ45FGY2OLHZFAIA/action/citation_signature","submit_replication":"https://pith.science/pith/LULHPU3RRJZJ45FGY2OLHZFAIA/action/replication_record"}},"created_at":"2026-05-18T01:34:35.036176+00:00","updated_at":"2026-05-18T01:34:35.036176+00:00"}