{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HEKQBPXTEB5B5TGN2CNMJIFMBB","short_pith_number":"pith:HEKQBPXT","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"},"canonical_sha256":"391500bef3207a1ecccdd09ac4a0ac086217672ff9f62afc3320aecd4ec867ab","source":{"kind":"arxiv","id":"2211.14664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.14664","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"2211.14664v1","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14664","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"HEKQBPXTEB5B","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"pith_short_16","alias_value":"HEKQBPXTEB5B5TGN","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"pith_short_8","alias_value":"HEKQBPXT","created_at":"2026-07-05T05:19:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HEKQBPXTEB5B5TGN2CNMJIFMBB","target":"record","payload":{"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"},"canonical_sha256":"391500bef3207a1ecccdd09ac4a0ac086217672ff9f62afc3320aecd4ec867ab","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"},"source_kind":"arxiv","source_id":"2211.14664","source_version":1,"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-07-05T05:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LYPOMWgZVfX/pa9KCd4P250DB52NzYPnfeVxZhU0OT+E7MQu8xuYjZrW0ReaU459wfDorZCamyLa7Ezta2ZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:34:05.954585Z"},"content_sha256":"ed4f859ab86226eb70af1436250e6c57e5f4507fcaac86fab6fb6013334a0cfd","schema_version":"1.0","event_id":"sha256:ed4f859ab86226eb70af1436250e6c57e5f4507fcaac86fab6fb6013334a0cfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HEKQBPXTEB5B5TGN2CNMJIFMBB","target":"graph","payload":{"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"},"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-07-05T05:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPisRLMN9bWljB1ezYypVgwa3PUl1plCn0DJejC5lKbJQQ7VsY0JKyYcJGapKNJn0W4yvKfuFWgEjrY0PoSRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:34:05.955105Z"},"content_sha256":"9efa2bc9b626348d7bc7c9f27ad94b640652386a009b5c539041c14699b62163","schema_version":"1.0","event_id":"sha256:9efa2bc9b626348d7bc7c9f27ad94b640652386a009b5c539041c14699b62163"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/bundle.json","state_url":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/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-08-13T02:34:05Z","links":{"resolver":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB","bundle":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/bundle.json","state":"https://pith.science/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEKQBPXTEB5B5TGN2CNMJIFMBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HEKQBPXTEB5B5TGN2CNMJIFMBB","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":"486b593c1bb53cd9d0ff5ec507d1fb13c30f27605f4ddf3681a4235208e34dd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-26T21:01:29Z","title_canon_sha256":"dc12d0da5a1986a1b095fdc23dace20a31b4f07f5dccc89fb6956803d698ddac"},"schema_version":"1.0","source":{"id":"2211.14664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.14664","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"2211.14664v1","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14664","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"HEKQBPXTEB5B","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"pith_short_16","alias_value":"HEKQBPXTEB5B5TGN","created_at":"2026-07-05T05:19:42Z"},{"alias_kind":"pith_short_8","alias_value":"HEKQBPXT","created_at":"2026-07-05T05:19:42Z"}],"graph_snapshots":[{"event_id":"sha256:9efa2bc9b626348d7bc7c9f27ad94b640652386a009b5c539041c14699b62163","target":"graph","created_at":"2026-07-05T05:19:42Z","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/2211.14664/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dylan Hendrickson, Erik D. Demaine, Jayson Lynch, Lily Chung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-26T21:01:29Z","title":"Lower Bounds on Retroactive Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14664","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:ed4f859ab86226eb70af1436250e6c57e5f4507fcaac86fab6fb6013334a0cfd","target":"record","created_at":"2026-07-05T05:19:42Z","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":"486b593c1bb53cd9d0ff5ec507d1fb13c30f27605f4ddf3681a4235208e34dd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-26T21:01:29Z","title_canon_sha256":"dc12d0da5a1986a1b095fdc23dace20a31b4f07f5dccc89fb6956803d698ddac"},"schema_version":"1.0","source":{"id":"2211.14664","kind":"arxiv","version":1}},"canonical_sha256":"391500bef3207a1ecccdd09ac4a0ac086217672ff9f62afc3320aecd4ec867ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"391500bef3207a1ecccdd09ac4a0ac086217672ff9f62afc3320aecd4ec867ab","first_computed_at":"2026-07-05T05:19:42.359215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:19:42.359215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sl1lH48+e7xYTOCVMBRqc8d6+k0nODx0vVhyfWV20B9JZOEMg0QROj0Cwz5WmDDhpVh6BiGknb51WtQLzeWmDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:19:42.359691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.14664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed4f859ab86226eb70af1436250e6c57e5f4507fcaac86fab6fb6013334a0cfd","sha256:9efa2bc9b626348d7bc7c9f27ad94b640652386a009b5c539041c14699b62163"],"state_sha256":"687c01d9308109af7f598a9c0ed7a5377c107d1cde6a03c60a9f11f109c2b7c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bQsSejo4qUheSj0M5+waFZ/aKFtyBjT4k0F3leUZfEQzl65/wM3aiprXTGB6Vp78B6C/uop1+3cMHPN37T3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:34:05.958837Z","bundle_sha256":"f98e8b077059d86f927d20733ee03866914f56e9d02d86c70ceb01dbd3fd0aa5"}}