{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:AQ57W6U5KNK7FAPKUKI2U4XAA7","short_pith_number":"pith:AQ57W6U5","canonical_record":{"source":{"id":"1004.1194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-07T21:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"e97d83132cf5a3baf1647d6bd7b039107ed7994d827ac1af71e67e6519343e18","abstract_canon_sha256":"cd8d10f13ba665a1bb28af0af6e233aea0ff3ff8a46e6bc133f166cf22d1eb9a"},"schema_version":"1.0"},"canonical_sha256":"043bfb7a9d5355f281eaa291aa72e007df4bf054bceeabfbd05e291be51cf500","source":{"kind":"arxiv","id":"1004.1194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1194","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1194v1","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1194","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"AQ57W6U5KNK7","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"AQ57W6U5KNK7FAPK","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"AQ57W6U5","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:AQ57W6U5KNK7FAPKUKI2U4XAA7","target":"record","payload":{"canonical_record":{"source":{"id":"1004.1194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-07T21:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"e97d83132cf5a3baf1647d6bd7b039107ed7994d827ac1af71e67e6519343e18","abstract_canon_sha256":"cd8d10f13ba665a1bb28af0af6e233aea0ff3ff8a46e6bc133f166cf22d1eb9a"},"schema_version":"1.0"},"canonical_sha256":"043bfb7a9d5355f281eaa291aa72e007df4bf054bceeabfbd05e291be51cf500","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:24.776397Z","signature_b64":"pIku/sgBLz6qkWQsnKwh2Egv96nYfUjpuSV+efhk6yNZokutHxcIP7JlyNCxiWKmcqZ5No9wsPVYhkx1WgNIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"043bfb7a9d5355f281eaa291aa72e007df4bf054bceeabfbd05e291be51cf500","last_reissued_at":"2026-05-18T01:03:24.775659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:24.775659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.1194","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-18T01:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hiqw/Xb5Q+YIzHeYJna6PYe1a1989qliVOiiZcrItC9xzgPFOqnFbPZnL0M7oSF5O74+Sz9sPODb76CvcKhsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:40:11.704243Z"},"content_sha256":"2b638bdc1bdcc7293dee085c72b7108af8a64a007487f5a4e4ea9a9d85a415b3","schema_version":"1.0","event_id":"sha256:2b638bdc1bdcc7293dee085c72b7108af8a64a007487f5a4e4ea9a9d85a415b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:AQ57W6U5KNK7FAPKUKI2U4XAA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unified Compression-Based Acceleration of Edit-Distance Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Gad M. Landau, Oren Weimann, Shir Landau","submitted_at":"2010-04-07T21:24:27Z","abstract_excerpt":"The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming solution for this problem computes the edit-distance between a pair of strings of total length O(N) in O(N^2) time. To this date, this quadratic upper-bound has never been substantially improved for general strings. However, there are known techniques for breaking this bound in case the strings are known to compress well under a particular compression scheme. The basic idea is to first compress the strings, and then t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1194","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-18T01:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V7xp0uAzkNkWw1zYR0yIoKhBD7GkLmex7CWS28zokf3SmPyHY9xQgGdSKseTdy0GoMm6vNwxbqFctuSPg3rIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:40:11.704625Z"},"content_sha256":"5b8eb233c59abddf7f1ac3c4e83f92aa5095ff2858606b1909a99e921b7b3c4a","schema_version":"1.0","event_id":"sha256:5b8eb233c59abddf7f1ac3c4e83f92aa5095ff2858606b1909a99e921b7b3c4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/bundle.json","state_url":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/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-26T05:40:11Z","links":{"resolver":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7","bundle":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/bundle.json","state":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:AQ57W6U5KNK7FAPKUKI2U4XAA7","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":"cd8d10f13ba665a1bb28af0af6e233aea0ff3ff8a46e6bc133f166cf22d1eb9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-07T21:24:27Z","title_canon_sha256":"e97d83132cf5a3baf1647d6bd7b039107ed7994d827ac1af71e67e6519343e18"},"schema_version":"1.0","source":{"id":"1004.1194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1194","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1194v1","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1194","created_at":"2026-05-18T01:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"AQ57W6U5KNK7","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"AQ57W6U5KNK7FAPK","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"AQ57W6U5","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:5b8eb233c59abddf7f1ac3c4e83f92aa5095ff2858606b1909a99e921b7b3c4a","target":"graph","created_at":"2026-05-18T01:03:24Z","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":"The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming solution for this problem computes the edit-distance between a pair of strings of total length O(N) in O(N^2) time. To this date, this quadratic upper-bound has never been substantially improved for general strings. However, there are known techniques for breaking this bound in case the strings are known to compress well under a particular compression scheme. The basic idea is to first compress the strings, and then t","authors_text":"Danny Hermelin, Gad M. Landau, Oren Weimann, Shir Landau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-07T21:24:27Z","title":"Unified Compression-Based Acceleration of Edit-Distance Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1194","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:2b638bdc1bdcc7293dee085c72b7108af8a64a007487f5a4e4ea9a9d85a415b3","target":"record","created_at":"2026-05-18T01:03:24Z","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":"cd8d10f13ba665a1bb28af0af6e233aea0ff3ff8a46e6bc133f166cf22d1eb9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-07T21:24:27Z","title_canon_sha256":"e97d83132cf5a3baf1647d6bd7b039107ed7994d827ac1af71e67e6519343e18"},"schema_version":"1.0","source":{"id":"1004.1194","kind":"arxiv","version":1}},"canonical_sha256":"043bfb7a9d5355f281eaa291aa72e007df4bf054bceeabfbd05e291be51cf500","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"043bfb7a9d5355f281eaa291aa72e007df4bf054bceeabfbd05e291be51cf500","first_computed_at":"2026-05-18T01:03:24.775659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:24.775659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pIku/sgBLz6qkWQsnKwh2Egv96nYfUjpuSV+efhk6yNZokutHxcIP7JlyNCxiWKmcqZ5No9wsPVYhkx1WgNIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:24.776397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.1194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b638bdc1bdcc7293dee085c72b7108af8a64a007487f5a4e4ea9a9d85a415b3","sha256:5b8eb233c59abddf7f1ac3c4e83f92aa5095ff2858606b1909a99e921b7b3c4a"],"state_sha256":"0a60d2369e900aba3514f3c988485aca18aac0e1ea6f732d00ff9c01646964fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iQS9H6RgpQwHwYd16UltWSqWXCaComCyQu6PIaYQWBG6Z7dxvB0kU149CrRxQQ4A08s4IoBOGy566ObvlmECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:40:11.708111Z","bundle_sha256":"0c7da62e376933dfda79232fcfc98c404c3c7a703f3e4d7f14f3507275e83dda"}}