{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QY5EAEGW6JKZX5Y45LMZBJE73T","short_pith_number":"pith:QY5EAEGW","canonical_record":{"source":{"id":"1604.07031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-24T13:49:23Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"a3a6b0f6b0740473ffbb411bc679ed9ac5d6e5c7d6fc2a7763426a9dfce7ebc7","abstract_canon_sha256":"04e72ba85e41d6c92c8661955df465b09baf791da9b5493d7fbe1ecf05904f73"},"schema_version":"1.0"},"canonical_sha256":"863a4010d6f2559bf71cead990a49fdcdd8425e91b36a13eba67e0a0c35c7325","source":{"kind":"arxiv","id":"1604.07031","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07031","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07031v2","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07031","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"QY5EAEGW6JKZ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QY5EAEGW6JKZX5Y4","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QY5EAEGW","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QY5EAEGW6JKZX5Y45LMZBJE73T","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-24T13:49:23Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"a3a6b0f6b0740473ffbb411bc679ed9ac5d6e5c7d6fc2a7763426a9dfce7ebc7","abstract_canon_sha256":"04e72ba85e41d6c92c8661955df465b09baf791da9b5493d7fbe1ecf05904f73"},"schema_version":"1.0"},"canonical_sha256":"863a4010d6f2559bf71cead990a49fdcdd8425e91b36a13eba67e0a0c35c7325","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:46.621498Z","signature_b64":"pkfKfIZz2wg7pCFQWp9xwwFrqHx0bAYlNW/l5Ft9OcNM8jB8hPNKDdPQmUV0fPCHC1HFAR/DBFxhxpd5IL6hAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863a4010d6f2559bf71cead990a49fdcdd8425e91b36a13eba67e0a0c35c7325","last_reissued_at":"2026-05-18T00:38:46.620834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:46.620834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07031","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-18T00:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8CvJie05m5LCGNr6tA8+3mSA9R+k25y0/Tn1AyjyUZb2iA8BeXU+bahMorn1IgSS+WdgF52N0ywKk8fH2bwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:46:33.721710Z"},"content_sha256":"861c98f5f6764e6358d3c8f7e6615edfb6d243b6c483a5dc316e09f2b0ce3526","schema_version":"1.0","event_id":"sha256:861c98f5f6764e6358d3c8f7e6615edfb6d243b6c483a5dc316e09f2b0ce3526"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QY5EAEGW6JKZX5Y45LMZBJE73T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predictive Hierarchical Clustering: Learning clusters of CPT codes for improving surgical outcomes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Elizabeth C. Lorenzi, Katherine Heller, Stephanie L. Brown, Zhifei Sun","submitted_at":"2016-04-24T13:49:23Z","abstract_excerpt":"We develop a novel algorithm, Predictive Hierarchical Clustering (PHC), for agglomerative hierarchical clustering of current procedural terminology (CPT) codes. Our predictive hierarchical clustering aims to cluster subgroups, not individual observations, found within our data, such that the clusters discovered result in optimal performance of a classification model. Therefore, merges are chosen based on a Bayesian hypothesis test, which chooses pairings of the subgroups that result in the best model fit, as measured by held out predictive likelihoods. We place a Dirichlet prior on the probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07031","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-18T00:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsoaA8jdKZ+Jw9VgesUHVCf2R7sritlxPWFbeTBjEs0lMVsKe0lCl2IGvmSUAgH0uqOhfR0QtMnMWYEgT+7ZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:46:33.722044Z"},"content_sha256":"0be05aac8ba627e4d4c41a03491555cdf5d4022492219d39440dd31ce13374ae","schema_version":"1.0","event_id":"sha256:0be05aac8ba627e4d4c41a03491555cdf5d4022492219d39440dd31ce13374ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY5EAEGW6JKZX5Y45LMZBJE73T/bundle.json","state_url":"https://pith.science/pith/QY5EAEGW6JKZX5Y45LMZBJE73T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY5EAEGW6JKZX5Y45LMZBJE73T/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-20T09:46:33Z","links":{"resolver":"https://pith.science/pith/QY5EAEGW6JKZX5Y45LMZBJE73T","bundle":"https://pith.science/pith/QY5EAEGW6JKZX5Y45LMZBJE73T/bundle.json","state":"https://pith.science/pith/QY5EAEGW6JKZX5Y45LMZBJE73T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY5EAEGW6JKZX5Y45LMZBJE73T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QY5EAEGW6JKZX5Y45LMZBJE73T","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":"04e72ba85e41d6c92c8661955df465b09baf791da9b5493d7fbe1ecf05904f73","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-24T13:49:23Z","title_canon_sha256":"a3a6b0f6b0740473ffbb411bc679ed9ac5d6e5c7d6fc2a7763426a9dfce7ebc7"},"schema_version":"1.0","source":{"id":"1604.07031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07031","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07031v2","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07031","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"QY5EAEGW6JKZ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QY5EAEGW6JKZX5Y4","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QY5EAEGW","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:0be05aac8ba627e4d4c41a03491555cdf5d4022492219d39440dd31ce13374ae","target":"graph","created_at":"2026-05-18T00:38:46Z","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 develop a novel algorithm, Predictive Hierarchical Clustering (PHC), for agglomerative hierarchical clustering of current procedural terminology (CPT) codes. Our predictive hierarchical clustering aims to cluster subgroups, not individual observations, found within our data, such that the clusters discovered result in optimal performance of a classification model. Therefore, merges are chosen based on a Bayesian hypothesis test, which chooses pairings of the subgroups that result in the best model fit, as measured by held out predictive likelihoods. We place a Dirichlet prior on the probabi","authors_text":"Elizabeth C. Lorenzi, Katherine Heller, Stephanie L. Brown, Zhifei Sun","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-24T13:49:23Z","title":"Predictive Hierarchical Clustering: Learning clusters of CPT codes for improving surgical outcomes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07031","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:861c98f5f6764e6358d3c8f7e6615edfb6d243b6c483a5dc316e09f2b0ce3526","target":"record","created_at":"2026-05-18T00:38:46Z","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":"04e72ba85e41d6c92c8661955df465b09baf791da9b5493d7fbe1ecf05904f73","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-24T13:49:23Z","title_canon_sha256":"a3a6b0f6b0740473ffbb411bc679ed9ac5d6e5c7d6fc2a7763426a9dfce7ebc7"},"schema_version":"1.0","source":{"id":"1604.07031","kind":"arxiv","version":2}},"canonical_sha256":"863a4010d6f2559bf71cead990a49fdcdd8425e91b36a13eba67e0a0c35c7325","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"863a4010d6f2559bf71cead990a49fdcdd8425e91b36a13eba67e0a0c35c7325","first_computed_at":"2026-05-18T00:38:46.620834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:46.620834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pkfKfIZz2wg7pCFQWp9xwwFrqHx0bAYlNW/l5Ft9OcNM8jB8hPNKDdPQmUV0fPCHC1HFAR/DBFxhxpd5IL6hAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:46.621498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:861c98f5f6764e6358d3c8f7e6615edfb6d243b6c483a5dc316e09f2b0ce3526","sha256:0be05aac8ba627e4d4c41a03491555cdf5d4022492219d39440dd31ce13374ae"],"state_sha256":"21d5167e277e49e1c302a07e6cd8d7f64bec78ed19ef76839b404e8ed23d0d7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLu3/Z+R52GkXULTYhykt4iemDu2nsIRYZdou4YSl/gkFrP29hCtGHFZ0l80cfNwoFUmdlrXgKjNEJTb6YOdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:46:33.723958Z","bundle_sha256":"26bddf9a5bb2ddb869ab38edd63fff9e255a5e4dfcada363a6505138830e8b08"}}