{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KKYXVQDOWGQYWWOTWKVRWVR4NS","short_pith_number":"pith:KKYXVQDO","schema_version":"1.0","canonical_sha256":"52b17ac06eb1a18b59d3b2ab1b563c6cb14b78a5183752190b7e24be07343db8","source":{"kind":"arxiv","id":"2302.02876","version":2},"attestation_state":"computed","paper":{"title":"Variational Information Pursuit for Interpretable Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Chattopadhyay, Benjamin D. Haeffele, Donald Geman, Kwan Ho Ryan Chan, Ren\\'e Vidal","submitted_at":"2023-02-06T15:43:48Z","abstract_excerpt":"There is a growing interest in the machine learning community in developing predictive algorithms that are \"interpretable by design\". Towards this end, recent work proposes to make interpretable decisions by sequentially asking interpretable queries about data until a prediction can be made with high confidence based on the answers obtained (the history). To promote short query-answer chains, a greedy procedure called Information Pursuit (IP) is used, which adaptively chooses queries in order of information gain. Generative models are employed to learn the distribution of query-answers and lab"},"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":"2302.02876","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-06T15:43:48Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d8e2e7abebf231647c559634aa57c0347cee984e43d8fe9c84e472c677477b58","abstract_canon_sha256":"2dc80af17eb3f5f170db73a6c7287b4b6912acd89b01344d043a71d4c6ddb680"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:58.730104Z","signature_b64":"yQtzmX1fn+zjx9E8OOA87ElwFdWTaLF33Nn4UYxjB6c54T/697ZykZSTBmulTZ5hWQwgxv6T55qHi33Lq+rZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b17ac06eb1a18b59d3b2ab1b563c6cb14b78a5183752190b7e24be07343db8","last_reissued_at":"2026-07-05T06:28:58.729629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:58.729629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Information Pursuit for Interpretable Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Chattopadhyay, Benjamin D. Haeffele, Donald Geman, Kwan Ho Ryan Chan, Ren\\'e Vidal","submitted_at":"2023-02-06T15:43:48Z","abstract_excerpt":"There is a growing interest in the machine learning community in developing predictive algorithms that are \"interpretable by design\". Towards this end, recent work proposes to make interpretable decisions by sequentially asking interpretable queries about data until a prediction can be made with high confidence based on the answers obtained (the history). To promote short query-answer chains, a greedy procedure called Information Pursuit (IP) is used, which adaptively chooses queries in order of information gain. Generative models are employed to learn the distribution of query-answers and lab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02876","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.02876/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2302.02876","created_at":"2026-07-05T06:28:58.729687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.02876v2","created_at":"2026-07-05T06:28:58.729687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02876","created_at":"2026-07-05T06:28:58.729687+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKYXVQDOWGQY","created_at":"2026-07-05T06:28:58.729687+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKYXVQDOWGQYWWOT","created_at":"2026-07-05T06:28:58.729687+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKYXVQDO","created_at":"2026-07-05T06:28:58.729687+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06775","citing_title":"Enhancing Performance of Explainable AI Models with Constrained Concept Refinement","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS","json":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS.json","graph_json":"https://pith.science/api/pith-number/KKYXVQDOWGQYWWOTWKVRWVR4NS/graph.json","events_json":"https://pith.science/api/pith-number/KKYXVQDOWGQYWWOTWKVRWVR4NS/events.json","paper":"https://pith.science/paper/KKYXVQDO"},"agent_actions":{"view_html":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS","download_json":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS.json","view_paper":"https://pith.science/paper/KKYXVQDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.02876&json=true","fetch_graph":"https://pith.science/api/pith-number/KKYXVQDOWGQYWWOTWKVRWVR4NS/graph.json","fetch_events":"https://pith.science/api/pith-number/KKYXVQDOWGQYWWOTWKVRWVR4NS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS/action/storage_attestation","attest_author":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS/action/author_attestation","sign_citation":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS/action/citation_signature","submit_replication":"https://pith.science/pith/KKYXVQDOWGQYWWOTWKVRWVR4NS/action/replication_record"}},"created_at":"2026-07-05T06:28:58.729687+00:00","updated_at":"2026-07-05T06:28:58.729687+00:00"}