{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MOXVEY7RU5OQTAO3A3ZL3GUMFD","short_pith_number":"pith:MOXVEY7R","canonical_record":{"source":{"id":"1804.06355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-17T16:28:26Z","cross_cats_sorted":[],"title_canon_sha256":"61b24345e12031ca3999fc45996396db701a4e892e6b35ef6797b617c7eda9f2","abstract_canon_sha256":"352c36181ad4b6b990592a24b0cd07dfa585636b1c3f0071bf859c332a5fbe24"},"schema_version":"1.0"},"canonical_sha256":"63af5263f1a75d0981db06f2bd9a8c28cf3ec860e4c8e684a6d8034075a13a44","source":{"kind":"arxiv","id":"1804.06355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06355","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06355v1","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06355","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"MOXVEY7RU5OQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MOXVEY7RU5OQTAO3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MOXVEY7R","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MOXVEY7RU5OQTAO3A3ZL3GUMFD","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-17T16:28:26Z","cross_cats_sorted":[],"title_canon_sha256":"61b24345e12031ca3999fc45996396db701a4e892e6b35ef6797b617c7eda9f2","abstract_canon_sha256":"352c36181ad4b6b990592a24b0cd07dfa585636b1c3f0071bf859c332a5fbe24"},"schema_version":"1.0"},"canonical_sha256":"63af5263f1a75d0981db06f2bd9a8c28cf3ec860e4c8e684a6d8034075a13a44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:10.265627Z","signature_b64":"iO0V282xy7cjbC/iZxEnuqLfScRrIiQKA2O7h0wydTO6Q5u4LLJ2469udjiIsMhDm08nUSmlkSTChER5i8ZsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63af5263f1a75d0981db06f2bd9a8c28cf3ec860e4c8e684a6d8034075a13a44","last_reissued_at":"2026-05-18T00:18:10.265025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:10.265025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06355","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:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/jtndaUKP+IdbpemrUPAK17ple1Nq7yEuHcWvgKXEoeCU+Y3Bc+YV1XkydP8igUjuueY2U3r1rKt9vAXbfOTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:40:43.917177Z"},"content_sha256":"1ad04f17428e76a6f381ca3a993ea5bf55658483ee1f3ef2173f04c96d58908c","schema_version":"1.0","event_id":"sha256:1ad04f17428e76a6f381ca3a993ea5bf55658483ee1f3ef2173f04c96d58908c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MOXVEY7RU5OQTAO3A3ZL3GUMFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aviad Rubinstein, Eric Balkanski, Yaron Singer","submitted_at":"2018-04-17T16:28:26Z","abstract_excerpt":"In this paper we study the adaptivity of submodular maximization. Adaptivity quantifies the number of sequential rounds that an algorithm makes when function evaluations can be executed in parallel. Adaptivity is a fundamental concept that is heavily studied across a variety of areas in computer science, largely due to the need for parallelizing computation. For the canonical problem of maximizing a monotone submodular function under a cardinality constraint, it is well known that a simple greedy algorithm achieves a $1-1/e$ approximation and that this approximation is optimal for polynomial-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06355","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:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VNKVDdnxLOzK6O9MU+vR2M53UKXOMjJrxgFoxXElPI8FVchm0DY+oRcsi797+KOnFj4CO6EEDhE+0FkZ069Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:40:43.917901Z"},"content_sha256":"616301a9dba034064a49ad036b9f6655158a4bb11f84dc127584d900a11b681f","schema_version":"1.0","event_id":"sha256:616301a9dba034064a49ad036b9f6655158a4bb11f84dc127584d900a11b681f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOXVEY7RU5OQTAO3A3ZL3GUMFD/bundle.json","state_url":"https://pith.science/pith/MOXVEY7RU5OQTAO3A3ZL3GUMFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOXVEY7RU5OQTAO3A3ZL3GUMFD/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-09T08:40:43Z","links":{"resolver":"https://pith.science/pith/MOXVEY7RU5OQTAO3A3ZL3GUMFD","bundle":"https://pith.science/pith/MOXVEY7RU5OQTAO3A3ZL3GUMFD/bundle.json","state":"https://pith.science/pith/MOXVEY7RU5OQTAO3A3ZL3GUMFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOXVEY7RU5OQTAO3A3ZL3GUMFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MOXVEY7RU5OQTAO3A3ZL3GUMFD","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":"352c36181ad4b6b990592a24b0cd07dfa585636b1c3f0071bf859c332a5fbe24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-17T16:28:26Z","title_canon_sha256":"61b24345e12031ca3999fc45996396db701a4e892e6b35ef6797b617c7eda9f2"},"schema_version":"1.0","source":{"id":"1804.06355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06355","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06355v1","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06355","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"MOXVEY7RU5OQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MOXVEY7RU5OQTAO3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MOXVEY7R","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:616301a9dba034064a49ad036b9f6655158a4bb11f84dc127584d900a11b681f","target":"graph","created_at":"2026-05-18T00:18:10Z","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 adaptivity of submodular maximization. Adaptivity quantifies the number of sequential rounds that an algorithm makes when function evaluations can be executed in parallel. Adaptivity is a fundamental concept that is heavily studied across a variety of areas in computer science, largely due to the need for parallelizing computation. For the canonical problem of maximizing a monotone submodular function under a cardinality constraint, it is well known that a simple greedy algorithm achieves a $1-1/e$ approximation and that this approximation is optimal for polynomial-t","authors_text":"Aviad Rubinstein, Eric Balkanski, Yaron Singer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-17T16:28:26Z","title":"An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06355","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:1ad04f17428e76a6f381ca3a993ea5bf55658483ee1f3ef2173f04c96d58908c","target":"record","created_at":"2026-05-18T00:18:10Z","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":"352c36181ad4b6b990592a24b0cd07dfa585636b1c3f0071bf859c332a5fbe24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-17T16:28:26Z","title_canon_sha256":"61b24345e12031ca3999fc45996396db701a4e892e6b35ef6797b617c7eda9f2"},"schema_version":"1.0","source":{"id":"1804.06355","kind":"arxiv","version":1}},"canonical_sha256":"63af5263f1a75d0981db06f2bd9a8c28cf3ec860e4c8e684a6d8034075a13a44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63af5263f1a75d0981db06f2bd9a8c28cf3ec860e4c8e684a6d8034075a13a44","first_computed_at":"2026-05-18T00:18:10.265025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:10.265025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iO0V282xy7cjbC/iZxEnuqLfScRrIiQKA2O7h0wydTO6Q5u4LLJ2469udjiIsMhDm08nUSmlkSTChER5i8ZsAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:10.265627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ad04f17428e76a6f381ca3a993ea5bf55658483ee1f3ef2173f04c96d58908c","sha256:616301a9dba034064a49ad036b9f6655158a4bb11f84dc127584d900a11b681f"],"state_sha256":"a3e2f4e299efe6410e34064768d39d2d1a4fcb6145029ea5644b5082e5f0a2b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJ52W6o1Clhp10u61jtJS8cgefaznViPYYKzckQZqowYhg77byq/NTq5qHbly2VUTGx9sPOqkxQahwfEXYjsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:40:43.921786Z","bundle_sha256":"7b5af83a3b060e7a3e050b1181b30728eb50bc544f348053efb1d93bad4a37ac"}}