{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:72NI3DEXDUDNXP24X77E2Y67WP","short_pith_number":"pith:72NI3DEX","canonical_record":{"source":{"id":"1310.8418","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-31T08:00:21Z","cross_cats_sorted":[],"title_canon_sha256":"70187ccf89028ac98daa4cdc83a3737def3ebe9e1640ced7db3ed5602ea16793","abstract_canon_sha256":"788182bf66500eb537b857702718bcba1be68e90fee2ac38cd58ab609499526e"},"schema_version":"1.0"},"canonical_sha256":"fe9a8d8c971d06dbbf5cbffe4d63dfb3f7e644a7c58a2f45548cac8ec5734d44","source":{"kind":"arxiv","id":"1310.8418","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8418","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8418v4","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8418","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"72NI3DEXDUDN","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"72NI3DEXDUDNXP24","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"72NI3DEX","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:72NI3DEXDUDNXP24X77E2Y67WP","target":"record","payload":{"canonical_record":{"source":{"id":"1310.8418","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-31T08:00:21Z","cross_cats_sorted":[],"title_canon_sha256":"70187ccf89028ac98daa4cdc83a3737def3ebe9e1640ced7db3ed5602ea16793","abstract_canon_sha256":"788182bf66500eb537b857702718bcba1be68e90fee2ac38cd58ab609499526e"},"schema_version":"1.0"},"canonical_sha256":"fe9a8d8c971d06dbbf5cbffe4d63dfb3f7e644a7c58a2f45548cac8ec5734d44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:30.069155Z","signature_b64":"9NOU9bKN3icu0HrupIeQvu3TfAw+ynhh19ToOHzQF3rCoF4EIdHFFtzPh5A3jYtTd3afdkGPYL8RPqcbp+A3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe9a8d8c971d06dbbf5cbffe4d63dfb3f7e644a7c58a2f45548cac8ec5734d44","last_reissued_at":"2026-05-18T02:22:30.068568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:30.068568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.8418","source_version":4,"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:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSgnM1od63dhYmRv9WyHUfF0ti+nNfvLApbyTPl+xGm4Dx+BGcEHThwC2irC9v/yxvXpsuZq/R1hmp3zCLjjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:08:21.157742Z"},"content_sha256":"f7afd397399b36e39de98be53770a1724a4020844dcb74aea0fca80fcd408341","schema_version":"1.0","event_id":"sha256:f7afd397399b36e39de98be53770a1724a4020844dcb74aea0fca80fcd408341"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:72NI3DEXDUDNXP24X77E2Y67WP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient distributed learning algorithm based on effective local functional approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dhruv Mahajan, Leon Bottou, Nikunj Agrawal, S. Sathiya Keerthi, S. Sundararajan","submitted_at":"2013-10-31T08:00:21Z","abstract_excerpt":"Scalable machine learning over big data is an important problem that is receiving a lot of attention in recent years. On popular distributed environments such as Hadoop running on a cluster of commodity machines, communication costs are substantial and algorithms need to be designed suitably considering those costs. In this paper we give a novel approach to the distributed training of linear classifiers (involving smooth losses and L2 regularization) that is designed to reduce the total communication costs. At each iteration, the nodes minimize locally formed approximate objective functions; t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8418","kind":"arxiv","version":4},"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:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnI/f/oWLLdte3xcQQxb6SQFJqnkhEoIGf8jFvImeqMEmc6TjQUKO0ok3QfZupSWo+ZMxmoWtkXfPy+c4tv1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:08:21.158544Z"},"content_sha256":"aa9aedc0b486b89e3afcfbd799ba5a06aba159f9832364bce4984c899778a032","schema_version":"1.0","event_id":"sha256:aa9aedc0b486b89e3afcfbd799ba5a06aba159f9832364bce4984c899778a032"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72NI3DEXDUDNXP24X77E2Y67WP/bundle.json","state_url":"https://pith.science/pith/72NI3DEXDUDNXP24X77E2Y67WP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72NI3DEXDUDNXP24X77E2Y67WP/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-09T19:08:21Z","links":{"resolver":"https://pith.science/pith/72NI3DEXDUDNXP24X77E2Y67WP","bundle":"https://pith.science/pith/72NI3DEXDUDNXP24X77E2Y67WP/bundle.json","state":"https://pith.science/pith/72NI3DEXDUDNXP24X77E2Y67WP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72NI3DEXDUDNXP24X77E2Y67WP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:72NI3DEXDUDNXP24X77E2Y67WP","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":"788182bf66500eb537b857702718bcba1be68e90fee2ac38cd58ab609499526e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-31T08:00:21Z","title_canon_sha256":"70187ccf89028ac98daa4cdc83a3737def3ebe9e1640ced7db3ed5602ea16793"},"schema_version":"1.0","source":{"id":"1310.8418","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8418","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8418v4","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8418","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"72NI3DEXDUDN","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"72NI3DEXDUDNXP24","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"72NI3DEX","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:aa9aedc0b486b89e3afcfbd799ba5a06aba159f9832364bce4984c899778a032","target":"graph","created_at":"2026-05-18T02:22:30Z","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":"Scalable machine learning over big data is an important problem that is receiving a lot of attention in recent years. On popular distributed environments such as Hadoop running on a cluster of commodity machines, communication costs are substantial and algorithms need to be designed suitably considering those costs. In this paper we give a novel approach to the distributed training of linear classifiers (involving smooth losses and L2 regularization) that is designed to reduce the total communication costs. At each iteration, the nodes minimize locally formed approximate objective functions; t","authors_text":"Dhruv Mahajan, Leon Bottou, Nikunj Agrawal, S. Sathiya Keerthi, S. Sundararajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-31T08:00:21Z","title":"An efficient distributed learning algorithm based on effective local functional approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8418","kind":"arxiv","version":4},"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:f7afd397399b36e39de98be53770a1724a4020844dcb74aea0fca80fcd408341","target":"record","created_at":"2026-05-18T02:22:30Z","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":"788182bf66500eb537b857702718bcba1be68e90fee2ac38cd58ab609499526e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-31T08:00:21Z","title_canon_sha256":"70187ccf89028ac98daa4cdc83a3737def3ebe9e1640ced7db3ed5602ea16793"},"schema_version":"1.0","source":{"id":"1310.8418","kind":"arxiv","version":4}},"canonical_sha256":"fe9a8d8c971d06dbbf5cbffe4d63dfb3f7e644a7c58a2f45548cac8ec5734d44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe9a8d8c971d06dbbf5cbffe4d63dfb3f7e644a7c58a2f45548cac8ec5734d44","first_computed_at":"2026-05-18T02:22:30.068568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:30.068568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9NOU9bKN3icu0HrupIeQvu3TfAw+ynhh19ToOHzQF3rCoF4EIdHFFtzPh5A3jYtTd3afdkGPYL8RPqcbp+A3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:30.069155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.8418","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7afd397399b36e39de98be53770a1724a4020844dcb74aea0fca80fcd408341","sha256:aa9aedc0b486b89e3afcfbd799ba5a06aba159f9832364bce4984c899778a032"],"state_sha256":"389f8a99174b362e80c1428b4703c4169546a1783317e633521c84716e542d79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JlVpE6EmaSAEL3S3g4iYln1tqemulQf36ocRnhRIoRh3SyQ5MC0cBbzmBcSRZIgCzI2MWYANy2kkXnsUm9EBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:08:21.162856Z","bundle_sha256":"7a2e72114835d197f1e032a12a13204f87f30e029b075a3b7b6cd5fee8d33e2c"}}