{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3S6I65KNALSXAH7M2VWYSDXPZW","short_pith_number":"pith:3S6I65KN","schema_version":"1.0","canonical_sha256":"dcbc8f754d02e5701fecd56d890eefcd812cc37efcfbc222fe589fa66a505713","source":{"kind":"arxiv","id":"1502.02739","version":1},"attestation_state":"computed","paper":{"title":"Explicit construction of Ramanujan bigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Amy Wooding, Brooke Feigon, Cristina Ballantine, Janne Kool, Kathrin Maurischat, Radhika Ganapathy","submitted_at":"2015-02-09T23:51:24Z","abstract_excerpt":"We construct explicitly an infinite family of Ramanujan graphs which are bipartite and biregular. Our construction starts with the Bruhat-Tits building of an inner form of $SU_3(\\mathbb Q_p)$. To make the graphs finite, we take successive quotients by infinitely many discrete co-compact subgroups of decreasing size."},"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.02739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-02-09T23:51:24Z","cross_cats_sorted":[],"title_canon_sha256":"ae53447ef064af7434e97faf03d0b8c80929df548ffdff5121832754b52835a5","abstract_canon_sha256":"91711d957e030687d34a172ae24c89fe360ccfdf0746f16120b3236796a2b685"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:31.079331Z","signature_b64":"4765mvwUrzu5tZuBAWSi/3rLJ57D9LEAByW2j5r6/WuUpJffJ6QRT5dADQnjViW165iZ6dTsTrXQK6CSDY3KAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcbc8f754d02e5701fecd56d890eefcd812cc37efcfbc222fe589fa66a505713","last_reissued_at":"2026-05-18T02:27:31.078536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:31.078536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit construction of Ramanujan bigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Amy Wooding, Brooke Feigon, Cristina Ballantine, Janne Kool, Kathrin Maurischat, Radhika Ganapathy","submitted_at":"2015-02-09T23:51:24Z","abstract_excerpt":"We construct explicitly an infinite family of Ramanujan graphs which are bipartite and biregular. Our construction starts with the Bruhat-Tits building of an inner form of $SU_3(\\mathbb Q_p)$. To make the graphs finite, we take successive quotients by infinitely many discrete co-compact subgroups of decreasing size."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02739","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":""},"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.02739","created_at":"2026-05-18T02:27:31.078653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02739v1","created_at":"2026-05-18T02:27:31.078653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02739","created_at":"2026-05-18T02:27:31.078653+00:00"},{"alias_kind":"pith_short_12","alias_value":"3S6I65KNALSX","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3S6I65KNALSXAH7M","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3S6I65KN","created_at":"2026-05-18T12:29:02.477457+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/3S6I65KNALSXAH7M2VWYSDXPZW","json":"https://pith.science/pith/3S6I65KNALSXAH7M2VWYSDXPZW.json","graph_json":"https://pith.science/api/pith-number/3S6I65KNALSXAH7M2VWYSDXPZW/graph.json","events_json":"https://pith.science/api/pith-number/3S6I65KNALSXAH7M2VWYSDXPZW/events.json","paper":"https://pith.science/paper/3S6I65KN"},"agent_actions":{"view_html":"https://pith.science/pith/3S6I65KNALSXAH7M2VWYSDXPZW","download_json":"https://pith.science/pith/3S6I65KNALSXAH7M2VWYSDXPZW.json","view_paper":"https://pith.science/paper/3S6I65KN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02739&json=true","fetch_graph":"https://pith.science/api/pith-number/3S6I65KNALSXAH7M2VWYSDXPZW/graph.json","fetch_events":"https://pith.science/api/pith-number/3S6I65KNALSXAH7M2VWYSDXPZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3S6I65KNALSXAH7M2VWYSDXPZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3S6I65KNALSXAH7M2VWYSDXPZW/action/storage_attestation","attest_author":"https://pith.science/pith/3S6I65KNALSXAH7M2VWYSDXPZW/action/author_attestation","sign_citation":"https://pith.science/pith/3S6I65KNALSXAH7M2VWYSDXPZW/action/citation_signature","submit_replication":"https://pith.science/pith/3S6I65KNALSXAH7M2VWYSDXPZW/action/replication_record"}},"created_at":"2026-05-18T02:27:31.078653+00:00","updated_at":"2026-05-18T02:27:31.078653+00:00"}