{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6LY5AYL6ZQ2JOWSN4EHNDX4HK2","short_pith_number":"pith:6LY5AYL6","schema_version":"1.0","canonical_sha256":"f2f1d0617ecc34975a4de10ed1df8756b3c966a9787c3ee22806ab03ee0b50c4","source":{"kind":"arxiv","id":"1801.10091","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Generalized Shift-Rule for the Prefer-Max De Bruijn Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Amir Rubin, Gal Amram","submitted_at":"2018-01-30T16:51:10Z","abstract_excerpt":"One of the fundamental ways to construct De Bruijn sequences is by using a shift-rule. A shift-rule receives a word as an argument and computes the symbol that appears after it in the sequence. An optimal shift-rule for an $(n,k)$-De Bruijn sequence runs in time $O(n)$. We propose an extended notion we name a generalized-shift-rule, which receives a word, $w$, and an integer, $c$, and outputs the $c$ symbols that comes after $w$. An optimal generalized-shift-rule for an $(n,k)$-De Bruijn sequence runs in time $O(n+c)$. We show that, unlike in the case of a shift-rule, a time optimal generalize"},"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":"1801.10091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-30T16:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"80dff15960c8dd42ae3a922e08e8c424a4ad1cf08a5bfe3ec6a543c7c0e1e1df","abstract_canon_sha256":"51c246d98d8006cfcc8d9556c7951adbf337a4568279ad6c40dd8e38407b06c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:04.310629Z","signature_b64":"1DUaeD3DJto3Xm2/MMyo/T9u9s5Z1B5mlsIIB9Cqd2sx6oNlB5VlLWAvSfmQJeN400Yn5cQ8Z0SVnpeMesh3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2f1d0617ecc34975a4de10ed1df8756b3c966a9787c3ee22806ab03ee0b50c4","last_reissued_at":"2026-05-17T23:46:04.309915Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:04.309915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Generalized Shift-Rule for the Prefer-Max De Bruijn Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Amir Rubin, Gal Amram","submitted_at":"2018-01-30T16:51:10Z","abstract_excerpt":"One of the fundamental ways to construct De Bruijn sequences is by using a shift-rule. A shift-rule receives a word as an argument and computes the symbol that appears after it in the sequence. An optimal shift-rule for an $(n,k)$-De Bruijn sequence runs in time $O(n)$. We propose an extended notion we name a generalized-shift-rule, which receives a word, $w$, and an integer, $c$, and outputs the $c$ symbols that comes after $w$. An optimal generalized-shift-rule for an $(n,k)$-De Bruijn sequence runs in time $O(n+c)$. We show that, unlike in the case of a shift-rule, a time optimal generalize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10091","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.10091","created_at":"2026-05-17T23:46:04.310021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10091v2","created_at":"2026-05-17T23:46:04.310021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10091","created_at":"2026-05-17T23:46:04.310021+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LY5AYL6ZQ2J","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LY5AYL6ZQ2JOWSN","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LY5AYL6","created_at":"2026-05-18T12:32:11.075285+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/6LY5AYL6ZQ2JOWSN4EHNDX4HK2","json":"https://pith.science/pith/6LY5AYL6ZQ2JOWSN4EHNDX4HK2.json","graph_json":"https://pith.science/api/pith-number/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/graph.json","events_json":"https://pith.science/api/pith-number/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/events.json","paper":"https://pith.science/paper/6LY5AYL6"},"agent_actions":{"view_html":"https://pith.science/pith/6LY5AYL6ZQ2JOWSN4EHNDX4HK2","download_json":"https://pith.science/pith/6LY5AYL6ZQ2JOWSN4EHNDX4HK2.json","view_paper":"https://pith.science/paper/6LY5AYL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10091&json=true","fetch_graph":"https://pith.science/api/pith-number/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/graph.json","fetch_events":"https://pith.science/api/pith-number/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/action/storage_attestation","attest_author":"https://pith.science/pith/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/action/author_attestation","sign_citation":"https://pith.science/pith/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/action/citation_signature","submit_replication":"https://pith.science/pith/6LY5AYL6ZQ2JOWSN4EHNDX4HK2/action/replication_record"}},"created_at":"2026-05-17T23:46:04.310021+00:00","updated_at":"2026-05-17T23:46:04.310021+00:00"}