{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:7MJBZR75JHP3AJYCLWZZQJVJVN","short_pith_number":"pith:7MJBZR75","canonical_record":{"source":{"id":"2108.11859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-26T15:34:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"902f907183d431fc537257fa299ea031c89aa287aa31d6f7520aca79f72d7940","abstract_canon_sha256":"561091c1de4fdcb6e1f4ed5233aca10bf7b6b42191a24960252e39b2bc1623bd"},"schema_version":"1.0"},"canonical_sha256":"fb121cc7fd49dfb027025db39826a9ab7e5c3adaf128876e4f42d7bc3a927185","source":{"kind":"arxiv","id":"2108.11859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.11859","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"2108.11859v1","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.11859","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"7MJBZR75JHP3","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"pith_short_16","alias_value":"7MJBZR75JHP3AJYC","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"pith_short_8","alias_value":"7MJBZR75","created_at":"2026-07-05T07:27:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:7MJBZR75JHP3AJYCLWZZQJVJVN","target":"record","payload":{"canonical_record":{"source":{"id":"2108.11859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-26T15:34:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"902f907183d431fc537257fa299ea031c89aa287aa31d6f7520aca79f72d7940","abstract_canon_sha256":"561091c1de4fdcb6e1f4ed5233aca10bf7b6b42191a24960252e39b2bc1623bd"},"schema_version":"1.0"},"canonical_sha256":"fb121cc7fd49dfb027025db39826a9ab7e5c3adaf128876e4f42d7bc3a927185","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:39.735685Z","signature_b64":"+R5y98zTyCXWQ4vWRMhbyuYJgcdzraOOYJO966JerbVMzaLIrvhH9LbrwKQzYJOaG7qzPR4GUT2B31SiGeFmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb121cc7fd49dfb027025db39826a9ab7e5c3adaf128876e4f42d7bc3a927185","last_reissued_at":"2026-07-05T07:27:39.735172Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:39.735172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.11859","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-05T07:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+sWbiP7j/TsVtMRdO0LEZRfVH23HycANfzWEkc47fvNiNLPJOhg5zKRp9zl6rFnfRqICHJnjcZnhr1ww+VPYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:02:20.999860Z"},"content_sha256":"a0ec27a3dae0c105dd5d38663f4ef96096638a28f2766ace820d4964dcb399a2","schema_version":"1.0","event_id":"sha256:a0ec27a3dae0c105dd5d38663f4ef96096638a28f2766ace820d4964dcb399a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:7MJBZR75JHP3AJYCLWZZQJVJVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary sequences with length n and nonlinear complexity not less than n/2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sicheng Liang, Xiangyong Zeng, Zhimin Sun, Zibi Xiao","submitted_at":"2021-08-26T15:34:37Z","abstract_excerpt":"In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all binary sequences with length $n$ and nonlinear complexity $c_{n}\\geq n/2$, where $n$ is an integer larger than $2$. Furthermore, a formula is established to calculate the exact number of these sequences. The distribution of nonlinear complexity for these sequences is thus completely determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.11859","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/2108.11859/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-05T07:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dknCd4PZLeEPaHT5Dm5gED0TASWEaVK4Q7ehst2qqJhduyTXvujd5YTcTECABRuiFUDwqjFx1FTWkAK4UM7vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:02:21.000379Z"},"content_sha256":"25616354f7e645a470076cb915c4beabd39c709c88f907c12972ce83be47cc86","schema_version":"1.0","event_id":"sha256:25616354f7e645a470076cb915c4beabd39c709c88f907c12972ce83be47cc86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MJBZR75JHP3AJYCLWZZQJVJVN/bundle.json","state_url":"https://pith.science/pith/7MJBZR75JHP3AJYCLWZZQJVJVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MJBZR75JHP3AJYCLWZZQJVJVN/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-08-17T20:02:21Z","links":{"resolver":"https://pith.science/pith/7MJBZR75JHP3AJYCLWZZQJVJVN","bundle":"https://pith.science/pith/7MJBZR75JHP3AJYCLWZZQJVJVN/bundle.json","state":"https://pith.science/pith/7MJBZR75JHP3AJYCLWZZQJVJVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MJBZR75JHP3AJYCLWZZQJVJVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:7MJBZR75JHP3AJYCLWZZQJVJVN","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":"561091c1de4fdcb6e1f4ed5233aca10bf7b6b42191a24960252e39b2bc1623bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-26T15:34:37Z","title_canon_sha256":"902f907183d431fc537257fa299ea031c89aa287aa31d6f7520aca79f72d7940"},"schema_version":"1.0","source":{"id":"2108.11859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.11859","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"2108.11859v1","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.11859","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"7MJBZR75JHP3","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"pith_short_16","alias_value":"7MJBZR75JHP3AJYC","created_at":"2026-07-05T07:27:39Z"},{"alias_kind":"pith_short_8","alias_value":"7MJBZR75","created_at":"2026-07-05T07:27:39Z"}],"graph_snapshots":[{"event_id":"sha256:25616354f7e645a470076cb915c4beabd39c709c88f907c12972ce83be47cc86","target":"graph","created_at":"2026-07-05T07:27:39Z","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/2108.11859/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all binary sequences with length $n$ and nonlinear complexity $c_{n}\\geq n/2$, where $n$ is an integer larger than $2$. Furthermore, a formula is established to calculate the exact number of these sequences. The distribution of nonlinear complexity for these sequences is thus completely determined.","authors_text":"Sicheng Liang, Xiangyong Zeng, Zhimin Sun, Zibi Xiao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-26T15:34:37Z","title":"Binary sequences with length n and nonlinear complexity not less than n/2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.11859","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:a0ec27a3dae0c105dd5d38663f4ef96096638a28f2766ace820d4964dcb399a2","target":"record","created_at":"2026-07-05T07:27:39Z","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":"561091c1de4fdcb6e1f4ed5233aca10bf7b6b42191a24960252e39b2bc1623bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-08-26T15:34:37Z","title_canon_sha256":"902f907183d431fc537257fa299ea031c89aa287aa31d6f7520aca79f72d7940"},"schema_version":"1.0","source":{"id":"2108.11859","kind":"arxiv","version":1}},"canonical_sha256":"fb121cc7fd49dfb027025db39826a9ab7e5c3adaf128876e4f42d7bc3a927185","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb121cc7fd49dfb027025db39826a9ab7e5c3adaf128876e4f42d7bc3a927185","first_computed_at":"2026-07-05T07:27:39.735172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:27:39.735172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+R5y98zTyCXWQ4vWRMhbyuYJgcdzraOOYJO966JerbVMzaLIrvhH9LbrwKQzYJOaG7qzPR4GUT2B31SiGeFmDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:27:39.735685Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.11859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0ec27a3dae0c105dd5d38663f4ef96096638a28f2766ace820d4964dcb399a2","sha256:25616354f7e645a470076cb915c4beabd39c709c88f907c12972ce83be47cc86"],"state_sha256":"716c034dc24db0aa64eea201869e79929665b6c258acb73d8e3ed2c78d549226"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Idd+xA6X8vy+IMaTrwtfpVdoXbiAiI1xKF5cnj9fvztXJ69EyJxT/odYY16Abnc/eFs+W9J0b1L2FTWVgVO7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T20:02:21.007931Z","bundle_sha256":"086119e75955fb3e9c4267beeb8f9740c5e99830ce3f17187428b9ce7c1fb5b6"}}