{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:F35Z6XMMHV3HPCR2CMJCCC6IW7","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":"728b477accaf909674683d93036fcfdbc4111635a53a46af02199cfe2ded7222","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-01T10:41:18Z","title_canon_sha256":"26556b8c23896263202054a7ce4097d59a6b2b4b91b68763fc30db522ba694b1"},"schema_version":"1.0","source":{"id":"2205.00441","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00441","created_at":"2026-07-05T04:19:12Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00441v1","created_at":"2026-07-05T04:19:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00441","created_at":"2026-07-05T04:19:12Z"},{"alias_kind":"pith_short_12","alias_value":"F35Z6XMMHV3H","created_at":"2026-07-05T04:19:12Z"},{"alias_kind":"pith_short_16","alias_value":"F35Z6XMMHV3HPCR2","created_at":"2026-07-05T04:19:12Z"},{"alias_kind":"pith_short_8","alias_value":"F35Z6XMM","created_at":"2026-07-05T04:19:12Z"}],"graph_snapshots":[{"event_id":"sha256:8061fe69694dd6004c96479ffc16eaaa1e397264f984d1d771c81acb299c1233","target":"graph","created_at":"2026-07-05T04:19:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.00441/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anna Zych-Pawlewicz, J\\k{e}drzej Olkowski, Karol W\\k{e}grzycki, Mateusz Rychlicki, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-01T10:41:18Z","title":"Dynamic data structures for parameterized string problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00441","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:1d84d5dcffb1b9a8b437a1533486b8de341d8983e8a79802866f4e32ab475880","target":"record","created_at":"2026-07-05T04:19:12Z","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":"728b477accaf909674683d93036fcfdbc4111635a53a46af02199cfe2ded7222","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-01T10:41:18Z","title_canon_sha256":"26556b8c23896263202054a7ce4097d59a6b2b4b91b68763fc30db522ba694b1"},"schema_version":"1.0","source":{"id":"2205.00441","kind":"arxiv","version":1}},"canonical_sha256":"2efb9f5d8c3d76778a3a1312210bc8b7eecbfdb3b2cbca1df5b47736a5689e0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2efb9f5d8c3d76778a3a1312210bc8b7eecbfdb3b2cbca1df5b47736a5689e0c","first_computed_at":"2026-07-05T04:19:12.810255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:19:12.810255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gLdsGMOOEfA9PL1pjWJST4tPSgQRuN9VYEeEUtrxVXc9lNpBIKlL2uGtXOgWrDtN/iLpHdHOV7JOLqmwNUSoAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:19:12.810641Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.00441","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d84d5dcffb1b9a8b437a1533486b8de341d8983e8a79802866f4e32ab475880","sha256:8061fe69694dd6004c96479ffc16eaaa1e397264f984d1d771c81acb299c1233"],"state_sha256":"cba22ad10cf64e3f7ca2355ec4e43b8f6d4b31ce581a8a1cbb4fc7a1f677b082"}