{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ND2J5RN4ZQGZW5FESLRT6JNI5F","short_pith_number":"pith:ND2J5RN4","canonical_record":{"source":{"id":"1901.09450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T22:19:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b26cb8b7f12d7ce992df2ea771cdba541383c9ec3b177ef991e027a3e3b98a4c","abstract_canon_sha256":"1625187ac7f7608f1e7dfe13245e25d68550f2c54efb85fe9e6b5dc65dd09c4f"},"schema_version":"1.0"},"canonical_sha256":"68f49ec5bccc0d9b74a492e33f25a8e968ec8922dde850e6829d60bdf07fb264","source":{"kind":"arxiv","id":"1901.09450","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09450","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09450v2","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09450","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"ND2J5RN4ZQGZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ND2J5RN4ZQGZW5FE","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ND2J5RN4","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ND2J5RN4ZQGZW5FESLRT6JNI5F","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T22:19:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b26cb8b7f12d7ce992df2ea771cdba541383c9ec3b177ef991e027a3e3b98a4c","abstract_canon_sha256":"1625187ac7f7608f1e7dfe13245e25d68550f2c54efb85fe9e6b5dc65dd09c4f"},"schema_version":"1.0"},"canonical_sha256":"68f49ec5bccc0d9b74a492e33f25a8e968ec8922dde850e6829d60bdf07fb264","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:55.516497Z","signature_b64":"pkjCALt/NsaJyzPQrErZ/jKXYr+POnn/7fnGP4P9bCYpGYVyqG38e6wrhGANABPYC0TmK/04LlvQNmSvGofNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68f49ec5bccc0d9b74a492e33f25a8e968ec8922dde850e6829d60bdf07fb264","last_reissued_at":"2026-05-17T23:40:55.515780Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:55.515780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09450","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-17T23:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKwPtnccQ92jtaONk5I1GcthWiSJtixFc3+/PUAAbcbgI0NfGiQder8PH+qd++u7kAkp0ttrGkNPAQMjlVCXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:24:55.338135Z"},"content_sha256":"67cda851e96f839f41856b80fccb8a1e79ecf717bf98833208acf76c6453cfad","schema_version":"1.0","event_id":"sha256:67cda851e96f839f41856b80fccb8a1e79ecf717bf98833208acf76c6453cfad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ND2J5RN4ZQGZW5FESLRT6JNI5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ADMM-SOFTMAX : An ADMM Approach for Multinomial Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eldad Haber, Lars Ruthotto, Samy Wu Fung, Sanna Tyrv\\\"ainen","submitted_at":"2019-01-27T22:19:06Z","abstract_excerpt":"We present ADMM-Softmax, an alternating direction method of multipliers (ADMM) for solving multinomial logistic regression (MLR) problems. Our method is geared toward supervised classification tasks with many examples and features. It decouples the nonlinear optimization problem in MLR into three steps that can be solved efficiently. In particular, each iteration of ADMM-Softmax consists of a linear least-squares problem, a set of independent small-scale smooth, convex problems, and a trivial dual variable update. Solution of the least-squares problem can be be accelerated by pre-computing a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09450","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-17T23:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oo9xbDgAqFZZjUUbEiTfYeK0QnuiOh2a0WkgSDMzYxcQMLc4RsDr3eAEwr4rEzkcc9CSlDc3vmfJN11XznkpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:24:55.338820Z"},"content_sha256":"9318473f4213cec3d3fe07dd4de863525f9a022bf81bba4c7ea6308a66740cba","schema_version":"1.0","event_id":"sha256:9318473f4213cec3d3fe07dd4de863525f9a022bf81bba4c7ea6308a66740cba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ND2J5RN4ZQGZW5FESLRT6JNI5F/bundle.json","state_url":"https://pith.science/pith/ND2J5RN4ZQGZW5FESLRT6JNI5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ND2J5RN4ZQGZW5FESLRT6JNI5F/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-25T18:24:55Z","links":{"resolver":"https://pith.science/pith/ND2J5RN4ZQGZW5FESLRT6JNI5F","bundle":"https://pith.science/pith/ND2J5RN4ZQGZW5FESLRT6JNI5F/bundle.json","state":"https://pith.science/pith/ND2J5RN4ZQGZW5FESLRT6JNI5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ND2J5RN4ZQGZW5FESLRT6JNI5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ND2J5RN4ZQGZW5FESLRT6JNI5F","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":"1625187ac7f7608f1e7dfe13245e25d68550f2c54efb85fe9e6b5dc65dd09c4f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T22:19:06Z","title_canon_sha256":"b26cb8b7f12d7ce992df2ea771cdba541383c9ec3b177ef991e027a3e3b98a4c"},"schema_version":"1.0","source":{"id":"1901.09450","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09450","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09450v2","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09450","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"ND2J5RN4ZQGZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ND2J5RN4ZQGZW5FE","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ND2J5RN4","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:9318473f4213cec3d3fe07dd4de863525f9a022bf81bba4c7ea6308a66740cba","target":"graph","created_at":"2026-05-17T23:40: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":"We present ADMM-Softmax, an alternating direction method of multipliers (ADMM) for solving multinomial logistic regression (MLR) problems. Our method is geared toward supervised classification tasks with many examples and features. It decouples the nonlinear optimization problem in MLR into three steps that can be solved efficiently. In particular, each iteration of ADMM-Softmax consists of a linear least-squares problem, a set of independent small-scale smooth, convex problems, and a trivial dual variable update. Solution of the least-squares problem can be be accelerated by pre-computing a f","authors_text":"Eldad Haber, Lars Ruthotto, Samy Wu Fung, Sanna Tyrv\\\"ainen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T22:19:06Z","title":"ADMM-SOFTMAX : An ADMM Approach for Multinomial Logistic Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09450","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:67cda851e96f839f41856b80fccb8a1e79ecf717bf98833208acf76c6453cfad","target":"record","created_at":"2026-05-17T23:40: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":"1625187ac7f7608f1e7dfe13245e25d68550f2c54efb85fe9e6b5dc65dd09c4f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T22:19:06Z","title_canon_sha256":"b26cb8b7f12d7ce992df2ea771cdba541383c9ec3b177ef991e027a3e3b98a4c"},"schema_version":"1.0","source":{"id":"1901.09450","kind":"arxiv","version":2}},"canonical_sha256":"68f49ec5bccc0d9b74a492e33f25a8e968ec8922dde850e6829d60bdf07fb264","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68f49ec5bccc0d9b74a492e33f25a8e968ec8922dde850e6829d60bdf07fb264","first_computed_at":"2026-05-17T23:40:55.515780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:55.515780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pkjCALt/NsaJyzPQrErZ/jKXYr+POnn/7fnGP4P9bCYpGYVyqG38e6wrhGANABPYC0TmK/04LlvQNmSvGofNBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:55.516497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09450","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67cda851e96f839f41856b80fccb8a1e79ecf717bf98833208acf76c6453cfad","sha256:9318473f4213cec3d3fe07dd4de863525f9a022bf81bba4c7ea6308a66740cba"],"state_sha256":"61e0be481d04f7645e7b532aae5fd8745e30ecdd718c48029c816c550d19bf87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50d9lEAvG/d5PZrnQJAXCISx0zDfV2tRXXS6BTVPJVAifLclvvIZR9DCNUGoGnLDAaFdM+aOBnx24Rs/iFwzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:24:55.342383Z","bundle_sha256":"9a13e4a0fec99f43e24147d0726b408f1525ba56af47f2ab9e0b9058b9f409ee"}}