{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CMNRI5QQLOFTDA335D6Z5TJWAR","short_pith_number":"pith:CMNRI5QQ","schema_version":"1.0","canonical_sha256":"131b1476105b8b31837be8fd9ecd3604552839be345d0370457edb0fd32c0a0a","source":{"kind":"arxiv","id":"1301.3843","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Classification and Feature Selection from Finite Data Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"C. Lee Giles, Frans Coetzee, Steve Lawrence","submitted_at":"2013-01-16T15:49:23Z","abstract_excerpt":"Feature selection aims to select the smallest subset of features for a specified level of performance. The optimal achievable classification performance on a feature subset is summarized by its Receiver Operating Curve (ROC). When infinite data is available, the Neyman- Pearson (NP) design procedure provides the most efficient way of obtaining this curve. In practice the design procedure is applied to density estimates from finite data sets. We perform a detailed statistical analysis of the resulting error propagation on finite alphabets. We show that the estimated performance curve (EPC) prod"},"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":"1301.3843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-16T15:49:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f7b93535b3222c434f3b660b2a91ecaf7d747bcf82315551b558da2b4133292f","abstract_canon_sha256":"f784f20bc3a2da697acf1e5101080a138e4033e1155cf808e9b7375f062c2fa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.426293Z","signature_b64":"MaVJ9EQbBODgdWm8LtI4x0LXScG0jiZuoHFSAfyYWRv5GfPxVwLrAUkTgD3nnJGxqhtyMJK7WfeDdai7jaKBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"131b1476105b8b31837be8fd9ecd3604552839be345d0370457edb0fd32c0a0a","last_reissued_at":"2026-05-18T03:36:15.425619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.425619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Classification and Feature Selection from Finite Data Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"C. Lee Giles, Frans Coetzee, Steve Lawrence","submitted_at":"2013-01-16T15:49:23Z","abstract_excerpt":"Feature selection aims to select the smallest subset of features for a specified level of performance. The optimal achievable classification performance on a feature subset is summarized by its Receiver Operating Curve (ROC). When infinite data is available, the Neyman- Pearson (NP) design procedure provides the most efficient way of obtaining this curve. In practice the design procedure is applied to density estimates from finite data sets. We perform a detailed statistical analysis of the resulting error propagation on finite alphabets. We show that the estimated performance curve (EPC) prod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3843","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":"1301.3843","created_at":"2026-05-18T03:36:15.425729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3843v1","created_at":"2026-05-18T03:36:15.425729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3843","created_at":"2026-05-18T03:36:15.425729+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMNRI5QQLOFT","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMNRI5QQLOFTDA33","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMNRI5QQ","created_at":"2026-05-18T12:27:40.988391+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/CMNRI5QQLOFTDA335D6Z5TJWAR","json":"https://pith.science/pith/CMNRI5QQLOFTDA335D6Z5TJWAR.json","graph_json":"https://pith.science/api/pith-number/CMNRI5QQLOFTDA335D6Z5TJWAR/graph.json","events_json":"https://pith.science/api/pith-number/CMNRI5QQLOFTDA335D6Z5TJWAR/events.json","paper":"https://pith.science/paper/CMNRI5QQ"},"agent_actions":{"view_html":"https://pith.science/pith/CMNRI5QQLOFTDA335D6Z5TJWAR","download_json":"https://pith.science/pith/CMNRI5QQLOFTDA335D6Z5TJWAR.json","view_paper":"https://pith.science/paper/CMNRI5QQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3843&json=true","fetch_graph":"https://pith.science/api/pith-number/CMNRI5QQLOFTDA335D6Z5TJWAR/graph.json","fetch_events":"https://pith.science/api/pith-number/CMNRI5QQLOFTDA335D6Z5TJWAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMNRI5QQLOFTDA335D6Z5TJWAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMNRI5QQLOFTDA335D6Z5TJWAR/action/storage_attestation","attest_author":"https://pith.science/pith/CMNRI5QQLOFTDA335D6Z5TJWAR/action/author_attestation","sign_citation":"https://pith.science/pith/CMNRI5QQLOFTDA335D6Z5TJWAR/action/citation_signature","submit_replication":"https://pith.science/pith/CMNRI5QQLOFTDA335D6Z5TJWAR/action/replication_record"}},"created_at":"2026-05-18T03:36:15.425729+00:00","updated_at":"2026-05-18T03:36:15.425729+00:00"}