{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P7OS63POVWRTEHOS4WVDRQBDB4","short_pith_number":"pith:P7OS63PO","canonical_record":{"source":{"id":"1708.05480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T01:52:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ff12fcc26110c6836679f3150f10cbfba2b100c82e30e6816b78d37ac40aaab6","abstract_canon_sha256":"53070b9df9a2ee8f0257c89dc2b8deb06cca781385eaabb02a007e5c26d10a4b"},"schema_version":"1.0"},"canonical_sha256":"7fdd2f6deeada3321dd2e5aa38c0230f1d079fb3a02af852dbde89325ab6caa2","source":{"kind":"arxiv","id":"1708.05480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05480","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05480v2","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05480","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"P7OS63POVWRT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P7OS63POVWRTEHOS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P7OS63PO","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P7OS63POVWRTEHOS4WVDRQBDB4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T01:52:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ff12fcc26110c6836679f3150f10cbfba2b100c82e30e6816b78d37ac40aaab6","abstract_canon_sha256":"53070b9df9a2ee8f0257c89dc2b8deb06cca781385eaabb02a007e5c26d10a4b"},"schema_version":"1.0"},"canonical_sha256":"7fdd2f6deeada3321dd2e5aa38c0230f1d079fb3a02af852dbde89325ab6caa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:00.289293Z","signature_b64":"Phn24+9HcKAjFpi6q9BuTi6yvYPG71UJsLb38PWMefH8+TdEKcMXtjpFffWuACHPxXvdscDtPKSEZpsDZ4/WAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fdd2f6deeada3321dd2e5aa38c0230f1d079fb3a02af852dbde89325ab6caa2","last_reissued_at":"2026-05-18T00:27:00.288638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:00.288638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05480","source_version":2,"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-18T00:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uM1v33zWrzTnV7Yp9rkLb1NEwZ1lr3v1WFMBmOnBV1/DVynDZblC7ffYuCcbs7xQnzpe3ChrfeJN17CXA8OxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:56:33.445115Z"},"content_sha256":"6801ae3ad1ab32260ef07cdfde5a7cafcb047a87ae9090aeaf9cdab7114d8b39","schema_version":"1.0","event_id":"sha256:6801ae3ad1ab32260ef07cdfde5a7cafcb047a87ae9090aeaf9cdab7114d8b39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P7OS63POVWRTEHOS4WVDRQBDB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cuiling Fan","submitted_at":"2017-08-18T01:52:44Z","abstract_excerpt":"Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period $4p$ with optimal autocorrelation was proposed via interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where $p$ is an odd prime with $p\\equiv 1(\\bmod~4)$. The objective of this paper is to determine the minimal polynomial and the linear complexity of this class of binary optimal sequences via sequence polynomial approach. It turns out that this cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05480","kind":"arxiv","version":2},"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-18T00:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UY2eHAbT8tNr7bvcU4Rucm7dmBXdCZ05A7YnCjl21RHMRLQYftaXG2jRwJGq7WrM+4DNMyBnQpqF81211AatBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:56:33.445784Z"},"content_sha256":"eaa29e0908ef9c29fb9e8e01bde54938518bc0223f53795c9a4c41f7e97c1d18","schema_version":"1.0","event_id":"sha256:eaa29e0908ef9c29fb9e8e01bde54938518bc0223f53795c9a4c41f7e97c1d18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7OS63POVWRTEHOS4WVDRQBDB4/bundle.json","state_url":"https://pith.science/pith/P7OS63POVWRTEHOS4WVDRQBDB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7OS63POVWRTEHOS4WVDRQBDB4/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-05-19T07:56:33Z","links":{"resolver":"https://pith.science/pith/P7OS63POVWRTEHOS4WVDRQBDB4","bundle":"https://pith.science/pith/P7OS63POVWRTEHOS4WVDRQBDB4/bundle.json","state":"https://pith.science/pith/P7OS63POVWRTEHOS4WVDRQBDB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7OS63POVWRTEHOS4WVDRQBDB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P7OS63POVWRTEHOS4WVDRQBDB4","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":"53070b9df9a2ee8f0257c89dc2b8deb06cca781385eaabb02a007e5c26d10a4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T01:52:44Z","title_canon_sha256":"ff12fcc26110c6836679f3150f10cbfba2b100c82e30e6816b78d37ac40aaab6"},"schema_version":"1.0","source":{"id":"1708.05480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05480","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05480v2","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05480","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"P7OS63POVWRT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P7OS63POVWRTEHOS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P7OS63PO","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:eaa29e0908ef9c29fb9e8e01bde54938518bc0223f53795c9a4c41f7e97c1d18","target":"graph","created_at":"2026-05-18T00:27:00Z","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":"Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period $4p$ with optimal autocorrelation was proposed via interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where $p$ is an odd prime with $p\\equiv 1(\\bmod~4)$. The objective of this paper is to determine the minimal polynomial and the linear complexity of this class of binary optimal sequences via sequence polynomial approach. It turns out that this cl","authors_text":"Cuiling Fan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T01:52:44Z","title":"The Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05480","kind":"arxiv","version":2},"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:6801ae3ad1ab32260ef07cdfde5a7cafcb047a87ae9090aeaf9cdab7114d8b39","target":"record","created_at":"2026-05-18T00:27:00Z","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":"53070b9df9a2ee8f0257c89dc2b8deb06cca781385eaabb02a007e5c26d10a4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T01:52:44Z","title_canon_sha256":"ff12fcc26110c6836679f3150f10cbfba2b100c82e30e6816b78d37ac40aaab6"},"schema_version":"1.0","source":{"id":"1708.05480","kind":"arxiv","version":2}},"canonical_sha256":"7fdd2f6deeada3321dd2e5aa38c0230f1d079fb3a02af852dbde89325ab6caa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fdd2f6deeada3321dd2e5aa38c0230f1d079fb3a02af852dbde89325ab6caa2","first_computed_at":"2026-05-18T00:27:00.288638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:00.288638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Phn24+9HcKAjFpi6q9BuTi6yvYPG71UJsLb38PWMefH8+TdEKcMXtjpFffWuACHPxXvdscDtPKSEZpsDZ4/WAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:00.289293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6801ae3ad1ab32260ef07cdfde5a7cafcb047a87ae9090aeaf9cdab7114d8b39","sha256:eaa29e0908ef9c29fb9e8e01bde54938518bc0223f53795c9a4c41f7e97c1d18"],"state_sha256":"f89d01bf9f75d97d428a9d729eb831bd5ee59cbd068d0542a91786d419999c1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDQ3RE8KFMAh6GHvEifjvLr6g/7sPjdVVN1aS80f+F4MrpcolhEu92xrJgVkj8VnIztB6Bf7R5BTtz2T3CMNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:56:33.448745Z","bundle_sha256":"ea8c53a9b78d9e8544005af4cd0cd9779e47ae3adcd780afa6904601f7932bc2"}}