{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:35CD2OWNUAO3IJ7Y44RLSCYSH5","short_pith_number":"pith:35CD2OWN","canonical_record":{"source":{"id":"1802.07417","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T03:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"d262268ee85a3b353d04ce31412957e65c3af7291df3414895f6cad80af1d04b","abstract_canon_sha256":"648688d75485e6d74a2d01017222d862baa108d52391d3a4181d4c43e5b89241"},"schema_version":"1.0"},"canonical_sha256":"df443d3acda01db427f8e722b90b123f5406ae99c56e2e1916a925e6c8377b97","source":{"kind":"arxiv","id":"1802.07417","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07417","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07417v3","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07417","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"35CD2OWNUAO3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"35CD2OWNUAO3IJ7Y","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"35CD2OWN","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:35CD2OWNUAO3IJ7Y44RLSCYSH5","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07417","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T03:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"d262268ee85a3b353d04ce31412957e65c3af7291df3414895f6cad80af1d04b","abstract_canon_sha256":"648688d75485e6d74a2d01017222d862baa108d52391d3a4181d4c43e5b89241"},"schema_version":"1.0"},"canonical_sha256":"df443d3acda01db427f8e722b90b123f5406ae99c56e2e1916a925e6c8377b97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:00.228530Z","signature_b64":"MlCsrlwMRcKDNH3baNXurMVv5ncxM22IdTWjwzYCtwIiXgrQ1VpshaWpD50H87DlLJlPGpC6Ey8dvL+jO8d0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df443d3acda01db427f8e722b90b123f5406ae99c56e2e1916a925e6c8377b97","last_reissued_at":"2026-05-17T23:44:00.227918Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:00.227918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07417","source_version":3,"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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d0ktrJeMU/PFQ7kZYM3TFEtgrcD1FFi0zF/p5XS9twDTXhGNCpZ2FRl2YAI4lyetPEwXIZrusIHASfJ6x5AnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:37:15.934235Z"},"content_sha256":"0ed6d6a265e3e967434269a6dcc87854c1a8e52324958962ef9484c9a7800b44","schema_version":"1.0","event_id":"sha256:0ed6d6a265e3e967434269a6dcc87854c1a8e52324958962ef9484c9a7800b44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:35CD2OWNUAO3IJ7Y44RLSCYSH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ashok Vardhan Makkuva, Pramod Viswanath, Sewoong Oh, Sreeram Kannan","submitted_at":"2018-02-21T03:58:37Z","abstract_excerpt":"Mixture-of-Experts (MoE) is a widely popular model for ensemble learning and is a basic building block of highly successful modern neural networks as well as a component in Gated Recurrent Units (GRU) and Attention networks. However, present algorithms for learning MoE including the EM algorithm, and gradient descent are known to get stuck in local optima. From a theoretical viewpoint, finding an efficient and provably consistent algorithm to learn the parameters remains a long standing open problem for more than two decades. In this paper, we introduce the first algorithm that learns the true"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07417","kind":"arxiv","version":3},"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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IVCIh8FfGwG52DXuT3tpFxCjyJDNpxNUhuGPY5kK1e8I3/Oodm8Q+a+P2vud/shs70mGPdLwfLKjS8aUZWpYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:37:15.934799Z"},"content_sha256":"866b8314a3668dfb93911f6b3a0ec4b6fb4579415fc7192ca6cdb7efe2c70dfe","schema_version":"1.0","event_id":"sha256:866b8314a3668dfb93911f6b3a0ec4b6fb4579415fc7192ca6cdb7efe2c70dfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35CD2OWNUAO3IJ7Y44RLSCYSH5/bundle.json","state_url":"https://pith.science/pith/35CD2OWNUAO3IJ7Y44RLSCYSH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35CD2OWNUAO3IJ7Y44RLSCYSH5/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-09T17:37:15Z","links":{"resolver":"https://pith.science/pith/35CD2OWNUAO3IJ7Y44RLSCYSH5","bundle":"https://pith.science/pith/35CD2OWNUAO3IJ7Y44RLSCYSH5/bundle.json","state":"https://pith.science/pith/35CD2OWNUAO3IJ7Y44RLSCYSH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35CD2OWNUAO3IJ7Y44RLSCYSH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:35CD2OWNUAO3IJ7Y44RLSCYSH5","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":"648688d75485e6d74a2d01017222d862baa108d52391d3a4181d4c43e5b89241","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T03:58:37Z","title_canon_sha256":"d262268ee85a3b353d04ce31412957e65c3af7291df3414895f6cad80af1d04b"},"schema_version":"1.0","source":{"id":"1802.07417","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07417","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07417v3","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07417","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"35CD2OWNUAO3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"35CD2OWNUAO3IJ7Y","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"35CD2OWN","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:866b8314a3668dfb93911f6b3a0ec4b6fb4579415fc7192ca6cdb7efe2c70dfe","target":"graph","created_at":"2026-05-17T23:44:00Z","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":"Mixture-of-Experts (MoE) is a widely popular model for ensemble learning and is a basic building block of highly successful modern neural networks as well as a component in Gated Recurrent Units (GRU) and Attention networks. However, present algorithms for learning MoE including the EM algorithm, and gradient descent are known to get stuck in local optima. From a theoretical viewpoint, finding an efficient and provably consistent algorithm to learn the parameters remains a long standing open problem for more than two decades. In this paper, we introduce the first algorithm that learns the true","authors_text":"Ashok Vardhan Makkuva, Pramod Viswanath, Sewoong Oh, Sreeram Kannan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T03:58:37Z","title":"Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07417","kind":"arxiv","version":3},"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:0ed6d6a265e3e967434269a6dcc87854c1a8e52324958962ef9484c9a7800b44","target":"record","created_at":"2026-05-17T23:44:00Z","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":"648688d75485e6d74a2d01017222d862baa108d52391d3a4181d4c43e5b89241","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T03:58:37Z","title_canon_sha256":"d262268ee85a3b353d04ce31412957e65c3af7291df3414895f6cad80af1d04b"},"schema_version":"1.0","source":{"id":"1802.07417","kind":"arxiv","version":3}},"canonical_sha256":"df443d3acda01db427f8e722b90b123f5406ae99c56e2e1916a925e6c8377b97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df443d3acda01db427f8e722b90b123f5406ae99c56e2e1916a925e6c8377b97","first_computed_at":"2026-05-17T23:44:00.227918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:00.227918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MlCsrlwMRcKDNH3baNXurMVv5ncxM22IdTWjwzYCtwIiXgrQ1VpshaWpD50H87DlLJlPGpC6Ey8dvL+jO8d0Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:00.228530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07417","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ed6d6a265e3e967434269a6dcc87854c1a8e52324958962ef9484c9a7800b44","sha256:866b8314a3668dfb93911f6b3a0ec4b6fb4579415fc7192ca6cdb7efe2c70dfe"],"state_sha256":"c89903b8f835b3ff5119796021c27df9bab18d40ae8a084f3ff975f4d489e68b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3EiPIwvGwIxE9WQODUvHXAoibOGsa6g7tFhYoEAfx5IkdNzuSJjHzdDQg/MSZNL8kn0bDEGAriVoSFuqV9EzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:37:15.938643Z","bundle_sha256":"8f8e203e140ac48de30d2fd287be6593d026aaaf3a17ba5df6114317d62e7f2f"}}