{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R3EXFOJQLMIWJVPHPW2UKBBMA6","short_pith_number":"pith:R3EXFOJQ","canonical_record":{"source":{"id":"1810.03530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-08T15:35:07Z","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"title_canon_sha256":"b4945ebe1dd1a61d19c698358d31867c18acd0c54d2919d153be3f3bf2df5b4b","abstract_canon_sha256":"05ce0dbbd91173bdfe2a2cd8b6b539b95124d0699a268c4553589e648918785c"},"schema_version":"1.0"},"canonical_sha256":"8ec972b9305b1164d5e77db545042c07b6e19a57677472aaf63debbe5e043ba9","source":{"kind":"arxiv","id":"1810.03530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03530","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03530v1","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03530","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"R3EXFOJQLMIW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3EXFOJQLMIWJVPH","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3EXFOJQ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R3EXFOJQLMIWJVPHPW2UKBBMA6","target":"record","payload":{"canonical_record":{"source":{"id":"1810.03530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-08T15:35:07Z","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"title_canon_sha256":"b4945ebe1dd1a61d19c698358d31867c18acd0c54d2919d153be3f3bf2df5b4b","abstract_canon_sha256":"05ce0dbbd91173bdfe2a2cd8b6b539b95124d0699a268c4553589e648918785c"},"schema_version":"1.0"},"canonical_sha256":"8ec972b9305b1164d5e77db545042c07b6e19a57677472aaf63debbe5e043ba9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:50.992612Z","signature_b64":"UH4z9HRuR54zfamTVgXsC61fumGOrs1fzZOduGd/PpHN/ZvsjWH6RF13fCDTAtTgXZe9eprYRDVnnlt617+zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ec972b9305b1164d5e77db545042c07b6e19a57677472aaf63debbe5e043ba9","last_reissued_at":"2026-05-18T00:03:50.991886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:50.991886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.03530","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-18T00:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I2ksK/3XxfrI6mAVvy6e3p2hJ6zU0ptP+qr3jweXJAKVDlUTiyUMMmd4koybfFnPxUK2PnS1jb6fklm4GaowCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:59:54.156590Z"},"content_sha256":"04999b3ebffcbbe48c67a3a2c88a2aac6f2e4220bd6bca839034afa85ec8b537","schema_version":"1.0","event_id":"sha256:04999b3ebffcbbe48c67a3a2c88a2aac6f2e4220bd6bca839034afa85ec8b537"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R3EXFOJQLMIWJVPHPW2UKBBMA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Parallelisation for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mario Boley, Michael Kamp, Olana Missura, Thomas G\\\"artner","submitted_at":"2018-10-08T15:35:07Z","abstract_excerpt":"We present a novel parallelisation scheme that simplifies the adaptation of learning algorithms to growing amounts of data as well as growing needs for accurate and confident predictions in critical applications. In contrast to other parallelisation techniques, it can be applied to a broad class of learning algorithms without further mathematical derivations and without writing dedicated code, while at the same time maintaining theoretical performance guarantees. Moreover, our parallelisation scheme is able to reduce the runtime of many learning algorithms to polylogarithmic time on quasi-poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03530","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-18T00:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgHEAo7++1i4b0QvtmCvGghBwjLuPk1KucUFbGhEFaeS6LtIvrfMmFaT34Bmz4i+KvTFzWClpovIiWd4kuU2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:59:54.156940Z"},"content_sha256":"e9e5995a6279acb852c8407db21ce12b447e77a1693bcdef69679f4d17386bc8","schema_version":"1.0","event_id":"sha256:e9e5995a6279acb852c8407db21ce12b447e77a1693bcdef69679f4d17386bc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3EXFOJQLMIWJVPHPW2UKBBMA6/bundle.json","state_url":"https://pith.science/pith/R3EXFOJQLMIWJVPHPW2UKBBMA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3EXFOJQLMIWJVPHPW2UKBBMA6/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-20T22:59:54Z","links":{"resolver":"https://pith.science/pith/R3EXFOJQLMIWJVPHPW2UKBBMA6","bundle":"https://pith.science/pith/R3EXFOJQLMIWJVPHPW2UKBBMA6/bundle.json","state":"https://pith.science/pith/R3EXFOJQLMIWJVPHPW2UKBBMA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3EXFOJQLMIWJVPHPW2UKBBMA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R3EXFOJQLMIWJVPHPW2UKBBMA6","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":"05ce0dbbd91173bdfe2a2cd8b6b539b95124d0699a268c4553589e648918785c","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-08T15:35:07Z","title_canon_sha256":"b4945ebe1dd1a61d19c698358d31867c18acd0c54d2919d153be3f3bf2df5b4b"},"schema_version":"1.0","source":{"id":"1810.03530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03530","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03530v1","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03530","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"R3EXFOJQLMIW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3EXFOJQLMIWJVPH","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3EXFOJQ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:e9e5995a6279acb852c8407db21ce12b447e77a1693bcdef69679f4d17386bc8","target":"graph","created_at":"2026-05-18T00:03:50Z","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 novel parallelisation scheme that simplifies the adaptation of learning algorithms to growing amounts of data as well as growing needs for accurate and confident predictions in critical applications. In contrast to other parallelisation techniques, it can be applied to a broad class of learning algorithms without further mathematical derivations and without writing dedicated code, while at the same time maintaining theoretical performance guarantees. Moreover, our parallelisation scheme is able to reduce the runtime of many learning algorithms to polylogarithmic time on quasi-poly","authors_text":"Mario Boley, Michael Kamp, Olana Missura, Thomas G\\\"artner","cross_cats":["cs.AI","cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-08T15:35:07Z","title":"Effective Parallelisation for Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03530","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:04999b3ebffcbbe48c67a3a2c88a2aac6f2e4220bd6bca839034afa85ec8b537","target":"record","created_at":"2026-05-18T00:03:50Z","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":"05ce0dbbd91173bdfe2a2cd8b6b539b95124d0699a268c4553589e648918785c","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-08T15:35:07Z","title_canon_sha256":"b4945ebe1dd1a61d19c698358d31867c18acd0c54d2919d153be3f3bf2df5b4b"},"schema_version":"1.0","source":{"id":"1810.03530","kind":"arxiv","version":1}},"canonical_sha256":"8ec972b9305b1164d5e77db545042c07b6e19a57677472aaf63debbe5e043ba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ec972b9305b1164d5e77db545042c07b6e19a57677472aaf63debbe5e043ba9","first_computed_at":"2026-05-18T00:03:50.991886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:50.991886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UH4z9HRuR54zfamTVgXsC61fumGOrs1fzZOduGd/PpHN/ZvsjWH6RF13fCDTAtTgXZe9eprYRDVnnlt617+zBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:50.992612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04999b3ebffcbbe48c67a3a2c88a2aac6f2e4220bd6bca839034afa85ec8b537","sha256:e9e5995a6279acb852c8407db21ce12b447e77a1693bcdef69679f4d17386bc8"],"state_sha256":"0101e617b210fd32b7de5e2136ae656d7bbeb8d1e475ed0de13045edd0280042"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1F+R7FH85dl0VpspKS68GWX04zsLsgFmt6ea7CG0yiEGkZ+zwRbi4LNTVGJBIMUNCCySU2P19TT1b540KG7QDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:59:54.158911Z","bundle_sha256":"173e77a251eecac3d8eb25aae9ce051d8498ab498c868713665217c00efc7b17"}}