{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NM2FOENF4XSA6VXBD7LJHWR5WP","short_pith_number":"pith:NM2FOENF","canonical_record":{"source":{"id":"1811.01564","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-05T09:23:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1e2c441dbdfe2f629e47b46f322e36647cacf85da3205a406c995d4585b281ee","abstract_canon_sha256":"906788c38a4217289ea2eb60418f7ec96fdd2f3e330bbf9ee366c742bdaf5a0c"},"schema_version":"1.0"},"canonical_sha256":"6b345711a5e5e40f56e11fd693da3db3dd332e3a92355284ac44afc5d5028cf2","source":{"kind":"arxiv","id":"1811.01564","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01564","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01564v2","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01564","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"NM2FOENF4XSA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NM2FOENF4XSA6VXB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NM2FOENF","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NM2FOENF4XSA6VXBD7LJHWR5WP","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01564","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-05T09:23:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1e2c441dbdfe2f629e47b46f322e36647cacf85da3205a406c995d4585b281ee","abstract_canon_sha256":"906788c38a4217289ea2eb60418f7ec96fdd2f3e330bbf9ee366c742bdaf5a0c"},"schema_version":"1.0"},"canonical_sha256":"6b345711a5e5e40f56e11fd693da3db3dd332e3a92355284ac44afc5d5028cf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:56.906844Z","signature_b64":"X6ikCmuFokYolZnDt+eOx0oEXnGnHpj+RhvXnWuXdMO9C0JoFAYmsgMMAZm1LQCp+C5P+mKJStx++DB5BMgPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b345711a5e5e40f56e11fd693da3db3dd332e3a92355284ac44afc5d5028cf2","last_reissued_at":"2026-05-17T23:57:56.906162Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:56.906162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01564","source_version":2,"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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOhgvbgfrYPDNSctmflKoB58ydE1Tt/P+t5ibR8hNcVM1ZWubBFXYJMk/aVLkAbBO0KC/Rehgkbir2XkX8gYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:27:07.887448Z"},"content_sha256":"dfb3eac4534f88bf29fa22cc8b5b62a04eaf733d4ea2f362a1a70051d6089fe2","schema_version":"1.0","event_id":"sha256:dfb3eac4534f88bf29fa22cc8b5b62a04eaf733d4ea2f362a1a70051d6089fe2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NM2FOENF4XSA6VXBD7LJHWR5WP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel training of linear models without compromising convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Celestine D\\\"unner, Kornilios Kourtis, Nikolas Ioannou, Thomas Parnell","submitted_at":"2018-11-05T09:23:41Z","abstract_excerpt":"In this paper we analyze, evaluate, and improve the performance of training generalized linear models on modern CPUs. We start with a state-of-the-art asynchronous parallel training algorithm, identify system-level performance bottlenecks, and apply optimizations that improve data parallelism, cache line locality, and cache line prefetching of the algorithm. These modifications reduce the per-epoch run-time significantly, but take a toll on algorithm convergence in terms of the required number of epochs. To alleviate these shortcomings of our systems-optimized version, we propose a novel, dyna"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01564","kind":"arxiv","version":2},"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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+7rJKh9iHcxpvjklGCY3EshFqmOwG3Gta04u/hrn1Z/TAdc0ziqi008L82gnPyluivECMITEDnwUpOZG0l9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:27:07.887833Z"},"content_sha256":"8e2d56c2c8b5acf041388b32b2bd919d001447fb19a24a9117468594c7a7466d","schema_version":"1.0","event_id":"sha256:8e2d56c2c8b5acf041388b32b2bd919d001447fb19a24a9117468594c7a7466d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/bundle.json","state_url":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/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-26T02:27:07Z","links":{"resolver":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP","bundle":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/bundle.json","state":"https://pith.science/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NM2FOENF4XSA6VXBD7LJHWR5WP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NM2FOENF4XSA6VXBD7LJHWR5WP","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":"906788c38a4217289ea2eb60418f7ec96fdd2f3e330bbf9ee366c742bdaf5a0c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-05T09:23:41Z","title_canon_sha256":"1e2c441dbdfe2f629e47b46f322e36647cacf85da3205a406c995d4585b281ee"},"schema_version":"1.0","source":{"id":"1811.01564","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01564","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01564v2","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01564","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"NM2FOENF4XSA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NM2FOENF4XSA6VXB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NM2FOENF","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:8e2d56c2c8b5acf041388b32b2bd919d001447fb19a24a9117468594c7a7466d","target":"graph","created_at":"2026-05-17T23:57:56Z","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 this paper we analyze, evaluate, and improve the performance of training generalized linear models on modern CPUs. We start with a state-of-the-art asynchronous parallel training algorithm, identify system-level performance bottlenecks, and apply optimizations that improve data parallelism, cache line locality, and cache line prefetching of the algorithm. These modifications reduce the per-epoch run-time significantly, but take a toll on algorithm convergence in terms of the required number of epochs. To alleviate these shortcomings of our systems-optimized version, we propose a novel, dyna","authors_text":"Celestine D\\\"unner, Kornilios Kourtis, Nikolas Ioannou, Thomas Parnell","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-05T09:23:41Z","title":"Parallel training of linear models without compromising convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01564","kind":"arxiv","version":2},"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:dfb3eac4534f88bf29fa22cc8b5b62a04eaf733d4ea2f362a1a70051d6089fe2","target":"record","created_at":"2026-05-17T23:57:56Z","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":"906788c38a4217289ea2eb60418f7ec96fdd2f3e330bbf9ee366c742bdaf5a0c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-05T09:23:41Z","title_canon_sha256":"1e2c441dbdfe2f629e47b46f322e36647cacf85da3205a406c995d4585b281ee"},"schema_version":"1.0","source":{"id":"1811.01564","kind":"arxiv","version":2}},"canonical_sha256":"6b345711a5e5e40f56e11fd693da3db3dd332e3a92355284ac44afc5d5028cf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b345711a5e5e40f56e11fd693da3db3dd332e3a92355284ac44afc5d5028cf2","first_computed_at":"2026-05-17T23:57:56.906162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:56.906162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X6ikCmuFokYolZnDt+eOx0oEXnGnHpj+RhvXnWuXdMO9C0JoFAYmsgMMAZm1LQCp+C5P+mKJStx++DB5BMgPBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:56.906844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01564","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfb3eac4534f88bf29fa22cc8b5b62a04eaf733d4ea2f362a1a70051d6089fe2","sha256:8e2d56c2c8b5acf041388b32b2bd919d001447fb19a24a9117468594c7a7466d"],"state_sha256":"6922deabad2132e1d69cf5d9622268426aa58283d8ae53eca6537788d11e4aee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYbGps8wWecRA8/A5BqWSL+QB2FfgCfAXiJx26Q2D/LrLcni2LIcyPVDK8bTLOXohV7mCmFTLN1Wt1yaHBTLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:27:07.890639Z","bundle_sha256":"088e46a47a131abdc60ee35e6b499cbaefb4252a378b04865ad8508aa4a13b28"}}