{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J4AN3PYLEC3VPGYGTHGSTGSP6I","short_pith_number":"pith:J4AN3PYL","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"},"canonical_sha256":"4f00ddbf0b20b7579b0699cd299a4ff21de4251e31a6959457308a4cd4d5c41f","source":{"kind":"arxiv","id":"1701.06478","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06478","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06478v2","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06478","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"J4AN3PYLEC3V","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J4AN3PYLEC3VPGYG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J4AN3PYL","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J4AN3PYLEC3VPGYGTHGSTGSP6I","target":"record","payload":{"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"},"canonical_sha256":"4f00ddbf0b20b7579b0699cd299a4ff21de4251e31a6959457308a4cd4d5c41f","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"},"source_kind":"arxiv","source_id":"1701.06478","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZTCX/isAxkhDphTfMlhS2C4GbBRzfULYZi0U1YcpHi1haapqq/rHjwYTzxKkb+E/CeBPQRedDuHltXaNLaPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:04:12.907424Z"},"content_sha256":"1f279888c445e9950fb58da23288097583b7455d995ddafbfcc53064ee8c3958","schema_version":"1.0","event_id":"sha256:1f279888c445e9950fb58da23288097583b7455d995ddafbfcc53064ee8c3958"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J4AN3PYLEC3VPGYGTHGSTGSP6I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aIGHHM8HXs5XN2lO3CLin+NQlF7Hv+EtgUgV/4RgyTkmWjb7rQLG8hnbaAQJRliLIFHV9DQxgm5q7fXnCK+YBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:04:12.908083Z"},"content_sha256":"f64e7921349c84b7ee5ffe6ef132c13a17fec4c53d641816cece5c3062680a46","schema_version":"1.0","event_id":"sha256:f64e7921349c84b7ee5ffe6ef132c13a17fec4c53d641816cece5c3062680a46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/bundle.json","state_url":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T16:04:12Z","links":{"resolver":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I","bundle":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/bundle.json","state":"https://pith.science/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4AN3PYLEC3VPGYGTHGSTGSP6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J4AN3PYLEC3VPGYGTHGSTGSP6I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f6a3b92c650c77bf40b187799b3c47d8fa16d37ed7c5ea682c7399e6b165526e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T16:24:14Z","title_canon_sha256":"5b5463e8ab60fe95d0d37301ea6c05430932fd26c0b78fe30bb2c0a788572bed"},"schema_version":"1.0","source":{"id":"1701.06478","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06478","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06478v2","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06478","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"J4AN3PYLEC3V","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J4AN3PYLEC3VPGYG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J4AN3PYL","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:f64e7921349c84b7ee5ffe6ef132c13a17fec4c53d641816cece5c3062680a46","target":"graph","created_at":"2026-05-18T00:46:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Alireza Vahid, Daniel J. Sorin, Georgios Mappouras, Robert Calderbank","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T16:24:14Z","title":"Correcting Two Deletions and Insertions in Racetrack Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06478","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1f279888c445e9950fb58da23288097583b7455d995ddafbfcc53064ee8c3958","target":"record","created_at":"2026-05-18T00:46:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f6a3b92c650c77bf40b187799b3c47d8fa16d37ed7c5ea682c7399e6b165526e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T16:24:14Z","title_canon_sha256":"5b5463e8ab60fe95d0d37301ea6c05430932fd26c0b78fe30bb2c0a788572bed"},"schema_version":"1.0","source":{"id":"1701.06478","kind":"arxiv","version":2}},"canonical_sha256":"4f00ddbf0b20b7579b0699cd299a4ff21de4251e31a6959457308a4cd4d5c41f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f00ddbf0b20b7579b0699cd299a4ff21de4251e31a6959457308a4cd4d5c41f","first_computed_at":"2026-05-18T00:46:26.149667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:26.149667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tSIsbh+WuT+yLF83k8Xmf4dMvz3wM9plYnqLEerc8jj57SC1j0PnBYRIREGS5D5AvY4QEnY+RzDC/ke8xW2eDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:26.150339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06478","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f279888c445e9950fb58da23288097583b7455d995ddafbfcc53064ee8c3958","sha256:f64e7921349c84b7ee5ffe6ef132c13a17fec4c53d641816cece5c3062680a46"],"state_sha256":"d5358f8ed2f289965610d6d248bca74a41461fb3b525b6a5c4084bb9c9156b7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0q3mnQXE1hcp5yyvP5CYtVjnyTsOme+kin/QLdm31aEehGjFTbhvZZOMVWBQr+mj8VQ44ezGwuo2tIHrmKCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:04:12.911762Z","bundle_sha256":"b658e641e9b225b9a3aee0222e08cb3f3176dc6ac1b4e849a32d97409c3dc9d9"}}