{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:64BIMPPKEHSCAQ7XD3R7X5TRQM","short_pith_number":"pith:64BIMPPK","canonical_record":{"source":{"id":"1204.3523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-04-16T15:25:50Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"679a85d7292d0c8618c0e33199305b2471b2dc6956402d3197deafc1795f0109","abstract_canon_sha256":"a5fd8d0a1be19942511d43db66ce3e9564e89f98edc7b4b1b05c954a75bd42d1"},"schema_version":"1.0"},"canonical_sha256":"f702863dea21e42043f71ee3fbf671832271cc4c895b843a81991bee7b0c7af2","source":{"kind":"arxiv","id":"1204.3523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3523","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3523v1","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3523","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"64BIMPPKEHSC","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"64BIMPPKEHSCAQ7X","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"64BIMPPK","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:64BIMPPKEHSCAQ7XD3R7X5TRQM","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-04-16T15:25:50Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"679a85d7292d0c8618c0e33199305b2471b2dc6956402d3197deafc1795f0109","abstract_canon_sha256":"a5fd8d0a1be19942511d43db66ce3e9564e89f98edc7b4b1b05c954a75bd42d1"},"schema_version":"1.0"},"canonical_sha256":"f702863dea21e42043f71ee3fbf671832271cc4c895b843a81991bee7b0c7af2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:51.314094Z","signature_b64":"OJKu4YrQxLj8P8USOiC+NykxfZGa6C6xudj0kr3ntTz4mHt30JrihrEWmGm07KA3Vt/bTDy5To5Suz9q/+QWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f702863dea21e42043f71ee3fbf671832271cc4c895b843a81991bee7b0c7af2","last_reissued_at":"2026-05-18T03:57:51.313441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:51.313441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3523","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-18T03:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yC51v8KLQAhIs3rXUF6g+o/55XrDlY74BEiKs7vMp095ugXGJB7rvfzZ2Bai0j+gnYNRa7x0r1fJVhpccFVJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:45:02.824138Z"},"content_sha256":"df63a8f8730b6d94337619f4b493e5cbb752443e404618a6ccc32a4adc1e3cbf","schema_version":"1.0","event_id":"sha256:df63a8f8730b6d94337619f4b493e5cbb752443e404618a6ccc32a4adc1e3cbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:64BIMPPKEHSCAQ7XD3R7X5TRQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Protocols for Distributed Classification and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avishek Saha, Hal Daume III, Jeff M. Phillips, Suresh Venkatasubramanian","submitted_at":"2012-04-16T15:25:50Z","abstract_excerpt":"In distributed learning, the goal is to perform a learning task over data distributed across multiple nodes with minimal (expensive) communication. Prior work (Daume III et al., 2012) proposes a general model that bounds the communication required for learning classifiers while allowing for $\\eps$ training error on linearly separable data adversarially distributed across nodes.\n  In this work, we develop key improvements and extensions to this basic model. Our first result is a two-party multiplicative-weight-update based protocol that uses $O(d^2 \\log{1/\\eps})$ words of communication to class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3523","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-18T03:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gR/KXOSLjZPB7YRhDBS6hc/auNOAyFMB08oC9m1ZjMhuQn6YMYzB5jGVE5a5010D8ZsnMfM6HqUrMUiBRGUMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:45:02.824880Z"},"content_sha256":"a73e4bb51873253d6de1db933f12ab2bbe4cb7841794486f0c3fc3d6233cad6e","schema_version":"1.0","event_id":"sha256:a73e4bb51873253d6de1db933f12ab2bbe4cb7841794486f0c3fc3d6233cad6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64BIMPPKEHSCAQ7XD3R7X5TRQM/bundle.json","state_url":"https://pith.science/pith/64BIMPPKEHSCAQ7XD3R7X5TRQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64BIMPPKEHSCAQ7XD3R7X5TRQM/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-31T15:45:02Z","links":{"resolver":"https://pith.science/pith/64BIMPPKEHSCAQ7XD3R7X5TRQM","bundle":"https://pith.science/pith/64BIMPPKEHSCAQ7XD3R7X5TRQM/bundle.json","state":"https://pith.science/pith/64BIMPPKEHSCAQ7XD3R7X5TRQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64BIMPPKEHSCAQ7XD3R7X5TRQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:64BIMPPKEHSCAQ7XD3R7X5TRQM","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":"a5fd8d0a1be19942511d43db66ce3e9564e89f98edc7b4b1b05c954a75bd42d1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-04-16T15:25:50Z","title_canon_sha256":"679a85d7292d0c8618c0e33199305b2471b2dc6956402d3197deafc1795f0109"},"schema_version":"1.0","source":{"id":"1204.3523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3523","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3523v1","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3523","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"64BIMPPKEHSC","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"64BIMPPKEHSCAQ7X","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"64BIMPPK","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:a73e4bb51873253d6de1db933f12ab2bbe4cb7841794486f0c3fc3d6233cad6e","target":"graph","created_at":"2026-05-18T03:57: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":"In distributed learning, the goal is to perform a learning task over data distributed across multiple nodes with minimal (expensive) communication. Prior work (Daume III et al., 2012) proposes a general model that bounds the communication required for learning classifiers while allowing for $\\eps$ training error on linearly separable data adversarially distributed across nodes.\n  In this work, we develop key improvements and extensions to this basic model. Our first result is a two-party multiplicative-weight-update based protocol that uses $O(d^2 \\log{1/\\eps})$ words of communication to class","authors_text":"Avishek Saha, Hal Daume III, Jeff M. Phillips, Suresh Venkatasubramanian","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-04-16T15:25:50Z","title":"Efficient Protocols for Distributed Classification and Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3523","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:df63a8f8730b6d94337619f4b493e5cbb752443e404618a6ccc32a4adc1e3cbf","target":"record","created_at":"2026-05-18T03:57: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":"a5fd8d0a1be19942511d43db66ce3e9564e89f98edc7b4b1b05c954a75bd42d1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-04-16T15:25:50Z","title_canon_sha256":"679a85d7292d0c8618c0e33199305b2471b2dc6956402d3197deafc1795f0109"},"schema_version":"1.0","source":{"id":"1204.3523","kind":"arxiv","version":1}},"canonical_sha256":"f702863dea21e42043f71ee3fbf671832271cc4c895b843a81991bee7b0c7af2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f702863dea21e42043f71ee3fbf671832271cc4c895b843a81991bee7b0c7af2","first_computed_at":"2026-05-18T03:57:51.313441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:51.313441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OJKu4YrQxLj8P8USOiC+NykxfZGa6C6xudj0kr3ntTz4mHt30JrihrEWmGm07KA3Vt/bTDy5To5Suz9q/+QWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:51.314094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df63a8f8730b6d94337619f4b493e5cbb752443e404618a6ccc32a4adc1e3cbf","sha256:a73e4bb51873253d6de1db933f12ab2bbe4cb7841794486f0c3fc3d6233cad6e"],"state_sha256":"6ec703153f30d63181e276644ca41b5a3ae1f9970aeb5d362e4d8d0f49144c3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhyIJY4QdmY9jUBF1f4CEUz2j3E6m9eLJp2jWu4RY2NVk3jHPGGnp8sGC2jGRiWcA4K5UrMaUl/jhH5DwfYJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:45:02.828963Z","bundle_sha256":"89837bfd80d0f626cdd87b2ac3323b1c1e412eee8bfe3c25e790d28b4a6655e1"}}