{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7KBQAUYKGYWSE7IX4SO2LZMEWU","short_pith_number":"pith:7KBQAUYK","schema_version":"1.0","canonical_sha256":"fa8300530a362d227d17e49da5e584b50a208658ce6df316b10d81487127de4a","source":{"kind":"arxiv","id":"1312.1583","version":1},"attestation_state":"computed","paper":{"title":"Sequences with high nonlinear complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Harald Niederreiter","submitted_at":"2013-12-05T15:35:01Z","abstract_excerpt":"We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite fields."},"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":"1312.1583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-05T15:35:01Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"0969e9e185401abf5b7a68c54d7b563a9d640aacc875aa14908cee697bbe5a58","abstract_canon_sha256":"321194105dd80ad3a3f14f0527284d5960aadf6c9844d0ec53d7ce1ed048cfda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:26.807095Z","signature_b64":"PXzDtJ7E5HVDGk2h5/MAIxStRldU+BUz5dcPjR2uz6kDjj7/cWjSa8rEWAadcr937S9QoMj6LMPbcVg6Hc52BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa8300530a362d227d17e49da5e584b50a208658ce6df316b10d81487127de4a","last_reissued_at":"2026-05-18T03:05:26.806546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:26.806546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequences with high nonlinear complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Harald Niederreiter","submitted_at":"2013-12-05T15:35:01Z","abstract_excerpt":"We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite fields."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1583","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":"1312.1583","created_at":"2026-05-18T03:05:26.806635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1583v1","created_at":"2026-05-18T03:05:26.806635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1583","created_at":"2026-05-18T03:05:26.806635+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KBQAUYKGYWS","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KBQAUYKGYWSE7IX","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KBQAUYK","created_at":"2026-05-18T12:27:36.564083+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/7KBQAUYKGYWSE7IX4SO2LZMEWU","json":"https://pith.science/pith/7KBQAUYKGYWSE7IX4SO2LZMEWU.json","graph_json":"https://pith.science/api/pith-number/7KBQAUYKGYWSE7IX4SO2LZMEWU/graph.json","events_json":"https://pith.science/api/pith-number/7KBQAUYKGYWSE7IX4SO2LZMEWU/events.json","paper":"https://pith.science/paper/7KBQAUYK"},"agent_actions":{"view_html":"https://pith.science/pith/7KBQAUYKGYWSE7IX4SO2LZMEWU","download_json":"https://pith.science/pith/7KBQAUYKGYWSE7IX4SO2LZMEWU.json","view_paper":"https://pith.science/paper/7KBQAUYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1583&json=true","fetch_graph":"https://pith.science/api/pith-number/7KBQAUYKGYWSE7IX4SO2LZMEWU/graph.json","fetch_events":"https://pith.science/api/pith-number/7KBQAUYKGYWSE7IX4SO2LZMEWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KBQAUYKGYWSE7IX4SO2LZMEWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KBQAUYKGYWSE7IX4SO2LZMEWU/action/storage_attestation","attest_author":"https://pith.science/pith/7KBQAUYKGYWSE7IX4SO2LZMEWU/action/author_attestation","sign_citation":"https://pith.science/pith/7KBQAUYKGYWSE7IX4SO2LZMEWU/action/citation_signature","submit_replication":"https://pith.science/pith/7KBQAUYKGYWSE7IX4SO2LZMEWU/action/replication_record"}},"created_at":"2026-05-18T03:05:26.806635+00:00","updated_at":"2026-05-18T03:05:26.806635+00:00"}