{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D6NMWMUTSKJYMCQVQCZOOUDQSH","short_pith_number":"pith:D6NMWMUT","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"},"canonical_sha256":"1f9acb32939293860a1580b2e7507091c608599fcb4488474cff44d522c45fb7","source":{"kind":"arxiv","id":"1804.03197","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03197","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03197v3","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03197","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"D6NMWMUTSKJY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6NMWMUTSKJYMCQV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6NMWMUT","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D6NMWMUTSKJYMCQVQCZOOUDQSH","target":"record","payload":{"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"},"canonical_sha256":"1f9acb32939293860a1580b2e7507091c608599fcb4488474cff44d522c45fb7","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"},"source_kind":"arxiv","source_id":"1804.03197","source_version":3,"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-05-17T23:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DQ5PkGM9Ky4o3MrtImJHXPI8TR72rUKDw1rok5jHMABoqDM9GPrykIJvJOz4x9ehGWYf3x6gP9bt7E1jmZeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:37:42.295391Z"},"content_sha256":"2e39a6f017013fcfe763cf44601e3c229fbd002bd980725c5182c8af1669ffbd","schema_version":"1.0","event_id":"sha256:2e39a6f017013fcfe763cf44601e3c229fbd002bd980725c5182c8af1669ffbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D6NMWMUTSKJYMCQVQCZOOUDQSH","target":"graph","payload":{"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"},"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-05-17T23:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"du5On2mV7Ji1tWYbOhv4MDacSdpiVAoYUpiqhOxOdQiILSNoe9vs7gHQXVe+IcuvUbSRhxMRdx9crEMj0SL1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:37:42.295773Z"},"content_sha256":"d56007a11f9f99850f19d5dbcb94875cc8e69ee20fec45acb4382e615c847881","schema_version":"1.0","event_id":"sha256:d56007a11f9f99850f19d5dbcb94875cc8e69ee20fec45acb4382e615c847881"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/bundle.json","state_url":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/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-05-24T23:37:42Z","links":{"resolver":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH","bundle":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/bundle.json","state":"https://pith.science/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6NMWMUTSKJYMCQVQCZOOUDQSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D6NMWMUTSKJYMCQVQCZOOUDQSH","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":"d959fa6a628fe25dbf1de4a0a56dce29ed38b2b5b97528bf1db72e0cc7d71140","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T19:35:48Z","title_canon_sha256":"f213266b4949a21bbb4181870053ea7684f81ed1748b39f2b68eabe577f75cb9"},"schema_version":"1.0","source":{"id":"1804.03197","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03197","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03197v3","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03197","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"D6NMWMUTSKJY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6NMWMUTSKJYMCQV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6NMWMUT","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:d56007a11f9f99850f19d5dbcb94875cc8e69ee20fec45acb4382e615c847881","target":"graph","created_at":"2026-05-17T23:46:09Z","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"},"paper":{"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","authors_text":"Amir Abboud, Barna Saha, Debmalya Panigrahi, Fabrizio Grandoni, Raghavendra Addanki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T19:35:48Z","title":"Dynamic Set Cover: Improved Algorithms & Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03197","kind":"arxiv","version":3},"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:2e39a6f017013fcfe763cf44601e3c229fbd002bd980725c5182c8af1669ffbd","target":"record","created_at":"2026-05-17T23:46:09Z","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":"d959fa6a628fe25dbf1de4a0a56dce29ed38b2b5b97528bf1db72e0cc7d71140","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T19:35:48Z","title_canon_sha256":"f213266b4949a21bbb4181870053ea7684f81ed1748b39f2b68eabe577f75cb9"},"schema_version":"1.0","source":{"id":"1804.03197","kind":"arxiv","version":3}},"canonical_sha256":"1f9acb32939293860a1580b2e7507091c608599fcb4488474cff44d522c45fb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f9acb32939293860a1580b2e7507091c608599fcb4488474cff44d522c45fb7","first_computed_at":"2026-05-17T23:46:09.724372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:09.724372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CupPxtObywM0hB3CpnUzHPW6I7S0FLF7dF9poZBjT8Hh7DtsI8tAkpEV2gKWabofucd65eyQtHLJ1A9sWx8wCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:09.724737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03197","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e39a6f017013fcfe763cf44601e3c229fbd002bd980725c5182c8af1669ffbd","sha256:d56007a11f9f99850f19d5dbcb94875cc8e69ee20fec45acb4382e615c847881"],"state_sha256":"27700f61c4d5fd55f135c5e841e0274e2f1cf9cec5e9cc83d1908407b5d4dd74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3ADd59hNm3JfHxx9+HzfunW/BkEyeRSYkgBc522+Iv6DWQSgUZ2qvYU9x3SszH/TnYp2Bl3hwlXuyjr7glDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:37:42.298293Z","bundle_sha256":"633e8c8d089f3eff41066857005332e156d838f5b722a62ee62514f72c24f640"}}