{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J4AN3PYLEC3VPGYGTHGSTGSP6I","short_pith_number":"pith:J4AN3PYL","schema_version":"1.0","canonical_sha256":"4f00ddbf0b20b7579b0699cd299a4ff21de4251e31a6959457308a4cd4d5c41f","source":{"kind":"arxiv","id":"1701.06478","version":2},"attestation_state":"computed","paper":{"title":"Correcting Two Deletions and Insertions in Racetrack Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Vahid, Daniel J. Sorin, Georgios Mappouras, Robert Calderbank","submitted_at":"2017-01-23T16:24:14Z","abstract_excerpt":"Racetrack memory is a non-volatile memory engineered to provide both high density and low latency, that is subject to synchronization or shift errors. This paper describes a fast coding solution, in which delimiter bits assist in identifying the type of shift error, and easily implementable graph-based codes are used to correct the error, once identified. A code that is able to detect and correct double shift errors is described in detail."},"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":"1701.06478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T16:24:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b5463e8ab60fe95d0d37301ea6c05430932fd26c0b78fe30bb2c0a788572bed","abstract_canon_sha256":"f6a3b92c650c77bf40b187799b3c47d8fa16d37ed7c5ea682c7399e6b165526e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:26.150339Z","signature_b64":"tSIsbh+WuT+yLF83k8Xmf4dMvz3wM9plYnqLEerc8jj57SC1j0PnBYRIREGS5D5AvY4QEnY+RzDC/ke8xW2eDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f00ddbf0b20b7579b0699cd299a4ff21de4251e31a6959457308a4cd4d5c41f","last_reissued_at":"2026-05-18T00:46:26.149667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:26.149667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correcting Two Deletions and Insertions in Racetrack Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Vahid, Daniel J. Sorin, Georgios Mappouras, Robert Calderbank","submitted_at":"2017-01-23T16:24:14Z","abstract_excerpt":"Racetrack memory is a non-volatile memory engineered to provide both high density and low latency, that is subject to synchronization or shift errors. This paper describes a fast coding solution, in which delimiter bits assist in identifying the type of shift error, and easily implementable graph-based codes are used to correct the error, once identified. A code that is able to detect and correct double shift errors is described in detail."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06478","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":"1701.06478","created_at":"2026-05-18T00:46:26.149762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06478v2","created_at":"2026-05-18T00:46:26.149762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06478","created_at":"2026-05-18T00:46:26.149762+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4AN3PYLEC3V","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4AN3PYLEC3VPGYG","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4AN3PYL","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/J4AN3PYLEC3VPGYGTHGSTGSP6I","json":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I.json","graph_json":"https://pith.science/api/pith-number/J4AN3PYLEC3VPGYGTHGSTGSP6I/graph.json","events_json":"https://pith.science/api/pith-number/J4AN3PYLEC3VPGYGTHGSTGSP6I/events.json","paper":"https://pith.science/paper/J4AN3PYL"},"agent_actions":{"view_html":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I","download_json":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I.json","view_paper":"https://pith.science/paper/J4AN3PYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06478&json=true","fetch_graph":"https://pith.science/api/pith-number/J4AN3PYLEC3VPGYGTHGSTGSP6I/graph.json","fetch_events":"https://pith.science/api/pith-number/J4AN3PYLEC3VPGYGTHGSTGSP6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/action/storage_attestation","attest_author":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/action/author_attestation","sign_citation":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/action/citation_signature","submit_replication":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/action/replication_record"}},"created_at":"2026-05-18T00:46:26.149762+00:00","updated_at":"2026-05-18T00:46:26.149762+00:00"}