{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JZ5N3PQNYR5PVXIWAP7MEW7YBF","short_pith_number":"pith:JZ5N3PQN","canonical_record":{"source":{"id":"1904.05451","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T21:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"1b1ffdab84937b7fb083554495abfa8952ae2daaec7ed0fd7807cc0fe32cf43d","abstract_canon_sha256":"1f9377472d5c2bd5a5cd727179730952ce30ca265085e69c47794b244eb3a213"},"schema_version":"1.0"},"canonical_sha256":"4e7addbe0dc47afadd1603fec25bf80971f0268fe3a8dcb35d7f3ffcd8fa5cce","source":{"kind":"arxiv","id":"1904.05451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05451","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05451v1","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05451","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"JZ5N3PQNYR5P","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JZ5N3PQNYR5PVXIW","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JZ5N3PQN","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JZ5N3PQNYR5PVXIWAP7MEW7YBF","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05451","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T21:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"1b1ffdab84937b7fb083554495abfa8952ae2daaec7ed0fd7807cc0fe32cf43d","abstract_canon_sha256":"1f9377472d5c2bd5a5cd727179730952ce30ca265085e69c47794b244eb3a213"},"schema_version":"1.0"},"canonical_sha256":"4e7addbe0dc47afadd1603fec25bf80971f0268fe3a8dcb35d7f3ffcd8fa5cce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:49.484765Z","signature_b64":"oZjumtwKGIihdF1k6Kd1Gka3fGqsYzJcjdfFjUuiYKmvonYECbwis5nMAqvPHoyPLKvYbzZ2YIabuhJoG4pXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e7addbe0dc47afadd1603fec25bf80971f0268fe3a8dcb35d7f3ffcd8fa5cce","last_reissued_at":"2026-05-17T23:48:49.484202Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:49.484202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05451","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-17T23:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCzwu9TqNxdINVhOgdUG9Xk36MvxZlPNV9n+SRoxdNa2Mvm4Npbyn6nlftwGUACeezoRFnywYiL+rETkB0lyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:54:17.420670Z"},"content_sha256":"cb4d25f9e8d2d4622ab9c4c74dd411c3cf81d3fe35bf40e99066e64a28c07384","schema_version":"1.0","event_id":"sha256:cb4d25f9e8d2d4622ab9c4c74dd411c3cf81d3fe35bf40e99066e64a28c07384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JZ5N3PQNYR5PVXIWAP7MEW7YBF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducing approximate Longest Common Subsequence to approximate Edit Distance","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aviad Rubinstein, Zhao Song","submitted_at":"2019-04-10T21:36:47Z","abstract_excerpt":"Given a pair of strings, the problems of computing their Longest Common Subsequence and Edit Distance have been extensively studied for decades. For exact algorithms, LCS and Edit Distance (with character insertions and deletions) are equivalent; the state of the art running time is (almost) quadratic and this is tight under plausible fine-grained complexity assumptions. But for approximation algorithms the picture is different: there is a long line of works with improved approximation factors for Edit Distance, but for LCS (with binary strings) only a trivial $1/2$-approximation was known. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05451","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-17T23:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHu4COpkWW7N7SEKroZVjU5CUdmojkcENXag7ukaHDeyuppxtEOeTxmdk6PGpwmm9C+XxFeoiD6702UERCGtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:54:17.421390Z"},"content_sha256":"6603211ac49975a56a1530340278ca62e2b392421a73b175c8631ae6f9505816","schema_version":"1.0","event_id":"sha256:6603211ac49975a56a1530340278ca62e2b392421a73b175c8631ae6f9505816"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZ5N3PQNYR5PVXIWAP7MEW7YBF/bundle.json","state_url":"https://pith.science/pith/JZ5N3PQNYR5PVXIWAP7MEW7YBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZ5N3PQNYR5PVXIWAP7MEW7YBF/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-01T01:54:17Z","links":{"resolver":"https://pith.science/pith/JZ5N3PQNYR5PVXIWAP7MEW7YBF","bundle":"https://pith.science/pith/JZ5N3PQNYR5PVXIWAP7MEW7YBF/bundle.json","state":"https://pith.science/pith/JZ5N3PQNYR5PVXIWAP7MEW7YBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZ5N3PQNYR5PVXIWAP7MEW7YBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JZ5N3PQNYR5PVXIWAP7MEW7YBF","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":"1f9377472d5c2bd5a5cd727179730952ce30ca265085e69c47794b244eb3a213","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T21:36:47Z","title_canon_sha256":"1b1ffdab84937b7fb083554495abfa8952ae2daaec7ed0fd7807cc0fe32cf43d"},"schema_version":"1.0","source":{"id":"1904.05451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05451","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05451v1","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05451","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"JZ5N3PQNYR5P","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JZ5N3PQNYR5PVXIW","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JZ5N3PQN","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:6603211ac49975a56a1530340278ca62e2b392421a73b175c8631ae6f9505816","target":"graph","created_at":"2026-05-17T23:48:49Z","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":"Given a pair of strings, the problems of computing their Longest Common Subsequence and Edit Distance have been extensively studied for decades. For exact algorithms, LCS and Edit Distance (with character insertions and deletions) are equivalent; the state of the art running time is (almost) quadratic and this is tight under plausible fine-grained complexity assumptions. But for approximation algorithms the picture is different: there is a long line of works with improved approximation factors for Edit Distance, but for LCS (with binary strings) only a trivial $1/2$-approximation was known. In","authors_text":"Aviad Rubinstein, Zhao Song","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T21:36:47Z","title":"Reducing approximate Longest Common Subsequence to approximate Edit Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05451","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:cb4d25f9e8d2d4622ab9c4c74dd411c3cf81d3fe35bf40e99066e64a28c07384","target":"record","created_at":"2026-05-17T23:48:49Z","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":"1f9377472d5c2bd5a5cd727179730952ce30ca265085e69c47794b244eb3a213","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T21:36:47Z","title_canon_sha256":"1b1ffdab84937b7fb083554495abfa8952ae2daaec7ed0fd7807cc0fe32cf43d"},"schema_version":"1.0","source":{"id":"1904.05451","kind":"arxiv","version":1}},"canonical_sha256":"4e7addbe0dc47afadd1603fec25bf80971f0268fe3a8dcb35d7f3ffcd8fa5cce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e7addbe0dc47afadd1603fec25bf80971f0268fe3a8dcb35d7f3ffcd8fa5cce","first_computed_at":"2026-05-17T23:48:49.484202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:49.484202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oZjumtwKGIihdF1k6Kd1Gka3fGqsYzJcjdfFjUuiYKmvonYECbwis5nMAqvPHoyPLKvYbzZ2YIabuhJoG4pXBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:49.484765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb4d25f9e8d2d4622ab9c4c74dd411c3cf81d3fe35bf40e99066e64a28c07384","sha256:6603211ac49975a56a1530340278ca62e2b392421a73b175c8631ae6f9505816"],"state_sha256":"4852c0b06dfb2fd133b22b2fe3afba1c6b770b863de01a01dbdfd77688834627"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kg7a0ppgD7AOC34ZRZoTfn32ooCW21Lw3dM55TE/NzUZWVMSppjRs+EJaLFXcJuBiztUHMo6nKYTCCxyw0tkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:54:17.424472Z","bundle_sha256":"3d2a28d5053a7bc422bbcc7624c58517b381bbe7fd818a91d84f065bfc8af937"}}