{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LDVX2YALEPUA7ZRIQKQ4ZFQOIT","short_pith_number":"pith:LDVX2YAL","canonical_record":{"source":{"id":"1905.13272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-30T19:35:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"86d65e684e97056af46ebd20bde272fb2c373e02fdc746dc314e942e2db03151","abstract_canon_sha256":"4c6a2ce8db21e357df3a0882c83568dd5a5b77c2c35307945addc3074644bb4c"},"schema_version":"1.0"},"canonical_sha256":"58eb7d600b23e80fe62882a1cc960e44de07c860cf19659c41761813b51df342","source":{"kind":"arxiv","id":"1905.13272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13272","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13272v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13272","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"LDVX2YALEPUA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LDVX2YALEPUA7ZRI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LDVX2YAL","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LDVX2YALEPUA7ZRIQKQ4ZFQOIT","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-30T19:35:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"86d65e684e97056af46ebd20bde272fb2c373e02fdc746dc314e942e2db03151","abstract_canon_sha256":"4c6a2ce8db21e357df3a0882c83568dd5a5b77c2c35307945addc3074644bb4c"},"schema_version":"1.0"},"canonical_sha256":"58eb7d600b23e80fe62882a1cc960e44de07c860cf19659c41761813b51df342","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:35.450638Z","signature_b64":"3w93F+qOwqIpOJQ6UMQUgj4lm2xXgUEIEjtv8sfdYsiRBE9fWIJbj2YL6qwTXBvvgIXm6uUADe3KOw5wkFvUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58eb7d600b23e80fe62882a1cc960e44de07c860cf19659c41761813b51df342","last_reissued_at":"2026-05-17T23:44:35.450186Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:35.450186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13272","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:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wETtbgrINcTBevnGxU/TKjo0+lt+Ssg+1sP9sg8SxgqtyPAGB1osR4QI7GjCaHntiLPQgBbku+jPQUQucYGkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:21:51.565176Z"},"content_sha256":"87f6092da4ec1ac84d63a27477aba5acb389b070258bb0c29808475ac0823e79","schema_version":"1.0","event_id":"sha256:87f6092da4ec1ac84d63a27477aba5acb389b070258bb0c29808475ac0823e79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LDVX2YALEPUA7ZRIQKQ4ZFQOIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Algorithm for Non-Monotone DR-Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy L. Nguyen","submitted_at":"2019-05-30T19:35:18Z","abstract_excerpt":"In this work, we give a new parallel algorithm for the problem of maximizing a non-monotone diminishing returns submodular function subject to a cardinality constraint. For any desired accuracy $\\epsilon$, our algorithm achieves a $1/e - \\epsilon$ approximation using $O(\\log{n} \\log(1/\\epsilon) / \\epsilon^3)$ parallel rounds of function evaluations. The approximation guarantee nearly matches the best approximation guarantee known for the problem in the sequential setting and the number of parallel rounds is nearly-optimal for any constant $\\epsilon$. Previous algorithms achieve worse approxima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13272","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:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUkJ0cM+WRHIpTJMI+AXqAYPU/3Cl+IvDeME6CuIZuQizXzKopI6EQwcZcDvt/zb30F0fHiysiOCRDfx7GLkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:21:51.565934Z"},"content_sha256":"999304e306af0cf921a8c8d0c14fa7fbcf0a59d9aea99cbe5c55565e7a42bd53","schema_version":"1.0","event_id":"sha256:999304e306af0cf921a8c8d0c14fa7fbcf0a59d9aea99cbe5c55565e7a42bd53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/bundle.json","state_url":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/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-12T02:21:51Z","links":{"resolver":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT","bundle":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/bundle.json","state":"https://pith.science/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDVX2YALEPUA7ZRIQKQ4ZFQOIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LDVX2YALEPUA7ZRIQKQ4ZFQOIT","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":"4c6a2ce8db21e357df3a0882c83568dd5a5b77c2c35307945addc3074644bb4c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-30T19:35:18Z","title_canon_sha256":"86d65e684e97056af46ebd20bde272fb2c373e02fdc746dc314e942e2db03151"},"schema_version":"1.0","source":{"id":"1905.13272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13272","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13272v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13272","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"LDVX2YALEPUA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LDVX2YALEPUA7ZRI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LDVX2YAL","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:999304e306af0cf921a8c8d0c14fa7fbcf0a59d9aea99cbe5c55565e7a42bd53","target":"graph","created_at":"2026-05-17T23:44:35Z","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 work, we give a new parallel algorithm for the problem of maximizing a non-monotone diminishing returns submodular function subject to a cardinality constraint. For any desired accuracy $\\epsilon$, our algorithm achieves a $1/e - \\epsilon$ approximation using $O(\\log{n} \\log(1/\\epsilon) / \\epsilon^3)$ parallel rounds of function evaluations. The approximation guarantee nearly matches the best approximation guarantee known for the problem in the sequential setting and the number of parallel rounds is nearly-optimal for any constant $\\epsilon$. Previous algorithms achieve worse approxima","authors_text":"Alina Ene, Huy L. Nguyen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-30T19:35:18Z","title":"Parallel Algorithm for Non-Monotone DR-Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13272","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:87f6092da4ec1ac84d63a27477aba5acb389b070258bb0c29808475ac0823e79","target":"record","created_at":"2026-05-17T23:44:35Z","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":"4c6a2ce8db21e357df3a0882c83568dd5a5b77c2c35307945addc3074644bb4c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-30T19:35:18Z","title_canon_sha256":"86d65e684e97056af46ebd20bde272fb2c373e02fdc746dc314e942e2db03151"},"schema_version":"1.0","source":{"id":"1905.13272","kind":"arxiv","version":1}},"canonical_sha256":"58eb7d600b23e80fe62882a1cc960e44de07c860cf19659c41761813b51df342","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58eb7d600b23e80fe62882a1cc960e44de07c860cf19659c41761813b51df342","first_computed_at":"2026-05-17T23:44:35.450186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:35.450186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3w93F+qOwqIpOJQ6UMQUgj4lm2xXgUEIEjtv8sfdYsiRBE9fWIJbj2YL6qwTXBvvgIXm6uUADe3KOw5wkFvUAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:35.450638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87f6092da4ec1ac84d63a27477aba5acb389b070258bb0c29808475ac0823e79","sha256:999304e306af0cf921a8c8d0c14fa7fbcf0a59d9aea99cbe5c55565e7a42bd53"],"state_sha256":"ebdf84f0c4cea5c3a150be2c6282bdb7b8239f237030d5c9202f25ef3f13ac85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jYi6D45ar5mMv3mtLu+ra09dGDMm5wBXBuDFfeU74m8Gb9D6dvP3lo6w6JoxYq/vRWkb5w3agtK+Ct++W8uAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:21:51.570631Z","bundle_sha256":"7ab985e6c2e6eeeb76f6e6a182e1d7395f234010356c21ffdc3d432d431feeaf"}}