{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EJHIWN2KEPQQHY476M5XBFZK4U","short_pith_number":"pith:EJHIWN2K","schema_version":"1.0","canonical_sha256":"224e8b374a23e103e39ff33b70972ae52e757cd217a31dc58affaacfef8f66c4","source":{"kind":"arxiv","id":"1702.04086","version":8},"attestation_state":"computed","paper":{"title":"Symmetric Pseudo-Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ilya Soloveychik, Vahid Tarokh, Yu Xiang","submitted_at":"2017-02-14T06:10:45Z","abstract_excerpt":"We consider the problem of generating symmetric pseudo-random sign (+/-1) matrices based on the similarity of their spectra to Wigner's semicircular law. Using binary m-sequences (Golomb sequences) of lengths n=2^m-1, we give a simple explicit construction of circulant n by n sign matrices and show that their spectra converge to the semicircular law when n grows. The Kolmogorov complexity of the proposed matrices equals to that of Golomb sequences and is at most 2log(n) bits."},"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":"1702.04086","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-14T06:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"d2353adbb8760656f41d8989a16266dc29aead4aba523119bc6af9c92172fa26","abstract_canon_sha256":"7eb2afd00ae14c124e7ced92108f0e07c252fea1a5c03b2755e7dd24b441a6ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:40.070152Z","signature_b64":"J3G4sApKTqWttpyOBBD3DQGn1pF/VqPThO3ElcxhKZEMmP7+/F0FfOExLY+b1g6XQpfU005mHlJUq/gOfvz5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"224e8b374a23e103e39ff33b70972ae52e757cd217a31dc58affaacfef8f66c4","last_reissued_at":"2026-05-18T00:22:40.069764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:40.069764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Pseudo-Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ilya Soloveychik, Vahid Tarokh, Yu Xiang","submitted_at":"2017-02-14T06:10:45Z","abstract_excerpt":"We consider the problem of generating symmetric pseudo-random sign (+/-1) matrices based on the similarity of their spectra to Wigner's semicircular law. Using binary m-sequences (Golomb sequences) of lengths n=2^m-1, we give a simple explicit construction of circulant n by n sign matrices and show that their spectra converge to the semicircular law when n grows. The Kolmogorov complexity of the proposed matrices equals to that of Golomb sequences and is at most 2log(n) bits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04086","kind":"arxiv","version":8},"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":"1702.04086","created_at":"2026-05-18T00:22:40.069823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04086v8","created_at":"2026-05-18T00:22:40.069823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04086","created_at":"2026-05-18T00:22:40.069823+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJHIWN2KEPQQ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJHIWN2KEPQQHY47","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJHIWN2K","created_at":"2026-05-18T12:31:12.930513+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/EJHIWN2KEPQQHY476M5XBFZK4U","json":"https://pith.science/pith/EJHIWN2KEPQQHY476M5XBFZK4U.json","graph_json":"https://pith.science/api/pith-number/EJHIWN2KEPQQHY476M5XBFZK4U/graph.json","events_json":"https://pith.science/api/pith-number/EJHIWN2KEPQQHY476M5XBFZK4U/events.json","paper":"https://pith.science/paper/EJHIWN2K"},"agent_actions":{"view_html":"https://pith.science/pith/EJHIWN2KEPQQHY476M5XBFZK4U","download_json":"https://pith.science/pith/EJHIWN2KEPQQHY476M5XBFZK4U.json","view_paper":"https://pith.science/paper/EJHIWN2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04086&json=true","fetch_graph":"https://pith.science/api/pith-number/EJHIWN2KEPQQHY476M5XBFZK4U/graph.json","fetch_events":"https://pith.science/api/pith-number/EJHIWN2KEPQQHY476M5XBFZK4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJHIWN2KEPQQHY476M5XBFZK4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJHIWN2KEPQQHY476M5XBFZK4U/action/storage_attestation","attest_author":"https://pith.science/pith/EJHIWN2KEPQQHY476M5XBFZK4U/action/author_attestation","sign_citation":"https://pith.science/pith/EJHIWN2KEPQQHY476M5XBFZK4U/action/citation_signature","submit_replication":"https://pith.science/pith/EJHIWN2KEPQQHY476M5XBFZK4U/action/replication_record"}},"created_at":"2026-05-18T00:22:40.069823+00:00","updated_at":"2026-05-18T00:22:40.069823+00:00"}