{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L5LSEFAMVTEBO5XJLLG5RKE3XH","short_pith_number":"pith:L5LSEFAM","schema_version":"1.0","canonical_sha256":"5f5722140cacc81776e95acdd8a89bb9f97130f46c04437ff6168a072eeae53d","source":{"kind":"arxiv","id":"1804.00735","version":1},"attestation_state":"computed","paper":{"title":"A Fast Divide-and-Conquer Sparse Cox Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.CO","authors_text":"Isaac Kohane, Joel Schwartz, Nathan Palmer, Qian Di, Tianxi Cai, Yan Wang","submitted_at":"2018-04-02T21:25:59Z","abstract_excerpt":"We propose a computationally and statistically efficient divide-and-conquer (DAC) algorithm to fit sparse Cox regression to massive datasets where the sample size $n_0$ is exceedingly large and the covariate dimension $p$ is not small but $n_0\\gg p$. The proposed algorithm achieves computational efficiency through a one-step linear approximation followed by a least square approximation to the partial likelihood (PL). These sequences of linearization enable us to maximize the PL with only a small subset and perform penalized estimation via a fast approximation to the PL. The algorithm is applic"},"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":"1804.00735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T21:25:59Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"b3c7339854f497fa0cfed3806c4944ab902d58376e3ca30282ce743fffc980fb","abstract_canon_sha256":"718048aba910ff9e25f67fa33e2e5200712ed4d5416933bc796f9d96e1a34170"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:32.330268Z","signature_b64":"0qazATaFSIYk2xHJ/KmZlp5mSBPbqK4bvUlPD6as5L4DeXZNEU/gCMSN9UwINnva5dFW10UA6V8SH4QmXazQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f5722140cacc81776e95acdd8a89bb9f97130f46c04437ff6168a072eeae53d","last_reissued_at":"2026-05-18T00:19:32.329765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:32.329765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Divide-and-Conquer Sparse Cox Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.CO","authors_text":"Isaac Kohane, Joel Schwartz, Nathan Palmer, Qian Di, Tianxi Cai, Yan Wang","submitted_at":"2018-04-02T21:25:59Z","abstract_excerpt":"We propose a computationally and statistically efficient divide-and-conquer (DAC) algorithm to fit sparse Cox regression to massive datasets where the sample size $n_0$ is exceedingly large and the covariate dimension $p$ is not small but $n_0\\gg p$. The proposed algorithm achieves computational efficiency through a one-step linear approximation followed by a least square approximation to the partial likelihood (PL). These sequences of linearization enable us to maximize the PL with only a small subset and perform penalized estimation via a fast approximation to the PL. The algorithm is applic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00735","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":"1804.00735","created_at":"2026-05-18T00:19:32.329837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00735v1","created_at":"2026-05-18T00:19:32.329837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00735","created_at":"2026-05-18T00:19:32.329837+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5LSEFAMVTEB","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5LSEFAMVTEBO5XJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5LSEFAM","created_at":"2026-05-18T12:32:33.847187+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/L5LSEFAMVTEBO5XJLLG5RKE3XH","json":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH.json","graph_json":"https://pith.science/api/pith-number/L5LSEFAMVTEBO5XJLLG5RKE3XH/graph.json","events_json":"https://pith.science/api/pith-number/L5LSEFAMVTEBO5XJLLG5RKE3XH/events.json","paper":"https://pith.science/paper/L5LSEFAM"},"agent_actions":{"view_html":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH","download_json":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH.json","view_paper":"https://pith.science/paper/L5LSEFAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00735&json=true","fetch_graph":"https://pith.science/api/pith-number/L5LSEFAMVTEBO5XJLLG5RKE3XH/graph.json","fetch_events":"https://pith.science/api/pith-number/L5LSEFAMVTEBO5XJLLG5RKE3XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/action/storage_attestation","attest_author":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/action/author_attestation","sign_citation":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/action/citation_signature","submit_replication":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/action/replication_record"}},"created_at":"2026-05-18T00:19:32.329837+00:00","updated_at":"2026-05-18T00:19:32.329837+00:00"}