{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IPM332RKCG5LZZF3ZXXRF3GENR","short_pith_number":"pith:IPM332RK","canonical_record":{"source":{"id":"1506.06715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T18:50:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2ff872a2b6db661a321d236ca5bddf4ec3b7ba3048e231ddefc87962469e9a45","abstract_canon_sha256":"36c08c2bc1a557094ebd5321767e7ffd0e7aab38e2929dfd9f0ad988d2a47eb9"},"schema_version":"1.0"},"canonical_sha256":"43d9bdea2a11babce4bbcdef12ecc46c4f17293244961c8bc028b9598b569d8a","source":{"kind":"arxiv","id":"1506.06715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06715","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06715v1","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06715","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"IPM332RKCG5L","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IPM332RKCG5LZZF3","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IPM332RK","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IPM332RKCG5LZZF3ZXXRF3GENR","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T18:50:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2ff872a2b6db661a321d236ca5bddf4ec3b7ba3048e231ddefc87962469e9a45","abstract_canon_sha256":"36c08c2bc1a557094ebd5321767e7ffd0e7aab38e2929dfd9f0ad988d2a47eb9"},"schema_version":"1.0"},"canonical_sha256":"43d9bdea2a11babce4bbcdef12ecc46c4f17293244961c8bc028b9598b569d8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:44.488304Z","signature_b64":"Yx0U37tvvw1leYRjQjJbRZcB498ZXqOMglZI1zpUijR3r3mz0ZtnxbIuHgFDylyxPxMcDXjgB2cmBuAbofdZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d9bdea2a11babce4bbcdef12ecc46c4f17293244961c8bc028b9598b569d8a","last_reissued_at":"2026-05-18T01:41:44.487799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:44.487799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06715","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-18T01:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pfx4zZh2Wn6zQLHW0oYXUI4YuC7g8jQI1HppmqQhk/jWpEcG91SxmxhGfDg/OqGDGROOnR6StW6wzXB7JijoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:01:38.979416Z"},"content_sha256":"8a62ee7b905512b8eaf5494975b8db8a338a2adda679ce442df645f860b01e33","schema_version":"1.0","event_id":"sha256:8a62ee7b905512b8eaf5494975b8db8a338a2adda679ce442df645f860b01e33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IPM332RKCG5LZZF3ZXXRF3GENR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Composable Core-sets for Distributed Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Morteza Zadimoghaddam, Vahab Mirrokni","submitted_at":"2015-06-22T18:50:41Z","abstract_excerpt":"An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obtain a solution inside the union of the representative solutions for all pieces. This technique can be captured via the concept of {\\em composable core-sets}, and has been recently applied to solve diversity maximization problems as well as several clustering problems. However, for coverage and submodular maximization problems, impossibility bounds are known for this technique \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06715","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-18T01:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaUj+4vdf4nWnYdoTJMCSEKFqPZlxf7li8bKeo7yzZ1BkQ+M9ZNHUMHdwkx5jUsLY5Uq3dUo3Zq2/7UV5jaYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:01:38.979800Z"},"content_sha256":"a3c2f8ba6b89100eaf9078c5cfc7f6d0a3efc1173dc50d2ca0c63a636adb6c29","schema_version":"1.0","event_id":"sha256:a3c2f8ba6b89100eaf9078c5cfc7f6d0a3efc1173dc50d2ca0c63a636adb6c29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPM332RKCG5LZZF3ZXXRF3GENR/bundle.json","state_url":"https://pith.science/pith/IPM332RKCG5LZZF3ZXXRF3GENR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPM332RKCG5LZZF3ZXXRF3GENR/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-25T08:01:38Z","links":{"resolver":"https://pith.science/pith/IPM332RKCG5LZZF3ZXXRF3GENR","bundle":"https://pith.science/pith/IPM332RKCG5LZZF3ZXXRF3GENR/bundle.json","state":"https://pith.science/pith/IPM332RKCG5LZZF3ZXXRF3GENR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPM332RKCG5LZZF3ZXXRF3GENR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IPM332RKCG5LZZF3ZXXRF3GENR","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":"36c08c2bc1a557094ebd5321767e7ffd0e7aab38e2929dfd9f0ad988d2a47eb9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T18:50:41Z","title_canon_sha256":"2ff872a2b6db661a321d236ca5bddf4ec3b7ba3048e231ddefc87962469e9a45"},"schema_version":"1.0","source":{"id":"1506.06715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06715","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06715v1","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06715","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"IPM332RKCG5L","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IPM332RKCG5LZZF3","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IPM332RK","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:a3c2f8ba6b89100eaf9078c5cfc7f6d0a3efc1173dc50d2ca0c63a636adb6c29","target":"graph","created_at":"2026-05-18T01:41:44Z","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":"An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obtain a solution inside the union of the representative solutions for all pieces. This technique can be captured via the concept of {\\em composable core-sets}, and has been recently applied to solve diversity maximization problems as well as several clustering problems. However, for coverage and submodular maximization problems, impossibility bounds are known for this technique \\","authors_text":"Morteza Zadimoghaddam, Vahab Mirrokni","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T18:50:41Z","title":"Randomized Composable Core-sets for Distributed Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06715","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:8a62ee7b905512b8eaf5494975b8db8a338a2adda679ce442df645f860b01e33","target":"record","created_at":"2026-05-18T01:41:44Z","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":"36c08c2bc1a557094ebd5321767e7ffd0e7aab38e2929dfd9f0ad988d2a47eb9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T18:50:41Z","title_canon_sha256":"2ff872a2b6db661a321d236ca5bddf4ec3b7ba3048e231ddefc87962469e9a45"},"schema_version":"1.0","source":{"id":"1506.06715","kind":"arxiv","version":1}},"canonical_sha256":"43d9bdea2a11babce4bbcdef12ecc46c4f17293244961c8bc028b9598b569d8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43d9bdea2a11babce4bbcdef12ecc46c4f17293244961c8bc028b9598b569d8a","first_computed_at":"2026-05-18T01:41:44.487799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:44.487799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yx0U37tvvw1leYRjQjJbRZcB498ZXqOMglZI1zpUijR3r3mz0ZtnxbIuHgFDylyxPxMcDXjgB2cmBuAbofdZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:44.488304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a62ee7b905512b8eaf5494975b8db8a338a2adda679ce442df645f860b01e33","sha256:a3c2f8ba6b89100eaf9078c5cfc7f6d0a3efc1173dc50d2ca0c63a636adb6c29"],"state_sha256":"ebddf6ce3b15f13595ece774543b54de5379e4975eb46202651396c93d639907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+Xr3ybfu7yjvA0KUs0y4HTpe3wMyGjA7j2+5eH9x0lsrx6J4U2QyTb1GZzSu8mgGNNdVIqBpeKRqeEEt9TYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:01:38.982970Z","bundle_sha256":"fd8244d939856ff72424620fd07b9a438a5824f20c4ca46b3a92084ed6b7cedb"}}