{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QE6TEJ35YOKQB3EITSKGGV2WFU","short_pith_number":"pith:QE6TEJ35","canonical_record":{"source":{"id":"1804.04178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T19:20:04Z","cross_cats_sorted":["cs.DC","quant-ph"],"title_canon_sha256":"fc73c491a63ba05b947f46819670b0f32533d383ca145a278dc5a8dbc7dd30f6","abstract_canon_sha256":"7bda86467619f793aedb1b424229cc39ca3e5684b32b503ea45d44da1b057731"},"schema_version":"1.0"},"canonical_sha256":"813d32277dc39500ec889c946357562d08a0dddbd11f698037ffb7bac000b753","source":{"kind":"arxiv","id":"1804.04178","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04178","created_at":"2026-05-18T00:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04178v2","created_at":"2026-05-18T00:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04178","created_at":"2026-05-18T00:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"QE6TEJ35YOKQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QE6TEJ35YOKQB3EI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QE6TEJ35","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QE6TEJ35YOKQB3EITSKGGV2WFU","target":"record","payload":{"canonical_record":{"source":{"id":"1804.04178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T19:20:04Z","cross_cats_sorted":["cs.DC","quant-ph"],"title_canon_sha256":"fc73c491a63ba05b947f46819670b0f32533d383ca145a278dc5a8dbc7dd30f6","abstract_canon_sha256":"7bda86467619f793aedb1b424229cc39ca3e5684b32b503ea45d44da1b057731"},"schema_version":"1.0"},"canonical_sha256":"813d32277dc39500ec889c946357562d08a0dddbd11f698037ffb7bac000b753","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:30.340305Z","signature_b64":"/rAQ50LO6C6o5FyCK2JBKLRIOREJsidTRJRVDuB87zsi1+pztw3V5Prz5yz8A9VHEI/cfIVv5X5+wl0rl/BfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"813d32277dc39500ec889c946357562d08a0dddbd11f698037ffb7bac000b753","last_reissued_at":"2026-05-18T00:17:30.339576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:30.339576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.04178","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-18T00: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":"wDwcPSd6MyzJBdcQ+gKbqpzHgwVODSod4dA1XmDQ0KnMqmM7mLXBeT1vixC7jz4SzUN94evdXwoKY18YWNszDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:03:37.531707Z"},"content_sha256":"545018151e8e9b442db9b19294160c88543fdb3c7e6082f843023b197be096cc","schema_version":"1.0","event_id":"sha256:545018151e8e9b442db9b19294160c88543fdb3c7e6082f843023b197be096cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QE6TEJ35YOKQB3EITSKGGV2WFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin, Soheil Ehsani","submitted_at":"2018-04-11T19:20:04Z","abstract_excerpt":"The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another one. Approximating edit distance in subquadratic time is \"one of the biggest unsolved problems in the field of combinatorial pattern matching\". Our main result is a quantum constant approximation algorithm for computing the edit distance in truly subquadratic time. More precisely, we give an $O(n^{1.858})$ quantum algorithm that approximates the edit distance within a factor of $7$. We further extend this result to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04178","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-18T00: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":"3yqpqY6KScBhqyxEL7J/4ymrlakGayi1g7MDRDiV1LqSO3+aXOg/0dQn5MlY7yJ80dEdSSPFsuKdlo9kO1vWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:03:37.532066Z"},"content_sha256":"b79a886f3c14c9336c08f5d16bb3e9f861d521c3149166d27a55c6d2e29fe82e","schema_version":"1.0","event_id":"sha256:b79a886f3c14c9336c08f5d16bb3e9f861d521c3149166d27a55c6d2e29fe82e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QE6TEJ35YOKQB3EITSKGGV2WFU/bundle.json","state_url":"https://pith.science/pith/QE6TEJ35YOKQB3EITSKGGV2WFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QE6TEJ35YOKQB3EITSKGGV2WFU/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-01T18:03:37Z","links":{"resolver":"https://pith.science/pith/QE6TEJ35YOKQB3EITSKGGV2WFU","bundle":"https://pith.science/pith/QE6TEJ35YOKQB3EITSKGGV2WFU/bundle.json","state":"https://pith.science/pith/QE6TEJ35YOKQB3EITSKGGV2WFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QE6TEJ35YOKQB3EITSKGGV2WFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QE6TEJ35YOKQB3EITSKGGV2WFU","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":"7bda86467619f793aedb1b424229cc39ca3e5684b32b503ea45d44da1b057731","cross_cats_sorted":["cs.DC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T19:20:04Z","title_canon_sha256":"fc73c491a63ba05b947f46819670b0f32533d383ca145a278dc5a8dbc7dd30f6"},"schema_version":"1.0","source":{"id":"1804.04178","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04178","created_at":"2026-05-18T00:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04178v2","created_at":"2026-05-18T00:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04178","created_at":"2026-05-18T00:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"QE6TEJ35YOKQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QE6TEJ35YOKQB3EI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QE6TEJ35","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:b79a886f3c14c9336c08f5d16bb3e9f861d521c3149166d27a55c6d2e29fe82e","target":"graph","created_at":"2026-05-18T00: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":"The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another one. Approximating edit distance in subquadratic time is \"one of the biggest unsolved problems in the field of combinatorial pattern matching\". Our main result is a quantum constant approximation algorithm for computing the edit distance in truly subquadratic time. More precisely, we give an $O(n^{1.858})$ quantum algorithm that approximates the edit distance within a factor of $7$. We further extend this result to a","authors_text":"Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin, Soheil Ehsani","cross_cats":["cs.DC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T19:20:04Z","title":"Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04178","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:545018151e8e9b442db9b19294160c88543fdb3c7e6082f843023b197be096cc","target":"record","created_at":"2026-05-18T00: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":"7bda86467619f793aedb1b424229cc39ca3e5684b32b503ea45d44da1b057731","cross_cats_sorted":["cs.DC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T19:20:04Z","title_canon_sha256":"fc73c491a63ba05b947f46819670b0f32533d383ca145a278dc5a8dbc7dd30f6"},"schema_version":"1.0","source":{"id":"1804.04178","kind":"arxiv","version":2}},"canonical_sha256":"813d32277dc39500ec889c946357562d08a0dddbd11f698037ffb7bac000b753","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"813d32277dc39500ec889c946357562d08a0dddbd11f698037ffb7bac000b753","first_computed_at":"2026-05-18T00:17:30.339576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:30.339576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/rAQ50LO6C6o5FyCK2JBKLRIOREJsidTRJRVDuB87zsi1+pztw3V5Prz5yz8A9VHEI/cfIVv5X5+wl0rl/BfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:30.340305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04178","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:545018151e8e9b442db9b19294160c88543fdb3c7e6082f843023b197be096cc","sha256:b79a886f3c14c9336c08f5d16bb3e9f861d521c3149166d27a55c6d2e29fe82e"],"state_sha256":"9fd95df76928bb71b0e21a1a8bac91c12f827c474f554430ec5c584f71285318"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9SrQgP70FEHuIzx6hOjOPsfw8Kmq59vE4mHRzzQrYIjY+n/I8xmydUUxkV5PvBgpQmx4RbzoYwTqDlUYnKFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:03:37.534136Z","bundle_sha256":"59a44ca7b150d2798b7c1623461c9e6c89fdbb30ed57d347fbcf877c67bb3237"}}