{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KTQKPXLXODGXLIG55YTEWLIW57","short_pith_number":"pith:KTQKPXLX","canonical_record":{"source":{"id":"1205.2282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T14:44:31Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"de6a576195af34d7317b7fa76330f4231ad3f969431641451afb4a3e40d3bf81","abstract_canon_sha256":"b250fc3d26be36156ab17119201f6ec80c8081eade7f92ffb193e1cd2709f886"},"schema_version":"1.0"},"canonical_sha256":"54e0a7dd7770cd75a0ddee264b2d16efd17c15c1195761b9ae96b952eca9666f","source":{"kind":"arxiv","id":"1205.2282","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2282","created_at":"2026-05-18T03:55:55Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2282v1","created_at":"2026-05-18T03:55:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2282","created_at":"2026-05-18T03:55:55Z"},{"alias_kind":"pith_short_12","alias_value":"KTQKPXLXODGX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KTQKPXLXODGXLIG5","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KTQKPXLX","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KTQKPXLXODGXLIG55YTEWLIW57","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T14:44:31Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"de6a576195af34d7317b7fa76330f4231ad3f969431641451afb4a3e40d3bf81","abstract_canon_sha256":"b250fc3d26be36156ab17119201f6ec80c8081eade7f92ffb193e1cd2709f886"},"schema_version":"1.0"},"canonical_sha256":"54e0a7dd7770cd75a0ddee264b2d16efd17c15c1195761b9ae96b952eca9666f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:55.728842Z","signature_b64":"dVFj7ycl9X2cUhjuj0w7v5WhIPjvOWV2TF0pJoC5kUbjd3SDiweIGuwy88W3DcH7D9NsCSsWiPBN7zWk2FHACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54e0a7dd7770cd75a0ddee264b2d16efd17c15c1195761b9ae96b952eca9666f","last_reissued_at":"2026-05-18T03:55:55.728158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:55.728158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2282","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-18T03:55:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dt4fDquO1SgBDGVlL4eBNU7IFo35AWlZuXsKyV4/cSHatOrdgzs/d+5jeg9whI4dWvGOpukUwVzZ7+tJOmVMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:08:24.026914Z"},"content_sha256":"d5927d007581b6eb42adf377f0fe3006c85c4227a16e568337b22fbda261b031","schema_version":"1.0","event_id":"sha256:d5927d007581b6eb42adf377f0fe3006c85c4227a16e568337b22fbda261b031"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KTQKPXLXODGXLIG55YTEWLIW57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Discussion on Parallelization Schemes for Stochastic Vector Quantization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"stat.ML","authors_text":"Beno\\^it Patra (LSTA), Fabrice Rossi (SAMM), Matthieu Durut (LTCI)","submitted_at":"2012-05-10T14:44:31Z","abstract_excerpt":"This paper studies parallelization schemes for stochastic Vector Quantization algorithms in order to obtain time speed-ups using distributed resources. We show that the most intuitive parallelization scheme does not lead to better performances than the sequential algorithm. Another distributed scheme is therefore introduced which obtains the expected speed-ups. Then, it is improved to fit implementation on distributed architectures where communications are slow and inter-machines synchronization too costly. The schemes are tested with simulated distributed architectures and, for the last one, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2282","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-18T03:55:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCdiRlHfKGb6b3wZyRom+Yj1byOORtWCXdb5XSJjKuVAegL9qJi5wqptegzCn9kcBfvCeNMbDM/VzWxoB/XQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:08:24.027268Z"},"content_sha256":"b06086d3dfd3dcda37d740bb0b2ff204490c5904999860744dd448e765ae0f4f","schema_version":"1.0","event_id":"sha256:b06086d3dfd3dcda37d740bb0b2ff204490c5904999860744dd448e765ae0f4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTQKPXLXODGXLIG55YTEWLIW57/bundle.json","state_url":"https://pith.science/pith/KTQKPXLXODGXLIG55YTEWLIW57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTQKPXLXODGXLIG55YTEWLIW57/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-28T05:08:24Z","links":{"resolver":"https://pith.science/pith/KTQKPXLXODGXLIG55YTEWLIW57","bundle":"https://pith.science/pith/KTQKPXLXODGXLIG55YTEWLIW57/bundle.json","state":"https://pith.science/pith/KTQKPXLXODGXLIG55YTEWLIW57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTQKPXLXODGXLIG55YTEWLIW57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KTQKPXLXODGXLIG55YTEWLIW57","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":"b250fc3d26be36156ab17119201f6ec80c8081eade7f92ffb193e1cd2709f886","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T14:44:31Z","title_canon_sha256":"de6a576195af34d7317b7fa76330f4231ad3f969431641451afb4a3e40d3bf81"},"schema_version":"1.0","source":{"id":"1205.2282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2282","created_at":"2026-05-18T03:55:55Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2282v1","created_at":"2026-05-18T03:55:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2282","created_at":"2026-05-18T03:55:55Z"},{"alias_kind":"pith_short_12","alias_value":"KTQKPXLXODGX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KTQKPXLXODGXLIG5","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KTQKPXLX","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:b06086d3dfd3dcda37d740bb0b2ff204490c5904999860744dd448e765ae0f4f","target":"graph","created_at":"2026-05-18T03:55:55Z","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":"This paper studies parallelization schemes for stochastic Vector Quantization algorithms in order to obtain time speed-ups using distributed resources. We show that the most intuitive parallelization scheme does not lead to better performances than the sequential algorithm. Another distributed scheme is therefore introduced which obtains the expected speed-ups. Then, it is improved to fit implementation on distributed architectures where communications are slow and inter-machines synchronization too costly. The schemes are tested with simulated distributed architectures and, for the last one, ","authors_text":"Beno\\^it Patra (LSTA), Fabrice Rossi (SAMM), Matthieu Durut (LTCI)","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T14:44:31Z","title":"A Discussion on Parallelization Schemes for Stochastic Vector Quantization Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2282","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:d5927d007581b6eb42adf377f0fe3006c85c4227a16e568337b22fbda261b031","target":"record","created_at":"2026-05-18T03:55:55Z","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":"b250fc3d26be36156ab17119201f6ec80c8081eade7f92ffb193e1cd2709f886","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T14:44:31Z","title_canon_sha256":"de6a576195af34d7317b7fa76330f4231ad3f969431641451afb4a3e40d3bf81"},"schema_version":"1.0","source":{"id":"1205.2282","kind":"arxiv","version":1}},"canonical_sha256":"54e0a7dd7770cd75a0ddee264b2d16efd17c15c1195761b9ae96b952eca9666f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54e0a7dd7770cd75a0ddee264b2d16efd17c15c1195761b9ae96b952eca9666f","first_computed_at":"2026-05-18T03:55:55.728158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:55.728158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dVFj7ycl9X2cUhjuj0w7v5WhIPjvOWV2TF0pJoC5kUbjd3SDiweIGuwy88W3DcH7D9NsCSsWiPBN7zWk2FHACw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:55.728842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5927d007581b6eb42adf377f0fe3006c85c4227a16e568337b22fbda261b031","sha256:b06086d3dfd3dcda37d740bb0b2ff204490c5904999860744dd448e765ae0f4f"],"state_sha256":"b08d5ea40518593720c8b0ecae4a82f8cd64f08574878a5bb37af7f069422454"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"miAUa8lLUMFCOrUC9ahjYeTDrLykYC63olGlbtTDvHJc/2fOfhWdyIGQYwQuVDrlE+sV3A7k0Rh3X7vvhizsBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:08:24.029297Z","bundle_sha256":"a3abb0e02e27fe6f83364c64ff13b9f0922e828eba65db7847f01b4907ff6c50"}}