{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D6NMWMUTSKJYMCQVQCZOOUDQSH","short_pith_number":"pith:D6NMWMUT","schema_version":"1.0","canonical_sha256":"1f9acb32939293860a1580b2e7507091c608599fcb4488474cff44d522c45fb7","source":{"kind":"arxiv","id":"1804.03197","version":3},"attestation_state":"computed","paper":{"title":"Dynamic Set Cover: Improved Algorithms & Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Barna Saha, Debmalya Panigrahi, Fabrizio Grandoni, Raghavendra Addanki","submitted_at":"2018-04-09T19:35:48Z","abstract_excerpt":"We give new upper and lower bounds for the {\\em dynamic} set cover problem. First, we give a $(1+\\epsilon) f$-approximation for fully dynamic set cover in $O(f^2\\log n /\\epsilon^5)$ (amortized) update time, for any $\\epsilon > 0$, where $f$ is the maximum number of sets that an element belongs to. In the decremental setting, the update time can be improved to $O(f^2/\\epsilon^5)$, while still obtaining an $(1+\\epsilon) f$-approximation. These are the first algorithms that obtain an approximation factor linear in $f$ for dynamic set cover, thereby almost matching the best bounds known in the off"},"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.03197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T19:35:48Z","cross_cats_sorted":[],"title_canon_sha256":"f213266b4949a21bbb4181870053ea7684f81ed1748b39f2b68eabe577f75cb9","abstract_canon_sha256":"d959fa6a628fe25dbf1de4a0a56dce29ed38b2b5b97528bf1db72e0cc7d71140"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:09.724737Z","signature_b64":"CupPxtObywM0hB3CpnUzHPW6I7S0FLF7dF9poZBjT8Hh7DtsI8tAkpEV2gKWabofucd65eyQtHLJ1A9sWx8wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f9acb32939293860a1580b2e7507091c608599fcb4488474cff44d522c45fb7","last_reissued_at":"2026-05-17T23:46:09.724372Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:09.724372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Set Cover: Improved Algorithms & Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Barna Saha, Debmalya Panigrahi, Fabrizio Grandoni, Raghavendra Addanki","submitted_at":"2018-04-09T19:35:48Z","abstract_excerpt":"We give new upper and lower bounds for the {\\em dynamic} set cover problem. First, we give a $(1+\\epsilon) f$-approximation for fully dynamic set cover in $O(f^2\\log n /\\epsilon^5)$ (amortized) update time, for any $\\epsilon > 0$, where $f$ is the maximum number of sets that an element belongs to. In the decremental setting, the update time can be improved to $O(f^2/\\epsilon^5)$, while still obtaining an $(1+\\epsilon) f$-approximation. These are the first algorithms that obtain an approximation factor linear in $f$ for dynamic set cover, thereby almost matching the best bounds known in the off"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03197","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":""},"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.03197","created_at":"2026-05-17T23:46:09.724438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03197v3","created_at":"2026-05-17T23:46:09.724438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03197","created_at":"2026-05-17T23:46:09.724438+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6NMWMUTSKJY","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6NMWMUTSKJYMCQV","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6NMWMUT","created_at":"2026-05-18T12:32:19.392346+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/D6NMWMUTSKJYMCQVQCZOOUDQSH","json":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH.json","graph_json":"https://pith.science/api/pith-number/D6NMWMUTSKJYMCQVQCZOOUDQSH/graph.json","events_json":"https://pith.science/api/pith-number/D6NMWMUTSKJYMCQVQCZOOUDQSH/events.json","paper":"https://pith.science/paper/D6NMWMUT"},"agent_actions":{"view_html":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH","download_json":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH.json","view_paper":"https://pith.science/paper/D6NMWMUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03197&json=true","fetch_graph":"https://pith.science/api/pith-number/D6NMWMUTSKJYMCQVQCZOOUDQSH/graph.json","fetch_events":"https://pith.science/api/pith-number/D6NMWMUTSKJYMCQVQCZOOUDQSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/action/storage_attestation","attest_author":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/action/author_attestation","sign_citation":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/action/citation_signature","submit_replication":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/action/replication_record"}},"created_at":"2026-05-17T23:46:09.724438+00:00","updated_at":"2026-05-17T23:46:09.724438+00:00"}