{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VXHZINOLLP3MX4OJHEHNPJTQDH","short_pith_number":"pith:VXHZINOL","schema_version":"1.0","canonical_sha256":"adcf9435cb5bf6cbf1c9390ed7a67019f698ee413b0dad198041767d077dcd1b","source":{"kind":"arxiv","id":"2111.03980","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amos Beimel, Haim Kaplan, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer, Yishay Mansour","submitted_at":"2021-11-07T01:15:07Z","abstract_excerpt":"A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm. We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis.\n  We give a general reduction transforming a dynamic algorithm against an oblivious adversary to a dynamic algorithm robust against an adaptive adversary. This r"},"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":"2111.03980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-07T01:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"6377ced3c27af1c1d17432d322fd4ed62b998e7cf69edcb97367aae8baf07d32","abstract_canon_sha256":"6fe1dc7e9464093b164b209d7580d42182d6865d4b8124e6d28de8acc1370949"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:54.363531Z","signature_b64":"S6Jb2DnqdC+4WHCD6RDudpZkn3jex8+oLczEdj3d5k4ztbGIYhsep5KAawy8H/DsnX8hYC8zt7BD8nBXyJgfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adcf9435cb5bf6cbf1c9390ed7a67019f698ee413b0dad198041767d077dcd1b","last_reissued_at":"2026-07-05T03:29:54.362773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:54.362773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amos Beimel, Haim Kaplan, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer, Yishay Mansour","submitted_at":"2021-11-07T01:15:07Z","abstract_excerpt":"A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm. We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis.\n  We give a general reduction transforming a dynamic algorithm against an oblivious adversary to a dynamic algorithm robust against an adaptive adversary. This r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.03980","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/2111.03980/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":"2111.03980","created_at":"2026-07-05T03:29:54.362865+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.03980v1","created_at":"2026-07-05T03:29:54.362865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.03980","created_at":"2026-07-05T03:29:54.362865+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXHZINOLLP3M","created_at":"2026-07-05T03:29:54.362865+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXHZINOLLP3MX4OJ","created_at":"2026-07-05T03:29:54.362865+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXHZINOL","created_at":"2026-07-05T03:29:54.362865+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05723","citing_title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH","json":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH.json","graph_json":"https://pith.science/api/pith-number/VXHZINOLLP3MX4OJHEHNPJTQDH/graph.json","events_json":"https://pith.science/api/pith-number/VXHZINOLLP3MX4OJHEHNPJTQDH/events.json","paper":"https://pith.science/paper/VXHZINOL"},"agent_actions":{"view_html":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH","download_json":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH.json","view_paper":"https://pith.science/paper/VXHZINOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.03980&json=true","fetch_graph":"https://pith.science/api/pith-number/VXHZINOLLP3MX4OJHEHNPJTQDH/graph.json","fetch_events":"https://pith.science/api/pith-number/VXHZINOLLP3MX4OJHEHNPJTQDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH/action/storage_attestation","attest_author":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH/action/author_attestation","sign_citation":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH/action/citation_signature","submit_replication":"https://pith.science/pith/VXHZINOLLP3MX4OJHEHNPJTQDH/action/replication_record"}},"created_at":"2026-07-05T03:29:54.362865+00:00","updated_at":"2026-07-05T03:29:54.362865+00:00"}