{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3EUAFHYTVOMRMFYI6LPYQFB5TW","short_pith_number":"pith:3EUAFHYT","schema_version":"1.0","canonical_sha256":"d928029f13ab99161708f2df88143d9d8621829591fd9d218cdf7e3a5195baf4","source":{"kind":"arxiv","id":"2607.02069","version":1},"attestation_state":"computed","paper":{"title":"Algebraic Model Counting for Global Analysis of Optimal Decision Trees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hiroki Arimura","submitted_at":"2026-07-02T12:03:11Z","abstract_excerpt":"Ensuring model reliability in Explainable AI requires a global assessment of the hypothesis space. We propose a formal framework for the exhaustive analysis of optimal and near-optimal decision trees, called Algebraic Decision Tree Counting (ADTC). Inspired by Algebraic Model Counting (AMC) in knowledge representation, ADTC reformulates diverse analytical tasks, such as optimization, counting, and sampling, into a unified sum-of-products computation over a semiring $R$. While the hypothesis space of decision trees is doubly exponential with respect to the maximum depth $\\Delta$, our dynamic pr"},"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":"2607.02069","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-02T12:03:11Z","cross_cats_sorted":[],"title_canon_sha256":"f72e17ff8a9296737e35e1aa8f45a0a0291f988157b20cd24172d339903842b0","abstract_canon_sha256":"5532f1824e9a49390ef2b805eb82dd89f716c7e7e1aa9f216a843a7c06931988"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:38.859992Z","signature_b64":"0wrSwd8cuXUk9V+KjBKlOHg9/54VroBrIyStKn866LgNqEbPvObikiQEsih6PIZQO9N0SVhAZ+w05qM/KLnbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d928029f13ab99161708f2df88143d9d8621829591fd9d218cdf7e3a5195baf4","last_reissued_at":"2026-07-03T01:17:38.859577Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:38.859577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algebraic Model Counting for Global Analysis of Optimal Decision Trees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hiroki Arimura","submitted_at":"2026-07-02T12:03:11Z","abstract_excerpt":"Ensuring model reliability in Explainable AI requires a global assessment of the hypothesis space. We propose a formal framework for the exhaustive analysis of optimal and near-optimal decision trees, called Algebraic Decision Tree Counting (ADTC). Inspired by Algebraic Model Counting (AMC) in knowledge representation, ADTC reformulates diverse analytical tasks, such as optimization, counting, and sampling, into a unified sum-of-products computation over a semiring $R$. While the hypothesis space of decision trees is doubly exponential with respect to the maximum depth $\\Delta$, our dynamic pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02069","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.02069/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":"2607.02069","created_at":"2026-07-03T01:17:38.859641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.02069v1","created_at":"2026-07-03T01:17:38.859641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02069","created_at":"2026-07-03T01:17:38.859641+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EUAFHYTVOMR","created_at":"2026-07-03T01:17:38.859641+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EUAFHYTVOMRMFYI","created_at":"2026-07-03T01:17:38.859641+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EUAFHYT","created_at":"2026-07-03T01:17:38.859641+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/3EUAFHYTVOMRMFYI6LPYQFB5TW","json":"https://pith.science/pith/3EUAFHYTVOMRMFYI6LPYQFB5TW.json","graph_json":"https://pith.science/api/pith-number/3EUAFHYTVOMRMFYI6LPYQFB5TW/graph.json","events_json":"https://pith.science/api/pith-number/3EUAFHYTVOMRMFYI6LPYQFB5TW/events.json","paper":"https://pith.science/paper/3EUAFHYT"},"agent_actions":{"view_html":"https://pith.science/pith/3EUAFHYTVOMRMFYI6LPYQFB5TW","download_json":"https://pith.science/pith/3EUAFHYTVOMRMFYI6LPYQFB5TW.json","view_paper":"https://pith.science/paper/3EUAFHYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.02069&json=true","fetch_graph":"https://pith.science/api/pith-number/3EUAFHYTVOMRMFYI6LPYQFB5TW/graph.json","fetch_events":"https://pith.science/api/pith-number/3EUAFHYTVOMRMFYI6LPYQFB5TW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EUAFHYTVOMRMFYI6LPYQFB5TW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EUAFHYTVOMRMFYI6LPYQFB5TW/action/storage_attestation","attest_author":"https://pith.science/pith/3EUAFHYTVOMRMFYI6LPYQFB5TW/action/author_attestation","sign_citation":"https://pith.science/pith/3EUAFHYTVOMRMFYI6LPYQFB5TW/action/citation_signature","submit_replication":"https://pith.science/pith/3EUAFHYTVOMRMFYI6LPYQFB5TW/action/replication_record"}},"created_at":"2026-07-03T01:17:38.859641+00:00","updated_at":"2026-07-03T01:17:38.859641+00:00"}