{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GTFEWSP6W66UW77FG2E6NLQAKI","short_pith_number":"pith:GTFEWSP6","canonical_record":{"source":{"id":"1408.2041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:38:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"857ceee70bfc92afbfea88a21ed8d98f1e1b7f5106c248f36ce94f9179f60d51","abstract_canon_sha256":"f164e017ecc8489aed5ae97d7e1745fa169f8f844fcfdfd4a728c0d4d34e3e6e"},"schema_version":"1.0"},"canonical_sha256":"34ca4b49feb7bd4b7fe53689e6ae00520c0f4f8f78138bc0e45ae07d32bc5089","source":{"kind":"arxiv","id":"1408.2041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2041","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2041v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2041","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"GTFEWSP6W66U","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GTFEWSP6W66UW77F","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GTFEWSP6","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GTFEWSP6W66UW77FG2E6NLQAKI","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:38:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"857ceee70bfc92afbfea88a21ed8d98f1e1b7f5106c248f36ce94f9179f60d51","abstract_canon_sha256":"f164e017ecc8489aed5ae97d7e1745fa169f8f844fcfdfd4a728c0d4d34e3e6e"},"schema_version":"1.0"},"canonical_sha256":"34ca4b49feb7bd4b7fe53689e6ae00520c0f4f8f78138bc0e45ae07d32bc5089","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.604304Z","signature_b64":"PrmgVc2mnOLeKNJNKkYSnohdTkWxa3GmO5OA5nUhWcP4hR0S3KDDG4c86XOqrkGQaRvGIdcTeEW9ZTKCukI9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34ca4b49feb7bd4b7fe53689e6ae00520c0f4f8f78138bc0e45ae07d32bc5089","last_reissued_at":"2026-05-18T02:45:30.603655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.603655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2041","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-18T02:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvO3p1iTMtCkEECNgJqviJWVTvXUY2vMyhNsmu0rFOn7JPJOIiq7LSyluDC0iMBV6x0mMkOXsGolw/0Pnh8DDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:48:28.511668Z"},"content_sha256":"554a681e69b34f8bd456f0e3e3515e526ff3ff46aa45e8e55291ac1d3a17ec40","schema_version":"1.0","event_id":"sha256:554a681e69b34f8bd456f0e3e3515e526ff3ff46aa45e8e55291ac1d3a17ec40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GTFEWSP6W66UW77FG2E6NLQAKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphLab: A New Framework For Parallel Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Aapo Kyrola, Carlos E. Guestrin, Danny Bickson, Joseph E. Gonzalez, Joseph Hellerstein, Yucheng Low","submitted_at":"2014-08-09T05:38:37Z","abstract_excerpt":"Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insufficiently expressive while low-level tools like MPI and Pthreads leave ML experts repeatedly solving the same design challenges. By targeting common patterns in ML, we developed GraphLab, which improves upon abstractions like MapReduce by compactly expressing asynchronous iterative algorithms with sparse computational dependencies while ensuring data consistency and achieving a high degree of parallel performance. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2041","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-18T02:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uF9k4jLkPHdnzt6UP3EE45e1LkfnsqXtUW+xJ0LcrdBmNLzhsYYQaiegseKA2Yz14q/5J8iHPWsQHHvYux2kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:48:28.512381Z"},"content_sha256":"70dfade50c40c3e85b59d2d95b238f05c389b940f3fea37c0beb85c362f16fe4","schema_version":"1.0","event_id":"sha256:70dfade50c40c3e85b59d2d95b238f05c389b940f3fea37c0beb85c362f16fe4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTFEWSP6W66UW77FG2E6NLQAKI/bundle.json","state_url":"https://pith.science/pith/GTFEWSP6W66UW77FG2E6NLQAKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTFEWSP6W66UW77FG2E6NLQAKI/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-27T21:48:28Z","links":{"resolver":"https://pith.science/pith/GTFEWSP6W66UW77FG2E6NLQAKI","bundle":"https://pith.science/pith/GTFEWSP6W66UW77FG2E6NLQAKI/bundle.json","state":"https://pith.science/pith/GTFEWSP6W66UW77FG2E6NLQAKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTFEWSP6W66UW77FG2E6NLQAKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GTFEWSP6W66UW77FG2E6NLQAKI","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":"f164e017ecc8489aed5ae97d7e1745fa169f8f844fcfdfd4a728c0d4d34e3e6e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:38:37Z","title_canon_sha256":"857ceee70bfc92afbfea88a21ed8d98f1e1b7f5106c248f36ce94f9179f60d51"},"schema_version":"1.0","source":{"id":"1408.2041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2041","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2041v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2041","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"GTFEWSP6W66U","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GTFEWSP6W66UW77F","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GTFEWSP6","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:70dfade50c40c3e85b59d2d95b238f05c389b940f3fea37c0beb85c362f16fe4","target":"graph","created_at":"2026-05-18T02:45: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":"Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insufficiently expressive while low-level tools like MPI and Pthreads leave ML experts repeatedly solving the same design challenges. By targeting common patterns in ML, we developed GraphLab, which improves upon abstractions like MapReduce by compactly expressing asynchronous iterative algorithms with sparse computational dependencies while ensuring data consistency and achieving a high degree of parallel performance. We ","authors_text":"Aapo Kyrola, Carlos E. Guestrin, Danny Bickson, Joseph E. Gonzalez, Joseph Hellerstein, Yucheng Low","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:38:37Z","title":"GraphLab: A New Framework For Parallel Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2041","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:554a681e69b34f8bd456f0e3e3515e526ff3ff46aa45e8e55291ac1d3a17ec40","target":"record","created_at":"2026-05-18T02:45: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":"f164e017ecc8489aed5ae97d7e1745fa169f8f844fcfdfd4a728c0d4d34e3e6e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:38:37Z","title_canon_sha256":"857ceee70bfc92afbfea88a21ed8d98f1e1b7f5106c248f36ce94f9179f60d51"},"schema_version":"1.0","source":{"id":"1408.2041","kind":"arxiv","version":1}},"canonical_sha256":"34ca4b49feb7bd4b7fe53689e6ae00520c0f4f8f78138bc0e45ae07d32bc5089","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34ca4b49feb7bd4b7fe53689e6ae00520c0f4f8f78138bc0e45ae07d32bc5089","first_computed_at":"2026-05-18T02:45:30.603655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:30.603655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PrmgVc2mnOLeKNJNKkYSnohdTkWxa3GmO5OA5nUhWcP4hR0S3KDDG4c86XOqrkGQaRvGIdcTeEW9ZTKCukI9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:30.604304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:554a681e69b34f8bd456f0e3e3515e526ff3ff46aa45e8e55291ac1d3a17ec40","sha256:70dfade50c40c3e85b59d2d95b238f05c389b940f3fea37c0beb85c362f16fe4"],"state_sha256":"a3ad6a8fafe298dd8acb1b5c988e0b46284ae414690c2c7f571564bc5b570a1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fL//5UbjHD/xxrDwNxivL5oSZFs3yu2bwy39Cqk6BAZGyCpPKFA5RsVvlCG0SLeVYyoKNT3KiYiKfVFswZaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:48:28.515719Z","bundle_sha256":"4f08a09cbe7f92991b6675cbdb2e33d3c1a1812d37956063fe43def54e9ea600"}}