{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LHPQYGMLDPVKOYXQASN4HLRHPR","short_pith_number":"pith:LHPQYGML","canonical_record":{"source":{"id":"1901.06840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T09:39:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82b332d0a13991d6c564285f7ce66648c7cca5f44dbbd0ee120a8d4acf6b17b8","abstract_canon_sha256":"fd7e624a9892aff3eaf3f6d066f7e5ed47ac1d35b7773e72fab68aa583928682"},"schema_version":"1.0"},"canonical_sha256":"59df0c198b1beaa762f0049bc3ae277c5193088ed5fd096c9016275d33b741d8","source":{"kind":"arxiv","id":"1901.06840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06840","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06840v1","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06840","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"LHPQYGMLDPVK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LHPQYGMLDPVKOYXQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LHPQYGML","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LHPQYGMLDPVKOYXQASN4HLRHPR","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T09:39:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82b332d0a13991d6c564285f7ce66648c7cca5f44dbbd0ee120a8d4acf6b17b8","abstract_canon_sha256":"fd7e624a9892aff3eaf3f6d066f7e5ed47ac1d35b7773e72fab68aa583928682"},"schema_version":"1.0"},"canonical_sha256":"59df0c198b1beaa762f0049bc3ae277c5193088ed5fd096c9016275d33b741d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:48.990448Z","signature_b64":"AYrNoL03DDYwZcL58FLnkrgNepVUn6o+KPLQK1TrTrjMzGp+UXBiww1DQ2hIlu9uEZ30vGI8tKjXUhuFxNqgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59df0c198b1beaa762f0049bc3ae277c5193088ed5fd096c9016275d33b741d8","last_reissued_at":"2026-05-17T23:55:48.989887Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:48.989887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06840","source_version":1,"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-17T23:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9d+W7sbxA9EkkOuh58dvKabO0USx5p3IMOJGwdg0tWmotlKVzTt0lMp8Yq70rGr4UxynJEAqKxl4OKIJwxAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:39:04.821563Z"},"content_sha256":"167a597942de47a1d6fef5e543e84808c641a3be79b6b554d7f858f7363261ed","schema_version":"1.0","event_id":"sha256:167a597942de47a1d6fef5e543e84808c641a3be79b6b554d7f858f7363261ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LHPQYGMLDPVKOYXQASN4HLRHPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anchor-Based Correction of Substitutions in Indexed Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Lenz, Antonia Wachter-Zeh, Eitan Yaakobi, Paul H. Siegel","submitted_at":"2019-01-21T09:39:04Z","abstract_excerpt":"Motivated by DNA-based data storage, we investigate a system where digital information is stored in an unordered set of several vectors over a finite alphabet. Each vector begins with a unique index that represents its position in the whole data set and does not contain data. This paper deals with the design of error-correcting codes for such indexed sets in the presence of substitution errors. We propose a construction that efficiently deals with the challenges that arise when designing codes for unordered sets. Using a novel mechanism, called anchoring, we show that it is possible to combat "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06840","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"},"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-17T23:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQEEl26vQdG7UlWtftx4PGf2kLRNsBD2wWY6jrs8T0G/uILsevSk7HSmlWU6OKU+ul8O4b3mucW8htbY1j/NBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:39:04.822181Z"},"content_sha256":"651e4255ebccdd821d7831b75d41748eae4e4f54c04c89d0cff910a878a2a159","schema_version":"1.0","event_id":"sha256:651e4255ebccdd821d7831b75d41748eae4e4f54c04c89d0cff910a878a2a159"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHPQYGMLDPVKOYXQASN4HLRHPR/bundle.json","state_url":"https://pith.science/pith/LHPQYGMLDPVKOYXQASN4HLRHPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHPQYGMLDPVKOYXQASN4HLRHPR/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-05T16:39:04Z","links":{"resolver":"https://pith.science/pith/LHPQYGMLDPVKOYXQASN4HLRHPR","bundle":"https://pith.science/pith/LHPQYGMLDPVKOYXQASN4HLRHPR/bundle.json","state":"https://pith.science/pith/LHPQYGMLDPVKOYXQASN4HLRHPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHPQYGMLDPVKOYXQASN4HLRHPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LHPQYGMLDPVKOYXQASN4HLRHPR","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":"fd7e624a9892aff3eaf3f6d066f7e5ed47ac1d35b7773e72fab68aa583928682","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T09:39:04Z","title_canon_sha256":"82b332d0a13991d6c564285f7ce66648c7cca5f44dbbd0ee120a8d4acf6b17b8"},"schema_version":"1.0","source":{"id":"1901.06840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06840","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06840v1","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06840","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"LHPQYGMLDPVK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LHPQYGMLDPVKOYXQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LHPQYGML","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:651e4255ebccdd821d7831b75d41748eae4e4f54c04c89d0cff910a878a2a159","target":"graph","created_at":"2026-05-17T23:55:48Z","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":"Motivated by DNA-based data storage, we investigate a system where digital information is stored in an unordered set of several vectors over a finite alphabet. Each vector begins with a unique index that represents its position in the whole data set and does not contain data. This paper deals with the design of error-correcting codes for such indexed sets in the presence of substitution errors. We propose a construction that efficiently deals with the challenges that arise when designing codes for unordered sets. Using a novel mechanism, called anchoring, we show that it is possible to combat ","authors_text":"Andreas Lenz, Antonia Wachter-Zeh, Eitan Yaakobi, Paul H. Siegel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T09:39:04Z","title":"Anchor-Based Correction of Substitutions in Indexed Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06840","kind":"arxiv","version":1},"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:167a597942de47a1d6fef5e543e84808c641a3be79b6b554d7f858f7363261ed","target":"record","created_at":"2026-05-17T23:55:48Z","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":"fd7e624a9892aff3eaf3f6d066f7e5ed47ac1d35b7773e72fab68aa583928682","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T09:39:04Z","title_canon_sha256":"82b332d0a13991d6c564285f7ce66648c7cca5f44dbbd0ee120a8d4acf6b17b8"},"schema_version":"1.0","source":{"id":"1901.06840","kind":"arxiv","version":1}},"canonical_sha256":"59df0c198b1beaa762f0049bc3ae277c5193088ed5fd096c9016275d33b741d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59df0c198b1beaa762f0049bc3ae277c5193088ed5fd096c9016275d33b741d8","first_computed_at":"2026-05-17T23:55:48.989887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:48.989887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AYrNoL03DDYwZcL58FLnkrgNepVUn6o+KPLQK1TrTrjMzGp+UXBiww1DQ2hIlu9uEZ30vGI8tKjXUhuFxNqgBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:48.990448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:167a597942de47a1d6fef5e543e84808c641a3be79b6b554d7f858f7363261ed","sha256:651e4255ebccdd821d7831b75d41748eae4e4f54c04c89d0cff910a878a2a159"],"state_sha256":"cc7749b9d806071150ac14b49dcc7563cddc2ac8d65a4f328daeb9ed0c5b8f10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1i9elHe9TabUjYwSoSde+1Q2gZ4N/K8m6nUq4q32xppw+0RuOLEk8h3JXxhdq6Oujx5hgwdFRjr2j1xnhvUvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:39:04.825211Z","bundle_sha256":"5ec1a1e7aa788e2df13ed2e1eba799186531fe0df661d6ebe99b327f92299bdc"}}