{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6TS4DJYYJW3SQ3GESU32O5PN7I","short_pith_number":"pith:6TS4DJYY","canonical_record":{"source":{"id":"1109.4459","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T02:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"7e2e7b5a7efe8045b9f759b1ac43cf956f6b313eafe8fb1d43f6fec311e21367","abstract_canon_sha256":"83d2edb6129d26e178971a7896e2d6e917afebfa2e739b3e2ef3a3e34290adf9"},"schema_version":"1.0"},"canonical_sha256":"f4e5c1a7184db7286cc49537a775edfa226e0c9625a2d404d84f431420c7662f","source":{"kind":"arxiv","id":"1109.4459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4459","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4459v1","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4459","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"6TS4DJYYJW3S","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6TS4DJYYJW3SQ3GE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6TS4DJYY","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6TS4DJYYJW3SQ3GESU32O5PN7I","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4459","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T02:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"7e2e7b5a7efe8045b9f759b1ac43cf956f6b313eafe8fb1d43f6fec311e21367","abstract_canon_sha256":"83d2edb6129d26e178971a7896e2d6e917afebfa2e739b3e2ef3a3e34290adf9"},"schema_version":"1.0"},"canonical_sha256":"f4e5c1a7184db7286cc49537a775edfa226e0c9625a2d404d84f431420c7662f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:34.714133Z","signature_b64":"aRrCmnL1obgprgrcIN7PRXCwKQcHWMimGNjzRvqYJC81I6qRGlj5DPXDRlzV8TbuGHcBPn2jPcI/tRVrGguoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4e5c1a7184db7286cc49537a775edfa226e0c9625a2d404d84f431420c7662f","last_reissued_at":"2026-05-18T04:12:34.713669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:34.713669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4459","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-18T04:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/sZ5sUO+QqNG6uF4+ZtMAQT1r19mdmWoMeb4rXcF3yXPOOLbAukGFDzC5m90Kjw99VIuywyKqX/rSMxZm0QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:16:04.673986Z"},"content_sha256":"5bdb988d7d7cfe0e1dfb740a5691e755fe07267a3bda7f6b3dd467ae531010ac","schema_version":"1.0","event_id":"sha256:5bdb988d7d7cfe0e1dfb740a5691e755fe07267a3bda7f6b3dd467ae531010ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6TS4DJYYJW3SQ3GESU32O5PN7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou, Wei Xiong","submitted_at":"2011-09-21T02:05:31Z","abstract_excerpt":"The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, $k$-error linear complexity, the minimum error and the $k$-error linear complexity profile, the notion of $m$-tight error linear complexity is presented. An efficient algorithm for computing $m$-tight error linear complexity is derived from the algorithm for computing $k$-error linear complexity of sequences over GF($p^{m}$) with period $p^n$, where $p$ is a prime. The validity of the algorithm is shown. The algorithm is also realized with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4459","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-18T04:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjz/SN4N5e1J6qopDznH2lYBGVKlwsfAZYsy4Xr7DBdZVofrUZ8U/VJ0hBeUMKta3iCbCdHpqXootU5AlVxaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:16:04.674683Z"},"content_sha256":"3260feed85a771dc97afe1bf781b1a5c07a0ad9ba641436dbd2ba2ebf25f36ad","schema_version":"1.0","event_id":"sha256:3260feed85a771dc97afe1bf781b1a5c07a0ad9ba641436dbd2ba2ebf25f36ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TS4DJYYJW3SQ3GESU32O5PN7I/bundle.json","state_url":"https://pith.science/pith/6TS4DJYYJW3SQ3GESU32O5PN7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TS4DJYYJW3SQ3GESU32O5PN7I/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-10T13:16:04Z","links":{"resolver":"https://pith.science/pith/6TS4DJYYJW3SQ3GESU32O5PN7I","bundle":"https://pith.science/pith/6TS4DJYYJW3SQ3GESU32O5PN7I/bundle.json","state":"https://pith.science/pith/6TS4DJYYJW3SQ3GESU32O5PN7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TS4DJYYJW3SQ3GESU32O5PN7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6TS4DJYYJW3SQ3GESU32O5PN7I","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":"83d2edb6129d26e178971a7896e2d6e917afebfa2e739b3e2ef3a3e34290adf9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T02:05:31Z","title_canon_sha256":"7e2e7b5a7efe8045b9f759b1ac43cf956f6b313eafe8fb1d43f6fec311e21367"},"schema_version":"1.0","source":{"id":"1109.4459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4459","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4459v1","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4459","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"6TS4DJYYJW3S","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6TS4DJYYJW3SQ3GE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6TS4DJYY","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:3260feed85a771dc97afe1bf781b1a5c07a0ad9ba641436dbd2ba2ebf25f36ad","target":"graph","created_at":"2026-05-18T04:12:34Z","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":"The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, $k$-error linear complexity, the minimum error and the $k$-error linear complexity profile, the notion of $m$-tight error linear complexity is presented. An efficient algorithm for computing $m$-tight error linear complexity is derived from the algorithm for computing $k$-error linear complexity of sequences over GF($p^{m}$) with period $p^n$, where $p$ is a prime. The validity of the algorithm is shown. The algorithm is also realized with ","authors_text":"Jianqin Zhou, Wei Xiong","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T02:05:31Z","title":"An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4459","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:5bdb988d7d7cfe0e1dfb740a5691e755fe07267a3bda7f6b3dd467ae531010ac","target":"record","created_at":"2026-05-18T04:12:34Z","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":"83d2edb6129d26e178971a7896e2d6e917afebfa2e739b3e2ef3a3e34290adf9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T02:05:31Z","title_canon_sha256":"7e2e7b5a7efe8045b9f759b1ac43cf956f6b313eafe8fb1d43f6fec311e21367"},"schema_version":"1.0","source":{"id":"1109.4459","kind":"arxiv","version":1}},"canonical_sha256":"f4e5c1a7184db7286cc49537a775edfa226e0c9625a2d404d84f431420c7662f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4e5c1a7184db7286cc49537a775edfa226e0c9625a2d404d84f431420c7662f","first_computed_at":"2026-05-18T04:12:34.713669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:34.713669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aRrCmnL1obgprgrcIN7PRXCwKQcHWMimGNjzRvqYJC81I6qRGlj5DPXDRlzV8TbuGHcBPn2jPcI/tRVrGguoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:34.714133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bdb988d7d7cfe0e1dfb740a5691e755fe07267a3bda7f6b3dd467ae531010ac","sha256:3260feed85a771dc97afe1bf781b1a5c07a0ad9ba641436dbd2ba2ebf25f36ad"],"state_sha256":"c202a424ddf7bda8ed81186802f9e52ce69a7fc201b9bed5788f27b4c8e1e2d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uFwhXicG2UEj8u62z1ljpuTe+Cfrkr7N0FKFQJfcAtO1JPNSKlFG4QG49B5eVvBaKBbi75SF9hYEWitPCD4eDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:16:04.678386Z","bundle_sha256":"eb3cca8fa8c0f85a983befd052c6aefc8366783fec479dc052b6850fc3f91fea"}}