{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IMU6XIQDSZOJCTUY5VBLW2BG6L","short_pith_number":"pith:IMU6XIQD","schema_version":"1.0","canonical_sha256":"4329eba203965c914e98ed42bb6826f2d1de1cea6f5d7e31140619333214a476","source":{"kind":"arxiv","id":"1712.03947","version":1},"attestation_state":"computed","paper":{"title":"The linear complexity of new binary cyclotomic sequences of period $p^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"Vladimir Edemskiy","submitted_at":"2017-12-11T18:53:31Z","abstract_excerpt":"In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear complexity of these sequences."},"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":"1712.03947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-11T18:53:31Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"897e65a4a8a7ac0d22f1c3d92077b18ff8066da4405166086cee6863b748c474","abstract_canon_sha256":"ca8177b99045166a122671f59e7db8cc2428966ca8099eacedb48ee4a0c85a13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:19.488165Z","signature_b64":"mtreOC0H13ho//6Cq+ghCOfQDbKeRMY2FWdpSi62CQIpJwgewMsjU2UZh8MaRIy/s80GgLUtFGTy9pwaPBmTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4329eba203965c914e98ed42bb6826f2d1de1cea6f5d7e31140619333214a476","last_reissued_at":"2026-05-18T00:28:19.487462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:19.487462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The linear complexity of new binary cyclotomic sequences of period $p^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"Vladimir Edemskiy","submitted_at":"2017-12-11T18:53:31Z","abstract_excerpt":"In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear complexity of these sequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03947","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":"1712.03947","created_at":"2026-05-18T00:28:19.487571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03947v1","created_at":"2026-05-18T00:28:19.487571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03947","created_at":"2026-05-18T00:28:19.487571+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMU6XIQDSZOJ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMU6XIQDSZOJCTUY","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMU6XIQD","created_at":"2026-05-18T12:31:21.493067+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/IMU6XIQDSZOJCTUY5VBLW2BG6L","json":"https://pith.science/pith/IMU6XIQDSZOJCTUY5VBLW2BG6L.json","graph_json":"https://pith.science/api/pith-number/IMU6XIQDSZOJCTUY5VBLW2BG6L/graph.json","events_json":"https://pith.science/api/pith-number/IMU6XIQDSZOJCTUY5VBLW2BG6L/events.json","paper":"https://pith.science/paper/IMU6XIQD"},"agent_actions":{"view_html":"https://pith.science/pith/IMU6XIQDSZOJCTUY5VBLW2BG6L","download_json":"https://pith.science/pith/IMU6XIQDSZOJCTUY5VBLW2BG6L.json","view_paper":"https://pith.science/paper/IMU6XIQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03947&json=true","fetch_graph":"https://pith.science/api/pith-number/IMU6XIQDSZOJCTUY5VBLW2BG6L/graph.json","fetch_events":"https://pith.science/api/pith-number/IMU6XIQDSZOJCTUY5VBLW2BG6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMU6XIQDSZOJCTUY5VBLW2BG6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMU6XIQDSZOJCTUY5VBLW2BG6L/action/storage_attestation","attest_author":"https://pith.science/pith/IMU6XIQDSZOJCTUY5VBLW2BG6L/action/author_attestation","sign_citation":"https://pith.science/pith/IMU6XIQDSZOJCTUY5VBLW2BG6L/action/citation_signature","submit_replication":"https://pith.science/pith/IMU6XIQDSZOJCTUY5VBLW2BG6L/action/replication_record"}},"created_at":"2026-05-18T00:28:19.487571+00:00","updated_at":"2026-05-18T00:28:19.487571+00:00"}