{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:U24IQWIYQIPZ6SVL5UZPFSMK45","short_pith_number":"pith:U24IQWIY","canonical_record":{"source":{"id":"1905.02367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T06:16:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"af3041616d6aa2f6280fafb052927254e411c209740d2c884ff65a2710b5af13","abstract_canon_sha256":"005f74aacdbefde1853b26f82dea0ee9ee06b5eaf9cb662f88d97b25e02a4c3b"},"schema_version":"1.0"},"canonical_sha256":"a6b8885918821f9f4aabed32f2c98ae764c1ce6a3ca9ae888ecafeb258ceb800","source":{"kind":"arxiv","id":"1905.02367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02367","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02367v1","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02367","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"U24IQWIYQIPZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U24IQWIYQIPZ6SVL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U24IQWIY","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:U24IQWIYQIPZ6SVL5UZPFSMK45","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T06:16:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"af3041616d6aa2f6280fafb052927254e411c209740d2c884ff65a2710b5af13","abstract_canon_sha256":"005f74aacdbefde1853b26f82dea0ee9ee06b5eaf9cb662f88d97b25e02a4c3b"},"schema_version":"1.0"},"canonical_sha256":"a6b8885918821f9f4aabed32f2c98ae764c1ce6a3ca9ae888ecafeb258ceb800","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:51.674855Z","signature_b64":"hgB07wbDayKHZ6PLxHPa8id6bUEM5CdcM/5GZufM6pUFqipMHsCpKB9Si+l2+yg9L9UWnkAniux5s7kO2WueCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6b8885918821f9f4aabed32f2c98ae764c1ce6a3ca9ae888ecafeb258ceb800","last_reissued_at":"2026-05-17T23:46:51.674128Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:51.674128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02367","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-17T23:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFNl8SGeeTEilNoF0cCYkeAKzj8V4ja7Q4RpEHwvaMGffG1FNnqBSKUStZxCRqL1uHv2H1P23Nxb1XhCHpKgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:32:48.488986Z"},"content_sha256":"fa6ce1b66d1785adc4e80eb7f698250a6c72881980ecfd9949665870a8df874e","schema_version":"1.0","event_id":"sha256:fa6ce1b66d1785adc4e80eb7f698250a6c72881980ecfd9949665870a8df874e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:U24IQWIYQIPZ6SVL5UZPFSMK45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarially Robust Submodular Maximization under Knapsack Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Dmitrii Avdiukhin, Grigory Yaroslavtsev, Samson Zhou, Slobodan Mitrovi\\'c","submitted_at":"2019-05-07T06:16:53Z","abstract_excerpt":"We propose the first adversarially robust algorithm for monotone submodular maximization under single and multiple knapsack constraints with scalable implementations in distributed and streaming settings. For a single knapsack constraint, our algorithm outputs a robust summary of almost optimal (up to polylogarithmic factors) size, from which a constant-factor approximation to the optimal solution can be constructed. For multiple knapsack constraints, our approximation is within a constant-factor of the best known non-robust solution.\n  We evaluate the performance of our algorithms by comparis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02367","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-17T23:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysWXT050yT1dMFuv+WIZ/12d5U92xOZhFmFenkrZDdwLNkQ5knEwr/xrQNuRELpPA/sYS5A5i5kJXboRxXKIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:32:48.489431Z"},"content_sha256":"8903b4563c95f8829b7bbd9722c521e1f465f9f7f52648fbd3220297e9a80499","schema_version":"1.0","event_id":"sha256:8903b4563c95f8829b7bbd9722c521e1f465f9f7f52648fbd3220297e9a80499"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U24IQWIYQIPZ6SVL5UZPFSMK45/bundle.json","state_url":"https://pith.science/pith/U24IQWIYQIPZ6SVL5UZPFSMK45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U24IQWIYQIPZ6SVL5UZPFSMK45/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-26T22:32:48Z","links":{"resolver":"https://pith.science/pith/U24IQWIYQIPZ6SVL5UZPFSMK45","bundle":"https://pith.science/pith/U24IQWIYQIPZ6SVL5UZPFSMK45/bundle.json","state":"https://pith.science/pith/U24IQWIYQIPZ6SVL5UZPFSMK45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U24IQWIYQIPZ6SVL5UZPFSMK45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U24IQWIYQIPZ6SVL5UZPFSMK45","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":"005f74aacdbefde1853b26f82dea0ee9ee06b5eaf9cb662f88d97b25e02a4c3b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T06:16:53Z","title_canon_sha256":"af3041616d6aa2f6280fafb052927254e411c209740d2c884ff65a2710b5af13"},"schema_version":"1.0","source":{"id":"1905.02367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02367","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02367v1","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02367","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"U24IQWIYQIPZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U24IQWIYQIPZ6SVL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U24IQWIY","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:8903b4563c95f8829b7bbd9722c521e1f465f9f7f52648fbd3220297e9a80499","target":"graph","created_at":"2026-05-17T23:46:51Z","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 propose the first adversarially robust algorithm for monotone submodular maximization under single and multiple knapsack constraints with scalable implementations in distributed and streaming settings. For a single knapsack constraint, our algorithm outputs a robust summary of almost optimal (up to polylogarithmic factors) size, from which a constant-factor approximation to the optimal solution can be constructed. For multiple knapsack constraints, our approximation is within a constant-factor of the best known non-robust solution.\n  We evaluate the performance of our algorithms by comparis","authors_text":"Dmitrii Avdiukhin, Grigory Yaroslavtsev, Samson Zhou, Slobodan Mitrovi\\'c","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T06:16:53Z","title":"Adversarially Robust Submodular Maximization under Knapsack Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02367","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:fa6ce1b66d1785adc4e80eb7f698250a6c72881980ecfd9949665870a8df874e","target":"record","created_at":"2026-05-17T23:46:51Z","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":"005f74aacdbefde1853b26f82dea0ee9ee06b5eaf9cb662f88d97b25e02a4c3b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T06:16:53Z","title_canon_sha256":"af3041616d6aa2f6280fafb052927254e411c209740d2c884ff65a2710b5af13"},"schema_version":"1.0","source":{"id":"1905.02367","kind":"arxiv","version":1}},"canonical_sha256":"a6b8885918821f9f4aabed32f2c98ae764c1ce6a3ca9ae888ecafeb258ceb800","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6b8885918821f9f4aabed32f2c98ae764c1ce6a3ca9ae888ecafeb258ceb800","first_computed_at":"2026-05-17T23:46:51.674128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:51.674128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hgB07wbDayKHZ6PLxHPa8id6bUEM5CdcM/5GZufM6pUFqipMHsCpKB9Si+l2+yg9L9UWnkAniux5s7kO2WueCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:51.674855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa6ce1b66d1785adc4e80eb7f698250a6c72881980ecfd9949665870a8df874e","sha256:8903b4563c95f8829b7bbd9722c521e1f465f9f7f52648fbd3220297e9a80499"],"state_sha256":"2910f1bca1faebcd16455d6e341b3884d978c6ccb4ccafe5776d3c177321b972"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDRswm6vdDukuuv2EVAZxF3qAH09FMnT7A8kNmXCNEEZ6WuY4vXXHCi7foFBPQ5skZ4oBaXi8jgWjLanRI4JDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:32:48.491986Z","bundle_sha256":"a68e19676e11b302f97fc87c95784be639921b1b780d88ee1d5f5822c10c0bb4"}}