{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TIME672JBZBRXXV6HW6VOLMGUY","short_pith_number":"pith:TIME672J","schema_version":"1.0","canonical_sha256":"9a184f7f490e431bdebe3dbd572d86a623f2c6017fd8374baa3ba45463260c26","source":{"kind":"arxiv","id":"1306.4615","version":3},"attestation_state":"computed","paper":{"title":"K-Adaptive Partitioning for Survival Data, with an Application to Cancer Staging","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Hyo Jeong Kang, HyungJun Cho, Seung-Mo Hong, Soo-Heang Eo","submitted_at":"2013-06-19T16:57:06Z","abstract_excerpt":"In medical research, it is often needed to obtain subgroups with heterogeneous survivals, which have been predicted from a prognostic factor. For this purpose, a binary split has often been used once or recursively; however, binary partitioning may not provide an optimal set of well separated subgroups. We propose a multi-way partitioning algorithm, which divides the data into K heterogeneous subgroups based on the information from a prognostic factor. The resulting subgroups show significant differences in survival. Such a multi-way partition is found by maximizing the minimum of the subgroup"},"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":"1306.4615","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.AP","submitted_at":"2013-06-19T16:57:06Z","cross_cats_sorted":[],"title_canon_sha256":"d8496328f666d874f5e4b2ff5cf70b6c0cf471a7322b5f75e87a0cb6f05f5a8d","abstract_canon_sha256":"645aacc2c22ed08d200b36ed22d54009799d0fbd26843875a5e882f22b6e302a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.201395Z","signature_b64":"MT467BqyFnOOZ3dQ/GqHSN3YzFDqqd1CpojoXQOrgPQfRSx2dztsA4zvs/x3mBi1ZO+073JN+aIZHbjzOlQ5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a184f7f490e431bdebe3dbd572d86a623f2c6017fd8374baa3ba45463260c26","last_reissued_at":"2026-05-18T02:38:53.201001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.201001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-Adaptive Partitioning for Survival Data, with an Application to Cancer Staging","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Hyo Jeong Kang, HyungJun Cho, Seung-Mo Hong, Soo-Heang Eo","submitted_at":"2013-06-19T16:57:06Z","abstract_excerpt":"In medical research, it is often needed to obtain subgroups with heterogeneous survivals, which have been predicted from a prognostic factor. For this purpose, a binary split has often been used once or recursively; however, binary partitioning may not provide an optimal set of well separated subgroups. We propose a multi-way partitioning algorithm, which divides the data into K heterogeneous subgroups based on the information from a prognostic factor. The resulting subgroups show significant differences in survival. Such a multi-way partition is found by maximizing the minimum of the subgroup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4615","kind":"arxiv","version":3},"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":"1306.4615","created_at":"2026-05-18T02:38:53.201061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4615v3","created_at":"2026-05-18T02:38:53.201061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4615","created_at":"2026-05-18T02:38:53.201061+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIME672JBZBR","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIME672JBZBRXXV6","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIME672J","created_at":"2026-05-18T12:28:02.375192+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/TIME672JBZBRXXV6HW6VOLMGUY","json":"https://pith.science/pith/TIME672JBZBRXXV6HW6VOLMGUY.json","graph_json":"https://pith.science/api/pith-number/TIME672JBZBRXXV6HW6VOLMGUY/graph.json","events_json":"https://pith.science/api/pith-number/TIME672JBZBRXXV6HW6VOLMGUY/events.json","paper":"https://pith.science/paper/TIME672J"},"agent_actions":{"view_html":"https://pith.science/pith/TIME672JBZBRXXV6HW6VOLMGUY","download_json":"https://pith.science/pith/TIME672JBZBRXXV6HW6VOLMGUY.json","view_paper":"https://pith.science/paper/TIME672J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4615&json=true","fetch_graph":"https://pith.science/api/pith-number/TIME672JBZBRXXV6HW6VOLMGUY/graph.json","fetch_events":"https://pith.science/api/pith-number/TIME672JBZBRXXV6HW6VOLMGUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIME672JBZBRXXV6HW6VOLMGUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIME672JBZBRXXV6HW6VOLMGUY/action/storage_attestation","attest_author":"https://pith.science/pith/TIME672JBZBRXXV6HW6VOLMGUY/action/author_attestation","sign_citation":"https://pith.science/pith/TIME672JBZBRXXV6HW6VOLMGUY/action/citation_signature","submit_replication":"https://pith.science/pith/TIME672JBZBRXXV6HW6VOLMGUY/action/replication_record"}},"created_at":"2026-05-18T02:38:53.201061+00:00","updated_at":"2026-05-18T02:38:53.201061+00:00"}