{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:S3VFM5MZXCFTYZLALC7QVFYYU7","short_pith_number":"pith:S3VFM5MZ","canonical_record":{"source":{"id":"1307.6626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-25T03:28:42Z","cross_cats_sorted":[],"title_canon_sha256":"00b47d22aa1676cdac90c400ac7791fd3dae12a4deb06e4e272fe5ec625e4e7c","abstract_canon_sha256":"a60734a2905cdc8a2bd5b3184949b45fe5d671cb2d13461eaa602275c7c8c20b"},"schema_version":"1.0"},"canonical_sha256":"96ea567599b88b3c656058bf0a9718a7e36f7beedf698124e60c468f0fa91d75","source":{"kind":"arxiv","id":"1307.6626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6626","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6626v1","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6626","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"S3VFM5MZXCFT","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S3VFM5MZXCFTYZLA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S3VFM5MZ","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:S3VFM5MZXCFTYZLALC7QVFYYU7","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-25T03:28:42Z","cross_cats_sorted":[],"title_canon_sha256":"00b47d22aa1676cdac90c400ac7791fd3dae12a4deb06e4e272fe5ec625e4e7c","abstract_canon_sha256":"a60734a2905cdc8a2bd5b3184949b45fe5d671cb2d13461eaa602275c7c8c20b"},"schema_version":"1.0"},"canonical_sha256":"96ea567599b88b3c656058bf0a9718a7e36f7beedf698124e60c468f0fa91d75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:14.519559Z","signature_b64":"VbvkVF4RU5t3BGCkC9b2L5VkZzUG5YQp/i5PawGP1bclmbBkFBJrLGT+P13Q4IEyNaSz0YbGCkEg/pNs2hmGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96ea567599b88b3c656058bf0a9718a7e36f7beedf698124e60c468f0fa91d75","last_reissued_at":"2026-05-18T01:19:14.518780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:14.518780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6626","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-18T01:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wa3aQZYjDpO3rPVNYETm7n0Mb9Is66mb48syq80ADXogWjQNEFWgbYMzBnfI44LUSe0KPi+BiP9h2zIj9FbzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:59:33.453925Z"},"content_sha256":"494db209cd504c372e9ecd83040afc83ea5e540d4e7ba07bafc1e27baddb0a6a","schema_version":"1.0","event_id":"sha256:494db209cd504c372e9ecd83040afc83ea5e540d4e7ba07bafc1e27baddb0a6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:S3VFM5MZXCFTYZLALC7QVFYYU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the $k$-error linear complexity of binary sequences derived from polynomial quotients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Chenhuang Wu, Zhihua Niu, Zhixiong Chen","submitted_at":"2013-07-25T03:28:42Z","abstract_excerpt":"We investigate the $k$-error linear complexity of $p^2$-periodic binary sequences defined from the polynomial quotients (including the well-studied Fermat quotients), which is defined by $$ q_{p,w}(u)\\equiv \\frac{u^w-u^{wp}}{p} \\bmod p ~ \\mathrm{with} 0 \\le q_{p,w}(u) \\le p-1, ~u\\ge 0, $$ where $p$ is an odd prime and $1\\le w<p$. Indeed, first for all integers $k$, we determine exact values of the $k$-error linear complexity over the finite field $\\F_2$ for these binary sequences under the assumption of  f2 being a primitive root modulo $p^2$, and then we determine their $k$-error linear compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6626","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-18T01:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWdxGODfTskHytZYfmOrepKzDFNbHXZS4xzyX8Nja4hjnYYApCqXU/Z6X1mETva5T5poF7en51K7TpDVocKiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:59:33.454275Z"},"content_sha256":"c579cd7dad27190c8eeabe85de58057891e21fbf7df6b0369726664bdc06f53b","schema_version":"1.0","event_id":"sha256:c579cd7dad27190c8eeabe85de58057891e21fbf7df6b0369726664bdc06f53b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3VFM5MZXCFTYZLALC7QVFYYU7/bundle.json","state_url":"https://pith.science/pith/S3VFM5MZXCFTYZLALC7QVFYYU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3VFM5MZXCFTYZLALC7QVFYYU7/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-30T17:59:33Z","links":{"resolver":"https://pith.science/pith/S3VFM5MZXCFTYZLALC7QVFYYU7","bundle":"https://pith.science/pith/S3VFM5MZXCFTYZLALC7QVFYYU7/bundle.json","state":"https://pith.science/pith/S3VFM5MZXCFTYZLALC7QVFYYU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3VFM5MZXCFTYZLALC7QVFYYU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S3VFM5MZXCFTYZLALC7QVFYYU7","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":"a60734a2905cdc8a2bd5b3184949b45fe5d671cb2d13461eaa602275c7c8c20b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-25T03:28:42Z","title_canon_sha256":"00b47d22aa1676cdac90c400ac7791fd3dae12a4deb06e4e272fe5ec625e4e7c"},"schema_version":"1.0","source":{"id":"1307.6626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6626","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6626v1","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6626","created_at":"2026-05-18T01:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"S3VFM5MZXCFT","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S3VFM5MZXCFTYZLA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S3VFM5MZ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:c579cd7dad27190c8eeabe85de58057891e21fbf7df6b0369726664bdc06f53b","target":"graph","created_at":"2026-05-18T01:19:14Z","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":"We investigate the $k$-error linear complexity of $p^2$-periodic binary sequences defined from the polynomial quotients (including the well-studied Fermat quotients), which is defined by $$ q_{p,w}(u)\\equiv \\frac{u^w-u^{wp}}{p} \\bmod p ~ \\mathrm{with} 0 \\le q_{p,w}(u) \\le p-1, ~u\\ge 0, $$ where $p$ is an odd prime and $1\\le w<p$. Indeed, first for all integers $k$, we determine exact values of the $k$-error linear complexity over the finite field $\\F_2$ for these binary sequences under the assumption of  f2 being a primitive root modulo $p^2$, and then we determine their $k$-error linear compl","authors_text":"Chenhuang Wu, Zhihua Niu, Zhixiong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-25T03:28:42Z","title":"On the $k$-error linear complexity of binary sequences derived from polynomial quotients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6626","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:494db209cd504c372e9ecd83040afc83ea5e540d4e7ba07bafc1e27baddb0a6a","target":"record","created_at":"2026-05-18T01:19:14Z","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":"a60734a2905cdc8a2bd5b3184949b45fe5d671cb2d13461eaa602275c7c8c20b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-25T03:28:42Z","title_canon_sha256":"00b47d22aa1676cdac90c400ac7791fd3dae12a4deb06e4e272fe5ec625e4e7c"},"schema_version":"1.0","source":{"id":"1307.6626","kind":"arxiv","version":1}},"canonical_sha256":"96ea567599b88b3c656058bf0a9718a7e36f7beedf698124e60c468f0fa91d75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96ea567599b88b3c656058bf0a9718a7e36f7beedf698124e60c468f0fa91d75","first_computed_at":"2026-05-18T01:19:14.518780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:14.518780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VbvkVF4RU5t3BGCkC9b2L5VkZzUG5YQp/i5PawGP1bclmbBkFBJrLGT+P13Q4IEyNaSz0YbGCkEg/pNs2hmGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:14.519559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:494db209cd504c372e9ecd83040afc83ea5e540d4e7ba07bafc1e27baddb0a6a","sha256:c579cd7dad27190c8eeabe85de58057891e21fbf7df6b0369726664bdc06f53b"],"state_sha256":"03447b0990c4990e5981f52d7d02a5689c0fa93289e0571852cf0f5a9ae7ad6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4AsY6DnkweD+m7oDffbeysd359nWtM/6ErBWtXxghlvmEnmLyKphp0R/djPEjY3RfeB4q+v92HSnCqnIc5sBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:59:33.456240Z","bundle_sha256":"7877f0ebefebea489f68def2cb53f8863ef61042c2fef987d196cc7b6d6f8871"}}