{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ASTWRF7TXEO5I2IMQCJT64LQIZ","short_pith_number":"pith:ASTWRF7T","schema_version":"1.0","canonical_sha256":"04a76897f3b91dd4690c80933f717046441e3b3882137455581af9d4a2093dae","source":{"kind":"arxiv","id":"1505.04637","version":1},"attestation_state":"computed","paper":{"title":"Ensemble of Example-Dependent Cost-Sensitive Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alejandro Correa Bahnsen, Bjorn Ottersten, Djamila Aouada","submitted_at":"2015-05-18T13:43:53Z","abstract_excerpt":"Several real-world classification problems are example-dependent cost-sensitive in nature, where the costs due to misclassification vary between examples and not only within classes. However, standard classification methods do not take these costs into account, and assume a constant cost of misclassification errors. In previous works, some methods that take into account the financial costs into the training of different algorithms have been proposed, with the example-dependent cost-sensitive decision tree algorithm being the one that gives the highest savings. In this paper we propose a new fr"},"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":"1505.04637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-18T13:43:53Z","cross_cats_sorted":[],"title_canon_sha256":"46cf598ec0ba6cab430f8017954623b408475fb49498e30b1c1a8ab844042fa7","abstract_canon_sha256":"1a90bcadf72b2befcbceead2ce593f824be904286644deed843e501eaea0345f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:24.940306Z","signature_b64":"1KLS1Ju2jqyZwUCw8YrOF40X0tnZkbFiVeuFCZ+/twWoDUNuSTNNnXsGRD9F77RE0g/YOdcq2GtNHFl+11ejCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04a76897f3b91dd4690c80933f717046441e3b3882137455581af9d4a2093dae","last_reissued_at":"2026-05-18T02:07:24.939946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:24.939946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensemble of Example-Dependent Cost-Sensitive Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alejandro Correa Bahnsen, Bjorn Ottersten, Djamila Aouada","submitted_at":"2015-05-18T13:43:53Z","abstract_excerpt":"Several real-world classification problems are example-dependent cost-sensitive in nature, where the costs due to misclassification vary between examples and not only within classes. However, standard classification methods do not take these costs into account, and assume a constant cost of misclassification errors. In previous works, some methods that take into account the financial costs into the training of different algorithms have been proposed, with the example-dependent cost-sensitive decision tree algorithm being the one that gives the highest savings. In this paper we propose a new fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04637","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":"1505.04637","created_at":"2026-05-18T02:07:24.940005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04637v1","created_at":"2026-05-18T02:07:24.940005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04637","created_at":"2026-05-18T02:07:24.940005+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASTWRF7TXEO5","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASTWRF7TXEO5I2IM","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASTWRF7T","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01409","citing_title":"Evaluating the stability of model explanations in instance-dependent cost-sensitive credit scoring","ref_index":2014,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ","json":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ.json","graph_json":"https://pith.science/api/pith-number/ASTWRF7TXEO5I2IMQCJT64LQIZ/graph.json","events_json":"https://pith.science/api/pith-number/ASTWRF7TXEO5I2IMQCJT64LQIZ/events.json","paper":"https://pith.science/paper/ASTWRF7T"},"agent_actions":{"view_html":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ","download_json":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ.json","view_paper":"https://pith.science/paper/ASTWRF7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04637&json=true","fetch_graph":"https://pith.science/api/pith-number/ASTWRF7TXEO5I2IMQCJT64LQIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ASTWRF7TXEO5I2IMQCJT64LQIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ/action/storage_attestation","attest_author":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ/action/author_attestation","sign_citation":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ/action/citation_signature","submit_replication":"https://pith.science/pith/ASTWRF7TXEO5I2IMQCJT64LQIZ/action/replication_record"}},"created_at":"2026-05-18T02:07:24.940005+00:00","updated_at":"2026-05-18T02:07:24.940005+00:00"}