{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WZWHREPN7TZ4XAZN7CPZYGCJLD","short_pith_number":"pith:WZWHREPN","canonical_record":{"source":{"id":"1312.5766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-19T22:05:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"22580670d07b7438ac70c2d655e855ffc04ad8a4881a969ce7fb5024d8c4314a","abstract_canon_sha256":"052f6f0894c43a3f520fd03e2e8fd2683a36c0d6114c34c180519767c8c96c58"},"schema_version":"1.0"},"canonical_sha256":"b66c7891edfcf3cb832df89f9c184958c79c111bccc1aa4ce51245c8d728467d","source":{"kind":"arxiv","id":"1312.5766","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5766","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5766v2","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5766","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"WZWHREPN7TZ4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WZWHREPN7TZ4XAZN","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WZWHREPN","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WZWHREPN7TZ4XAZN7CPZYGCJLD","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-19T22:05:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"22580670d07b7438ac70c2d655e855ffc04ad8a4881a969ce7fb5024d8c4314a","abstract_canon_sha256":"052f6f0894c43a3f520fd03e2e8fd2683a36c0d6114c34c180519767c8c96c58"},"schema_version":"1.0"},"canonical_sha256":"b66c7891edfcf3cb832df89f9c184958c79c111bccc1aa4ce51245c8d728467d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:43.815463Z","signature_b64":"jhAJUG1El/e/KQ5b279yunOTrz7f+vFUfYkOpkX77yOikJr7OA/BFDBI9gOogbY5MEKoXTBG/0Husbl/RNX2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b66c7891edfcf3cb832df89f9c184958c79c111bccc1aa4ce51245c8d728467d","last_reissued_at":"2026-05-18T03:03:43.814751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:43.814751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5766","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-18T03:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzbeXPIWERfbb6Bk4/oa3FeMabmtZuynN5fUqPTpqZknauviF3z+Adntn2RD5cH8nhB+ncCV1mkea+vBzxZKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:11:26.901962Z"},"content_sha256":"40cc525cef0f3da1af81ab1e92622af6fbac1d95a700c088c3911248040936d3","schema_version":"1.0","event_id":"sha256:40cc525cef0f3da1af81ab1e92622af6fbac1d95a700c088c3911248040936d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WZWHREPN7TZ4XAZN7CPZYGCJLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure-Aware Dynamic Scheduler for Parallel Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Eric P. Xing, Garth A. Gibson, Jin Kyu Kim, Qirong Ho, Seunghak Lee","submitted_at":"2013-12-19T22:05:11Z","abstract_excerpt":"Training large machine learning (ML) models with many variables or parameters can take a long time if one employs sequential procedures even with stochastic updates. A natural solution is to turn to distributed computing on a cluster; however, naive, unstructured parallelization of ML algorithms does not usually lead to a proportional speedup and can even result in divergence, because dependencies between model elements can attenuate the computational gains from parallelization and compromise correctness of inference. Recent efforts toward this issue have benefited from exploiting the static, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5766","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-18T03:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwBmWCIP+3ht7xct7EU7I6PbuTgmCwPvQfpnWjW+AjNk6QnDO2OvOb4A1SuX7ntYdyJYZXpkIAnXgR7391YhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:11:26.902293Z"},"content_sha256":"e2532f34f2976d18b1c3a2452e11d605fbd9d64f36ba2e483228d7712cb92564","schema_version":"1.0","event_id":"sha256:e2532f34f2976d18b1c3a2452e11d605fbd9d64f36ba2e483228d7712cb92564"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZWHREPN7TZ4XAZN7CPZYGCJLD/bundle.json","state_url":"https://pith.science/pith/WZWHREPN7TZ4XAZN7CPZYGCJLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZWHREPN7TZ4XAZN7CPZYGCJLD/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-01T12:11:26Z","links":{"resolver":"https://pith.science/pith/WZWHREPN7TZ4XAZN7CPZYGCJLD","bundle":"https://pith.science/pith/WZWHREPN7TZ4XAZN7CPZYGCJLD/bundle.json","state":"https://pith.science/pith/WZWHREPN7TZ4XAZN7CPZYGCJLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZWHREPN7TZ4XAZN7CPZYGCJLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WZWHREPN7TZ4XAZN7CPZYGCJLD","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":"052f6f0894c43a3f520fd03e2e8fd2683a36c0d6114c34c180519767c8c96c58","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-19T22:05:11Z","title_canon_sha256":"22580670d07b7438ac70c2d655e855ffc04ad8a4881a969ce7fb5024d8c4314a"},"schema_version":"1.0","source":{"id":"1312.5766","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5766","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5766v2","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5766","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"WZWHREPN7TZ4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WZWHREPN7TZ4XAZN","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WZWHREPN","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:e2532f34f2976d18b1c3a2452e11d605fbd9d64f36ba2e483228d7712cb92564","target":"graph","created_at":"2026-05-18T03:03:43Z","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":"Training large machine learning (ML) models with many variables or parameters can take a long time if one employs sequential procedures even with stochastic updates. A natural solution is to turn to distributed computing on a cluster; however, naive, unstructured parallelization of ML algorithms does not usually lead to a proportional speedup and can even result in divergence, because dependencies between model elements can attenuate the computational gains from parallelization and compromise correctness of inference. Recent efforts toward this issue have benefited from exploiting the static, ","authors_text":"Eric P. Xing, Garth A. Gibson, Jin Kyu Kim, Qirong Ho, Seunghak Lee","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-19T22:05:11Z","title":"Structure-Aware Dynamic Scheduler for Parallel Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5766","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:40cc525cef0f3da1af81ab1e92622af6fbac1d95a700c088c3911248040936d3","target":"record","created_at":"2026-05-18T03:03:43Z","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":"052f6f0894c43a3f520fd03e2e8fd2683a36c0d6114c34c180519767c8c96c58","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-19T22:05:11Z","title_canon_sha256":"22580670d07b7438ac70c2d655e855ffc04ad8a4881a969ce7fb5024d8c4314a"},"schema_version":"1.0","source":{"id":"1312.5766","kind":"arxiv","version":2}},"canonical_sha256":"b66c7891edfcf3cb832df89f9c184958c79c111bccc1aa4ce51245c8d728467d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b66c7891edfcf3cb832df89f9c184958c79c111bccc1aa4ce51245c8d728467d","first_computed_at":"2026-05-18T03:03:43.814751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:43.814751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jhAJUG1El/e/KQ5b279yunOTrz7f+vFUfYkOpkX77yOikJr7OA/BFDBI9gOogbY5MEKoXTBG/0Husbl/RNX2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:43.815463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5766","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40cc525cef0f3da1af81ab1e92622af6fbac1d95a700c088c3911248040936d3","sha256:e2532f34f2976d18b1c3a2452e11d605fbd9d64f36ba2e483228d7712cb92564"],"state_sha256":"8ef9a89b11da041127c8b4109afcf564ac0744c46d65cc67f20a8e33b7c17c81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yyr2QTEtxC4fmL3yIOCY7uka2dVljlFj7Xt7/1FfB6SK0Srq1oC4soNSEi44dTpsIZhaYSVZaeQX6hb2LB5fDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:11:26.904102Z","bundle_sha256":"acc3d106df7d5261e1e25078fcf62d9b55c319a61d7c7a71916365f85095500e"}}