{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:5BFUFB22NTKMXX37QJXWFKC6MU","short_pith_number":"pith:5BFUFB22","canonical_record":{"source":{"id":"cs/0512040","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CR","submitted_at":"2005-12-10T00:38:45Z","cross_cats_sorted":[],"title_canon_sha256":"e1115b0751805c1f5b5125ac6f00729fda890b47615f87b3c42248799ba37d0f","abstract_canon_sha256":"969285c8191b446104f3f222bc4f5d5dc76718d3a8e18d44926ba2234bec9e30"},"schema_version":"1.0"},"canonical_sha256":"e84b42875a6cd4cbdf7f826f62a85e6524a0c1c1f53178eb92c4af3ae8d760be","source":{"kind":"arxiv","id":"cs/0512040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0512040","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0512040v1","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512040","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"5BFUFB22NTKM","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"pith_short_16","alias_value":"5BFUFB22NTKMXX37","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"pith_short_8","alias_value":"5BFUFB22","created_at":"2026-07-04T14:52:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:5BFUFB22NTKMXX37QJXWFKC6MU","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0512040","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CR","submitted_at":"2005-12-10T00:38:45Z","cross_cats_sorted":[],"title_canon_sha256":"e1115b0751805c1f5b5125ac6f00729fda890b47615f87b3c42248799ba37d0f","abstract_canon_sha256":"969285c8191b446104f3f222bc4f5d5dc76718d3a8e18d44926ba2234bec9e30"},"schema_version":"1.0"},"canonical_sha256":"e84b42875a6cd4cbdf7f826f62a85e6524a0c1c1f53178eb92c4af3ae8d760be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:52:06.418946Z","signature_b64":"z5Nux7bIv1hk5CEqVAYFPGY/O2M0XCVaL0Aqe+IJiMvNUFbinwv/zFvlrAT9nipSZIN7fyQ3zpg8YWCeXqhGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e84b42875a6cd4cbdf7f826f62a85e6524a0c1c1f53178eb92c4af3ae8d760be","last_reissued_at":"2026-07-04T14:52:06.418602Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:52:06.418602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0512040","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-07-04T14:52:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRx0ug4qjOgGrn4YFNSpn3wLheA2PjVzLfgYnwwhz1udaO0edtzdIVNcK9810ZmXJTyRZRQ4DVyO5RyPpF4bAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:04:07.153172Z"},"content_sha256":"7f294459e5704baad05b1fd245099c156fe16dae4ef1da20061776c1a3543ed8","schema_version":"1.0","event_id":"sha256:7f294459e5704baad05b1fd245099c156fe16dae4ef1da20061776c1a3543ed8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:5BFUFB22NTKMXX37QJXWFKC6MU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fast algorithm for determining the linear complexity of periodic sequences","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou","submitted_at":"2005-12-10T00:38:45Z","abstract_excerpt":"A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented here generalizes both the algorithm in [4] where the period of a sequence over GF(q) is p m and the algorithm in [5] where the period of a binary sequence is 2 n p m . When m=0, the algorithm simplifies the generalized Games-Chan algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512040","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0512040/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:52:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T916xCT0CXerhdTcO2PmzysuorYj+v5FxTvoVGgCUqPjg7CtaKNonU5sVGj/EBxxl53aNxKiPEwUmu+AErkaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:04:07.153553Z"},"content_sha256":"8b89877f2a45c0f9088ecd1ae9f50c8acaa4c8dbe3597d72fa155f8fc7463250","schema_version":"1.0","event_id":"sha256:8b89877f2a45c0f9088ecd1ae9f50c8acaa4c8dbe3597d72fa155f8fc7463250"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BFUFB22NTKMXX37QJXWFKC6MU/bundle.json","state_url":"https://pith.science/pith/5BFUFB22NTKMXX37QJXWFKC6MU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BFUFB22NTKMXX37QJXWFKC6MU/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-07-05T02:04:07Z","links":{"resolver":"https://pith.science/pith/5BFUFB22NTKMXX37QJXWFKC6MU","bundle":"https://pith.science/pith/5BFUFB22NTKMXX37QJXWFKC6MU/bundle.json","state":"https://pith.science/pith/5BFUFB22NTKMXX37QJXWFKC6MU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BFUFB22NTKMXX37QJXWFKC6MU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:5BFUFB22NTKMXX37QJXWFKC6MU","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":"969285c8191b446104f3f222bc4f5d5dc76718d3a8e18d44926ba2234bec9e30","cross_cats_sorted":[],"license":"","primary_cat":"cs.CR","submitted_at":"2005-12-10T00:38:45Z","title_canon_sha256":"e1115b0751805c1f5b5125ac6f00729fda890b47615f87b3c42248799ba37d0f"},"schema_version":"1.0","source":{"id":"cs/0512040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0512040","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0512040v1","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512040","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"5BFUFB22NTKM","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"pith_short_16","alias_value":"5BFUFB22NTKMXX37","created_at":"2026-07-04T14:52:06Z"},{"alias_kind":"pith_short_8","alias_value":"5BFUFB22","created_at":"2026-07-04T14:52:06Z"}],"graph_snapshots":[{"event_id":"sha256:8b89877f2a45c0f9088ecd1ae9f50c8acaa4c8dbe3597d72fa155f8fc7463250","target":"graph","created_at":"2026-07-04T14:52:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0512040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented here generalizes both the algorithm in [4] where the period of a sequence over GF(q) is p m and the algorithm in [5] where the period of a binary sequence is 2 n p m . When m=0, the algorithm simplifies the generalized Games-Chan algorithm.","authors_text":"Jianqin Zhou","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CR","submitted_at":"2005-12-10T00:38:45Z","title":"A fast algorithm for determining the linear complexity of periodic sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512040","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:7f294459e5704baad05b1fd245099c156fe16dae4ef1da20061776c1a3543ed8","target":"record","created_at":"2026-07-04T14:52:06Z","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":"969285c8191b446104f3f222bc4f5d5dc76718d3a8e18d44926ba2234bec9e30","cross_cats_sorted":[],"license":"","primary_cat":"cs.CR","submitted_at":"2005-12-10T00:38:45Z","title_canon_sha256":"e1115b0751805c1f5b5125ac6f00729fda890b47615f87b3c42248799ba37d0f"},"schema_version":"1.0","source":{"id":"cs/0512040","kind":"arxiv","version":1}},"canonical_sha256":"e84b42875a6cd4cbdf7f826f62a85e6524a0c1c1f53178eb92c4af3ae8d760be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e84b42875a6cd4cbdf7f826f62a85e6524a0c1c1f53178eb92c4af3ae8d760be","first_computed_at":"2026-07-04T14:52:06.418602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:52:06.418602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z5Nux7bIv1hk5CEqVAYFPGY/O2M0XCVaL0Aqe+IJiMvNUFbinwv/zFvlrAT9nipSZIN7fyQ3zpg8YWCeXqhGBg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:52:06.418946Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0512040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f294459e5704baad05b1fd245099c156fe16dae4ef1da20061776c1a3543ed8","sha256:8b89877f2a45c0f9088ecd1ae9f50c8acaa4c8dbe3597d72fa155f8fc7463250"],"state_sha256":"1c13c759870065d4034c121a65b56226d4e854943f00c0713a7ec40094c2758f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yR4ctWFnZIuTbo7FpyxM7pd61QvvHiHVb7RbkxghKAGlM6K2tdpRt+vCbRmrsYWgVOQOhrpN4DUIjOvDNzXiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T02:04:07.155530Z","bundle_sha256":"e98503faee0ee277324b4635cc1b4631114dc090dabf3dad469c93338682198f"}}