{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HZX4G2ZBZG2ZI656Q3ORE3TGRP","short_pith_number":"pith:HZX4G2ZB","schema_version":"1.0","canonical_sha256":"3e6fc36b21c9b5947bbe86dd126e668bda83562dc95c35756e3ff217cea6b0c3","source":{"kind":"arxiv","id":"1711.09494","version":2},"attestation_state":"computed","paper":{"title":"Skip-Sliding Window Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anshoo Tandon, Lav R. Varshney, Mehul Motani, Ting-Yi Wu","submitted_at":"2017-11-27T00:24:32Z","abstract_excerpt":"Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window. A skip-sliding window (SSW) code is defined in terms of the length $L$ of a sliding window, skip length $J$, and cost constraint $E$ in each sliding window. Each valid codeword of length $L + kJ$ is determined by $k+1$ windows of length $L$ where window $i$ starts at $(iJ + 1)$th symbol for all non-negative integers $i$ such that $i \\leq k$; and the cost constraint $E$ in each window must be satisfied. In this work, two "},"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":"1711.09494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-27T00:24:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"917c80f43378c82aade9a9df9850008eeec605c51411b5401e32b8ef7104946c","abstract_canon_sha256":"4668e6208bc886e1b8d7db89d220ccb2a7119d38dae632327a5cedab4eee6273"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:14.275502Z","signature_b64":"EMlCW79PCigMrW/7ksrNxHFU9x2EbMsU9QhrBivwU/GVB3MZ2MsHjmvv3Hk1LLtQLwPYfezOtB9qz0HB9L3rBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e6fc36b21c9b5947bbe86dd126e668bda83562dc95c35756e3ff217cea6b0c3","last_reissued_at":"2026-05-18T00:26:14.274973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:14.274973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Skip-Sliding Window Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anshoo Tandon, Lav R. Varshney, Mehul Motani, Ting-Yi Wu","submitted_at":"2017-11-27T00:24:32Z","abstract_excerpt":"Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window. A skip-sliding window (SSW) code is defined in terms of the length $L$ of a sliding window, skip length $J$, and cost constraint $E$ in each sliding window. Each valid codeword of length $L + kJ$ is determined by $k+1$ windows of length $L$ where window $i$ starts at $(iJ + 1)$th symbol for all non-negative integers $i$ such that $i \\leq k$; and the cost constraint $E$ in each window must be satisfied. In this work, two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09494","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":"1711.09494","created_at":"2026-05-18T00:26:14.275057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09494v2","created_at":"2026-05-18T00:26:14.275057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09494","created_at":"2026-05-18T00:26:14.275057+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZX4G2ZBZG2Z","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZX4G2ZBZG2ZI656","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZX4G2ZB","created_at":"2026-05-18T12:31:21.493067+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/HZX4G2ZBZG2ZI656Q3ORE3TGRP","json":"https://pith.science/pith/HZX4G2ZBZG2ZI656Q3ORE3TGRP.json","graph_json":"https://pith.science/api/pith-number/HZX4G2ZBZG2ZI656Q3ORE3TGRP/graph.json","events_json":"https://pith.science/api/pith-number/HZX4G2ZBZG2ZI656Q3ORE3TGRP/events.json","paper":"https://pith.science/paper/HZX4G2ZB"},"agent_actions":{"view_html":"https://pith.science/pith/HZX4G2ZBZG2ZI656Q3ORE3TGRP","download_json":"https://pith.science/pith/HZX4G2ZBZG2ZI656Q3ORE3TGRP.json","view_paper":"https://pith.science/paper/HZX4G2ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09494&json=true","fetch_graph":"https://pith.science/api/pith-number/HZX4G2ZBZG2ZI656Q3ORE3TGRP/graph.json","fetch_events":"https://pith.science/api/pith-number/HZX4G2ZBZG2ZI656Q3ORE3TGRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZX4G2ZBZG2ZI656Q3ORE3TGRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZX4G2ZBZG2ZI656Q3ORE3TGRP/action/storage_attestation","attest_author":"https://pith.science/pith/HZX4G2ZBZG2ZI656Q3ORE3TGRP/action/author_attestation","sign_citation":"https://pith.science/pith/HZX4G2ZBZG2ZI656Q3ORE3TGRP/action/citation_signature","submit_replication":"https://pith.science/pith/HZX4G2ZBZG2ZI656Q3ORE3TGRP/action/replication_record"}},"created_at":"2026-05-18T00:26:14.275057+00:00","updated_at":"2026-05-18T00:26:14.275057+00:00"}