{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZLTNM5SH5BUVFP34AW6VHQZY4O","short_pith_number":"pith:ZLTNM5SH","schema_version":"1.0","canonical_sha256":"cae6d67647e86952bf7c05bd53c338e3a21d98c92f68118d477d9cf02410e918","source":{"kind":"arxiv","id":"2004.14891","version":3},"attestation_state":"computed","paper":{"title":"Fully-Dynamic Coresets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Monika Henzinger, Sagar Kale","submitted_at":"2020-04-30T15:45:21Z","abstract_excerpt":"With input sizes becoming massive, coresets -- small yet representative summary of the input -- are relevant more than ever. A weighted set $C_w$ that is a subset of the input is an $\\varepsilon$-coreset if the cost of any feasible solution $S$ with respect to $C_w$ is within $[1 {\\pm} \\varepsilon]$ of the cost of $S$ with respect to the original input. We give a very general technique to compute coresets in the fully-dynamic setting where input points can be added or deleted. Given a static $\\varepsilon$-coreset algorithm that runs in time $t(n, \\varepsilon, \\lambda)$ and computes a coreset o"},"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":"2004.14891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-30T15:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"b01744bfbb436288f4b66d0325938e3322bfdca3b0d0466de7c83f3dd451a458","abstract_canon_sha256":"988b3aebfcba025c9f7562153898f25633bfe64c51ee560a8163ab3343d7b95b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:18.234142Z","signature_b64":"dsYzNxRCSAspUlYojdex6Rua+6vb+MxeKhNR587E7DzcRZWnv+zMQmaN3eKdTaj8FABI3MVOz24gdPOnCnItCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cae6d67647e86952bf7c05bd53c338e3a21d98c92f68118d477d9cf02410e918","last_reissued_at":"2026-07-05T01:38:18.233663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:18.233663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully-Dynamic Coresets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Monika Henzinger, Sagar Kale","submitted_at":"2020-04-30T15:45:21Z","abstract_excerpt":"With input sizes becoming massive, coresets -- small yet representative summary of the input -- are relevant more than ever. A weighted set $C_w$ that is a subset of the input is an $\\varepsilon$-coreset if the cost of any feasible solution $S$ with respect to $C_w$ is within $[1 {\\pm} \\varepsilon]$ of the cost of $S$ with respect to the original input. We give a very general technique to compute coresets in the fully-dynamic setting where input points can be added or deleted. Given a static $\\varepsilon$-coreset algorithm that runs in time $t(n, \\varepsilon, \\lambda)$ and computes a coreset o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.14891","kind":"arxiv","version":3},"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/2004.14891/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":"2004.14891","created_at":"2026-07-05T01:38:18.233747+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.14891v3","created_at":"2026-07-05T01:38:18.233747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.14891","created_at":"2026-07-05T01:38:18.233747+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLTNM5SH5BUV","created_at":"2026-07-05T01:38:18.233747+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLTNM5SH5BUVFP34","created_at":"2026-07-05T01:38:18.233747+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLTNM5SH","created_at":"2026-07-05T01:38:18.233747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.07745","citing_title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O","json":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O.json","graph_json":"https://pith.science/api/pith-number/ZLTNM5SH5BUVFP34AW6VHQZY4O/graph.json","events_json":"https://pith.science/api/pith-number/ZLTNM5SH5BUVFP34AW6VHQZY4O/events.json","paper":"https://pith.science/paper/ZLTNM5SH"},"agent_actions":{"view_html":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O","download_json":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O.json","view_paper":"https://pith.science/paper/ZLTNM5SH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.14891&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLTNM5SH5BUVFP34AW6VHQZY4O/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLTNM5SH5BUVFP34AW6VHQZY4O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O/action/storage_attestation","attest_author":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O/action/author_attestation","sign_citation":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O/action/citation_signature","submit_replication":"https://pith.science/pith/ZLTNM5SH5BUVFP34AW6VHQZY4O/action/replication_record"}},"created_at":"2026-07-05T01:38:18.233747+00:00","updated_at":"2026-07-05T01:38:18.233747+00:00"}