{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UURGQGJU3YJ6PEEO4RKAKTEZKQ","short_pith_number":"pith:UURGQGJU","canonical_record":{"source":{"id":"1801.02310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T05:39:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4e8bd37ed6aac97dcf3d82bf3217de7244dd51e3d8cbafca6fc520a27107d4e","abstract_canon_sha256":"9e96752a12f26a20a16d6b5fab6959ac7982ff9d632ac1ba3bceb5e127bdcfb7"},"schema_version":"1.0"},"canonical_sha256":"a522681934de13e7908ee454054c99542f793414ae3e8702359eb217a889bcb2","source":{"kind":"arxiv","id":"1801.02310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02310","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02310v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02310","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"UURGQGJU3YJ6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UURGQGJU3YJ6PEEO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UURGQGJU","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UURGQGJU3YJ6PEEO4RKAKTEZKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T05:39:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4e8bd37ed6aac97dcf3d82bf3217de7244dd51e3d8cbafca6fc520a27107d4e","abstract_canon_sha256":"9e96752a12f26a20a16d6b5fab6959ac7982ff9d632ac1ba3bceb5e127bdcfb7"},"schema_version":"1.0"},"canonical_sha256":"a522681934de13e7908ee454054c99542f793414ae3e8702359eb217a889bcb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:32.090840Z","signature_b64":"UIgIUYCb+OIxMKTSL/0YexxkOkVVaXUT5lZ/SrN2Pg/Om+fqyJ9F1AoMh0HQZPWh8FUrGWnWRdv6bt6WyOE7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a522681934de13e7908ee454054c99542f793414ae3e8702359eb217a889bcb2","last_reissued_at":"2026-05-18T00:26:32.090223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:32.090223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02310","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-18T00:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEOyKxkay+9ZMAooLikEAmNb7eSKqk/EiXTKbo3z4ovPXQAsp9T0FlGU8BswQPyM20qT8arqXwyeOkuoOD5eAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:28:17.602807Z"},"content_sha256":"200d08abb6f1fac404021e67ddef223e4c5326da34b95e2a0d3a677b0f0d1298","schema_version":"1.0","event_id":"sha256:200d08abb6f1fac404021e67ddef223e4c5326da34b95e2a0d3a677b0f0d1298"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UURGQGJU3YJ6PEEO4RKAKTEZKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Han Mao Kiah, Johan Chrisnata, Tuan Thanh Nguyen, Yeow Meng Chee","submitted_at":"2018-01-08T05:39:43Z","abstract_excerpt":"Tandem duplication is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain et al. (2017) proposed the study of codes that correct tandem duplications. Known code constructions are based on {\\em irreducible words}.\n  We study efficient encoding/decoding methods for irreducible words. First, we describe an $(\\ell,m)$-finite state encoder and show that when $m=\\Theta(1/\\epsilon)$ and $\\ell=\\Theta(1/\\epsilon)$, the encoder achieves rate that is $\\epsilon$ away from the optimal. Next, we provide ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02310","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-18T00:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3os+lNUuM1v6rH3pc6QJm2dq5NJbJZlpnfb6xmOGGPO37znhPVezBe1sCPCQtFCaMf/pJnAY+l3Gkk/wRxgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:28:17.603155Z"},"content_sha256":"1e3bebccfac1045159d6eff47f7d561dede1deb93182f71537f1a3d69191a6f5","schema_version":"1.0","event_id":"sha256:1e3bebccfac1045159d6eff47f7d561dede1deb93182f71537f1a3d69191a6f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UURGQGJU3YJ6PEEO4RKAKTEZKQ/bundle.json","state_url":"https://pith.science/pith/UURGQGJU3YJ6PEEO4RKAKTEZKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UURGQGJU3YJ6PEEO4RKAKTEZKQ/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-30T20:28:17Z","links":{"resolver":"https://pith.science/pith/UURGQGJU3YJ6PEEO4RKAKTEZKQ","bundle":"https://pith.science/pith/UURGQGJU3YJ6PEEO4RKAKTEZKQ/bundle.json","state":"https://pith.science/pith/UURGQGJU3YJ6PEEO4RKAKTEZKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UURGQGJU3YJ6PEEO4RKAKTEZKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UURGQGJU3YJ6PEEO4RKAKTEZKQ","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":"9e96752a12f26a20a16d6b5fab6959ac7982ff9d632ac1ba3bceb5e127bdcfb7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T05:39:43Z","title_canon_sha256":"f4e8bd37ed6aac97dcf3d82bf3217de7244dd51e3d8cbafca6fc520a27107d4e"},"schema_version":"1.0","source":{"id":"1801.02310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02310","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02310v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02310","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"UURGQGJU3YJ6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UURGQGJU3YJ6PEEO","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UURGQGJU","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:1e3bebccfac1045159d6eff47f7d561dede1deb93182f71537f1a3d69191a6f5","target":"graph","created_at":"2026-05-18T00:26:32Z","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":"Tandem duplication is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain et al. (2017) proposed the study of codes that correct tandem duplications. Known code constructions are based on {\\em irreducible words}.\n  We study efficient encoding/decoding methods for irreducible words. First, we describe an $(\\ell,m)$-finite state encoder and show that when $m=\\Theta(1/\\epsilon)$ and $\\ell=\\Theta(1/\\epsilon)$, the encoder achieves rate that is $\\epsilon$ away from the optimal. Next, we provide ra","authors_text":"Han Mao Kiah, Johan Chrisnata, Tuan Thanh Nguyen, Yeow Meng Chee","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T05:39:43Z","title":"Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02310","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:200d08abb6f1fac404021e67ddef223e4c5326da34b95e2a0d3a677b0f0d1298","target":"record","created_at":"2026-05-18T00:26:32Z","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":"9e96752a12f26a20a16d6b5fab6959ac7982ff9d632ac1ba3bceb5e127bdcfb7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T05:39:43Z","title_canon_sha256":"f4e8bd37ed6aac97dcf3d82bf3217de7244dd51e3d8cbafca6fc520a27107d4e"},"schema_version":"1.0","source":{"id":"1801.02310","kind":"arxiv","version":1}},"canonical_sha256":"a522681934de13e7908ee454054c99542f793414ae3e8702359eb217a889bcb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a522681934de13e7908ee454054c99542f793414ae3e8702359eb217a889bcb2","first_computed_at":"2026-05-18T00:26:32.090223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:32.090223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UIgIUYCb+OIxMKTSL/0YexxkOkVVaXUT5lZ/SrN2Pg/Om+fqyJ9F1AoMh0HQZPWh8FUrGWnWRdv6bt6WyOE7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:32.090840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:200d08abb6f1fac404021e67ddef223e4c5326da34b95e2a0d3a677b0f0d1298","sha256:1e3bebccfac1045159d6eff47f7d561dede1deb93182f71537f1a3d69191a6f5"],"state_sha256":"97f404a71dfca26e644b61a5925046df441a184c6bdd6d609f1944cedcebfde1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8IolqH5JyonY52F0hTaDwhniQkStoYKG/Bz9y8kDVXLuY5yO+Keys1ikqiXFUW3zW+bFYF1xY/gjUD/6NGeNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:28:17.605265Z","bundle_sha256":"ea8e916b0abcd472f61b45a5c7a0be421247d3fca4e59378a81d866399b85960"}}