{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EQZD52UBJUKFQC2JXYNROTLHJY","short_pith_number":"pith:EQZD52UB","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"},"canonical_sha256":"24323eea814d14580b49be1b174d674e2dd8e66854e9e1055c7e2cd297b059d6","source":{"kind":"arxiv","id":"1812.04230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04230","created_at":"2026-05-17T23:58:32Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04230v1","created_at":"2026-05-17T23:58:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04230","created_at":"2026-05-17T23:58:32Z"},{"alias_kind":"pith_short_12","alias_value":"EQZD52UBJUKF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EQZD52UBJUKFQC2J","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EQZD52UB","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EQZD52UBJUKFQC2JXYNROTLHJY","target":"record","payload":{"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"},"canonical_sha256":"24323eea814d14580b49be1b174d674e2dd8e66854e9e1055c7e2cd297b059d6","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"},"source_kind":"arxiv","source_id":"1812.04230","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lOfzPwR6YU3aNxmNSV7+a3YeKyweNcqo9ELIeo8qBGhNIupC6r3MbCkUaBj5BirzQ4+FEXn89koMcp2seI3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:25:50.967305Z"},"content_sha256":"7bb9605178a097452ab00860c37904bb9596fc466645760f07b0f1c9b76a0aa4","schema_version":"1.0","event_id":"sha256:7bb9605178a097452ab00860c37904bb9596fc466645760f07b0f1c9b76a0aa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EQZD52UBJUKFQC2JXYNROTLHJY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTngV6Rr5ymReRNqmhokdsUsVfCeeYFHxEnUE4Jpo42rckOod2ooqI+zWBLuB+jbjR0LJjqQDqB33ZO8HRQIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:25:50.967660Z"},"content_sha256":"e9a836e1fd7d9435af27d644443d46f250bd5e4140e9400ec39ad9866a6553d8","schema_version":"1.0","event_id":"sha256:e9a836e1fd7d9435af27d644443d46f250bd5e4140e9400ec39ad9866a6553d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/bundle.json","state_url":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQZD52UBJUKFQC2JXYNROTLHJY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T14:25:50Z","links":{"resolver":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY","bundle":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/bundle.json","state":"https://pith.science/pith/EQZD52UBJUKFQC2JXYNROTLHJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQZD52UBJUKFQC2JXYNROTLHJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EQZD52UBJUKFQC2JXYNROTLHJY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aca600cbb9f7c6441b356ef44e3b18c3a79260504264feeaa63a0324ce2b1802","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T06:22:50Z","title_canon_sha256":"ea5d66f8fb373a660e3f9d3aa0bc1472cb5f2b8d774364676b56f9c72c3015f2"},"schema_version":"1.0","source":{"id":"1812.04230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04230","created_at":"2026-05-17T23:58:32Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04230v1","created_at":"2026-05-17T23:58:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04230","created_at":"2026-05-17T23:58:32Z"},{"alias_kind":"pith_short_12","alias_value":"EQZD52UBJUKF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EQZD52UBJUKFQC2J","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EQZD52UB","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:e9a836e1fd7d9435af27d644443d46f250bd5e4140e9400ec39ad9866a6553d8","target":"graph","created_at":"2026-05-17T23:58:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amadou Bah, David Uminsky, Jackson Abascal, Mario Banuelos, Olivia Vasquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T06:22:50Z","title":"A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04230","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7bb9605178a097452ab00860c37904bb9596fc466645760f07b0f1c9b76a0aa4","target":"record","created_at":"2026-05-17T23:58:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aca600cbb9f7c6441b356ef44e3b18c3a79260504264feeaa63a0324ce2b1802","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T06:22:50Z","title_canon_sha256":"ea5d66f8fb373a660e3f9d3aa0bc1472cb5f2b8d774364676b56f9c72c3015f2"},"schema_version":"1.0","source":{"id":"1812.04230","kind":"arxiv","version":1}},"canonical_sha256":"24323eea814d14580b49be1b174d674e2dd8e66854e9e1055c7e2cd297b059d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24323eea814d14580b49be1b174d674e2dd8e66854e9e1055c7e2cd297b059d6","first_computed_at":"2026-05-17T23:58:32.923764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:32.923764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pFA3FpePQub4jYh3iwmbMfD+/WaXNgoJKsemaT5Vm43DogrdIANGxcKOHuRBGWQUAMGJVnVnrDLfJrzXBT3gAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:32.924377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bb9605178a097452ab00860c37904bb9596fc466645760f07b0f1c9b76a0aa4","sha256:e9a836e1fd7d9435af27d644443d46f250bd5e4140e9400ec39ad9866a6553d8"],"state_sha256":"d39b243986b6843aa7f8c61c79902ad7249dda9f401711f2bcf4b6e928972282"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PS7b2d/wv+MPtjxOLhbxy+xVA3ccV4KYrt+XKP6zHKayuAZwJejFamns3KAy92Kd7B6oZiecDQ8TQPSjuOJDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:25:50.969549Z","bundle_sha256":"7dcc5945dc2c33bd0a254ccf4c007468deab31efc112ff5deb0c8cf3738c6d07"}}