{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RITKHSEGAV6IU6A3NOJGXCULMB","short_pith_number":"pith:RITKHSEG","canonical_record":{"source":{"id":"1707.04347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-13T22:48:43Z","cross_cats_sorted":["cs.AI","cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"39d506794cb0d9268e617742317e95eccec6c38c14a8b435c7354827a2aefc6a","abstract_canon_sha256":"66eb753a3f26e6444cc8a2b0ed049982c0dada1a02f5528bc0040bfdd14d50de"},"schema_version":"1.0"},"canonical_sha256":"8a26a3c886057c8a781b6b926b8a8b6052cacdb098b6bc688b1eba45d28c380f","source":{"kind":"arxiv","id":"1707.04347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04347","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04347v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04347","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"RITKHSEGAV6I","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RITKHSEGAV6IU6A3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RITKHSEG","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RITKHSEGAV6IU6A3NOJGXCULMB","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-13T22:48:43Z","cross_cats_sorted":["cs.AI","cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"39d506794cb0d9268e617742317e95eccec6c38c14a8b435c7354827a2aefc6a","abstract_canon_sha256":"66eb753a3f26e6444cc8a2b0ed049982c0dada1a02f5528bc0040bfdd14d50de"},"schema_version":"1.0"},"canonical_sha256":"8a26a3c886057c8a781b6b926b8a8b6052cacdb098b6bc688b1eba45d28c380f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.554030Z","signature_b64":"Vukh74kfed2nACunvjcH2yBkU35iaLbJk+7kpoIcXl0jYP3v5zo/j8FCr5oVRuYM7KcW0vT33fm3OZJsyPSSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a26a3c886057c8a781b6b926b8a8b6052cacdb098b6bc688b1eba45d28c380f","last_reissued_at":"2026-05-18T00:40:18.553286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.553286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04347","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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NxoMCCjWb6fWC2zoFw2GqyV2PzdAvbrr7zESU1LvRNRpgaTrJezPLnzsysRDRyh1PmTxnr9ItHtZJyscV80bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:08:41.563731Z"},"content_sha256":"16c123d518f9472297fd1d2696998eb38c5800b2ff991cbfe649fbc12d7cdfd2","schema_version":"1.0","event_id":"sha256:16c123d518f9472297fd1d2696998eb38c5800b2ff991cbfe649fbc12d7cdfd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RITKHSEGAV6IU6A3NOJGXCULMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.LG","stat.ML"],"primary_cat":"cs.DM","authors_text":"Amin Karbasi, Lin Chen, Moran Feldman","submitted_at":"2017-07-13T22:48:43Z","abstract_excerpt":"Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the known algorithms may perform arbitrarily poorly. Amending this issue, by obtaining approximation results for set functions generalizing submodular functions, has been the focus of recent works.\n  One such class, known as weakly submodular functions, has received a lot of attention. A key result proved by Das and Kempe (2011) showed that the approximation rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04347","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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJl2ccJ4LzQpEXNOBAE7B0Aqf+T8AreWfD+PCeNVXE5vzvGPNiswvqGPHLvGaXrpdk8+Uk24h8xk/XYwggvpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:08:41.564418Z"},"content_sha256":"e96793651b9cd0e51dc82970920d077083b5a420188fe9077d39dfcbdf097585","schema_version":"1.0","event_id":"sha256:e96793651b9cd0e51dc82970920d077083b5a420188fe9077d39dfcbdf097585"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RITKHSEGAV6IU6A3NOJGXCULMB/bundle.json","state_url":"https://pith.science/pith/RITKHSEGAV6IU6A3NOJGXCULMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RITKHSEGAV6IU6A3NOJGXCULMB/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-31T21:08:41Z","links":{"resolver":"https://pith.science/pith/RITKHSEGAV6IU6A3NOJGXCULMB","bundle":"https://pith.science/pith/RITKHSEGAV6IU6A3NOJGXCULMB/bundle.json","state":"https://pith.science/pith/RITKHSEGAV6IU6A3NOJGXCULMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RITKHSEGAV6IU6A3NOJGXCULMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RITKHSEGAV6IU6A3NOJGXCULMB","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":"66eb753a3f26e6444cc8a2b0ed049982c0dada1a02f5528bc0040bfdd14d50de","cross_cats_sorted":["cs.AI","cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-13T22:48:43Z","title_canon_sha256":"39d506794cb0d9268e617742317e95eccec6c38c14a8b435c7354827a2aefc6a"},"schema_version":"1.0","source":{"id":"1707.04347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04347","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04347v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04347","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"RITKHSEGAV6I","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RITKHSEGAV6IU6A3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RITKHSEG","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:e96793651b9cd0e51dc82970920d077083b5a420188fe9077d39dfcbdf097585","target":"graph","created_at":"2026-05-18T00:40:18Z","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":"Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the known algorithms may perform arbitrarily poorly. Amending this issue, by obtaining approximation results for set functions generalizing submodular functions, has been the focus of recent works.\n  One such class, known as weakly submodular functions, has received a lot of attention. A key result proved by Das and Kempe (2011) showed that the approximation rat","authors_text":"Amin Karbasi, Lin Chen, Moran Feldman","cross_cats":["cs.AI","cs.DS","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-13T22:48:43Z","title":"Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04347","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:16c123d518f9472297fd1d2696998eb38c5800b2ff991cbfe649fbc12d7cdfd2","target":"record","created_at":"2026-05-18T00:40:18Z","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":"66eb753a3f26e6444cc8a2b0ed049982c0dada1a02f5528bc0040bfdd14d50de","cross_cats_sorted":["cs.AI","cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-13T22:48:43Z","title_canon_sha256":"39d506794cb0d9268e617742317e95eccec6c38c14a8b435c7354827a2aefc6a"},"schema_version":"1.0","source":{"id":"1707.04347","kind":"arxiv","version":1}},"canonical_sha256":"8a26a3c886057c8a781b6b926b8a8b6052cacdb098b6bc688b1eba45d28c380f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a26a3c886057c8a781b6b926b8a8b6052cacdb098b6bc688b1eba45d28c380f","first_computed_at":"2026-05-18T00:40:18.553286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.553286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vukh74kfed2nACunvjcH2yBkU35iaLbJk+7kpoIcXl0jYP3v5zo/j8FCr5oVRuYM7KcW0vT33fm3OZJsyPSSBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.554030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16c123d518f9472297fd1d2696998eb38c5800b2ff991cbfe649fbc12d7cdfd2","sha256:e96793651b9cd0e51dc82970920d077083b5a420188fe9077d39dfcbdf097585"],"state_sha256":"b2b32dc7d8ac00577dd3dc0e7ca6714d72a65d56e2c2552562e63c4220565222"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iA4qqGnReKZW785YzDSSYa7lpgRfVv0Ejq4/Ucbe3UUG5RNhwrOMi9QolfXh3TPX1I/xaUEJ/nD+XVnQg84hBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:08:41.568354Z","bundle_sha256":"29c83b6342b19d126865aaabd07259f9fbf904b691b2cf4f61e47448f936314b"}}