{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JI3RWX32JOKRHFFSYR64JPC33V","short_pith_number":"pith:JI3RWX32","canonical_record":{"source":{"id":"1807.11462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T17:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"ca602d22606773108073cb058ba045c566995b7272650be520b575dd39b626fd","abstract_canon_sha256":"089694f9396810b0bc56de1c2423f22068bd966723cdd75cf35a3991397f46df"},"schema_version":"1.0"},"canonical_sha256":"4a371b5f7a4b951394b2c47dc4bc5bdd48ab1d3a26a6eb88d10e7455e5e2e8ff","source":{"kind":"arxiv","id":"1807.11462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11462","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11462v1","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11462","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"JI3RWX32JOKR","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JI3RWX32JOKRHFFS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JI3RWX32","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JI3RWX32JOKRHFFSYR64JPC33V","target":"record","payload":{"canonical_record":{"source":{"id":"1807.11462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T17:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"ca602d22606773108073cb058ba045c566995b7272650be520b575dd39b626fd","abstract_canon_sha256":"089694f9396810b0bc56de1c2423f22068bd966723cdd75cf35a3991397f46df"},"schema_version":"1.0"},"canonical_sha256":"4a371b5f7a4b951394b2c47dc4bc5bdd48ab1d3a26a6eb88d10e7455e5e2e8ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:31.856649Z","signature_b64":"ak7jYgd5kNoXC4dPCeiE8a/AcEyJXZYOWWsd+1Q+ISXINn9Tg1RnaxayoOtYmYafzXpj9QtsnzcVuFD//njOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a371b5f7a4b951394b2c47dc4bc5bdd48ab1d3a26a6eb88d10e7455e5e2e8ff","last_reissued_at":"2026-05-18T00:09:31.855973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:31.855973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.11462","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:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Q8ovZhidpJDDqWm4Goqgr8ys1T9AnrbG9Jc30GCeaVghT76qS7GYMUyA78x1TCsr0FtnYjyVD46YPQpHZlGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:37.643266Z"},"content_sha256":"acfdc27ed51a69a2f1d8780f8da935c1fe1df11b4312f431f2023d2cd71cf79c","schema_version":"1.0","event_id":"sha256:acfdc27ed51a69a2f1d8780f8da935c1fe1df11b4312f431f2023d2cd71cf79c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JI3RWX32JOKRHFFSYR64JPC33V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-monotone Submodular Maximization in Exponentially Fewer Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Breuer, Eric Balkanski, Yaron Singer","submitted_at":"2018-07-30T17:44:53Z","abstract_excerpt":"In this paper we consider parallelization for applications whose objective can be expressed as maximizing a non-monotone submodular function under a cardinality constraint. Our main result is an algorithm whose approximation is arbitrarily close to $1/2e$ in $O(\\log^2 n)$ adaptive rounds, where $n$ is the size of the ground set. This is an exponential speedup in parallel running time over any previously studied algorithm for constrained non-monotone submodular maximization. Beyond its provable guarantees, the algorithm performs well in practice. Specifically, experiments on traffic monitoring "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11462","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:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPiGi2GX2RQ8mFF/Ky+qy/89Ct84fMBpKaDCLr/1aLg//AWvigrfEBrSnRfWDa2jk57lz/a2UTzg3Z952oAWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:37.643637Z"},"content_sha256":"c0af52d96dbcbbc732862cebc7443dec417aa590a2349fb1ee6bf60b515a5a9f","schema_version":"1.0","event_id":"sha256:c0af52d96dbcbbc732862cebc7443dec417aa590a2349fb1ee6bf60b515a5a9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/bundle.json","state_url":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JI3RWX32JOKRHFFSYR64JPC33V/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-09T00:23:37Z","links":{"resolver":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V","bundle":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/bundle.json","state":"https://pith.science/pith/JI3RWX32JOKRHFFSYR64JPC33V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JI3RWX32JOKRHFFSYR64JPC33V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JI3RWX32JOKRHFFSYR64JPC33V","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":"089694f9396810b0bc56de1c2423f22068bd966723cdd75cf35a3991397f46df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T17:44:53Z","title_canon_sha256":"ca602d22606773108073cb058ba045c566995b7272650be520b575dd39b626fd"},"schema_version":"1.0","source":{"id":"1807.11462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11462","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11462v1","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11462","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"JI3RWX32JOKR","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JI3RWX32JOKRHFFS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JI3RWX32","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:c0af52d96dbcbbc732862cebc7443dec417aa590a2349fb1ee6bf60b515a5a9f","target":"graph","created_at":"2026-05-18T00:09:31Z","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 consider parallelization for applications whose objective can be expressed as maximizing a non-monotone submodular function under a cardinality constraint. Our main result is an algorithm whose approximation is arbitrarily close to $1/2e$ in $O(\\log^2 n)$ adaptive rounds, where $n$ is the size of the ground set. This is an exponential speedup in parallel running time over any previously studied algorithm for constrained non-monotone submodular maximization. Beyond its provable guarantees, the algorithm performs well in practice. Specifically, experiments on traffic monitoring ","authors_text":"Adam Breuer, Eric Balkanski, Yaron Singer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T17:44:53Z","title":"Non-monotone Submodular Maximization in Exponentially Fewer Iterations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11462","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:acfdc27ed51a69a2f1d8780f8da935c1fe1df11b4312f431f2023d2cd71cf79c","target":"record","created_at":"2026-05-18T00:09:31Z","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":"089694f9396810b0bc56de1c2423f22068bd966723cdd75cf35a3991397f46df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T17:44:53Z","title_canon_sha256":"ca602d22606773108073cb058ba045c566995b7272650be520b575dd39b626fd"},"schema_version":"1.0","source":{"id":"1807.11462","kind":"arxiv","version":1}},"canonical_sha256":"4a371b5f7a4b951394b2c47dc4bc5bdd48ab1d3a26a6eb88d10e7455e5e2e8ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a371b5f7a4b951394b2c47dc4bc5bdd48ab1d3a26a6eb88d10e7455e5e2e8ff","first_computed_at":"2026-05-18T00:09:31.855973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:31.855973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ak7jYgd5kNoXC4dPCeiE8a/AcEyJXZYOWWsd+1Q+ISXINn9Tg1RnaxayoOtYmYafzXpj9QtsnzcVuFD//njOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:31.856649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acfdc27ed51a69a2f1d8780f8da935c1fe1df11b4312f431f2023d2cd71cf79c","sha256:c0af52d96dbcbbc732862cebc7443dec417aa590a2349fb1ee6bf60b515a5a9f"],"state_sha256":"7e98f07dd8a23a06f051365e18a7256ccc0b83cf80b7c906007c4b6c35cc197e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0sWRx4YAAwvUhY+dbId/FCiC5uXZ49fxfzkedKHSxpW6Ot5v9LeJedHxvMq9WxlFIW0zqCFrYbvX8hvUWajAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:23:37.645590Z","bundle_sha256":"7450723d22f142b2bb7ba8636d2bbd82d65be9e94cb5659330f94658c64678a2"}}