{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N7XAP42G5XO7K5L2KJ6IJ7OBG2","short_pith_number":"pith:N7XAP42G","canonical_record":{"source":{"id":"1711.07112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-20T01:05:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d0698c3d63328bb5495d92e68bd1ba22c62f9de5fdbcd6e90cc25e70a3c38ff7","abstract_canon_sha256":"fc0ef83d18ec94f3aff466f178eba5887346069ea31f2ea7717cf46d0d75367e"},"schema_version":"1.0"},"canonical_sha256":"6fee07f346edddf5757a527c84fdc1369bafcc115769ca022316f3e8acec91b6","source":{"kind":"arxiv","id":"1711.07112","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07112","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07112v2","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07112","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"pith_short_12","alias_value":"N7XAP42G5XO7","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N7XAP42G5XO7K5L2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N7XAP42G","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N7XAP42G5XO7K5L2KJ6IJ7OBG2","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-20T01:05:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d0698c3d63328bb5495d92e68bd1ba22c62f9de5fdbcd6e90cc25e70a3c38ff7","abstract_canon_sha256":"fc0ef83d18ec94f3aff466f178eba5887346069ea31f2ea7717cf46d0d75367e"},"schema_version":"1.0"},"canonical_sha256":"6fee07f346edddf5757a527c84fdc1369bafcc115769ca022316f3e8acec91b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:58.926626Z","signature_b64":"w0gEGovnansgP1ttFen6jJhLW6ihrtd5n4mIxuFPE6gKvWlxjj7V7k4yQRYOr67rZucfVA4dhqRJKFZRBDfvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fee07f346edddf5757a527c84fdc1369bafcc115769ca022316f3e8acec91b6","last_reissued_at":"2026-05-18T00:29:58.926086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:58.926086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07112","source_version":2,"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:29:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tP3O/Ez9xiUTLuKiW/iJUSa6yIislx7czG6X6mmgPksRju7cackhhc7qEzgAQD7x10ERl8XYz5czllk9TimBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:20:20.110471Z"},"content_sha256":"2e0879c0d9aa97e26e41e53eb6a4a037f355f5296f03b97762cd6d7f55acb565","schema_version":"1.0","event_id":"sha256:2e0879c0d9aa97e26e41e53eb6a4a037f355f5296f03b97762cd6d7f55acb565"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N7XAP42G5XO7K5L2KJ6IJ7OBG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deletion-Robust Submodular Maximization at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Ehsan Kazemi, Morteza Zadimoghaddam","submitted_at":"2017-11-20T01:05:17Z","abstract_excerpt":"Can we efficiently extract useful information from a large user-generated dataset while protecting the privacy of the users and/or ensuring fairness in representation. We cast this problem as an instance of a deletion-robust submodular maximization where part of the data may be deleted due to privacy concerns or fairness criteria. We propose the first memory-efficient centralized, streaming, and distributed methods with constant-factor approximation guarantees against any number of adversarial deletions. We extensively evaluate the performance of our algorithms against prior state-of-the-art o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07112","kind":"arxiv","version":2},"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:29:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Os6crGq3rnP+fX9p9d0SBcqrDLLoywrAaBT6US6o5OeetkSM20CJGFSrk2vZiW92c0AKJU8r2hDLjy+kfEYjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:20:20.111044Z"},"content_sha256":"d0cd1579ae59df8dba6b94f99474cee6327a0797ec668db27378e3a03c30703f","schema_version":"1.0","event_id":"sha256:d0cd1579ae59df8dba6b94f99474cee6327a0797ec668db27378e3a03c30703f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7XAP42G5XO7K5L2KJ6IJ7OBG2/bundle.json","state_url":"https://pith.science/pith/N7XAP42G5XO7K5L2KJ6IJ7OBG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7XAP42G5XO7K5L2KJ6IJ7OBG2/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-26T19:20:20Z","links":{"resolver":"https://pith.science/pith/N7XAP42G5XO7K5L2KJ6IJ7OBG2","bundle":"https://pith.science/pith/N7XAP42G5XO7K5L2KJ6IJ7OBG2/bundle.json","state":"https://pith.science/pith/N7XAP42G5XO7K5L2KJ6IJ7OBG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7XAP42G5XO7K5L2KJ6IJ7OBG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N7XAP42G5XO7K5L2KJ6IJ7OBG2","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":"fc0ef83d18ec94f3aff466f178eba5887346069ea31f2ea7717cf46d0d75367e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-20T01:05:17Z","title_canon_sha256":"d0698c3d63328bb5495d92e68bd1ba22c62f9de5fdbcd6e90cc25e70a3c38ff7"},"schema_version":"1.0","source":{"id":"1711.07112","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07112","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07112v2","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07112","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"pith_short_12","alias_value":"N7XAP42G5XO7","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N7XAP42G5XO7K5L2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N7XAP42G","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:d0cd1579ae59df8dba6b94f99474cee6327a0797ec668db27378e3a03c30703f","target":"graph","created_at":"2026-05-18T00:29:58Z","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":"Can we efficiently extract useful information from a large user-generated dataset while protecting the privacy of the users and/or ensuring fairness in representation. We cast this problem as an instance of a deletion-robust submodular maximization where part of the data may be deleted due to privacy concerns or fairness criteria. We propose the first memory-efficient centralized, streaming, and distributed methods with constant-factor approximation guarantees against any number of adversarial deletions. We extensively evaluate the performance of our algorithms against prior state-of-the-art o","authors_text":"Amin Karbasi, Ehsan Kazemi, Morteza Zadimoghaddam","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-20T01:05:17Z","title":"Deletion-Robust Submodular Maximization at Scale"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07112","kind":"arxiv","version":2},"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:2e0879c0d9aa97e26e41e53eb6a4a037f355f5296f03b97762cd6d7f55acb565","target":"record","created_at":"2026-05-18T00:29:58Z","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":"fc0ef83d18ec94f3aff466f178eba5887346069ea31f2ea7717cf46d0d75367e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-20T01:05:17Z","title_canon_sha256":"d0698c3d63328bb5495d92e68bd1ba22c62f9de5fdbcd6e90cc25e70a3c38ff7"},"schema_version":"1.0","source":{"id":"1711.07112","kind":"arxiv","version":2}},"canonical_sha256":"6fee07f346edddf5757a527c84fdc1369bafcc115769ca022316f3e8acec91b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fee07f346edddf5757a527c84fdc1369bafcc115769ca022316f3e8acec91b6","first_computed_at":"2026-05-18T00:29:58.926086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:58.926086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w0gEGovnansgP1ttFen6jJhLW6ihrtd5n4mIxuFPE6gKvWlxjj7V7k4yQRYOr67rZucfVA4dhqRJKFZRBDfvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:58.926626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07112","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e0879c0d9aa97e26e41e53eb6a4a037f355f5296f03b97762cd6d7f55acb565","sha256:d0cd1579ae59df8dba6b94f99474cee6327a0797ec668db27378e3a03c30703f"],"state_sha256":"3951310b3d24d7eaac3f92a204049ddc5445bd872c0c0ab4548e43b6e6e082be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zr7KymWqkpR0RPuikoiPWAc2fmgMDkutIXCSja9I+UXv3vMUVnS0vaIUjTPwsF2iodPYtZFCeyyWXtELj+FBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:20:20.114000Z","bundle_sha256":"c7834cc21166aa983fc6d1e26515abeea0d10769fe41e063b638b660d8d90379"}}