{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LURA6JNCI6EUYOTRENNY7JKTNN","short_pith_number":"pith:LURA6JNC","canonical_record":{"source":{"id":"1604.04706","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T07:26:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c54945220c285af4967e5f3552d864ade86e28d2b0193717978e3b73801dc0d3","abstract_canon_sha256":"189a1d586f76def58e8709b5332d9be17f4fad6de0913a8bb0b53ba68496643b"},"schema_version":"1.0"},"canonical_sha256":"5d220f25a247894c3a71235b8fa5536b783bb8b5da03182d83a936fb6d603267","source":{"kind":"arxiv","id":"1604.04706","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04706","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04706v7","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04706","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"LURA6JNCI6EU","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LURA6JNCI6EUYOTR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LURA6JNC","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LURA6JNCI6EUYOTRENNY7JKTNN","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04706","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T07:26:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c54945220c285af4967e5f3552d864ade86e28d2b0193717978e3b73801dc0d3","abstract_canon_sha256":"189a1d586f76def58e8709b5332d9be17f4fad6de0913a8bb0b53ba68496643b"},"schema_version":"1.0"},"canonical_sha256":"5d220f25a247894c3a71235b8fa5536b783bb8b5da03182d83a936fb6d603267","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:58.022797Z","signature_b64":"BIVHEJBdhIAtVp9tF/acXsT893nHISrxhv58FPz72Q2EC0xqcSznWDpZ1YfpKe3mZ2I5zFXhDmenYzLevexcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d220f25a247894c3a71235b8fa5536b783bb8b5da03182d83a936fb6d603267","last_reissued_at":"2026-05-18T00:08:58.022064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:58.022064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04706","source_version":7,"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:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZU4U08NY9bIgxH3gSpHtytjwoGlHLt1/tiQhAgKFMxH4nBdlMp6ZngfDppELuFHwyuRi20igdR+fCaO9kfIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:13:10.572025Z"},"content_sha256":"e497f84099d5e1075f63c2a42665907c26bc233ddcdfffb8e4534ea7aac3f8c4","schema_version":"1.0","event_id":"sha256:e497f84099d5e1075f63c2a42665907c26bc233ddcdfffb8e4534ea7aac3f8c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LURA6JNCI6EUYOTRENNY7JKTNN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DS-MLR: Exploiting Double Separability for Scaling up Distributed Multinomial Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hyokun Yun, Parameswaran Raman, Shin Matsushima, Sriram Srinivasan, S.V.N. Vishwanathan, Xinhua Zhang","submitted_at":"2016-04-16T07:26:58Z","abstract_excerpt":"Scaling multinomial logistic regression to datasets with very large number of data points and classes is challenging. This is primarily because one needs to compute the log-partition function on every data point. This makes distributing the computation hard. In this paper, we present a distributed stochastic gradient descent based optimization method (DS-MLR) for scaling up multinomial logistic regression problems to massive scale datasets without hitting any storage constraints on the data and model parameters. Our algorithm exploits double-separability, an attractive property that allows us "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04706","kind":"arxiv","version":7},"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:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqV4HmmcYeoatMSPFmYcDOQkTPs9ZiQwBfRO5NeI9kebwSWg+CSk1Wa99yog096IZgIqx3c2DVLwEAoBovZqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:13:10.572467Z"},"content_sha256":"e6c3d084f63d2ed63232258c7303537ec25682d9cd78b3d964ebe5595c28c5c3","schema_version":"1.0","event_id":"sha256:e6c3d084f63d2ed63232258c7303537ec25682d9cd78b3d964ebe5595c28c5c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LURA6JNCI6EUYOTRENNY7JKTNN/bundle.json","state_url":"https://pith.science/pith/LURA6JNCI6EUYOTRENNY7JKTNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LURA6JNCI6EUYOTRENNY7JKTNN/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-02T17:13:10Z","links":{"resolver":"https://pith.science/pith/LURA6JNCI6EUYOTRENNY7JKTNN","bundle":"https://pith.science/pith/LURA6JNCI6EUYOTRENNY7JKTNN/bundle.json","state":"https://pith.science/pith/LURA6JNCI6EUYOTRENNY7JKTNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LURA6JNCI6EUYOTRENNY7JKTNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LURA6JNCI6EUYOTRENNY7JKTNN","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":"189a1d586f76def58e8709b5332d9be17f4fad6de0913a8bb0b53ba68496643b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T07:26:58Z","title_canon_sha256":"c54945220c285af4967e5f3552d864ade86e28d2b0193717978e3b73801dc0d3"},"schema_version":"1.0","source":{"id":"1604.04706","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04706","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04706v7","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04706","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"LURA6JNCI6EU","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LURA6JNCI6EUYOTR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LURA6JNC","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:e6c3d084f63d2ed63232258c7303537ec25682d9cd78b3d964ebe5595c28c5c3","target":"graph","created_at":"2026-05-18T00:08:58Z","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":"Scaling multinomial logistic regression to datasets with very large number of data points and classes is challenging. This is primarily because one needs to compute the log-partition function on every data point. This makes distributing the computation hard. In this paper, we present a distributed stochastic gradient descent based optimization method (DS-MLR) for scaling up multinomial logistic regression problems to massive scale datasets without hitting any storage constraints on the data and model parameters. Our algorithm exploits double-separability, an attractive property that allows us ","authors_text":"Hyokun Yun, Parameswaran Raman, Shin Matsushima, Sriram Srinivasan, S.V.N. Vishwanathan, Xinhua Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T07:26:58Z","title":"DS-MLR: Exploiting Double Separability for Scaling up Distributed Multinomial Logistic Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04706","kind":"arxiv","version":7},"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:e497f84099d5e1075f63c2a42665907c26bc233ddcdfffb8e4534ea7aac3f8c4","target":"record","created_at":"2026-05-18T00:08:58Z","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":"189a1d586f76def58e8709b5332d9be17f4fad6de0913a8bb0b53ba68496643b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T07:26:58Z","title_canon_sha256":"c54945220c285af4967e5f3552d864ade86e28d2b0193717978e3b73801dc0d3"},"schema_version":"1.0","source":{"id":"1604.04706","kind":"arxiv","version":7}},"canonical_sha256":"5d220f25a247894c3a71235b8fa5536b783bb8b5da03182d83a936fb6d603267","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d220f25a247894c3a71235b8fa5536b783bb8b5da03182d83a936fb6d603267","first_computed_at":"2026-05-18T00:08:58.022064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:58.022064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BIVHEJBdhIAtVp9tF/acXsT893nHISrxhv58FPz72Q2EC0xqcSznWDpZ1YfpKe3mZ2I5zFXhDmenYzLevexcAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:58.022797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04706","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e497f84099d5e1075f63c2a42665907c26bc233ddcdfffb8e4534ea7aac3f8c4","sha256:e6c3d084f63d2ed63232258c7303537ec25682d9cd78b3d964ebe5595c28c5c3"],"state_sha256":"a17701ab06757e6796c2b3a47effafd1b931fffe2b33a7aa23366c0a7e543bbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6UV1iPsbhV9rfgzwTggLovgxKZ8b2/dNYMCXjfvY6tgmTxQyG+rSVAJvthE7MjRKxinqBSI+9MFX444Y7yuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:13:10.575246Z","bundle_sha256":"659a683f0ab83fa111aaf153157f02589cce64d1325eedee4eafd6bb4704290a"}}