{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CVOD2LPTMMOXNUIZVUCQRSUPLD","short_pith_number":"pith:CVOD2LPT","schema_version":"1.0","canonical_sha256":"155c3d2df3631d76d119ad0508ca8f58e3edc4499c08af594ab5a4ad9e7ec362","source":{"kind":"arxiv","id":"1811.10658","version":1},"attestation_state":"computed","paper":{"title":"HELOC Applicant Risk Performance Evaluation by Topological Hierarchical Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Brad Reynolds, Derek Doran, Kyle Brown, Ryan Kramer","submitted_at":"2018-11-26T19:35:11Z","abstract_excerpt":"Strong regulations in the financial industry mean that any decisions based on machine learning need to be explained. This precludes the use of powerful supervised techniques such as neural networks. In this study we propose a new unsupervised and semi-supervised technique known as the topological hierarchical decomposition (THD). This process breaks a dataset down into ever smaller groups, where groups are associated with a simplicial complex that approximate the underlying topology of a dataset. We apply THD to the FICO machine learning challenge dataset, consisting of anonymized home equity "},"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":"1811.10658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-26T19:35:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"293c32693ddf1c96321f0177e0fa341606422cfc40ddef2b3b9c38145fa96411","abstract_canon_sha256":"5f787bcffec67573fbd014f4da8ebcbf5d5b0a3b0c2cfc239b109a0fa93af06f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.899840Z","signature_b64":"OCGBU9xs/ncWivQX/6PrEiDcqy8vax5TetEvIWY39QcD5DDWxdnO3gSGMhWSmkFMt7B/Gde+Gg57OE6ce3UIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"155c3d2df3631d76d119ad0508ca8f58e3edc4499c08af594ab5a4ad9e7ec362","last_reissued_at":"2026-05-17T23:59:47.899232Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.899232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HELOC Applicant Risk Performance Evaluation by Topological Hierarchical Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Brad Reynolds, Derek Doran, Kyle Brown, Ryan Kramer","submitted_at":"2018-11-26T19:35:11Z","abstract_excerpt":"Strong regulations in the financial industry mean that any decisions based on machine learning need to be explained. This precludes the use of powerful supervised techniques such as neural networks. In this study we propose a new unsupervised and semi-supervised technique known as the topological hierarchical decomposition (THD). This process breaks a dataset down into ever smaller groups, where groups are associated with a simplicial complex that approximate the underlying topology of a dataset. We apply THD to the FICO machine learning challenge dataset, consisting of anonymized home equity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10658","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":"1811.10658","created_at":"2026-05-17T23:59:47.899323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10658v1","created_at":"2026-05-17T23:59:47.899323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10658","created_at":"2026-05-17T23:59:47.899323+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVOD2LPTMMOX","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVOD2LPTMMOXNUIZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVOD2LPT","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2405.18921","citing_title":"GLANCE: Global Actions in a Nutshell for Counterfactual Explainability","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD","json":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD.json","graph_json":"https://pith.science/api/pith-number/CVOD2LPTMMOXNUIZVUCQRSUPLD/graph.json","events_json":"https://pith.science/api/pith-number/CVOD2LPTMMOXNUIZVUCQRSUPLD/events.json","paper":"https://pith.science/paper/CVOD2LPT"},"agent_actions":{"view_html":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD","download_json":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD.json","view_paper":"https://pith.science/paper/CVOD2LPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10658&json=true","fetch_graph":"https://pith.science/api/pith-number/CVOD2LPTMMOXNUIZVUCQRSUPLD/graph.json","fetch_events":"https://pith.science/api/pith-number/CVOD2LPTMMOXNUIZVUCQRSUPLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD/action/storage_attestation","attest_author":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD/action/author_attestation","sign_citation":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD/action/citation_signature","submit_replication":"https://pith.science/pith/CVOD2LPTMMOXNUIZVUCQRSUPLD/action/replication_record"}},"created_at":"2026-05-17T23:59:47.899323+00:00","updated_at":"2026-05-17T23:59:47.899323+00:00"}