{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JTC3YUOMOHC6JJ6DVEWDPL6MIO","short_pith_number":"pith:JTC3YUOM","canonical_record":{"source":{"id":"2302.04475","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-09T07:37:45Z","cross_cats_sorted":[],"title_canon_sha256":"8e681fd26d5bc41a7114e38c1acede0a70d26d5428edad61a2e5f6dabdb51961","abstract_canon_sha256":"70c9a07dbbc65068599ccb663c51802ca52057b82a50db6c31d5069cd9db56ee"},"schema_version":"1.0"},"canonical_sha256":"4cc5bc51cc71c5e4a7c3a92c37afcc438669ec43cd2a4403056b390d42d85a7f","source":{"kind":"arxiv","id":"2302.04475","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04475","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04475v2","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04475","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"JTC3YUOMOHC6","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"pith_short_16","alias_value":"JTC3YUOMOHC6JJ6D","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"pith_short_8","alias_value":"JTC3YUOM","created_at":"2026-07-05T07:16:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JTC3YUOMOHC6JJ6DVEWDPL6MIO","target":"record","payload":{"canonical_record":{"source":{"id":"2302.04475","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-09T07:37:45Z","cross_cats_sorted":[],"title_canon_sha256":"8e681fd26d5bc41a7114e38c1acede0a70d26d5428edad61a2e5f6dabdb51961","abstract_canon_sha256":"70c9a07dbbc65068599ccb663c51802ca52057b82a50db6c31d5069cd9db56ee"},"schema_version":"1.0"},"canonical_sha256":"4cc5bc51cc71c5e4a7c3a92c37afcc438669ec43cd2a4403056b390d42d85a7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:36.512462Z","signature_b64":"k1dGYqDEklyoLTphZdRkqtat4bkx/B2+5ELAQOegsXTpilkMAc7nU82a8SMQX26YOMuxPU2gI+6VCpWRvkXfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cc5bc51cc71c5e4a7c3a92c37afcc438669ec43cd2a4403056b390d42d85a7f","last_reissued_at":"2026-07-05T07:16:36.511953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:36.511953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.04475","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-07-05T07:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mD9qYuWHbZiUOFZHVTfqCWNOe86PekzYX+w8zvmojTy9q/KgX6KauL5S+mgXS5IVzT6qz9wYUvFGYYpNeCzYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T16:37:17.578277Z"},"content_sha256":"87975c8088be9463e645e4535b4c27b7317f5a55ddd3936bee5d7b02bbcd8d67","schema_version":"1.0","event_id":"sha256:87975c8088be9463e645e4535b4c27b7317f5a55ddd3936bee5d7b02bbcd8d67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JTC3YUOMOHC6JJ6DVEWDPL6MIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locally consistent decomposition of strings with applications to edit distance sketching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michal Kouck\\'y, Sudatta Bhattacharya","submitted_at":"2023-02-09T07:37:45Z","abstract_excerpt":"In this paper we provide a new locally consistent decomposition of strings. Each string $x$ is decomposed into blocks that can be described by grammars of size $\\widetilde{O}(k)$ (using some amount of randomness). If we take two strings $x$ and $y$ of edit distance at most $k$ then their block decomposition uses the same number of grammars and the $i$-th grammar of $x$ is the same as the $i$-th grammar of $y$ except for at most $k$ indexes $i$. The edit distance of $x$ and $y$ equals to the sum of edit distances of pairs of blocks where $x$ and $y$ differ. Our decomposition can be used to desi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04475","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.04475/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7KQsEN78iR57yy0oe8EqrwkFOCPD2L/nUg+Ntt0+bY9u6efUQEBbyBulvsNRjjInVpDfcXMLGx7t2cfLZvyjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T16:37:17.579165Z"},"content_sha256":"1d461acdcb919721d93046db2f99117b5eb610e8d5f6c2a346b646206e8dbb87","schema_version":"1.0","event_id":"sha256:1d461acdcb919721d93046db2f99117b5eb610e8d5f6c2a346b646206e8dbb87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTC3YUOMOHC6JJ6DVEWDPL6MIO/bundle.json","state_url":"https://pith.science/pith/JTC3YUOMOHC6JJ6DVEWDPL6MIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTC3YUOMOHC6JJ6DVEWDPL6MIO/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-08-15T16:37:17Z","links":{"resolver":"https://pith.science/pith/JTC3YUOMOHC6JJ6DVEWDPL6MIO","bundle":"https://pith.science/pith/JTC3YUOMOHC6JJ6DVEWDPL6MIO/bundle.json","state":"https://pith.science/pith/JTC3YUOMOHC6JJ6DVEWDPL6MIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTC3YUOMOHC6JJ6DVEWDPL6MIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JTC3YUOMOHC6JJ6DVEWDPL6MIO","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":"70c9a07dbbc65068599ccb663c51802ca52057b82a50db6c31d5069cd9db56ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-09T07:37:45Z","title_canon_sha256":"8e681fd26d5bc41a7114e38c1acede0a70d26d5428edad61a2e5f6dabdb51961"},"schema_version":"1.0","source":{"id":"2302.04475","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04475","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04475v2","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04475","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"JTC3YUOMOHC6","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"pith_short_16","alias_value":"JTC3YUOMOHC6JJ6D","created_at":"2026-07-05T07:16:36Z"},{"alias_kind":"pith_short_8","alias_value":"JTC3YUOM","created_at":"2026-07-05T07:16:36Z"}],"graph_snapshots":[{"event_id":"sha256:1d461acdcb919721d93046db2f99117b5eb610e8d5f6c2a346b646206e8dbb87","target":"graph","created_at":"2026-07-05T07:16:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2302.04475/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we provide a new locally consistent decomposition of strings. Each string $x$ is decomposed into blocks that can be described by grammars of size $\\widetilde{O}(k)$ (using some amount of randomness). If we take two strings $x$ and $y$ of edit distance at most $k$ then their block decomposition uses the same number of grammars and the $i$-th grammar of $x$ is the same as the $i$-th grammar of $y$ except for at most $k$ indexes $i$. The edit distance of $x$ and $y$ equals to the sum of edit distances of pairs of blocks where $x$ and $y$ differ. Our decomposition can be used to desi","authors_text":"Michal Kouck\\'y, Sudatta Bhattacharya","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-09T07:37:45Z","title":"Locally consistent decomposition of strings with applications to edit distance sketching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04475","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:87975c8088be9463e645e4535b4c27b7317f5a55ddd3936bee5d7b02bbcd8d67","target":"record","created_at":"2026-07-05T07:16:36Z","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":"70c9a07dbbc65068599ccb663c51802ca52057b82a50db6c31d5069cd9db56ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-09T07:37:45Z","title_canon_sha256":"8e681fd26d5bc41a7114e38c1acede0a70d26d5428edad61a2e5f6dabdb51961"},"schema_version":"1.0","source":{"id":"2302.04475","kind":"arxiv","version":2}},"canonical_sha256":"4cc5bc51cc71c5e4a7c3a92c37afcc438669ec43cd2a4403056b390d42d85a7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cc5bc51cc71c5e4a7c3a92c37afcc438669ec43cd2a4403056b390d42d85a7f","first_computed_at":"2026-07-05T07:16:36.511953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:36.511953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k1dGYqDEklyoLTphZdRkqtat4bkx/B2+5ELAQOegsXTpilkMAc7nU82a8SMQX26YOMuxPU2gI+6VCpWRvkXfBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:36.512462Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.04475","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87975c8088be9463e645e4535b4c27b7317f5a55ddd3936bee5d7b02bbcd8d67","sha256:1d461acdcb919721d93046db2f99117b5eb610e8d5f6c2a346b646206e8dbb87"],"state_sha256":"7f8709de18d5a8ca9502a0a53d4be8dfa87248aaee12934efbd39006de98a662"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9I5uScM3e76xTKOPpRWJc3PF7H7eiXX/v0G+cGuEKr/vldpROXdn9JyJmnOSfn9TKXdv38KAzN0KW9hUWh6lCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T16:37:17.584336Z","bundle_sha256":"070ff346b55da7575b92455e7464d1e7a9d0f65a0d56900bba31af0ed5026606"}}