{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CHJGBLB56BV6ADN24FCGFQDBMC","short_pith_number":"pith:CHJGBLB5","canonical_record":{"source":{"id":"1109.5635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-26T16:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"025072d4489d0b97b7815e0bdf7a01f6d4efcbadf0427c5386b1ee9bddbb3bb4","abstract_canon_sha256":"fd8bc6e184400b41aab8e481d1cf14c4100e1109705f759d4a86c5db97d3e784"},"schema_version":"1.0"},"canonical_sha256":"11d260ac3df06be00dbae14462c06160af2a523f862384e6ab0baa7aedce7d0c","source":{"kind":"arxiv","id":"1109.5635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5635","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5635v1","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5635","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"CHJGBLB56BV6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CHJGBLB56BV6ADN2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CHJGBLB5","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CHJGBLB56BV6ADN24FCGFQDBMC","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-26T16:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"025072d4489d0b97b7815e0bdf7a01f6d4efcbadf0427c5386b1ee9bddbb3bb4","abstract_canon_sha256":"fd8bc6e184400b41aab8e481d1cf14c4100e1109705f759d4a86c5db97d3e784"},"schema_version":"1.0"},"canonical_sha256":"11d260ac3df06be00dbae14462c06160af2a523f862384e6ab0baa7aedce7d0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:19.065143Z","signature_b64":"HT2FLB91IhW33JjxaC5btjMf5xb3tQ3QurC6Hb+f0v50xweeOC0ys2btJResjiACXL3zPLghgtVTkzmsOiCNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11d260ac3df06be00dbae14462c06160af2a523f862384e6ab0baa7aedce7d0c","last_reissued_at":"2026-05-18T04:12:19.064734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:19.064734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5635","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-18T04:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/5PZNPVPzqcyariMxxhp8S1RAm0YV4fu56i9IzWwzQwZBHOx/HS+88eVfYHCqzzbavnDgXJsx4+2EDDMuyIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:53:16.339524Z"},"content_sha256":"bc57a1a76738e3159b9f43743665aa20d54a5e0d029e0188f85d8cbf4ead9815","schema_version":"1.0","event_id":"sha256:bc57a1a76738e3159b9f43743665aa20d54a5e0d029e0188f85d8cbf4ead9815"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CHJGBLB56BV6ADN24FCGFQDBMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Edit Distance in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Krzysztof Onak","submitted_at":"2011-09-26T16:48:20Z","abstract_excerpt":"We show how to compute the edit distance between two strings of length n up to a factor of 2^{\\~O(sqrt(log n))} in n^(1+o(1)) time. This is the first sub-polynomial approximation algorithm for this problem that runs in near-linear time, improving on the state-of-the-art n^(1/3+o(1)) approximation. Previously, approximation of 2^{\\~O(sqrt(log n))} was known only for embedding edit distance into l_1, and it is not known if that embedding can be computed in less than quadratic time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5635","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-18T04:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iUTbZOPyKO2tYODBW376EFPZtxujg0XHv8B2kmud3fpIPX1COUBomB7Nm7yvf7v1Cdbsh9wPBHo7Rm4ly/iBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:53:16.340202Z"},"content_sha256":"885a648c1599bb337cbb2ce7d1424b0275b1ab06a2ad7a8f4194b5545cbfa07f","schema_version":"1.0","event_id":"sha256:885a648c1599bb337cbb2ce7d1424b0275b1ab06a2ad7a8f4194b5545cbfa07f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHJGBLB56BV6ADN24FCGFQDBMC/bundle.json","state_url":"https://pith.science/pith/CHJGBLB56BV6ADN24FCGFQDBMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHJGBLB56BV6ADN24FCGFQDBMC/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-05-29T19:53:16Z","links":{"resolver":"https://pith.science/pith/CHJGBLB56BV6ADN24FCGFQDBMC","bundle":"https://pith.science/pith/CHJGBLB56BV6ADN24FCGFQDBMC/bundle.json","state":"https://pith.science/pith/CHJGBLB56BV6ADN24FCGFQDBMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHJGBLB56BV6ADN24FCGFQDBMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CHJGBLB56BV6ADN24FCGFQDBMC","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":"fd8bc6e184400b41aab8e481d1cf14c4100e1109705f759d4a86c5db97d3e784","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-26T16:48:20Z","title_canon_sha256":"025072d4489d0b97b7815e0bdf7a01f6d4efcbadf0427c5386b1ee9bddbb3bb4"},"schema_version":"1.0","source":{"id":"1109.5635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5635","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5635v1","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5635","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"CHJGBLB56BV6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CHJGBLB56BV6ADN2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CHJGBLB5","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:885a648c1599bb337cbb2ce7d1424b0275b1ab06a2ad7a8f4194b5545cbfa07f","target":"graph","created_at":"2026-05-18T04:12:19Z","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":"We show how to compute the edit distance between two strings of length n up to a factor of 2^{\\~O(sqrt(log n))} in n^(1+o(1)) time. This is the first sub-polynomial approximation algorithm for this problem that runs in near-linear time, improving on the state-of-the-art n^(1/3+o(1)) approximation. Previously, approximation of 2^{\\~O(sqrt(log n))} was known only for embedding edit distance into l_1, and it is not known if that embedding can be computed in less than quadratic time.","authors_text":"Alexandr Andoni, Krzysztof Onak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-26T16:48:20Z","title":"Approximating Edit Distance in Near-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5635","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:bc57a1a76738e3159b9f43743665aa20d54a5e0d029e0188f85d8cbf4ead9815","target":"record","created_at":"2026-05-18T04:12:19Z","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":"fd8bc6e184400b41aab8e481d1cf14c4100e1109705f759d4a86c5db97d3e784","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-26T16:48:20Z","title_canon_sha256":"025072d4489d0b97b7815e0bdf7a01f6d4efcbadf0427c5386b1ee9bddbb3bb4"},"schema_version":"1.0","source":{"id":"1109.5635","kind":"arxiv","version":1}},"canonical_sha256":"11d260ac3df06be00dbae14462c06160af2a523f862384e6ab0baa7aedce7d0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11d260ac3df06be00dbae14462c06160af2a523f862384e6ab0baa7aedce7d0c","first_computed_at":"2026-05-18T04:12:19.064734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:19.064734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HT2FLB91IhW33JjxaC5btjMf5xb3tQ3QurC6Hb+f0v50xweeOC0ys2btJResjiACXL3zPLghgtVTkzmsOiCNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:19.065143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc57a1a76738e3159b9f43743665aa20d54a5e0d029e0188f85d8cbf4ead9815","sha256:885a648c1599bb337cbb2ce7d1424b0275b1ab06a2ad7a8f4194b5545cbfa07f"],"state_sha256":"d3164371c7a0151159db586b95c77118e35a4219a027d04b2c2ae483372c3c58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41k9rvwEhc4C9AwibCtSICiKFFLxSmqD78wpTnKPzCswsBRhY0K8/86da0ccih3aQ9Q1lBV7SKh7pKCU0mTSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:53:16.343839Z","bundle_sha256":"7dd0dd48750a4dd8917e435f9c938a1d0759b12795e6000e5ce6ab58d9d7e23c"}}