{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N6TOXTS7Y5QMSMVQICV2CUS77A","short_pith_number":"pith:N6TOXTS7","schema_version":"1.0","canonical_sha256":"6fa6ebce5fc760c932b040aba1525ff80da2ed8bb409dfdb0a6da2b5c8cefdb2","source":{"kind":"arxiv","id":"2410.07966","version":1},"attestation_state":"computed","paper":{"title":"Neural Reasoning Networks: Efficient Interpretable Neural Networks With Automatic Textual Explanations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander Gray, Kyle Harper Erwin, Naweed Aghmad Khan, Ndivhuwo Makondo, Olga Vilenskaia, Parikshit Ram, Stephen Carrow, Tim Klinger","submitted_at":"2024-10-10T14:27:12Z","abstract_excerpt":"Recent advances in machine learning have led to a surge in adoption of neural networks for various tasks, but lack of interpretability remains an issue for many others in which an understanding of the features influencing the prediction is necessary to ensure fairness, safety, and legal compliance. In this paper we consider one class of such tasks, tabular dataset classification, and propose a novel neuro-symbolic architecture, Neural Reasoning Networks (NRN), that is scalable and generates logically sound textual explanations for its predictions. NRNs are connected layers of logical neurons w"},"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":"2410.07966","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-10T14:27:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d339b9fe8c00a4665a791686dbdb203fd20737c6f42bbe2c1b233d072c8d16ae","abstract_canon_sha256":"a6921c137c7bdbb074f34226d1006d870b04fab656dd01862efda1c3314e8aa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:46.770559Z","signature_b64":"aFFpuARYMgzb3lW8u90V9A6lBY4aJYLVE+q0Fe4ZE0WSpoAk8h0noEXjghYoWctzdWelMeUGKwktnjQMfIhGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fa6ebce5fc760c932b040aba1525ff80da2ed8bb409dfdb0a6da2b5c8cefdb2","last_reissued_at":"2026-07-05T09:18:46.770114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:46.770114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Reasoning Networks: Efficient Interpretable Neural Networks With Automatic Textual Explanations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander Gray, Kyle Harper Erwin, Naweed Aghmad Khan, Ndivhuwo Makondo, Olga Vilenskaia, Parikshit Ram, Stephen Carrow, Tim Klinger","submitted_at":"2024-10-10T14:27:12Z","abstract_excerpt":"Recent advances in machine learning have led to a surge in adoption of neural networks for various tasks, but lack of interpretability remains an issue for many others in which an understanding of the features influencing the prediction is necessary to ensure fairness, safety, and legal compliance. In this paper we consider one class of such tasks, tabular dataset classification, and propose a novel neuro-symbolic architecture, Neural Reasoning Networks (NRN), that is scalable and generates logically sound textual explanations for its predictions. NRNs are connected layers of logical neurons w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07966","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/2410.07966/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":"2410.07966","created_at":"2026-07-05T09:18:46.770173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.07966v1","created_at":"2026-07-05T09:18:46.770173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07966","created_at":"2026-07-05T09:18:46.770173+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6TOXTS7Y5QM","created_at":"2026-07-05T09:18:46.770173+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6TOXTS7Y5QMSMVQ","created_at":"2026-07-05T09:18:46.770173+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6TOXTS7","created_at":"2026-07-05T09:18:46.770173+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.14597","citing_title":"a1: Steep Test-time Scaling Law via Environment Augmented Generation","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A","json":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A.json","graph_json":"https://pith.science/api/pith-number/N6TOXTS7Y5QMSMVQICV2CUS77A/graph.json","events_json":"https://pith.science/api/pith-number/N6TOXTS7Y5QMSMVQICV2CUS77A/events.json","paper":"https://pith.science/paper/N6TOXTS7"},"agent_actions":{"view_html":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A","download_json":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A.json","view_paper":"https://pith.science/paper/N6TOXTS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.07966&json=true","fetch_graph":"https://pith.science/api/pith-number/N6TOXTS7Y5QMSMVQICV2CUS77A/graph.json","fetch_events":"https://pith.science/api/pith-number/N6TOXTS7Y5QMSMVQICV2CUS77A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A/action/storage_attestation","attest_author":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A/action/author_attestation","sign_citation":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A/action/citation_signature","submit_replication":"https://pith.science/pith/N6TOXTS7Y5QMSMVQICV2CUS77A/action/replication_record"}},"created_at":"2026-07-05T09:18:46.770173+00:00","updated_at":"2026-07-05T09:18:46.770173+00:00"}