{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JK3MADBI32CL6VBZ7LX6IJNJMT","short_pith_number":"pith:JK3MADBI","schema_version":"1.0","canonical_sha256":"4ab6c00c28de84bf5439faefe425a964d72453b39f43d92c9e02701e922860c8","source":{"kind":"arxiv","id":"1803.03912","version":4},"attestation_state":"computed","paper":{"title":"On the linear complexity for multidimensional sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Andrew Tirkel, Domingo G\\'omez-P\\'erez, Min Sha","submitted_at":"2018-03-11T06:24:39Z","abstract_excerpt":"In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and $k$-error linear complexity of multidimensional periodic sequences."},"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":"1803.03912","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-11T06:24:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9951cc15c9674f2ac78ab23c9d33c3897511b9244d3a7c807bdfa0e8576b5d46","abstract_canon_sha256":"9ccff93c7238584d22d2013e873a2dc7104f3cc496d8ff24c69bad98ff83b161"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:41.672808Z","signature_b64":"/pd+DQg+0SmDerANAWX2ib9dp+djqD901wz9ZSaF7bypAFSHcz5aqOywC58wnHmSrtSnIMRszxt73ZsKkm7VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ab6c00c28de84bf5439faefe425a964d72453b39f43d92c9e02701e922860c8","last_reissued_at":"2026-05-18T00:09:41.672289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:41.672289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the linear complexity for multidimensional sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Andrew Tirkel, Domingo G\\'omez-P\\'erez, Min Sha","submitted_at":"2018-03-11T06:24:39Z","abstract_excerpt":"In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and $k$-error linear complexity of multidimensional periodic sequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03912","kind":"arxiv","version":4},"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":"1803.03912","created_at":"2026-05-18T00:09:41.672384+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03912v4","created_at":"2026-05-18T00:09:41.672384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03912","created_at":"2026-05-18T00:09:41.672384+00:00"},{"alias_kind":"pith_short_12","alias_value":"JK3MADBI32CL","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JK3MADBI32CL6VBZ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JK3MADBI","created_at":"2026-05-18T12:32:31.084164+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/JK3MADBI32CL6VBZ7LX6IJNJMT","json":"https://pith.science/pith/JK3MADBI32CL6VBZ7LX6IJNJMT.json","graph_json":"https://pith.science/api/pith-number/JK3MADBI32CL6VBZ7LX6IJNJMT/graph.json","events_json":"https://pith.science/api/pith-number/JK3MADBI32CL6VBZ7LX6IJNJMT/events.json","paper":"https://pith.science/paper/JK3MADBI"},"agent_actions":{"view_html":"https://pith.science/pith/JK3MADBI32CL6VBZ7LX6IJNJMT","download_json":"https://pith.science/pith/JK3MADBI32CL6VBZ7LX6IJNJMT.json","view_paper":"https://pith.science/paper/JK3MADBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03912&json=true","fetch_graph":"https://pith.science/api/pith-number/JK3MADBI32CL6VBZ7LX6IJNJMT/graph.json","fetch_events":"https://pith.science/api/pith-number/JK3MADBI32CL6VBZ7LX6IJNJMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JK3MADBI32CL6VBZ7LX6IJNJMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JK3MADBI32CL6VBZ7LX6IJNJMT/action/storage_attestation","attest_author":"https://pith.science/pith/JK3MADBI32CL6VBZ7LX6IJNJMT/action/author_attestation","sign_citation":"https://pith.science/pith/JK3MADBI32CL6VBZ7LX6IJNJMT/action/citation_signature","submit_replication":"https://pith.science/pith/JK3MADBI32CL6VBZ7LX6IJNJMT/action/replication_record"}},"created_at":"2026-05-18T00:09:41.672384+00:00","updated_at":"2026-05-18T00:09:41.672384+00:00"}