{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A5SSVIDM4YP2ZX2UJJVTVCUXZW","short_pith_number":"pith:A5SSVIDM","schema_version":"1.0","canonical_sha256":"07652aa06ce61facdf544a6b3a8a97cdae2b23154982bc812d932e2b61064659","source":{"kind":"arxiv","id":"1804.06932","version":2},"attestation_state":"computed","paper":{"title":"Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik D. Demaine, Lijie Chen, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu, Yuzhou Gu","submitted_at":"2018-04-18T22:09:57Z","abstract_excerpt":"Since the introduction of retroactive data structures at SODA 2004, a major unsolved problem has been to bound the gap between the best partially retroactive data structure (where changes can be made to the past, but only the present can be queried) and the best fully retroactive data structure (where the past can also be queried) for any problem. It was proved in 2004 that any partially retroactive data structure with operation time $T(n,m)$ can be transformed into a fully retroactive data structure with operation time $O(\\sqrt{m} \\cdot T(n,m))$, where $n$ is the size of the data structure an"},"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":"1804.06932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-18T22:09:57Z","cross_cats_sorted":[],"title_canon_sha256":"d8fdfa4ecda81487155562d82691b75b3bd05c9cb96cc25cb0f19d18809efb56","abstract_canon_sha256":"222416670003bacf1618a848d908c27be87e7514c81ec1eda33da2e4d8fa4394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:32.641497Z","signature_b64":"8nqziB2874pbrpXkKCUUe6Qo+Q7Bl/4Saq2Hdptdb3h+vBM1ILlL3qqDHHn0EYLAtPm0ijZr6D8rFL84XLH8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07652aa06ce61facdf544a6b3a8a97cdae2b23154982bc812d932e2b61064659","last_reissued_at":"2026-05-18T00:17:32.640974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:32.640974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik D. Demaine, Lijie Chen, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu, Yuzhou Gu","submitted_at":"2018-04-18T22:09:57Z","abstract_excerpt":"Since the introduction of retroactive data structures at SODA 2004, a major unsolved problem has been to bound the gap between the best partially retroactive data structure (where changes can be made to the past, but only the present can be queried) and the best fully retroactive data structure (where the past can also be queried) for any problem. It was proved in 2004 that any partially retroactive data structure with operation time $T(n,m)$ can be transformed into a fully retroactive data structure with operation time $O(\\sqrt{m} \\cdot T(n,m))$, where $n$ is the size of the data structure an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06932","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":""},"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":"1804.06932","created_at":"2026-05-18T00:17:32.641053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06932v2","created_at":"2026-05-18T00:17:32.641053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06932","created_at":"2026-05-18T00:17:32.641053+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5SSVIDM4YP2","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5SSVIDM4YP2ZX2U","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5SSVIDM","created_at":"2026-05-18T12:32:13.499390+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/A5SSVIDM4YP2ZX2UJJVTVCUXZW","json":"https://pith.science/pith/A5SSVIDM4YP2ZX2UJJVTVCUXZW.json","graph_json":"https://pith.science/api/pith-number/A5SSVIDM4YP2ZX2UJJVTVCUXZW/graph.json","events_json":"https://pith.science/api/pith-number/A5SSVIDM4YP2ZX2UJJVTVCUXZW/events.json","paper":"https://pith.science/paper/A5SSVIDM"},"agent_actions":{"view_html":"https://pith.science/pith/A5SSVIDM4YP2ZX2UJJVTVCUXZW","download_json":"https://pith.science/pith/A5SSVIDM4YP2ZX2UJJVTVCUXZW.json","view_paper":"https://pith.science/paper/A5SSVIDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06932&json=true","fetch_graph":"https://pith.science/api/pith-number/A5SSVIDM4YP2ZX2UJJVTVCUXZW/graph.json","fetch_events":"https://pith.science/api/pith-number/A5SSVIDM4YP2ZX2UJJVTVCUXZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5SSVIDM4YP2ZX2UJJVTVCUXZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5SSVIDM4YP2ZX2UJJVTVCUXZW/action/storage_attestation","attest_author":"https://pith.science/pith/A5SSVIDM4YP2ZX2UJJVTVCUXZW/action/author_attestation","sign_citation":"https://pith.science/pith/A5SSVIDM4YP2ZX2UJJVTVCUXZW/action/citation_signature","submit_replication":"https://pith.science/pith/A5SSVIDM4YP2ZX2UJJVTVCUXZW/action/replication_record"}},"created_at":"2026-05-18T00:17:32.641053+00:00","updated_at":"2026-05-18T00:17:32.641053+00:00"}