{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:M3MKVHIWI7DQCM5BFS6KNMALA5","short_pith_number":"pith:M3MKVHIW","canonical_record":{"source":{"id":"1110.4198","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-19T07:34:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"348af51b8a28b1de5bbcc010ff71b87f3083e5f27438eb2cf69bfd0566c7ceb0","abstract_canon_sha256":"0379ecbb9472733f41ef9302335a4208c9c2bbdb8eb93d19b13d5bb779a3b0be"},"schema_version":"1.0"},"canonical_sha256":"66d8aa9d1647c70133a12cbca6b00b07479632b8dbe71933f5e6d145cbf31363","source":{"kind":"arxiv","id":"1110.4198","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4198","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4198v3","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4198","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"M3MKVHIWI7DQ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M3MKVHIWI7DQCM5B","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M3MKVHIW","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:M3MKVHIWI7DQCM5BFS6KNMALA5","target":"record","payload":{"canonical_record":{"source":{"id":"1110.4198","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-19T07:34:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"348af51b8a28b1de5bbcc010ff71b87f3083e5f27438eb2cf69bfd0566c7ceb0","abstract_canon_sha256":"0379ecbb9472733f41ef9302335a4208c9c2bbdb8eb93d19b13d5bb779a3b0be"},"schema_version":"1.0"},"canonical_sha256":"66d8aa9d1647c70133a12cbca6b00b07479632b8dbe71933f5e6d145cbf31363","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:40.542252Z","signature_b64":"Hal1ajCV8zTdq/0J1xIezIARVq2fwnqapoVWnp2oj35kP8aKOgec5SuIStRiDLp36AU2nlgIJ8r0dtXMUqU7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d8aa9d1647c70133a12cbca6b00b07479632b8dbe71933f5e6d145cbf31363","last_reissued_at":"2026-05-18T03:18:40.541543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:40.541543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.4198","source_version":3,"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:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrZ5Z8kpeyCf26xm/L0fKjhZ7aprjdefjH232pxkCtPHHMI9VPPk41MjAwCm8MM5k6BnjG724icEl+J6Wb7XAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:34:46.474167Z"},"content_sha256":"eb64ca836f9e7712304338388c2245a4cf7184c5df15652b877bc2d184ee544e","schema_version":"1.0","event_id":"sha256:eb64ca836f9e7712304338388c2245a4cf7184c5df15652b877bc2d184ee544e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:M3MKVHIWI7DQCM5BFS6KNMALA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Reliable Effective Terascale Linear Learning System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alekh Agarwal, John Langford, Miroslav Dudik, Olivier Chapelle","submitted_at":"2011-10-19T07:34:19Z","abstract_excerpt":"We present a system and a set of techniques for learning linear predictors with convex losses on terascale datasets, with trillions of features, {The number of features here refers to the number of non-zero entries in the data matrix.} billions of training examples and millions of parameters in an hour using a cluster of 1000 machines. Individually none of the component techniques are new, but the careful synthesis required to obtain an efficient implementation is. The result is, up to our knowledge, the most scalable and efficient linear learning system reported in the literature (as of 2011 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4198","kind":"arxiv","version":3},"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:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJE58TDtZGMa6j3B9msSKvqGaivXwLgF42FdBsJuhVVysQRSZjcEk02YnC/VWSigO6hpPsUrO4Aps/vCQGopDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:34:46.474829Z"},"content_sha256":"9d446fec882ad49fbbf3bdacf73b5d5ac718416c124c280d8fd456f9c385f6af","schema_version":"1.0","event_id":"sha256:9d446fec882ad49fbbf3bdacf73b5d5ac718416c124c280d8fd456f9c385f6af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3MKVHIWI7DQCM5BFS6KNMALA5/bundle.json","state_url":"https://pith.science/pith/M3MKVHIWI7DQCM5BFS6KNMALA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3MKVHIWI7DQCM5BFS6KNMALA5/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-27T02:34:46Z","links":{"resolver":"https://pith.science/pith/M3MKVHIWI7DQCM5BFS6KNMALA5","bundle":"https://pith.science/pith/M3MKVHIWI7DQCM5BFS6KNMALA5/bundle.json","state":"https://pith.science/pith/M3MKVHIWI7DQCM5BFS6KNMALA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3MKVHIWI7DQCM5BFS6KNMALA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:M3MKVHIWI7DQCM5BFS6KNMALA5","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":"0379ecbb9472733f41ef9302335a4208c9c2bbdb8eb93d19b13d5bb779a3b0be","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-19T07:34:19Z","title_canon_sha256":"348af51b8a28b1de5bbcc010ff71b87f3083e5f27438eb2cf69bfd0566c7ceb0"},"schema_version":"1.0","source":{"id":"1110.4198","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4198","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4198v3","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4198","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"M3MKVHIWI7DQ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M3MKVHIWI7DQCM5B","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M3MKVHIW","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:9d446fec882ad49fbbf3bdacf73b5d5ac718416c124c280d8fd456f9c385f6af","target":"graph","created_at":"2026-05-18T03:18:40Z","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 present a system and a set of techniques for learning linear predictors with convex losses on terascale datasets, with trillions of features, {The number of features here refers to the number of non-zero entries in the data matrix.} billions of training examples and millions of parameters in an hour using a cluster of 1000 machines. Individually none of the component techniques are new, but the careful synthesis required to obtain an efficient implementation is. The result is, up to our knowledge, the most scalable and efficient linear learning system reported in the literature (as of 2011 ","authors_text":"Alekh Agarwal, John Langford, Miroslav Dudik, Olivier Chapelle","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-19T07:34:19Z","title":"A Reliable Effective Terascale Linear Learning System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4198","kind":"arxiv","version":3},"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:eb64ca836f9e7712304338388c2245a4cf7184c5df15652b877bc2d184ee544e","target":"record","created_at":"2026-05-18T03:18:40Z","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":"0379ecbb9472733f41ef9302335a4208c9c2bbdb8eb93d19b13d5bb779a3b0be","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-19T07:34:19Z","title_canon_sha256":"348af51b8a28b1de5bbcc010ff71b87f3083e5f27438eb2cf69bfd0566c7ceb0"},"schema_version":"1.0","source":{"id":"1110.4198","kind":"arxiv","version":3}},"canonical_sha256":"66d8aa9d1647c70133a12cbca6b00b07479632b8dbe71933f5e6d145cbf31363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66d8aa9d1647c70133a12cbca6b00b07479632b8dbe71933f5e6d145cbf31363","first_computed_at":"2026-05-18T03:18:40.541543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:40.541543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hal1ajCV8zTdq/0J1xIezIARVq2fwnqapoVWnp2oj35kP8aKOgec5SuIStRiDLp36AU2nlgIJ8r0dtXMUqU7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:40.542252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4198","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb64ca836f9e7712304338388c2245a4cf7184c5df15652b877bc2d184ee544e","sha256:9d446fec882ad49fbbf3bdacf73b5d5ac718416c124c280d8fd456f9c385f6af"],"state_sha256":"3b40287188d539fa2673130d3f98749379ee8a753b47643a76319a625a38bab9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IqmpP/9XCwPk2JH5SY/E3CIl11DbY0bRKePaHGDwd9Y0aApXg3QBNFjZWSwxEG4LRtEEVZkv7qX+AVYkqeyFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:34:46.478184Z","bundle_sha256":"db5ef4ecf4578d30efc2de2c7a953145bb916a26d48f3f9964bc5f89083c81a5"}}