{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UFFQRBNT7FPI2ENKXZOBX6RDVB","short_pith_number":"pith:UFFQRBNT","schema_version":"1.0","canonical_sha256":"a14b0885b3f95e8d11aabe5c1bfa23a855ca1621b1bdf01e07fbf4ea343d64ea","source":{"kind":"arxiv","id":"2605.28739","version":1},"attestation_state":"computed","paper":{"title":"BIRDNet: Mining and Encoding Boolean Implication Knowledge Graphs as Interpretable Deep Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE","q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Tirtharaj Dash","submitted_at":"2026-05-27T16:59:01Z","abstract_excerpt":"Tabular data in knowledge-rich domains often carries a latent prior in the form of Boolean implication relationships (BIRs) between pairs of features. We mine such relationships with a sparse-exception binomial test. The mined implications form a typed directed graph, equivalent to a propositional rule base of 2-literal clauses. We encode this graph as the connectivity of a layered neural network, called BIRDNet, in which each hidden unit corresponds to one mined rule and binds only to its two features. We show two consequences of this design: First, the architecture is sparse by construction:"},"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":"2605.28739","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-27T16:59:01Z","cross_cats_sorted":["cs.AI","cs.NE","q-bio.QM"],"title_canon_sha256":"3b374de345c2ca55b1599ad1a5f0bace642d5d781f98ad4367ce266ec6646224","abstract_canon_sha256":"952e37b6d9ba1890787d9dfcdc2d3dac9ccf381c8e93d14d2a205f69586f08c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:05:01.614443Z","signature_b64":"NPMUN0SyM6PnPjlboiHl6IxknpTDW6J4iupDHS0eAwO9ta5zeLuJI+NsK79i5QraRDT5QFOKxOr+Img30gAXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14b0885b3f95e8d11aabe5c1bfa23a855ca1621b1bdf01e07fbf4ea343d64ea","last_reissued_at":"2026-05-28T02:05:01.614035Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:05:01.614035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BIRDNet: Mining and Encoding Boolean Implication Knowledge Graphs as Interpretable Deep Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE","q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Tirtharaj Dash","submitted_at":"2026-05-27T16:59:01Z","abstract_excerpt":"Tabular data in knowledge-rich domains often carries a latent prior in the form of Boolean implication relationships (BIRs) between pairs of features. We mine such relationships with a sparse-exception binomial test. The mined implications form a typed directed graph, equivalent to a propositional rule base of 2-literal clauses. We encode this graph as the connectivity of a layered neural network, called BIRDNet, in which each hidden unit corresponds to one mined rule and binds only to its two features. We show two consequences of this design: First, the architecture is sparse by construction:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28739","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/2605.28739/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":"2605.28739","created_at":"2026-05-28T02:05:01.614095+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28739v1","created_at":"2026-05-28T02:05:01.614095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28739","created_at":"2026-05-28T02:05:01.614095+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFFQRBNT7FPI","created_at":"2026-05-28T02:05:01.614095+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFFQRBNT7FPI2ENK","created_at":"2026-05-28T02:05:01.614095+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFFQRBNT","created_at":"2026-05-28T02:05:01.614095+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/UFFQRBNT7FPI2ENKXZOBX6RDVB","json":"https://pith.science/pith/UFFQRBNT7FPI2ENKXZOBX6RDVB.json","graph_json":"https://pith.science/api/pith-number/UFFQRBNT7FPI2ENKXZOBX6RDVB/graph.json","events_json":"https://pith.science/api/pith-number/UFFQRBNT7FPI2ENKXZOBX6RDVB/events.json","paper":"https://pith.science/paper/UFFQRBNT"},"agent_actions":{"view_html":"https://pith.science/pith/UFFQRBNT7FPI2ENKXZOBX6RDVB","download_json":"https://pith.science/pith/UFFQRBNT7FPI2ENKXZOBX6RDVB.json","view_paper":"https://pith.science/paper/UFFQRBNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28739&json=true","fetch_graph":"https://pith.science/api/pith-number/UFFQRBNT7FPI2ENKXZOBX6RDVB/graph.json","fetch_events":"https://pith.science/api/pith-number/UFFQRBNT7FPI2ENKXZOBX6RDVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFFQRBNT7FPI2ENKXZOBX6RDVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFFQRBNT7FPI2ENKXZOBX6RDVB/action/storage_attestation","attest_author":"https://pith.science/pith/UFFQRBNT7FPI2ENKXZOBX6RDVB/action/author_attestation","sign_citation":"https://pith.science/pith/UFFQRBNT7FPI2ENKXZOBX6RDVB/action/citation_signature","submit_replication":"https://pith.science/pith/UFFQRBNT7FPI2ENKXZOBX6RDVB/action/replication_record"}},"created_at":"2026-05-28T02:05:01.614095+00:00","updated_at":"2026-05-28T02:05:01.614095+00:00"}