{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WR6WIYIZGTVWM2YPK5SQ2PENOL","short_pith_number":"pith:WR6WIYIZ","schema_version":"1.0","canonical_sha256":"b47d64611934eb666b0f57650d3c8d72eafdf9f39ce9cdcdebb4d28ed6ac49d7","source":{"kind":"arxiv","id":"1410.2182","version":1},"attestation_state":"computed","paper":{"title":"Linear complexity problems of level sequences of Euler quotients and their related binary sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"Xiaoni Du, Zhihua Niu, Zhixiong Chen","submitted_at":"2014-09-20T19:02:36Z","abstract_excerpt":"The Euler quotient modulo an odd-prime power $p^r~(r>1)$ can be uniquely decomposed as a $p$-adic number of the form $$ \\frac{u^{(p-1)p^{r-1}} -1}{p^r}\\equiv a_0(u)+a_1(u)p+\\ldots+a_{r-1}(u)p^{r-1} \\pmod {p^r},~ \\gcd(u,p)=1, $$ where $0\\le a_j(u)<p$ for $0\\le j\\le r-1$ and we set all $a_j(u)=0$ if $\\gcd(u,p)>1$. We firstly study certain arithmetic properties of the level sequences $(a_j(u))_{u\\ge 0}$ over $\\mathbb{F}_p$ via introducing a new quotient. Then we determine the exact values of linear complexity of $(a_j(u))_{u\\ge 0}$ and values of $k$-error linear complexity for binary sequences de"},"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":"1410.2182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-20T19:02:36Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"77a9d60d5f52ee2b78ead9684f604bd093f12b8dc6c2405012384eacec5acda3","abstract_canon_sha256":"8b833c8b08fc02fc3c6be476e112c0d287fd63faa86f27e98024f3e0d4f0ad1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:14.288552Z","signature_b64":"Z/cRG2UZShdOuV4t3GY5c8yPnrs6a9bf2NR1wrXPMhyucW9E9C61FROzLzoft8J0kLv9migxJIue889R7NXSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b47d64611934eb666b0f57650d3c8d72eafdf9f39ce9cdcdebb4d28ed6ac49d7","last_reissued_at":"2026-05-18T01:19:14.287918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:14.287918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear complexity problems of level sequences of Euler quotients and their related binary sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"Xiaoni Du, Zhihua Niu, Zhixiong Chen","submitted_at":"2014-09-20T19:02:36Z","abstract_excerpt":"The Euler quotient modulo an odd-prime power $p^r~(r>1)$ can be uniquely decomposed as a $p$-adic number of the form $$ \\frac{u^{(p-1)p^{r-1}} -1}{p^r}\\equiv a_0(u)+a_1(u)p+\\ldots+a_{r-1}(u)p^{r-1} \\pmod {p^r},~ \\gcd(u,p)=1, $$ where $0\\le a_j(u)<p$ for $0\\le j\\le r-1$ and we set all $a_j(u)=0$ if $\\gcd(u,p)>1$. We firstly study certain arithmetic properties of the level sequences $(a_j(u))_{u\\ge 0}$ over $\\mathbb{F}_p$ via introducing a new quotient. Then we determine the exact values of linear complexity of $(a_j(u))_{u\\ge 0}$ and values of $k$-error linear complexity for binary sequences de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2182","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":"1410.2182","created_at":"2026-05-18T01:19:14.287999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2182v1","created_at":"2026-05-18T01:19:14.287999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2182","created_at":"2026-05-18T01:19:14.287999+00:00"},{"alias_kind":"pith_short_12","alias_value":"WR6WIYIZGTVW","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WR6WIYIZGTVWM2YP","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WR6WIYIZ","created_at":"2026-05-18T12:28:54.890064+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/WR6WIYIZGTVWM2YPK5SQ2PENOL","json":"https://pith.science/pith/WR6WIYIZGTVWM2YPK5SQ2PENOL.json","graph_json":"https://pith.science/api/pith-number/WR6WIYIZGTVWM2YPK5SQ2PENOL/graph.json","events_json":"https://pith.science/api/pith-number/WR6WIYIZGTVWM2YPK5SQ2PENOL/events.json","paper":"https://pith.science/paper/WR6WIYIZ"},"agent_actions":{"view_html":"https://pith.science/pith/WR6WIYIZGTVWM2YPK5SQ2PENOL","download_json":"https://pith.science/pith/WR6WIYIZGTVWM2YPK5SQ2PENOL.json","view_paper":"https://pith.science/paper/WR6WIYIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2182&json=true","fetch_graph":"https://pith.science/api/pith-number/WR6WIYIZGTVWM2YPK5SQ2PENOL/graph.json","fetch_events":"https://pith.science/api/pith-number/WR6WIYIZGTVWM2YPK5SQ2PENOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WR6WIYIZGTVWM2YPK5SQ2PENOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WR6WIYIZGTVWM2YPK5SQ2PENOL/action/storage_attestation","attest_author":"https://pith.science/pith/WR6WIYIZGTVWM2YPK5SQ2PENOL/action/author_attestation","sign_citation":"https://pith.science/pith/WR6WIYIZGTVWM2YPK5SQ2PENOL/action/citation_signature","submit_replication":"https://pith.science/pith/WR6WIYIZGTVWM2YPK5SQ2PENOL/action/replication_record"}},"created_at":"2026-05-18T01:19:14.287999+00:00","updated_at":"2026-05-18T01:19:14.287999+00:00"}