{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LBA7M4HGATZIQQN5B63KV3L2QO","short_pith_number":"pith:LBA7M4HG","canonical_record":{"source":{"id":"1602.06688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T09:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"0b342d37b422f1fb6cf7e5818a30b349dd154f26c496c34e733d12a913c7bdc5","abstract_canon_sha256":"ca184151f5a52d749209f443dfd19a61df4f95ccc3fd7e032d68e6c7c9026b5d"},"schema_version":"1.0"},"canonical_sha256":"5841f670e604f28841bd0fb6aaed7a83ac85c8ede696dbe2d3bbeed3ba1946d1","source":{"kind":"arxiv","id":"1602.06688","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06688","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06688v2","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06688","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"LBA7M4HGATZI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LBA7M4HGATZIQQN5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LBA7M4HG","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LBA7M4HGATZIQQN5B63KV3L2QO","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T09:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"0b342d37b422f1fb6cf7e5818a30b349dd154f26c496c34e733d12a913c7bdc5","abstract_canon_sha256":"ca184151f5a52d749209f443dfd19a61df4f95ccc3fd7e032d68e6c7c9026b5d"},"schema_version":"1.0"},"canonical_sha256":"5841f670e604f28841bd0fb6aaed7a83ac85c8ede696dbe2d3bbeed3ba1946d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:30.215700Z","signature_b64":"UaNRo0cGWLHnxw/nImoKSp1ifI51LhEi/9zz8Y5FOnLXC2bZdiOjx0S0P1E2iJlVyxfn2CzFm3AOZXjR6Y3KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5841f670e604f28841bd0fb6aaed7a83ac85c8ede696dbe2d3bbeed3ba1946d1","last_reissued_at":"2026-05-18T01:17:30.214993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:30.214993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06688","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-18T01:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDxMKxbU3CUa8pn42m+bft4SBFWycvDfiwZ4WKiidR+JZgJxMH/+hVecTl0Dwx5GnkYVWhNcDw6UN0ntxeQzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:12:39.278665Z"},"content_sha256":"10677f75310b2de56768c8157bdb6506f17357d417432c208e1dbeeceb22a9e7","schema_version":"1.0","event_id":"sha256:10677f75310b2de56768c8157bdb6506f17357d417432c208e1dbeeceb22a9e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LBA7M4HGATZIQQN5B63KV3L2QO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"siEDM: an efficient string index and search algorithm for edit distance with moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, Kenta Nakashima, Tetsuji Kuboyama, Yasuo Tabei, Yoshimasa Takabatake","submitted_at":"2016-02-22T09:02:44Z","abstract_excerpt":"Although several self-indexes for highly repetitive text collections exist, developing an index and search algorithm with editing operations remains a challenge. Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string into another. Although the problem of computing EDM is intractable, it has a wide range of potential applications, especially in approximate string retrieval. Despite the importance of computing EDM, there has been no efficient method for indexing and searching large text coll"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06688","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-18T01:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEeP8+oIdDpSaCL9EXag1D8DnMI5RH3aJ4UJYlUs4Xj45K4VDWudy85LuleY3mLvGT/NHhHW6EYP83pmjnvJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:12:39.279336Z"},"content_sha256":"4ea1f0e4e3bc5b6d08669bad0d6c8724c82cacc174f0c68a7c44146a2831ceba","schema_version":"1.0","event_id":"sha256:4ea1f0e4e3bc5b6d08669bad0d6c8724c82cacc174f0c68a7c44146a2831ceba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/bundle.json","state_url":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBA7M4HGATZIQQN5B63KV3L2QO/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-09T18:12:39Z","links":{"resolver":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO","bundle":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/bundle.json","state":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBA7M4HGATZIQQN5B63KV3L2QO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LBA7M4HGATZIQQN5B63KV3L2QO","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":"ca184151f5a52d749209f443dfd19a61df4f95ccc3fd7e032d68e6c7c9026b5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T09:02:44Z","title_canon_sha256":"0b342d37b422f1fb6cf7e5818a30b349dd154f26c496c34e733d12a913c7bdc5"},"schema_version":"1.0","source":{"id":"1602.06688","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06688","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06688v2","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06688","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"LBA7M4HGATZI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LBA7M4HGATZIQQN5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LBA7M4HG","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:4ea1f0e4e3bc5b6d08669bad0d6c8724c82cacc174f0c68a7c44146a2831ceba","target":"graph","created_at":"2026-05-18T01:17:30Z","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":"Although several self-indexes for highly repetitive text collections exist, developing an index and search algorithm with editing operations remains a challenge. Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string into another. Although the problem of computing EDM is intractable, it has a wide range of potential applications, especially in approximate string retrieval. Despite the importance of computing EDM, there has been no efficient method for indexing and searching large text coll","authors_text":"Hiroshi Sakamoto, Kenta Nakashima, Tetsuji Kuboyama, Yasuo Tabei, Yoshimasa Takabatake","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T09:02:44Z","title":"siEDM: an efficient string index and search algorithm for edit distance with moves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06688","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:10677f75310b2de56768c8157bdb6506f17357d417432c208e1dbeeceb22a9e7","target":"record","created_at":"2026-05-18T01:17:30Z","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":"ca184151f5a52d749209f443dfd19a61df4f95ccc3fd7e032d68e6c7c9026b5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T09:02:44Z","title_canon_sha256":"0b342d37b422f1fb6cf7e5818a30b349dd154f26c496c34e733d12a913c7bdc5"},"schema_version":"1.0","source":{"id":"1602.06688","kind":"arxiv","version":2}},"canonical_sha256":"5841f670e604f28841bd0fb6aaed7a83ac85c8ede696dbe2d3bbeed3ba1946d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5841f670e604f28841bd0fb6aaed7a83ac85c8ede696dbe2d3bbeed3ba1946d1","first_computed_at":"2026-05-18T01:17:30.214993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:30.214993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UaNRo0cGWLHnxw/nImoKSp1ifI51LhEi/9zz8Y5FOnLXC2bZdiOjx0S0P1E2iJlVyxfn2CzFm3AOZXjR6Y3KBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:30.215700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06688","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10677f75310b2de56768c8157bdb6506f17357d417432c208e1dbeeceb22a9e7","sha256:4ea1f0e4e3bc5b6d08669bad0d6c8724c82cacc174f0c68a7c44146a2831ceba"],"state_sha256":"94773398bd990ac8c5b524fc0ce7ee139abb1dd79a15e66442e35148e3934a1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWHDs6orfDhd1/shOTVtDC2RK1X5WnDHVqIiB2eGY6MMbqgG1xsyfv7U0dKR9xg0mIVB+60D7P7F3rnG9OZwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:12:39.283174Z","bundle_sha256":"6f2ff2c59b7dba4665c41683c5f6da454d35946519b2f9bbc05d5a426d833c45"}}