{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YHGAFNQMOJ7UIT3URMIYTATR4Z","short_pith_number":"pith:YHGAFNQM","schema_version":"1.0","canonical_sha256":"c1cc02b60c727f444f748b11898271e64eb6961aec30b295ff9d591ef87eaaa9","source":{"kind":"arxiv","id":"1601.05594","version":2},"attestation_state":"computed","paper":{"title":"Encoding Semiconstrained Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Moshe Schwartz, Ohad Elishco, Tom Meyerovitch","submitted_at":"2016-01-21T11:48:08Z","abstract_excerpt":"Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply techniques from constrained systems, we study sequences of constrained systems that are contained in, or contain, a given semiconstrained system, while approaching its capacity. In the case of contained systems we describe to such sequences resulting in constant-to-constant bit-rate block encoders and sliding-block encoders. Surprisingly, in the case of containing s"},"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":"1601.05594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T11:48:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b254a3bc7eb82a957d0e9763ee6a0daf3bcba6ca49bbc35f0a3ba2f72871fcc1","abstract_canon_sha256":"c349f7409b77ab9f0189094e791967f4d73dda903db8c7dba58e06cdd30229e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:31.245744Z","signature_b64":"v48T3y+DeSwyylbDMLxaVB3gK29L5vm0lHAeY0vfmwE4PtSZRP47SJZQpCfCmsaDGfLX8mSo+qQzpR3a9Fy2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1cc02b60c727f444f748b11898271e64eb6961aec30b295ff9d591ef87eaaa9","last_reissued_at":"2026-05-18T01:01:31.245277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:31.245277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encoding Semiconstrained Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Moshe Schwartz, Ohad Elishco, Tom Meyerovitch","submitted_at":"2016-01-21T11:48:08Z","abstract_excerpt":"Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply techniques from constrained systems, we study sequences of constrained systems that are contained in, or contain, a given semiconstrained system, while approaching its capacity. In the case of contained systems we describe to such sequences resulting in constant-to-constant bit-rate block encoders and sliding-block encoders. Surprisingly, in the case of containing s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05594","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":"1601.05594","created_at":"2026-05-18T01:01:31.245346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05594v2","created_at":"2026-05-18T01:01:31.245346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05594","created_at":"2026-05-18T01:01:31.245346+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHGAFNQMOJ7U","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHGAFNQMOJ7UIT3U","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHGAFNQM","created_at":"2026-05-18T12:30:53.716459+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/YHGAFNQMOJ7UIT3URMIYTATR4Z","json":"https://pith.science/pith/YHGAFNQMOJ7UIT3URMIYTATR4Z.json","graph_json":"https://pith.science/api/pith-number/YHGAFNQMOJ7UIT3URMIYTATR4Z/graph.json","events_json":"https://pith.science/api/pith-number/YHGAFNQMOJ7UIT3URMIYTATR4Z/events.json","paper":"https://pith.science/paper/YHGAFNQM"},"agent_actions":{"view_html":"https://pith.science/pith/YHGAFNQMOJ7UIT3URMIYTATR4Z","download_json":"https://pith.science/pith/YHGAFNQMOJ7UIT3URMIYTATR4Z.json","view_paper":"https://pith.science/paper/YHGAFNQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05594&json=true","fetch_graph":"https://pith.science/api/pith-number/YHGAFNQMOJ7UIT3URMIYTATR4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/YHGAFNQMOJ7UIT3URMIYTATR4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHGAFNQMOJ7UIT3URMIYTATR4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHGAFNQMOJ7UIT3URMIYTATR4Z/action/storage_attestation","attest_author":"https://pith.science/pith/YHGAFNQMOJ7UIT3URMIYTATR4Z/action/author_attestation","sign_citation":"https://pith.science/pith/YHGAFNQMOJ7UIT3URMIYTATR4Z/action/citation_signature","submit_replication":"https://pith.science/pith/YHGAFNQMOJ7UIT3URMIYTATR4Z/action/replication_record"}},"created_at":"2026-05-18T01:01:31.245346+00:00","updated_at":"2026-05-18T01:01:31.245346+00:00"}