{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DANWVYRCVTRZCGQA3A74SRZVIW","short_pith_number":"pith:DANWVYRC","canonical_record":{"source":{"id":"2003.09095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-03-20T04:20:44Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"23696a3c7421d79f79650616b6ea968be3f165298b94416ed2329dbdbc963513","abstract_canon_sha256":"a1dd64756944b142f116f07f9979564575263f250b78059762b1e68669838430"},"schema_version":"1.0"},"canonical_sha256":"181b6ae222ace3911a00d83fc9473545afbf99c0b914a52f45302a89285e8439","source":{"kind":"arxiv","id":"2003.09095","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.09095","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"arxiv_version","alias_value":"2003.09095v2","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.09095","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"pith_short_12","alias_value":"DANWVYRCVTRZ","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"pith_short_16","alias_value":"DANWVYRCVTRZCGQA","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"pith_short_8","alias_value":"DANWVYRC","created_at":"2026-07-05T02:43:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DANWVYRCVTRZCGQA3A74SRZVIW","target":"record","payload":{"canonical_record":{"source":{"id":"2003.09095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-03-20T04:20:44Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"23696a3c7421d79f79650616b6ea968be3f165298b94416ed2329dbdbc963513","abstract_canon_sha256":"a1dd64756944b142f116f07f9979564575263f250b78059762b1e68669838430"},"schema_version":"1.0"},"canonical_sha256":"181b6ae222ace3911a00d83fc9473545afbf99c0b914a52f45302a89285e8439","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:26.809606Z","signature_b64":"ASHBYwrTE0LEpbvnJNsQabFtMtaLlhSksrLqaXVDtJgak5Vpld89HHrQrV9+9Zj/r5yoQyWQ/OQQcVfQRRVxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181b6ae222ace3911a00d83fc9473545afbf99c0b914a52f45302a89285e8439","last_reissued_at":"2026-07-05T02:43:26.809086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:26.809086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.09095","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-07-05T02:43:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6hTKQcG8aOWiSoGHWwo/EhmjegZlMCpTwr7/ebwuaw1Fc1LVlglgpxBHJA2yZvDiIYvP13Z8TwlDATu+IUZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:51:00.887299Z"},"content_sha256":"20aa5cfca53a2ba352e89d9c455df6d81aa1bf87a9c6799f146d603ff9409193","schema_version":"1.0","event_id":"sha256:20aa5cfca53a2ba352e89d9c455df6d81aa1bf87a9c6799f146d603ff9409193"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DANWVYRCVTRZCGQA3A74SRZVIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficiently Generated Family of Binary de Bruijn Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Martianus Frederic Ezerman, Qiang Wang, Yunlong Zhu, Zuling Chang","submitted_at":"2020-03-20T04:20:44Z","abstract_excerpt":"We study how to generate binary de Bruijn sequences efficiently from the class of simple linear feedback shift registers with feedback function $f(x_0, x_1, \\ldots, x_{n-1}) = x_0 + x_1 + x_{n-1}$ for $n \\geq 3$, using the cycle joining method. Based on the properties of this class of LFSRs, we propose two new generic successor rules, each of which produces at least $2^{n-3}$ de Bruijn sequences. These two classes build upon a framework proposed by Gabric, Sawada, Williams and Wong in Discrete Mathematics vol. 341, no. 11, pp. 2977--2987, November 2018. Here we introduce new useful choices for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.09095","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.09095/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-05T02:43:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2r4mE1uMa1zwvj7JMaW5nT2NEAION+jKXuvnzBT+7AbG1hPb6IoElIBPJIESMTmOKdCqjVEVGzVcEZi/3FE4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:51:00.887850Z"},"content_sha256":"aa10a488dbe3762673de7b08ca39691bbbc2a85f2250ecdcc7c0bee5b1543d52","schema_version":"1.0","event_id":"sha256:aa10a488dbe3762673de7b08ca39691bbbc2a85f2250ecdcc7c0bee5b1543d52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DANWVYRCVTRZCGQA3A74SRZVIW/bundle.json","state_url":"https://pith.science/pith/DANWVYRCVTRZCGQA3A74SRZVIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DANWVYRCVTRZCGQA3A74SRZVIW/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-10T09:51:00Z","links":{"resolver":"https://pith.science/pith/DANWVYRCVTRZCGQA3A74SRZVIW","bundle":"https://pith.science/pith/DANWVYRCVTRZCGQA3A74SRZVIW/bundle.json","state":"https://pith.science/pith/DANWVYRCVTRZCGQA3A74SRZVIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DANWVYRCVTRZCGQA3A74SRZVIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DANWVYRCVTRZCGQA3A74SRZVIW","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":"a1dd64756944b142f116f07f9979564575263f250b78059762b1e68669838430","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-03-20T04:20:44Z","title_canon_sha256":"23696a3c7421d79f79650616b6ea968be3f165298b94416ed2329dbdbc963513"},"schema_version":"1.0","source":{"id":"2003.09095","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.09095","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"arxiv_version","alias_value":"2003.09095v2","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.09095","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"pith_short_12","alias_value":"DANWVYRCVTRZ","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"pith_short_16","alias_value":"DANWVYRCVTRZCGQA","created_at":"2026-07-05T02:43:26Z"},{"alias_kind":"pith_short_8","alias_value":"DANWVYRC","created_at":"2026-07-05T02:43:26Z"}],"graph_snapshots":[{"event_id":"sha256:aa10a488dbe3762673de7b08ca39691bbbc2a85f2250ecdcc7c0bee5b1543d52","target":"graph","created_at":"2026-07-05T02:43:26Z","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/2003.09095/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study how to generate binary de Bruijn sequences efficiently from the class of simple linear feedback shift registers with feedback function $f(x_0, x_1, \\ldots, x_{n-1}) = x_0 + x_1 + x_{n-1}$ for $n \\geq 3$, using the cycle joining method. Based on the properties of this class of LFSRs, we propose two new generic successor rules, each of which produces at least $2^{n-3}$ de Bruijn sequences. These two classes build upon a framework proposed by Gabric, Sawada, Williams and Wong in Discrete Mathematics vol. 341, no. 11, pp. 2977--2987, November 2018. Here we introduce new useful choices for","authors_text":"Martianus Frederic Ezerman, Qiang Wang, Yunlong Zhu, Zuling Chang","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-03-20T04:20:44Z","title":"An Efficiently Generated Family of Binary de Bruijn Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.09095","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:20aa5cfca53a2ba352e89d9c455df6d81aa1bf87a9c6799f146d603ff9409193","target":"record","created_at":"2026-07-05T02:43:26Z","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":"a1dd64756944b142f116f07f9979564575263f250b78059762b1e68669838430","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-03-20T04:20:44Z","title_canon_sha256":"23696a3c7421d79f79650616b6ea968be3f165298b94416ed2329dbdbc963513"},"schema_version":"1.0","source":{"id":"2003.09095","kind":"arxiv","version":2}},"canonical_sha256":"181b6ae222ace3911a00d83fc9473545afbf99c0b914a52f45302a89285e8439","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"181b6ae222ace3911a00d83fc9473545afbf99c0b914a52f45302a89285e8439","first_computed_at":"2026-07-05T02:43:26.809086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:43:26.809086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ASHBYwrTE0LEpbvnJNsQabFtMtaLlhSksrLqaXVDtJgak5Vpld89HHrQrV9+9Zj/r5yoQyWQ/OQQcVfQRRVxBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:43:26.809606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.09095","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20aa5cfca53a2ba352e89d9c455df6d81aa1bf87a9c6799f146d603ff9409193","sha256:aa10a488dbe3762673de7b08ca39691bbbc2a85f2250ecdcc7c0bee5b1543d52"],"state_sha256":"6117406abd892dbcdb053f365202813296d9667af9ca9178aed955f550108799"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M9yKknynQuZ45Zv6Sgsu0PKAuuVNFSOdlBcb5XcRAbTICKbZTFv8cb9XRNUL8EQSMg1y1K6xnSRNipjt3XqWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:51:00.892696Z","bundle_sha256":"0a8be43e0ad1ee5fda2b05b94e0bdfe472d0446d11b4e78d0d9310f3fe357842"}}