{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U6OWEHWNBZ7CEWGMNAMMMU6LJT","short_pith_number":"pith:U6OWEHWN","schema_version":"1.0","canonical_sha256":"a79d621ecd0e7e2258cc6818c653cb4ce20c29cd71bdb2add70f56ea4b2f4fd7","source":{"kind":"arxiv","id":"1411.6520","version":1},"attestation_state":"computed","paper":{"title":"Distributed Coordinate Descent for L1-regularized Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Genkin, Ilya Trofimov","submitted_at":"2014-11-24T16:40:33Z","abstract_excerpt":"Solving logistic regression with L1-regularization in distributed settings is an important problem. This problem arises when training dataset is very large and cannot fit the memory of a single machine. We present d-GLMNET, a new algorithm solving logistic regression with L1-regularization in the distributed settings. We empirically show that it is superior over distributed online learning via truncated gradient."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1411.6520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-24T16:40:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"368a9006ec617fc4dcafbcf45dc91b2e683ac68be0f5f1ad45287b09519217e3","abstract_canon_sha256":"2a56d95f9307947eafc5f62681259a43c1d6095f4786a1035214242375b70194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:08.742359Z","signature_b64":"zNAUPyJ3UXgUk9M5gFZ1nr3BYd/yb6MTgQ7wJuDhbOqNgjzNS1M9SzJFh2eJxYPreAGkMPkFs5njYs6x6hTKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a79d621ecd0e7e2258cc6818c653cb4ce20c29cd71bdb2add70f56ea4b2f4fd7","last_reissued_at":"2026-05-18T01:23:08.741854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:08.741854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Coordinate Descent for L1-regularized Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Genkin, Ilya Trofimov","submitted_at":"2014-11-24T16:40:33Z","abstract_excerpt":"Solving logistic regression with L1-regularization in distributed settings is an important problem. This problem arises when training dataset is very large and cannot fit the memory of a single machine. We present d-GLMNET, a new algorithm solving logistic regression with L1-regularization in the distributed settings. We empirically show that it is superior over distributed online learning via truncated gradient."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6520","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.6520","created_at":"2026-05-18T01:23:08.741946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6520v1","created_at":"2026-05-18T01:23:08.741946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6520","created_at":"2026-05-18T01:23:08.741946+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6OWEHWNBZ7C","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6OWEHWNBZ7CEWGM","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6OWEHWN","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT","json":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT.json","graph_json":"https://pith.science/api/pith-number/U6OWEHWNBZ7CEWGMNAMMMU6LJT/graph.json","events_json":"https://pith.science/api/pith-number/U6OWEHWNBZ7CEWGMNAMMMU6LJT/events.json","paper":"https://pith.science/paper/U6OWEHWN"},"agent_actions":{"view_html":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT","download_json":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT.json","view_paper":"https://pith.science/paper/U6OWEHWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6520&json=true","fetch_graph":"https://pith.science/api/pith-number/U6OWEHWNBZ7CEWGMNAMMMU6LJT/graph.json","fetch_events":"https://pith.science/api/pith-number/U6OWEHWNBZ7CEWGMNAMMMU6LJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT/action/storage_attestation","attest_author":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT/action/author_attestation","sign_citation":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT/action/citation_signature","submit_replication":"https://pith.science/pith/U6OWEHWNBZ7CEWGMNAMMMU6LJT/action/replication_record"}},"created_at":"2026-05-18T01:23:08.741946+00:00","updated_at":"2026-05-18T01:23:08.741946+00:00"}