{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:F7HCHFXV4TMM5BEUA5LPI6NH4H","short_pith_number":"pith:F7HCHFXV","canonical_record":{"source":{"id":"1202.6078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T21:33:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"89c2e071d31f5ff41dcc579b930ab31b194152fcce7a3b28a159b1513f2a1c6a","abstract_canon_sha256":"781a0ad73b49a9b89e226b6c61b062c1cb7dfa870045845a216d918a87ebbee5"},"schema_version":"1.0"},"canonical_sha256":"2fce2396f5e4d8ce84940756f479a7e1d4abdca6500e15de68aad5e271a3a494","source":{"kind":"arxiv","id":"1202.6078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6078","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6078v1","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6078","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"F7HCHFXV4TMM","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F7HCHFXV4TMM5BEU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F7HCHFXV","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:F7HCHFXV4TMM5BEUA5LPI6NH4H","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T21:33:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"89c2e071d31f5ff41dcc579b930ab31b194152fcce7a3b28a159b1513f2a1c6a","abstract_canon_sha256":"781a0ad73b49a9b89e226b6c61b062c1cb7dfa870045845a216d918a87ebbee5"},"schema_version":"1.0"},"canonical_sha256":"2fce2396f5e4d8ce84940756f479a7e1d4abdca6500e15de68aad5e271a3a494","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:51.319004Z","signature_b64":"fdTxGCPyRes1YJY1SFev2Cu9r8JfQX8r/LFHc5IVPGr89g5W6EIo+MTehzuqsPmy55KUhNked8LAxgDlxEHlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fce2396f5e4d8ce84940756f479a7e1d4abdca6500e15de68aad5e271a3a494","last_reissued_at":"2026-05-18T04:00:51.318599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:51.318599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6078","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-18T04:00:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/16ne0WRjvjOhSYhIk6a4k3FCd+CQzHtg7LYivf2JkObsME1wQKRmPLFF1qeGagbbtx6PCXBIUGLI1rdUd32Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:16:12.218489Z"},"content_sha256":"a657211440f44d6c434c6bcd371cba017c62403172af5cb2c633038c782e706a","schema_version":"1.0","event_id":"sha256:a657211440f44d6c434c6bcd371cba017c62403172af5cb2c633038c782e706a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:F7HCHFXV4TMM5BEUA5LPI6NH4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Protocols for Learning Classifiers on Distributed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Avishek Saha, Hal Daume III, Jeff M. Phillips, Suresh Venkatasubramanian","submitted_at":"2012-02-27T21:33:32Z","abstract_excerpt":"We consider the problem of learning classifiers for labeled data that has been distributed across several nodes. Our goal is to find a single classifier, with small approximation error, across all datasets while minimizing the communication between nodes. This setting models real-world communication bottlenecks in the processing of massive distributed datasets. We present several very general sampling-based solutions as well as some two-way protocols which have a provable exponential speed-up over any one-way protocol. We focus on core problems for noiseless data distributed across two or more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6078","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-18T04:00:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CoHOmHwwZKa4oRU9yV3ClCiHgeXtwfPSyjJocanGAMIDZuyLI/QjVjrlXvsljzX4KYDd4Kfc+hTleRA2yLBCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:16:12.219382Z"},"content_sha256":"472cd1d29ed73078657f026eefe7ef11b17f167aa114401a37f8a7d0eac667bb","schema_version":"1.0","event_id":"sha256:472cd1d29ed73078657f026eefe7ef11b17f167aa114401a37f8a7d0eac667bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7HCHFXV4TMM5BEUA5LPI6NH4H/bundle.json","state_url":"https://pith.science/pith/F7HCHFXV4TMM5BEUA5LPI6NH4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7HCHFXV4TMM5BEUA5LPI6NH4H/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-31T12:16:12Z","links":{"resolver":"https://pith.science/pith/F7HCHFXV4TMM5BEUA5LPI6NH4H","bundle":"https://pith.science/pith/F7HCHFXV4TMM5BEUA5LPI6NH4H/bundle.json","state":"https://pith.science/pith/F7HCHFXV4TMM5BEUA5LPI6NH4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7HCHFXV4TMM5BEUA5LPI6NH4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F7HCHFXV4TMM5BEUA5LPI6NH4H","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":"781a0ad73b49a9b89e226b6c61b062c1cb7dfa870045845a216d918a87ebbee5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T21:33:32Z","title_canon_sha256":"89c2e071d31f5ff41dcc579b930ab31b194152fcce7a3b28a159b1513f2a1c6a"},"schema_version":"1.0","source":{"id":"1202.6078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6078","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6078v1","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6078","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"F7HCHFXV4TMM","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F7HCHFXV4TMM5BEU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F7HCHFXV","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:472cd1d29ed73078657f026eefe7ef11b17f167aa114401a37f8a7d0eac667bb","target":"graph","created_at":"2026-05-18T04:00:51Z","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":"We consider the problem of learning classifiers for labeled data that has been distributed across several nodes. Our goal is to find a single classifier, with small approximation error, across all datasets while minimizing the communication between nodes. This setting models real-world communication bottlenecks in the processing of massive distributed datasets. We present several very general sampling-based solutions as well as some two-way protocols which have a provable exponential speed-up over any one-way protocol. We focus on core problems for noiseless data distributed across two or more","authors_text":"Avishek Saha, Hal Daume III, Jeff M. Phillips, Suresh Venkatasubramanian","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T21:33:32Z","title":"Protocols for Learning Classifiers on Distributed Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6078","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:a657211440f44d6c434c6bcd371cba017c62403172af5cb2c633038c782e706a","target":"record","created_at":"2026-05-18T04:00:51Z","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":"781a0ad73b49a9b89e226b6c61b062c1cb7dfa870045845a216d918a87ebbee5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T21:33:32Z","title_canon_sha256":"89c2e071d31f5ff41dcc579b930ab31b194152fcce7a3b28a159b1513f2a1c6a"},"schema_version":"1.0","source":{"id":"1202.6078","kind":"arxiv","version":1}},"canonical_sha256":"2fce2396f5e4d8ce84940756f479a7e1d4abdca6500e15de68aad5e271a3a494","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fce2396f5e4d8ce84940756f479a7e1d4abdca6500e15de68aad5e271a3a494","first_computed_at":"2026-05-18T04:00:51.318599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:51.318599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fdTxGCPyRes1YJY1SFev2Cu9r8JfQX8r/LFHc5IVPGr89g5W6EIo+MTehzuqsPmy55KUhNked8LAxgDlxEHlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:51.319004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a657211440f44d6c434c6bcd371cba017c62403172af5cb2c633038c782e706a","sha256:472cd1d29ed73078657f026eefe7ef11b17f167aa114401a37f8a7d0eac667bb"],"state_sha256":"65589f550e0c35b982c05f39a1527ce493a0c395f8f7869467e19539c7567d7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLG5ts2uAJFdEbCDl1lRez7QQJWen96vb1qd9eOOqpi7/4qb/cvjXvIxjGkgUB23YxBdMruruBE6IwA6t+pAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:16:12.223855Z","bundle_sha256":"49f5df84c8d5adf5736365f134c33e2aea9e9bffdecab8bb3093a78f63aed91f"}}