{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LAJIS73NFATSLBDCEQ6SGMWRDM","short_pith_number":"pith:LAJIS73N","schema_version":"1.0","canonical_sha256":"5812897f6d2827258462243d2332d11b3dbedcf3aa0951e1aa6d2cf7f8c7543c","source":{"kind":"arxiv","id":"2111.02336","version":2},"attestation_state":"computed","paper":{"title":"An Improved Algorithm for The $k$-Dyck Edit Distance Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dvir Fried, Ely Porat, Shay Golan, Tatiana Starikovskaya, Tomasz Kociumaka, Tsvi Kopelowitz","submitted_at":"2021-11-03T16:38:37Z","abstract_excerpt":"A Dyck sequence is a sequence of opening and closing parentheses (of various types) that is balanced. The Dyck edit distance of a given sequence of parentheses $S$ is the smallest number of edit operations (insertions, deletions, and substitutions) needed to transform $S$ into a Dyck sequence. We consider the threshold Dyck edit distance problem, where the input is a sequence of parentheses $S$ and a positive integer $k$, and the goal is to compute the Dyck edit distance of $S$ only if the distance is at most $k$, and otherwise report that the distance is larger than $k$. Backurs and Onak [POD"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2111.02336","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T16:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"80036183db6774a3660da25797800044e1e635fec395299bb6060f5e16d94b55","abstract_canon_sha256":"f08724f3d9a44eedf1f45ac826b95fdd637136021f29c23b8ef6686d093e1b5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:50:12.608772Z","signature_b64":"qPGWf00MIpg8Vrec5ATuBLWHhTNmWI8eyZa0Q2pTguxlPdc1z2LXmsyZJ6kkX0nN8WB0JQhx+Rw8afXmveTnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5812897f6d2827258462243d2332d11b3dbedcf3aa0951e1aa6d2cf7f8c7543c","last_reissued_at":"2026-07-05T04:50:12.608308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:50:12.608308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Algorithm for The $k$-Dyck Edit Distance Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dvir Fried, Ely Porat, Shay Golan, Tatiana Starikovskaya, Tomasz Kociumaka, Tsvi Kopelowitz","submitted_at":"2021-11-03T16:38:37Z","abstract_excerpt":"A Dyck sequence is a sequence of opening and closing parentheses (of various types) that is balanced. The Dyck edit distance of a given sequence of parentheses $S$ is the smallest number of edit operations (insertions, deletions, and substitutions) needed to transform $S$ into a Dyck sequence. We consider the threshold Dyck edit distance problem, where the input is a sequence of parentheses $S$ and a positive integer $k$, and the goal is to compute the Dyck edit distance of $S$ only if the distance is at most $k$, and otherwise report that the distance is larger than $k$. Backurs and Onak [POD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02336","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/2111.02336/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.02336","created_at":"2026-07-05T04:50:12.608371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.02336v2","created_at":"2026-07-05T04:50:12.608371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02336","created_at":"2026-07-05T04:50:12.608371+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAJIS73NFATS","created_at":"2026-07-05T04:50:12.608371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAJIS73NFATSLBDC","created_at":"2026-07-05T04:50:12.608371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAJIS73N","created_at":"2026-07-05T04:50:12.608371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM","json":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM.json","graph_json":"https://pith.science/api/pith-number/LAJIS73NFATSLBDCEQ6SGMWRDM/graph.json","events_json":"https://pith.science/api/pith-number/LAJIS73NFATSLBDCEQ6SGMWRDM/events.json","paper":"https://pith.science/paper/LAJIS73N"},"agent_actions":{"view_html":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM","download_json":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM.json","view_paper":"https://pith.science/paper/LAJIS73N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.02336&json=true","fetch_graph":"https://pith.science/api/pith-number/LAJIS73NFATSLBDCEQ6SGMWRDM/graph.json","fetch_events":"https://pith.science/api/pith-number/LAJIS73NFATSLBDCEQ6SGMWRDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM/action/storage_attestation","attest_author":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM/action/author_attestation","sign_citation":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM/action/citation_signature","submit_replication":"https://pith.science/pith/LAJIS73NFATSLBDCEQ6SGMWRDM/action/replication_record"}},"created_at":"2026-07-05T04:50:12.608371+00:00","updated_at":"2026-07-05T04:50:12.608371+00:00"}