{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2SIGEXT7NCKNUIG7NU5KTI3BZ2","short_pith_number":"pith:2SIGEXT7","schema_version":"1.0","canonical_sha256":"d490625e7f6894da20df6d3aa9a361ceaf2eb497200acff12ca6cefa523bcc43","source":{"kind":"arxiv","id":"1012.1895","version":1},"attestation_state":"computed","paper":{"title":"Coding for High-Density Recording on a 1-D Granular Magnetic Medium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Arya Mazumdar, Navin Kashyap","submitted_at":"2010-12-08T23:59:35Z","abstract_excerpt":"In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a simple one-dimensional combinatorial model of this medium. In our model, we assume a setting where binary data is sequentially written on the medium and a bit can erroneously change to the immediately preceding value. We derive several properties of codes that correct this type of errors, focusing on bounds on their cardinality.\n  We also define a probabilisti"},"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":"1012.1895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-08T23:59:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e8ad895146a3e785f2850a213beda2adfbd8e692d676e6f7b5e21b183e069c6e","abstract_canon_sha256":"1eb17353b2f11ed2663ed52d08bbdc3df082ec497d296019677179b7e96da89c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:54.196788Z","signature_b64":"ixjLaqVhr7lmJ+1Thn5D8Zf1oiTCnj72Q9CQXBgKzkq4wDCWahsW7FrG5ELT15WSuiYZrmZYoKy7ota3bRtJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d490625e7f6894da20df6d3aa9a361ceaf2eb497200acff12ca6cefa523bcc43","last_reissued_at":"2026-05-18T04:07:54.196136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:54.196136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding for High-Density Recording on a 1-D Granular Magnetic Medium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Arya Mazumdar, Navin Kashyap","submitted_at":"2010-12-08T23:59:35Z","abstract_excerpt":"In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a simple one-dimensional combinatorial model of this medium. In our model, we assume a setting where binary data is sequentially written on the medium and a bit can erroneously change to the immediately preceding value. We derive several properties of codes that correct this type of errors, focusing on bounds on their cardinality.\n  We also define a probabilisti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1895","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.1895","created_at":"2026-05-18T04:07:54.196199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1895v1","created_at":"2026-05-18T04:07:54.196199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1895","created_at":"2026-05-18T04:07:54.196199+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SIGEXT7NCKN","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SIGEXT7NCKNUIG7","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SIGEXT7","created_at":"2026-05-18T12:26:03.138858+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/2SIGEXT7NCKNUIG7NU5KTI3BZ2","json":"https://pith.science/pith/2SIGEXT7NCKNUIG7NU5KTI3BZ2.json","graph_json":"https://pith.science/api/pith-number/2SIGEXT7NCKNUIG7NU5KTI3BZ2/graph.json","events_json":"https://pith.science/api/pith-number/2SIGEXT7NCKNUIG7NU5KTI3BZ2/events.json","paper":"https://pith.science/paper/2SIGEXT7"},"agent_actions":{"view_html":"https://pith.science/pith/2SIGEXT7NCKNUIG7NU5KTI3BZ2","download_json":"https://pith.science/pith/2SIGEXT7NCKNUIG7NU5KTI3BZ2.json","view_paper":"https://pith.science/paper/2SIGEXT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1895&json=true","fetch_graph":"https://pith.science/api/pith-number/2SIGEXT7NCKNUIG7NU5KTI3BZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/2SIGEXT7NCKNUIG7NU5KTI3BZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SIGEXT7NCKNUIG7NU5KTI3BZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SIGEXT7NCKNUIG7NU5KTI3BZ2/action/storage_attestation","attest_author":"https://pith.science/pith/2SIGEXT7NCKNUIG7NU5KTI3BZ2/action/author_attestation","sign_citation":"https://pith.science/pith/2SIGEXT7NCKNUIG7NU5KTI3BZ2/action/citation_signature","submit_replication":"https://pith.science/pith/2SIGEXT7NCKNUIG7NU5KTI3BZ2/action/replication_record"}},"created_at":"2026-05-18T04:07:54.196199+00:00","updated_at":"2026-05-18T04:07:54.196199+00:00"}