{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O3YPFAKPVEKZCDFCBX2OTYTMT4","short_pith_number":"pith:O3YPFAKP","schema_version":"1.0","canonical_sha256":"76f0f2814fa915910ca20df4e9e26c9f0365f14eeb9c8eea46b020b4c0413836","source":{"kind":"arxiv","id":"1604.06753","version":2},"attestation_state":"computed","paper":{"title":"A note on the multiple-recursive matrix method for generating pseudorandom vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Himanshu Kumar Haran, Sartaj Ul Hasan, Susil Kumar Bishoi","submitted_at":"2016-04-22T17:12:28Z","abstract_excerpt":"The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiple-recursive matrix method. Moreover, for improving the linear complexity, we introduce a tweak on the contents of the primitive multiple-recursive matrix method."},"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":"1604.06753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-04-22T17:12:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cd72a141ba3a0c86612cf007fa6eeb4c437b2dfcb29e22c7ff0592d8fc1551f1","abstract_canon_sha256":"c6a0a6d149fc4c6e8e4e14fabb743fb401a8f85a32d06dde3940eb7a4d437df0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:28.338666Z","signature_b64":"r6ib6fUOpJxIl5o02MGIohvTkbhPq1nn6F4zx92ytwhi+x4hN2/v7JPv656LvV3yTvFHsz+OXcT8sUWjaSNsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76f0f2814fa915910ca20df4e9e26c9f0365f14eeb9c8eea46b020b4c0413836","last_reissued_at":"2026-05-18T00:48:28.338065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:28.338065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the multiple-recursive matrix method for generating pseudorandom vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Himanshu Kumar Haran, Sartaj Ul Hasan, Susil Kumar Bishoi","submitted_at":"2016-04-22T17:12:28Z","abstract_excerpt":"The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiple-recursive matrix method. Moreover, for improving the linear complexity, we introduce a tweak on the contents of the primitive multiple-recursive matrix method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06753","kind":"arxiv","version":2},"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":"1604.06753","created_at":"2026-05-18T00:48:28.338149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06753v2","created_at":"2026-05-18T00:48:28.338149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06753","created_at":"2026-05-18T00:48:28.338149+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3YPFAKPVEKZ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3YPFAKPVEKZCDFC","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3YPFAKP","created_at":"2026-05-18T12:30:36.002864+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/O3YPFAKPVEKZCDFCBX2OTYTMT4","json":"https://pith.science/pith/O3YPFAKPVEKZCDFCBX2OTYTMT4.json","graph_json":"https://pith.science/api/pith-number/O3YPFAKPVEKZCDFCBX2OTYTMT4/graph.json","events_json":"https://pith.science/api/pith-number/O3YPFAKPVEKZCDFCBX2OTYTMT4/events.json","paper":"https://pith.science/paper/O3YPFAKP"},"agent_actions":{"view_html":"https://pith.science/pith/O3YPFAKPVEKZCDFCBX2OTYTMT4","download_json":"https://pith.science/pith/O3YPFAKPVEKZCDFCBX2OTYTMT4.json","view_paper":"https://pith.science/paper/O3YPFAKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06753&json=true","fetch_graph":"https://pith.science/api/pith-number/O3YPFAKPVEKZCDFCBX2OTYTMT4/graph.json","fetch_events":"https://pith.science/api/pith-number/O3YPFAKPVEKZCDFCBX2OTYTMT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3YPFAKPVEKZCDFCBX2OTYTMT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3YPFAKPVEKZCDFCBX2OTYTMT4/action/storage_attestation","attest_author":"https://pith.science/pith/O3YPFAKPVEKZCDFCBX2OTYTMT4/action/author_attestation","sign_citation":"https://pith.science/pith/O3YPFAKPVEKZCDFCBX2OTYTMT4/action/citation_signature","submit_replication":"https://pith.science/pith/O3YPFAKPVEKZCDFCBX2OTYTMT4/action/replication_record"}},"created_at":"2026-05-18T00:48:28.338149+00:00","updated_at":"2026-05-18T00:48:28.338149+00:00"}