{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L5LSEFAMVTEBO5XJLLG5RKE3XH","short_pith_number":"pith:L5LSEFAM","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"},"canonical_sha256":"5f5722140cacc81776e95acdd8a89bb9f97130f46c04437ff6168a072eeae53d","source":{"kind":"arxiv","id":"1804.00735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00735","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00735v1","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00735","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"L5LSEFAMVTEB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L5LSEFAMVTEBO5XJ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L5LSEFAM","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L5LSEFAMVTEBO5XJLLG5RKE3XH","target":"record","payload":{"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"},"canonical_sha256":"5f5722140cacc81776e95acdd8a89bb9f97130f46c04437ff6168a072eeae53d","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"},"source_kind":"arxiv","source_id":"1804.00735","source_version":1,"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:19:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7y9K/I/UWOSDKMKOFry3yQJ2n/mWCxsSc+nHo8qa2VirGT9YrNfaSY98Lnu6kJKN7Ns8H+eMoQAcMTQ8Qs6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:25:39.825421Z"},"content_sha256":"4948e4a702582bbeedc2a1d64bc8c5b473f55e1978a3e4a1fc1cd24012832984","schema_version":"1.0","event_id":"sha256:4948e4a702582bbeedc2a1d64bc8c5b473f55e1978a3e4a1fc1cd24012832984"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L5LSEFAMVTEBO5XJLLG5RKE3XH","target":"graph","payload":{"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"},"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:19:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xk9nqzShVoh8qnIme+afgMUpkZ/5+UftPlnM4/6YOp5kEDuvFoXrwlpWYXGQi2hgq8cWM3ljcidaMPy0aKSwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:25:39.825773Z"},"content_sha256":"ef50a5fbdfbc2e2aca88c53a034e13823905fcc4e954dc09af289ef08e0b9e4a","schema_version":"1.0","event_id":"sha256:ef50a5fbdfbc2e2aca88c53a034e13823905fcc4e954dc09af289ef08e0b9e4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/bundle.json","state_url":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/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-01T09:25:39Z","links":{"resolver":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH","bundle":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/bundle.json","state":"https://pith.science/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5LSEFAMVTEBO5XJLLG5RKE3XH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L5LSEFAMVTEBO5XJLLG5RKE3XH","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":"718048aba910ff9e25f67fa33e2e5200712ed4d5416933bc796f9d96e1a34170","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T21:25:59Z","title_canon_sha256":"b3c7339854f497fa0cfed3806c4944ab902d58376e3ca30282ce743fffc980fb"},"schema_version":"1.0","source":{"id":"1804.00735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00735","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00735v1","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00735","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"L5LSEFAMVTEB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L5LSEFAMVTEBO5XJ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L5LSEFAM","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:ef50a5fbdfbc2e2aca88c53a034e13823905fcc4e954dc09af289ef08e0b9e4a","target":"graph","created_at":"2026-05-18T00:19:32Z","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 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","authors_text":"Isaac Kohane, Joel Schwartz, Nathan Palmer, Qian Di, Tianxi Cai, Yan Wang","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T21:25:59Z","title":"A Fast Divide-and-Conquer Sparse Cox Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00735","kind":"arxiv","version":1},"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:4948e4a702582bbeedc2a1d64bc8c5b473f55e1978a3e4a1fc1cd24012832984","target":"record","created_at":"2026-05-18T00:19:32Z","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":"718048aba910ff9e25f67fa33e2e5200712ed4d5416933bc796f9d96e1a34170","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-02T21:25:59Z","title_canon_sha256":"b3c7339854f497fa0cfed3806c4944ab902d58376e3ca30282ce743fffc980fb"},"schema_version":"1.0","source":{"id":"1804.00735","kind":"arxiv","version":1}},"canonical_sha256":"5f5722140cacc81776e95acdd8a89bb9f97130f46c04437ff6168a072eeae53d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f5722140cacc81776e95acdd8a89bb9f97130f46c04437ff6168a072eeae53d","first_computed_at":"2026-05-18T00:19:32.329765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:32.329765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0qazATaFSIYk2xHJ/KmZlp5mSBPbqK4bvUlPD6as5L4DeXZNEU/gCMSN9UwINnva5dFW10UA6V8SH4QmXazQAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:32.330268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4948e4a702582bbeedc2a1d64bc8c5b473f55e1978a3e4a1fc1cd24012832984","sha256:ef50a5fbdfbc2e2aca88c53a034e13823905fcc4e954dc09af289ef08e0b9e4a"],"state_sha256":"aebd904252265a2ecec91171f2529500815b543319cebb2532cd1a775d9bd996"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfWjBI2rEc5Qj9ycu452KMDajvP8MTXUdsrhjME5odPKhucx/YLYEeUferIG4h4Z8lZqF4xV8N1iwS6ZtzOtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:25:39.827837Z","bundle_sha256":"6473d141f3e551789fd2fd1104e58186ce654484886fbf4d99d1801b05fc0b3f"}}