{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TDF3X2EHWFZP3LSAGJG7DXVVBO","short_pith_number":"pith:TDF3X2EH","canonical_record":{"source":{"id":"1606.06482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-06-21T08:59:26Z","cross_cats_sorted":[],"title_canon_sha256":"bff8aa38a823f831813c11715d7f08ece04b85571890b065725352f62433fc27","abstract_canon_sha256":"f6c6ff60022f92737eb64ff86694afcf716a1f3bf7d35281547831ca84a35172"},"schema_version":"1.0"},"canonical_sha256":"98cbbbe887b172fdae40324df1deb50b872a836b92e3646063eac3164bdba148","source":{"kind":"arxiv","id":"1606.06482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06482","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06482v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06482","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"TDF3X2EHWFZP","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TDF3X2EHWFZP3LSA","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TDF3X2EH","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TDF3X2EHWFZP3LSAGJG7DXVVBO","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-06-21T08:59:26Z","cross_cats_sorted":[],"title_canon_sha256":"bff8aa38a823f831813c11715d7f08ece04b85571890b065725352f62433fc27","abstract_canon_sha256":"f6c6ff60022f92737eb64ff86694afcf716a1f3bf7d35281547831ca84a35172"},"schema_version":"1.0"},"canonical_sha256":"98cbbbe887b172fdae40324df1deb50b872a836b92e3646063eac3164bdba148","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:09.435823Z","signature_b64":"IimLnHudcyxYyTLSh6ElLb+4RWvXsNwDHZHWALquxuqa7ny7tdmkVdLNUjGBQmnVYMZWl/g7CwhQ5+aOkLCHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98cbbbe887b172fdae40324df1deb50b872a836b92e3646063eac3164bdba148","last_reissued_at":"2026-05-18T01:12:09.435300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:09.435300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06482","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:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Ox/S8BDO3Z91lB6fPqFlnw/fhvkYDAf0Xp4dpnER38SBKeFGpp8WElMYE8phJYe5dq6HCjjHEcR4ga3ZbTaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:06:19.444502Z"},"content_sha256":"b3b15f288d117572acd71037f88337b14948c926e01a16163ca579b66fcbcac8","schema_version":"1.0","event_id":"sha256:b3b15f288d117572acd71037f88337b14948c926e01a16163ca579b66fcbcac8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TDF3X2EHWFZP3LSAGJG7DXVVBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expansion complexity and linear complexity of sequences over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Arne Winterhof, Harald Niederreiter, L\\'aszl\\'o M\\'erai","submitted_at":"2016-06-21T08:59:26Z","abstract_excerpt":"The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. We study the relationship between linear complexity and expansion complexity. In particular, we show that for purely periodic sequences both figures of merit provide essentially the same quality test for a sufficiently long part of the sequence. However, if we study shorter parts of the period or nonperiodic sequences, then we can show, roughly speaking,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06482","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:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0W6l7dA4Gw+gaKuTxNs/rRzg24fb/VrO+iS0y/zgEjCm4TuYvB5ek3LSQCs0n7rQEaCDAnt9Q+aUwxi+HAIPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:06:19.445230Z"},"content_sha256":"7b58ab81b28d4e6a7ea0c3f19b7eade3b7f4555e22a9edebbc68b1db60bba50e","schema_version":"1.0","event_id":"sha256:7b58ab81b28d4e6a7ea0c3f19b7eade3b7f4555e22a9edebbc68b1db60bba50e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDF3X2EHWFZP3LSAGJG7DXVVBO/bundle.json","state_url":"https://pith.science/pith/TDF3X2EHWFZP3LSAGJG7DXVVBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDF3X2EHWFZP3LSAGJG7DXVVBO/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-07T19:06:19Z","links":{"resolver":"https://pith.science/pith/TDF3X2EHWFZP3LSAGJG7DXVVBO","bundle":"https://pith.science/pith/TDF3X2EHWFZP3LSAGJG7DXVVBO/bundle.json","state":"https://pith.science/pith/TDF3X2EHWFZP3LSAGJG7DXVVBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDF3X2EHWFZP3LSAGJG7DXVVBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TDF3X2EHWFZP3LSAGJG7DXVVBO","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":"f6c6ff60022f92737eb64ff86694afcf716a1f3bf7d35281547831ca84a35172","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-06-21T08:59:26Z","title_canon_sha256":"bff8aa38a823f831813c11715d7f08ece04b85571890b065725352f62433fc27"},"schema_version":"1.0","source":{"id":"1606.06482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06482","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06482v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06482","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"TDF3X2EHWFZP","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TDF3X2EHWFZP3LSA","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TDF3X2EH","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:7b58ab81b28d4e6a7ea0c3f19b7eade3b7f4555e22a9edebbc68b1db60bba50e","target":"graph","created_at":"2026-05-18T01:12:09Z","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":"The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. We study the relationship between linear complexity and expansion complexity. In particular, we show that for purely periodic sequences both figures of merit provide essentially the same quality test for a sufficiently long part of the sequence. However, if we study shorter parts of the period or nonperiodic sequences, then we can show, roughly speaking,","authors_text":"Arne Winterhof, Harald Niederreiter, L\\'aszl\\'o M\\'erai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-06-21T08:59:26Z","title":"Expansion complexity and linear complexity of sequences over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06482","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:b3b15f288d117572acd71037f88337b14948c926e01a16163ca579b66fcbcac8","target":"record","created_at":"2026-05-18T01:12:09Z","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":"f6c6ff60022f92737eb64ff86694afcf716a1f3bf7d35281547831ca84a35172","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-06-21T08:59:26Z","title_canon_sha256":"bff8aa38a823f831813c11715d7f08ece04b85571890b065725352f62433fc27"},"schema_version":"1.0","source":{"id":"1606.06482","kind":"arxiv","version":1}},"canonical_sha256":"98cbbbe887b172fdae40324df1deb50b872a836b92e3646063eac3164bdba148","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98cbbbe887b172fdae40324df1deb50b872a836b92e3646063eac3164bdba148","first_computed_at":"2026-05-18T01:12:09.435300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:09.435300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IimLnHudcyxYyTLSh6ElLb+4RWvXsNwDHZHWALquxuqa7ny7tdmkVdLNUjGBQmnVYMZWl/g7CwhQ5+aOkLCHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:09.435823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3b15f288d117572acd71037f88337b14948c926e01a16163ca579b66fcbcac8","sha256:7b58ab81b28d4e6a7ea0c3f19b7eade3b7f4555e22a9edebbc68b1db60bba50e"],"state_sha256":"4e137f90755a79e3672fc534f7fd845bdc5173287483265234e5be71e9656906"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTA3/abnUlFlH8yVulm9eBTZv4QKbO/GpDvPchGqT0E2arnsbxV8nKMWXPh235DPhKthqh1FrHGbCn2dhsKyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T19:06:19.449010Z","bundle_sha256":"9458be5e3c606a19e3b553ddc5dbe4f287cd0cec5c66091ae8726ee99892bf1a"}}