{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U3A3GYRSCAKYAWFCJTRE4VXR2I","short_pith_number":"pith:U3A3GYRS","canonical_record":{"source":{"id":"1410.6604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-24T07:52:55Z","cross_cats_sorted":["cs.DC","stat.CO","stat.ME"],"title_canon_sha256":"c546b41675a133c2505faa6d9d5d862f1b74274ced59a9ed39aab295656bed30","abstract_canon_sha256":"69240f74cb7d23c581c999b362dcd56a71bdb8659287456a92cba935cde0427d"},"schema_version":"1.0"},"canonical_sha256":"a6c1b3623210158058a24ce24e56f1d223a4ca3307a20c3714f0f56e2b3a29c4","source":{"kind":"arxiv","id":"1410.6604","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6604","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6604v1","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6604","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"U3A3GYRSCAKY","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U3A3GYRSCAKYAWFC","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U3A3GYRS","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U3A3GYRSCAKYAWFCJTRE4VXR2I","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-24T07:52:55Z","cross_cats_sorted":["cs.DC","stat.CO","stat.ME"],"title_canon_sha256":"c546b41675a133c2505faa6d9d5d862f1b74274ced59a9ed39aab295656bed30","abstract_canon_sha256":"69240f74cb7d23c581c999b362dcd56a71bdb8659287456a92cba935cde0427d"},"schema_version":"1.0"},"canonical_sha256":"a6c1b3623210158058a24ce24e56f1d223a4ca3307a20c3714f0f56e2b3a29c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:24.928929Z","signature_b64":"awoC4xu+3xru/pH6yy3rjrd2mEwHXCkzGpOCY5z3K2Rik3621c+Ll2MzMH+s0l+7LJ+70Tx30oXnPjbS2MUOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6c1b3623210158058a24ce24e56f1d223a4ca3307a20c3714f0f56e2b3a29c4","last_reissued_at":"2026-05-18T02:39:24.928512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:24.928512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6604","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-18T02:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5P9PIXaGPvAwv9VVoEPwQwHlPx62TQHS7RUQMyQnswi5BKSufGfDfanSlarIrIpmm29RErL1cW+HxGneBgxUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:33:13.356466Z"},"content_sha256":"bc12aa584b2bf18bf26bd96a06c7c4229386113a6dfeb7e1dfb6b815a81884c2","schema_version":"1.0","event_id":"sha256:bc12aa584b2bf18bf26bd96a06c7c4229386113a6dfeb7e1dfb6b815a81884c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U3A3GYRSCAKYAWFCJTRE4VXR2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Median Selection Subset Aggregation for Parallel Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"David Dunson, Peichao Peng, Xiangyu Wang","submitted_at":"2014-10-24T07:52:55Z","abstract_excerpt":"For massive data sets, efficient computation commonly relies on distributed algorithms that store and process subsets of the data on different machines, minimizing communication costs. Our focus is on regression and classification problems involving many features. A variety of distributed algorithms have been proposed in this context, but challenges arise in defining an algorithm with low communication, theoretical guarantees and excellent practical performance in general settings. We propose a MEdian Selection Subset AGgregation Estimator (message) algorithm, which attempts to solve these pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6604","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-18T02:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e89rOIa5Td7shgRnM5bDdr2yBMcvy+RIWEboJHb8LfixPN086nO0ilhrDcizyq/lwaaNv8mzs8Lti7mKt0n7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:33:13.356881Z"},"content_sha256":"5ea89b62fc6018342f1494797e59e56021cbe5d183685043f4b4eda164619687","schema_version":"1.0","event_id":"sha256:5ea89b62fc6018342f1494797e59e56021cbe5d183685043f4b4eda164619687"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3A3GYRSCAKYAWFCJTRE4VXR2I/bundle.json","state_url":"https://pith.science/pith/U3A3GYRSCAKYAWFCJTRE4VXR2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3A3GYRSCAKYAWFCJTRE4VXR2I/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-02T14:33:13Z","links":{"resolver":"https://pith.science/pith/U3A3GYRSCAKYAWFCJTRE4VXR2I","bundle":"https://pith.science/pith/U3A3GYRSCAKYAWFCJTRE4VXR2I/bundle.json","state":"https://pith.science/pith/U3A3GYRSCAKYAWFCJTRE4VXR2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3A3GYRSCAKYAWFCJTRE4VXR2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U3A3GYRSCAKYAWFCJTRE4VXR2I","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":"69240f74cb7d23c581c999b362dcd56a71bdb8659287456a92cba935cde0427d","cross_cats_sorted":["cs.DC","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-24T07:52:55Z","title_canon_sha256":"c546b41675a133c2505faa6d9d5d862f1b74274ced59a9ed39aab295656bed30"},"schema_version":"1.0","source":{"id":"1410.6604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6604","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6604v1","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6604","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"U3A3GYRSCAKY","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U3A3GYRSCAKYAWFC","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U3A3GYRS","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:5ea89b62fc6018342f1494797e59e56021cbe5d183685043f4b4eda164619687","target":"graph","created_at":"2026-05-18T02:39:24Z","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":"For massive data sets, efficient computation commonly relies on distributed algorithms that store and process subsets of the data on different machines, minimizing communication costs. Our focus is on regression and classification problems involving many features. A variety of distributed algorithms have been proposed in this context, but challenges arise in defining an algorithm with low communication, theoretical guarantees and excellent practical performance in general settings. We propose a MEdian Selection Subset AGgregation Estimator (message) algorithm, which attempts to solve these pro","authors_text":"David Dunson, Peichao Peng, Xiangyu Wang","cross_cats":["cs.DC","stat.CO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-24T07:52:55Z","title":"Median Selection Subset Aggregation for Parallel Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6604","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:bc12aa584b2bf18bf26bd96a06c7c4229386113a6dfeb7e1dfb6b815a81884c2","target":"record","created_at":"2026-05-18T02:39:24Z","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":"69240f74cb7d23c581c999b362dcd56a71bdb8659287456a92cba935cde0427d","cross_cats_sorted":["cs.DC","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-24T07:52:55Z","title_canon_sha256":"c546b41675a133c2505faa6d9d5d862f1b74274ced59a9ed39aab295656bed30"},"schema_version":"1.0","source":{"id":"1410.6604","kind":"arxiv","version":1}},"canonical_sha256":"a6c1b3623210158058a24ce24e56f1d223a4ca3307a20c3714f0f56e2b3a29c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6c1b3623210158058a24ce24e56f1d223a4ca3307a20c3714f0f56e2b3a29c4","first_computed_at":"2026-05-18T02:39:24.928512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:24.928512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"awoC4xu+3xru/pH6yy3rjrd2mEwHXCkzGpOCY5z3K2Rik3621c+Ll2MzMH+s0l+7LJ+70Tx30oXnPjbS2MUOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:24.928929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc12aa584b2bf18bf26bd96a06c7c4229386113a6dfeb7e1dfb6b815a81884c2","sha256:5ea89b62fc6018342f1494797e59e56021cbe5d183685043f4b4eda164619687"],"state_sha256":"13a99ef09731c811116b8c0a6955052309b291b7ab6830145f0b45c9c38b4629"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cu1CmCeZsaa+YIUzpfVy5xjJwPnG1cLB2BUY4WxSZv0ZP8FqYAUCvF99Zl7kMUQ5MXckJe+qFYPdHI3feRlZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:33:13.359815Z","bundle_sha256":"3939c570b9a4ae727b969bc5db12ff51b789815a9441c32fa13e24efd7495346"}}