{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N3BIRGQ5B3XKYVQQRRTNY2XQWK","short_pith_number":"pith:N3BIRGQ5","canonical_record":{"source":{"id":"1805.09480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T02:08:14Z","cross_cats_sorted":["cs.GT","cs.LG","math.OC","stat.ML"],"title_canon_sha256":"a56bb20a3b055bbfe0fbd90dd2b1ec7d0f87cc29e782809ee4edaca6291df34a","abstract_canon_sha256":"1263ef46fc2885aa04682a157817bc8ad2ec059190f3f3c454ffb501b5aae7d0"},"schema_version":"1.0"},"canonical_sha256":"6ec2889a1d0eeeac56108c66dc6af0b29c21def8e74507bf70cea323b6c49aed","source":{"kind":"arxiv","id":"1805.09480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09480","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09480v1","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09480","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"pith_short_12","alias_value":"N3BIRGQ5B3XK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N3BIRGQ5B3XKYVQQ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N3BIRGQ5","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N3BIRGQ5B3XKYVQQRRTNY2XQWK","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T02:08:14Z","cross_cats_sorted":["cs.GT","cs.LG","math.OC","stat.ML"],"title_canon_sha256":"a56bb20a3b055bbfe0fbd90dd2b1ec7d0f87cc29e782809ee4edaca6291df34a","abstract_canon_sha256":"1263ef46fc2885aa04682a157817bc8ad2ec059190f3f3c454ffb501b5aae7d0"},"schema_version":"1.0"},"canonical_sha256":"6ec2889a1d0eeeac56108c66dc6af0b29c21def8e74507bf70cea323b6c49aed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:03.783789Z","signature_b64":"X4Ta9bI3vD3wgiYf5SJc1cBIDsq+mswAnk5xUEWVON8kXWfoX67YbuRbgzLAiFLVTefuZ0K/jmyXNqi1fQ8LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec2889a1d0eeeac56108c66dc6af0b29c21def8e74507bf70cea323b6c49aed","last_reissued_at":"2026-05-18T00:15:03.783021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:03.783021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09480","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:15:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A9yPEWUTw/mc3U9p3ynL7/0veq6GT78mQO8FKENWC4OJ9qvuLxmsUJhu+Iwx3g4SIxvesMpc2HOHzOWKjqinAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:50:00.531770Z"},"content_sha256":"53d97346726d30a63902b4d451356e26ce2e0bae9f2a96b4ffbc4e034386aa8b","schema_version":"1.0","event_id":"sha256:53d97346726d30a63902b4d451356e26ce2e0bae9f2a96b4ffbc4e034386aa8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N3BIRGQ5B3XKYVQQRRTNY2XQWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","math.OC","stat.ML"],"primary_cat":"cs.DS","authors_text":"Joshua R. Wang, Rad Niazadeh, Tim Roughgarden","submitted_at":"2018-05-24T02:08:14Z","abstract_excerpt":"In this paper we study the fundamental problems of maximizing a continuous non-monotone submodular function over the hypercube, both with and without coordinate-wise concavity. This family of optimization problems has several applications in machine learning, economics, and communication systems. Our main result is the first $\\frac{1}{2}$-approximation algorithm for continuous submodular function maximization; this approximation factor of $\\frac{1}{2}$ is the best possible for algorithms that only query the objective function at polynomially many points. For the special case of DR-submodular m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09480","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:15:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1A/JyejOhDe9ZBEI772mmj4MKn4uxOB4W+Ggfh1fVRI+LlZz26fu9RO/DUZ5OyHlA1DzOibIvdvwztD9ELMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:50:00.532132Z"},"content_sha256":"87df5918208c6048f2ba9d8ad46c6a691dbda86fc875e54cae3038c4fd15293a","schema_version":"1.0","event_id":"sha256:87df5918208c6048f2ba9d8ad46c6a691dbda86fc875e54cae3038c4fd15293a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/bundle.json","state_url":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/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-25T17:50:00Z","links":{"resolver":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK","bundle":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/bundle.json","state":"https://pith.science/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3BIRGQ5B3XKYVQQRRTNY2XQWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N3BIRGQ5B3XKYVQQRRTNY2XQWK","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":"1263ef46fc2885aa04682a157817bc8ad2ec059190f3f3c454ffb501b5aae7d0","cross_cats_sorted":["cs.GT","cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T02:08:14Z","title_canon_sha256":"a56bb20a3b055bbfe0fbd90dd2b1ec7d0f87cc29e782809ee4edaca6291df34a"},"schema_version":"1.0","source":{"id":"1805.09480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09480","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09480v1","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09480","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"pith_short_12","alias_value":"N3BIRGQ5B3XK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N3BIRGQ5B3XKYVQQ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N3BIRGQ5","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:87df5918208c6048f2ba9d8ad46c6a691dbda86fc875e54cae3038c4fd15293a","target":"graph","created_at":"2026-05-18T00:15:03Z","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 fundamental problems of maximizing a continuous non-monotone submodular function over the hypercube, both with and without coordinate-wise concavity. This family of optimization problems has several applications in machine learning, economics, and communication systems. Our main result is the first $\\frac{1}{2}$-approximation algorithm for continuous submodular function maximization; this approximation factor of $\\frac{1}{2}$ is the best possible for algorithms that only query the objective function at polynomially many points. For the special case of DR-submodular m","authors_text":"Joshua R. Wang, Rad Niazadeh, Tim Roughgarden","cross_cats":["cs.GT","cs.LG","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T02:08:14Z","title":"Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09480","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:53d97346726d30a63902b4d451356e26ce2e0bae9f2a96b4ffbc4e034386aa8b","target":"record","created_at":"2026-05-18T00:15:03Z","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":"1263ef46fc2885aa04682a157817bc8ad2ec059190f3f3c454ffb501b5aae7d0","cross_cats_sorted":["cs.GT","cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-24T02:08:14Z","title_canon_sha256":"a56bb20a3b055bbfe0fbd90dd2b1ec7d0f87cc29e782809ee4edaca6291df34a"},"schema_version":"1.0","source":{"id":"1805.09480","kind":"arxiv","version":1}},"canonical_sha256":"6ec2889a1d0eeeac56108c66dc6af0b29c21def8e74507bf70cea323b6c49aed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ec2889a1d0eeeac56108c66dc6af0b29c21def8e74507bf70cea323b6c49aed","first_computed_at":"2026-05-18T00:15:03.783021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:03.783021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X4Ta9bI3vD3wgiYf5SJc1cBIDsq+mswAnk5xUEWVON8kXWfoX67YbuRbgzLAiFLVTefuZ0K/jmyXNqi1fQ8LCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:03.783789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53d97346726d30a63902b4d451356e26ce2e0bae9f2a96b4ffbc4e034386aa8b","sha256:87df5918208c6048f2ba9d8ad46c6a691dbda86fc875e54cae3038c4fd15293a"],"state_sha256":"9174a3fa45e5c8d96df92f516a598669c9f13bfcc80bfe30ad451832ecce9d68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7k/ypXfGEsuAhvjCqcd3LzJHHNluZA9N61Y2Cc5wA5R7CwexEyyIj7Vxgtyf3b6cIiR400XBY5p50ObrFCidBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:50:00.534138Z","bundle_sha256":"46c1b96261441bdb58c8c318a2612147528bd45f9f9e0dfb8217b0801e19e869"}}