{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JOOLAPNX2OM3KKGUNSZLIHBTXE","short_pith_number":"pith:JOOLAPNX","schema_version":"1.0","canonical_sha256":"4b9cb03db7d399b528d46cb2b41c33b93ea32798966106f952611f9a3ef05233","source":{"kind":"arxiv","id":"1511.01764","version":1},"attestation_state":"computed","paper":{"title":"Discrete R\\'enyi Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Tse, Farzan Farnia, Meisam Razaviyayn","submitted_at":"2015-11-05T14:47:04Z","abstract_excerpt":"Consider the binary classification problem of predicting a target variable $Y$ from a discrete feature vector $X = (X_1,...,X_d)$. When the probability distribution $\\mathbb{P}(X,Y)$ is known, the optimal classifier, leading to the minimum misclassification rate, is given by the Maximum A-posteriori Probability decision rule. However, estimating the complete joint distribution $\\mathbb{P}(X,Y)$ is computationally and statistically impossible for large values of $d$. An alternative approach is to first estimate some low order marginals of $\\mathbb{P}(X,Y)$ and then design the classifier based o"},"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":"1511.01764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T14:47:04Z","cross_cats_sorted":[],"title_canon_sha256":"01f9caab47e35692d8c95b7d5b0efe6bc3aad9d4db4ab306671c3ed6c9f0ac03","abstract_canon_sha256":"46904b9d0e5d0604b9df4d51ed6919b8e10977706b9ff57cdd4645ac3067a728"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.861254Z","signature_b64":"gGNZdMLdBsk3PAThmUL8UQ59k99PKC1AddnBL+eagL27yJ5SYKCCqbnlNIq+weKcd67qOS1o3ii2nDVY6LYsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b9cb03db7d399b528d46cb2b41c33b93ea32798966106f952611f9a3ef05233","last_reissued_at":"2026-05-18T01:27:39.860758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.860758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete R\\'enyi Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Tse, Farzan Farnia, Meisam Razaviyayn","submitted_at":"2015-11-05T14:47:04Z","abstract_excerpt":"Consider the binary classification problem of predicting a target variable $Y$ from a discrete feature vector $X = (X_1,...,X_d)$. When the probability distribution $\\mathbb{P}(X,Y)$ is known, the optimal classifier, leading to the minimum misclassification rate, is given by the Maximum A-posteriori Probability decision rule. However, estimating the complete joint distribution $\\mathbb{P}(X,Y)$ is computationally and statistically impossible for large values of $d$. An alternative approach is to first estimate some low order marginals of $\\mathbb{P}(X,Y)$ and then design the classifier based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01764","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":"1511.01764","created_at":"2026-05-18T01:27:39.860834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01764v1","created_at":"2026-05-18T01:27:39.860834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01764","created_at":"2026-05-18T01:27:39.860834+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOOLAPNX2OM3","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOOLAPNX2OM3KKGU","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOOLAPNX","created_at":"2026-05-18T12:29:27.538025+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/JOOLAPNX2OM3KKGUNSZLIHBTXE","json":"https://pith.science/pith/JOOLAPNX2OM3KKGUNSZLIHBTXE.json","graph_json":"https://pith.science/api/pith-number/JOOLAPNX2OM3KKGUNSZLIHBTXE/graph.json","events_json":"https://pith.science/api/pith-number/JOOLAPNX2OM3KKGUNSZLIHBTXE/events.json","paper":"https://pith.science/paper/JOOLAPNX"},"agent_actions":{"view_html":"https://pith.science/pith/JOOLAPNX2OM3KKGUNSZLIHBTXE","download_json":"https://pith.science/pith/JOOLAPNX2OM3KKGUNSZLIHBTXE.json","view_paper":"https://pith.science/paper/JOOLAPNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01764&json=true","fetch_graph":"https://pith.science/api/pith-number/JOOLAPNX2OM3KKGUNSZLIHBTXE/graph.json","fetch_events":"https://pith.science/api/pith-number/JOOLAPNX2OM3KKGUNSZLIHBTXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOOLAPNX2OM3KKGUNSZLIHBTXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOOLAPNX2OM3KKGUNSZLIHBTXE/action/storage_attestation","attest_author":"https://pith.science/pith/JOOLAPNX2OM3KKGUNSZLIHBTXE/action/author_attestation","sign_citation":"https://pith.science/pith/JOOLAPNX2OM3KKGUNSZLIHBTXE/action/citation_signature","submit_replication":"https://pith.science/pith/JOOLAPNX2OM3KKGUNSZLIHBTXE/action/replication_record"}},"created_at":"2026-05-18T01:27:39.860834+00:00","updated_at":"2026-05-18T01:27:39.860834+00:00"}