{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HEKQBPXTEB5B5TGN2CNMJIFMBB","short_pith_number":"pith:HEKQBPXT","schema_version":"1.0","canonical_sha256":"391500bef3207a1ecccdd09ac4a0ac086217672ff9f62afc3320aecd4ec867ab","source":{"kind":"arxiv","id":"2211.14664","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds on Retroactive Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dylan Hendrickson, Erik D. Demaine, Jayson Lynch, Lily Chung","submitted_at":"2022-11-26T21:01:29Z","abstract_excerpt":"We prove essentially optimal fine-grained lower bounds on the gap between a data structure and a partially retroactive version of the same data structure. Precisely, assuming any one of three standard conjectures, we describe a problem that has a data structure where operations run in $O(T(n,m))$ time per operation, but any partially retroactive version of that data structure requires $T(n,m) \\cdot m^{1-o(1)}$ worst-case time per operation, where $n$ is the size of the data structure at any time and $m$ is the number of operations. Any data structure with operations running in $O(T(n,m))$ time"},"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":"2211.14664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-26T21:01:29Z","cross_cats_sorted":[],"title_canon_sha256":"dc12d0da5a1986a1b095fdc23dace20a31b4f07f5dccc89fb6956803d698ddac","abstract_canon_sha256":"486b593c1bb53cd9d0ff5ec507d1fb13c30f27605f4ddf3681a4235208e34dd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:42.359691Z","signature_b64":"Sl1lH48+e7xYTOCVMBRqc8d6+k0nODx0vVhyfWV20B9JZOEMg0QROj0Cwz5WmDDhpVh6BiGknb51WtQLzeWmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"391500bef3207a1ecccdd09ac4a0ac086217672ff9f62afc3320aecd4ec867ab","last_reissued_at":"2026-07-05T05:19:42.359215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:42.359215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on Retroactive Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dylan Hendrickson, Erik D. Demaine, Jayson Lynch, Lily Chung","submitted_at":"2022-11-26T21:01:29Z","abstract_excerpt":"We prove essentially optimal fine-grained lower bounds on the gap between a data structure and a partially retroactive version of the same data structure. Precisely, assuming any one of three standard conjectures, we describe a problem that has a data structure where operations run in $O(T(n,m))$ time per operation, but any partially retroactive version of that data structure requires $T(n,m) \\cdot m^{1-o(1)}$ worst-case time per operation, where $n$ is the size of the data structure at any time and $m$ is the number of operations. Any data structure with operations running in $O(T(n,m))$ time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14664","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/2211.14664/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":"2211.14664","created_at":"2026-07-05T05:19:42.359272+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.14664v1","created_at":"2026-07-05T05:19:42.359272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14664","created_at":"2026-07-05T05:19:42.359272+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEKQBPXTEB5B","created_at":"2026-07-05T05:19:42.359272+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEKQBPXTEB5B5TGN","created_at":"2026-07-05T05:19:42.359272+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEKQBPXT","created_at":"2026-07-05T05:19:42.359272+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/HEKQBPXTEB5B5TGN2CNMJIFMBB","json":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB.json","graph_json":"https://pith.science/api/pith-number/HEKQBPXTEB5B5TGN2CNMJIFMBB/graph.json","events_json":"https://pith.science/api/pith-number/HEKQBPXTEB5B5TGN2CNMJIFMBB/events.json","paper":"https://pith.science/paper/HEKQBPXT"},"agent_actions":{"view_html":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB","download_json":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB.json","view_paper":"https://pith.science/paper/HEKQBPXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.14664&json=true","fetch_graph":"https://pith.science/api/pith-number/HEKQBPXTEB5B5TGN2CNMJIFMBB/graph.json","fetch_events":"https://pith.science/api/pith-number/HEKQBPXTEB5B5TGN2CNMJIFMBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/action/storage_attestation","attest_author":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/action/author_attestation","sign_citation":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/action/citation_signature","submit_replication":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/action/replication_record"}},"created_at":"2026-07-05T05:19:42.359272+00:00","updated_at":"2026-07-05T05:19:42.359272+00:00"}