{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5PGQ6DDZE64OHNJMM4LYRVFM3Q","short_pith_number":"pith:5PGQ6DDZ","canonical_record":{"source":{"id":"1611.05646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-17T12:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"19afc5d9ffbcc1d3762264e7de2ed043d76adbea8c4b3e455db13bc10c1cdc10","abstract_canon_sha256":"14e9edb7e8633a787a991ec2e44990a633966987a5a5260f61d5ad1dde1bd38d"},"schema_version":"1.0"},"canonical_sha256":"ebcd0f0c7927b8e3b52c671788d4acdc23f9d4ed10f70af492a01cd884bb978f","source":{"kind":"arxiv","id":"1611.05646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05646","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05646v1","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05646","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"5PGQ6DDZE64O","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5PGQ6DDZE64OHNJM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5PGQ6DDZ","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5PGQ6DDZE64OHNJMM4LYRVFM3Q","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-17T12:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"19afc5d9ffbcc1d3762264e7de2ed043d76adbea8c4b3e455db13bc10c1cdc10","abstract_canon_sha256":"14e9edb7e8633a787a991ec2e44990a633966987a5a5260f61d5ad1dde1bd38d"},"schema_version":"1.0"},"canonical_sha256":"ebcd0f0c7927b8e3b52c671788d4acdc23f9d4ed10f70af492a01cd884bb978f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:02.991799Z","signature_b64":"qB1vp7HJZREt5HiUO7OIa9ZttjebI6Sbs/ytSDrCc+HD89djE8zzqIyVqS8HhzHL/ILAWmQgii0/NH3Pbbk2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebcd0f0c7927b8e3b52c671788d4acdc23f9d4ed10f70af492a01cd884bb978f","last_reissued_at":"2026-05-18T00:58:02.991245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:02.991245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05646","source_version":1,"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-18T00:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NaaVq97R9XImQHLWeCILc1jT26a1qorOLJfZ2M3QO1F+cxPpVgzdc7vcdUs+yJwdV3TDEpt2VywaUyMG/FrdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:49:11.357826Z"},"content_sha256":"eeec366c5cee0dd8b440a362b42fa12fcf2b5ddae221ea40a459cc5d33754eaa","schema_version":"1.0","event_id":"sha256:eeec366c5cee0dd8b440a362b42fa12fcf2b5ddae221ea40a459cc5d33754eaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5PGQ6DDZE64OHNJMM4LYRVFM3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online and Dynamic Algorithms for Set Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, Debmalya Panigrahi, Ravishankar Krishnaswamy","submitted_at":"2016-11-17T12:01:43Z","abstract_excerpt":"In this paper, we study the set cover problem in the fully dynamic model. In this model, the set of active elements, i.e., those that must be covered at any given time, can change due to element arrivals and departures. The goal is to maintain an algorithmic solution that is competitive with respect to the current optimal solution. This model is popular in both the dynamic algorithms and online algorithms communities. The difference is in the restriction placed on the algorithm: in dynamic algorithms, the running time of the algorithm making updates (called update time) is bounded, while in on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05646","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":""},"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-18T00:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5CVmYZU4k5jEVqC6pu2JDid/F0jDEM0/gIV3s3Abm4I1oRIWHN+3MNomc5FQjZhszIk72o+du3Z8gGdVRv2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:49:11.358533Z"},"content_sha256":"05c9b0f7fd891be00c0c2553483434dee6a09eac3f994b7faa462b575b9c208b","schema_version":"1.0","event_id":"sha256:05c9b0f7fd891be00c0c2553483434dee6a09eac3f994b7faa462b575b9c208b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PGQ6DDZE64OHNJMM4LYRVFM3Q/bundle.json","state_url":"https://pith.science/pith/5PGQ6DDZE64OHNJMM4LYRVFM3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PGQ6DDZE64OHNJMM4LYRVFM3Q/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-06-06T07:49:11Z","links":{"resolver":"https://pith.science/pith/5PGQ6DDZE64OHNJMM4LYRVFM3Q","bundle":"https://pith.science/pith/5PGQ6DDZE64OHNJMM4LYRVFM3Q/bundle.json","state":"https://pith.science/pith/5PGQ6DDZE64OHNJMM4LYRVFM3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PGQ6DDZE64OHNJMM4LYRVFM3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5PGQ6DDZE64OHNJMM4LYRVFM3Q","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":"14e9edb7e8633a787a991ec2e44990a633966987a5a5260f61d5ad1dde1bd38d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-17T12:01:43Z","title_canon_sha256":"19afc5d9ffbcc1d3762264e7de2ed043d76adbea8c4b3e455db13bc10c1cdc10"},"schema_version":"1.0","source":{"id":"1611.05646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05646","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05646v1","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05646","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"5PGQ6DDZE64O","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5PGQ6DDZE64OHNJM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5PGQ6DDZ","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:05c9b0f7fd891be00c0c2553483434dee6a09eac3f994b7faa462b575b9c208b","target":"graph","created_at":"2026-05-18T00:58:02Z","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":"In this paper, we study the set cover problem in the fully dynamic model. In this model, the set of active elements, i.e., those that must be covered at any given time, can change due to element arrivals and departures. The goal is to maintain an algorithmic solution that is competitive with respect to the current optimal solution. This model is popular in both the dynamic algorithms and online algorithms communities. The difference is in the restriction placed on the algorithm: in dynamic algorithms, the running time of the algorithm making updates (called update time) is bounded, while in on","authors_text":"Amit Kumar, Anupam Gupta, Debmalya Panigrahi, Ravishankar Krishnaswamy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-17T12:01:43Z","title":"Online and Dynamic Algorithms for Set Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05646","kind":"arxiv","version":1},"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:eeec366c5cee0dd8b440a362b42fa12fcf2b5ddae221ea40a459cc5d33754eaa","target":"record","created_at":"2026-05-18T00:58:02Z","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":"14e9edb7e8633a787a991ec2e44990a633966987a5a5260f61d5ad1dde1bd38d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-17T12:01:43Z","title_canon_sha256":"19afc5d9ffbcc1d3762264e7de2ed043d76adbea8c4b3e455db13bc10c1cdc10"},"schema_version":"1.0","source":{"id":"1611.05646","kind":"arxiv","version":1}},"canonical_sha256":"ebcd0f0c7927b8e3b52c671788d4acdc23f9d4ed10f70af492a01cd884bb978f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebcd0f0c7927b8e3b52c671788d4acdc23f9d4ed10f70af492a01cd884bb978f","first_computed_at":"2026-05-18T00:58:02.991245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:02.991245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qB1vp7HJZREt5HiUO7OIa9ZttjebI6Sbs/ytSDrCc+HD89djE8zzqIyVqS8HhzHL/ILAWmQgii0/NH3Pbbk2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:02.991799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeec366c5cee0dd8b440a362b42fa12fcf2b5ddae221ea40a459cc5d33754eaa","sha256:05c9b0f7fd891be00c0c2553483434dee6a09eac3f994b7faa462b575b9c208b"],"state_sha256":"e28210f66664ffa586c2b5522fed5c6d097b22c6253e78a715cc5654cf324def"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZDL0jcthvNI2jz+fGnbrK/irKXZjqgKWRGshq/AN/Op0ti4owANkye39rv2k4oJi1UUn/FsFzehLeJxmrpR/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T07:49:11.362251Z","bundle_sha256":"de45b9747b75c53bf0a9eb0a487a50e914191902577af63323605aec4ec5a629"}}