{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F35Z6XMMHV3HPCR2CMJCCC6IW7","short_pith_number":"pith:F35Z6XMM","schema_version":"1.0","canonical_sha256":"2efb9f5d8c3d76778a3a1312210bc8b7eecbfdb3b2cbca1df5b47736a5689e0c","source":{"kind":"arxiv","id":"2205.00441","version":1},"attestation_state":"computed","paper":{"title":"Dynamic data structures for parameterized string problems","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, J\\k{e}drzej Olkowski, Karol W\\k{e}grzycki, Mateusz Rychlicki, Micha{\\l} Pilipczuk","submitted_at":"2022-05-01T10:41:18Z","abstract_excerpt":"We revisit classic string problems considered in the area of parameterized complexity, and study them through the lens of dynamic data structures. That is, instead of asking for a static algorithm that solves the given instance efficiently, our goal is to design a data structure that efficiently maintains a solution, or reports a lack thereof, upon updates in the instance.\n  We first consider the Closest String problem, for which we design randomized dynamic data structures with amortized update times $d^{\\mathcal{O}(d)}$ and $|\\Sigma|^{\\mathcal{O}(d)}$, respectively, where $\\Sigma$ is the alp"},"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":"2205.00441","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-01T10:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"26556b8c23896263202054a7ce4097d59a6b2b4b91b68763fc30db522ba694b1","abstract_canon_sha256":"728b477accaf909674683d93036fcfdbc4111635a53a46af02199cfe2ded7222"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:12.810641Z","signature_b64":"gLdsGMOOEfA9PL1pjWJST4tPSgQRuN9VYEeEUtrxVXc9lNpBIKlL2uGtXOgWrDtN/iLpHdHOV7JOLqmwNUSoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2efb9f5d8c3d76778a3a1312210bc8b7eecbfdb3b2cbca1df5b47736a5689e0c","last_reissued_at":"2026-07-05T04:19:12.810255Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:12.810255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic data structures for parameterized string problems","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, J\\k{e}drzej Olkowski, Karol W\\k{e}grzycki, Mateusz Rychlicki, Micha{\\l} Pilipczuk","submitted_at":"2022-05-01T10:41:18Z","abstract_excerpt":"We revisit classic string problems considered in the area of parameterized complexity, and study them through the lens of dynamic data structures. That is, instead of asking for a static algorithm that solves the given instance efficiently, our goal is to design a data structure that efficiently maintains a solution, or reports a lack thereof, upon updates in the instance.\n  We first consider the Closest String problem, for which we design randomized dynamic data structures with amortized update times $d^{\\mathcal{O}(d)}$ and $|\\Sigma|^{\\mathcal{O}(d)}$, respectively, where $\\Sigma$ is the alp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00441","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.00441/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":"2205.00441","created_at":"2026-07-05T04:19:12.810310+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.00441v1","created_at":"2026-07-05T04:19:12.810310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00441","created_at":"2026-07-05T04:19:12.810310+00:00"},{"alias_kind":"pith_short_12","alias_value":"F35Z6XMMHV3H","created_at":"2026-07-05T04:19:12.810310+00:00"},{"alias_kind":"pith_short_16","alias_value":"F35Z6XMMHV3HPCR2","created_at":"2026-07-05T04:19:12.810310+00:00"},{"alias_kind":"pith_short_8","alias_value":"F35Z6XMM","created_at":"2026-07-05T04:19:12.810310+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/F35Z6XMMHV3HPCR2CMJCCC6IW7","json":"https://pith.science/pith/F35Z6XMMHV3HPCR2CMJCCC6IW7.json","graph_json":"https://pith.science/api/pith-number/F35Z6XMMHV3HPCR2CMJCCC6IW7/graph.json","events_json":"https://pith.science/api/pith-number/F35Z6XMMHV3HPCR2CMJCCC6IW7/events.json","paper":"https://pith.science/paper/F35Z6XMM"},"agent_actions":{"view_html":"https://pith.science/pith/F35Z6XMMHV3HPCR2CMJCCC6IW7","download_json":"https://pith.science/pith/F35Z6XMMHV3HPCR2CMJCCC6IW7.json","view_paper":"https://pith.science/paper/F35Z6XMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.00441&json=true","fetch_graph":"https://pith.science/api/pith-number/F35Z6XMMHV3HPCR2CMJCCC6IW7/graph.json","fetch_events":"https://pith.science/api/pith-number/F35Z6XMMHV3HPCR2CMJCCC6IW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F35Z6XMMHV3HPCR2CMJCCC6IW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F35Z6XMMHV3HPCR2CMJCCC6IW7/action/storage_attestation","attest_author":"https://pith.science/pith/F35Z6XMMHV3HPCR2CMJCCC6IW7/action/author_attestation","sign_citation":"https://pith.science/pith/F35Z6XMMHV3HPCR2CMJCCC6IW7/action/citation_signature","submit_replication":"https://pith.science/pith/F35Z6XMMHV3HPCR2CMJCCC6IW7/action/replication_record"}},"created_at":"2026-07-05T04:19:12.810310+00:00","updated_at":"2026-07-05T04:19:12.810310+00:00"}