{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EQZD52UBJUKFQC2JXYNROTLHJY","short_pith_number":"pith:EQZD52UB","schema_version":"1.0","canonical_sha256":"24323eea814d14580b49be1b174d674e2dd8e66854e9e1055c7e2cd297b059d6","source":{"kind":"arxiv","id":"1812.04230","version":1},"attestation_state":"computed","paper":{"title":"A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amadou Bah, David Uminsky, Jackson Abascal, Mario Banuelos, Olivia Vasquez","submitted_at":"2018-12-11T06:22:50Z","abstract_excerpt":"We present a new $O(k^2 \\binom{n}{k}^2)$ method for generating an orthogonal basis of eigenvectors for the Johnson graph $J(n,k)$. Unlike standard methods for computing a full eigenbasis of sparse symmetric matrices, the algorithm presented here is non-iterative, and produces exact results under an infinite-precision computation model. In addition, our method is highly parallelizable; given access to unlimited parallel processors, the eigenbasis can be constructed in only $O(n)$ time given n and k. We also present an algorithm for computing projections onto the eigenspaces of $J(n,k)$ in paral"},"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":"1812.04230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T06:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"ea5d66f8fb373a660e3f9d3aa0bc1472cb5f2b8d774364676b56f9c72c3015f2","abstract_canon_sha256":"aca600cbb9f7c6441b356ef44e3b18c3a79260504264feeaa63a0324ce2b1802"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:32.924377Z","signature_b64":"pFA3FpePQub4jYh3iwmbMfD+/WaXNgoJKsemaT5Vm43DogrdIANGxcKOHuRBGWQUAMGJVnVnrDLfJrzXBT3gAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24323eea814d14580b49be1b174d674e2dd8e66854e9e1055c7e2cd297b059d6","last_reissued_at":"2026-05-17T23:58:32.923764Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:32.923764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amadou Bah, David Uminsky, Jackson Abascal, Mario Banuelos, Olivia Vasquez","submitted_at":"2018-12-11T06:22:50Z","abstract_excerpt":"We present a new $O(k^2 \\binom{n}{k}^2)$ method for generating an orthogonal basis of eigenvectors for the Johnson graph $J(n,k)$. Unlike standard methods for computing a full eigenbasis of sparse symmetric matrices, the algorithm presented here is non-iterative, and produces exact results under an infinite-precision computation model. In addition, our method is highly parallelizable; given access to unlimited parallel processors, the eigenbasis can be constructed in only $O(n)$ time given n and k. We also present an algorithm for computing projections onto the eigenspaces of $J(n,k)$ in paral"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04230","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":"1812.04230","created_at":"2026-05-17T23:58:32.923855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04230v1","created_at":"2026-05-17T23:58:32.923855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04230","created_at":"2026-05-17T23:58:32.923855+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQZD52UBJUKF","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQZD52UBJUKFQC2J","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQZD52UB","created_at":"2026-05-18T12:32:22.470017+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/EQZD52UBJUKFQC2JXYNROTLHJY","json":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY.json","graph_json":"https://pith.science/api/pith-number/EQZD52UBJUKFQC2JXYNROTLHJY/graph.json","events_json":"https://pith.science/api/pith-number/EQZD52UBJUKFQC2JXYNROTLHJY/events.json","paper":"https://pith.science/paper/EQZD52UB"},"agent_actions":{"view_html":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY","download_json":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY.json","view_paper":"https://pith.science/paper/EQZD52UB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04230&json=true","fetch_graph":"https://pith.science/api/pith-number/EQZD52UBJUKFQC2JXYNROTLHJY/graph.json","fetch_events":"https://pith.science/api/pith-number/EQZD52UBJUKFQC2JXYNROTLHJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/action/storage_attestation","attest_author":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/action/author_attestation","sign_citation":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/action/citation_signature","submit_replication":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/action/replication_record"}},"created_at":"2026-05-17T23:58:32.923855+00:00","updated_at":"2026-05-17T23:58:32.923855+00:00"}