{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GXDII2TPIP4Y7ZM3YYDBTK2MIG","short_pith_number":"pith:GXDII2TP","schema_version":"1.0","canonical_sha256":"35c6846a6f43f98fe59bc60619ab4c41b47aa8c9329ce42cf1dc05039491e53b","source":{"kind":"arxiv","id":"2411.07107","version":3},"attestation_state":"computed","paper":{"title":"Training Neural Networks as Recognizers of Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Alexandra Butoi, Anej Svete, Brian DuSell, Ghazal Khalighinejad, Josef Valvoda, Ryan Cotterell","submitted_at":"2024-11-11T16:33:25Z","abstract_excerpt":"Characterizing the computational power of neural network architectures in terms of formal language theory remains a crucial line of research, as it describes lower and upper bounds on the reasoning capabilities of modern AI. However, when empirically testing these bounds, existing work often leaves a discrepancy between experiments and the formal claims they are meant to support. The problem is that formal language theory pertains specifically to recognizers: machines that receive a string as input and classify whether it belongs to a language. On the other hand, it is common instead to evalua"},"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":"2411.07107","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-11-11T16:33:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2761f8b735e33496bf4b1f2dcac5c86b2ca312f2ea460edd06e4ccd2f0201ca2","abstract_canon_sha256":"90d6818d661fc6eab50884abb0e32b8b090f36911e7be19ef7b33cfb62f5268f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:56.164882Z","signature_b64":"nbmQ+ZemnHHwYShIVLhXTXsQ9Eqe9rHWL5hENfLo3ePBD3nKBCBN1/TKX4PMkEXfvIH3gvTJtW5bDkxQgyooCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c6846a6f43f98fe59bc60619ab4c41b47aa8c9329ce42cf1dc05039491e53b","last_reissued_at":"2026-07-05T10:47:56.164400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:56.164400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Training Neural Networks as Recognizers of Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Alexandra Butoi, Anej Svete, Brian DuSell, Ghazal Khalighinejad, Josef Valvoda, Ryan Cotterell","submitted_at":"2024-11-11T16:33:25Z","abstract_excerpt":"Characterizing the computational power of neural network architectures in terms of formal language theory remains a crucial line of research, as it describes lower and upper bounds on the reasoning capabilities of modern AI. However, when empirically testing these bounds, existing work often leaves a discrepancy between experiments and the formal claims they are meant to support. The problem is that formal language theory pertains specifically to recognizers: machines that receive a string as input and classify whether it belongs to a language. On the other hand, it is common instead to evalua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07107","kind":"arxiv","version":3},"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/2411.07107/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":"2411.07107","created_at":"2026-07-05T10:47:56.164460+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.07107v3","created_at":"2026-07-05T10:47:56.164460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07107","created_at":"2026-07-05T10:47:56.164460+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXDII2TPIP4Y","created_at":"2026-07-05T10:47:56.164460+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXDII2TPIP4Y7ZM3","created_at":"2026-07-05T10:47:56.164460+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXDII2TP","created_at":"2026-07-05T10:47:56.164460+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02709","citing_title":"Evaluating the Formal Reasoning Capabilities of Large Language Models through Chomsky Hierarchy","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG","json":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG.json","graph_json":"https://pith.science/api/pith-number/GXDII2TPIP4Y7ZM3YYDBTK2MIG/graph.json","events_json":"https://pith.science/api/pith-number/GXDII2TPIP4Y7ZM3YYDBTK2MIG/events.json","paper":"https://pith.science/paper/GXDII2TP"},"agent_actions":{"view_html":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG","download_json":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG.json","view_paper":"https://pith.science/paper/GXDII2TP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.07107&json=true","fetch_graph":"https://pith.science/api/pith-number/GXDII2TPIP4Y7ZM3YYDBTK2MIG/graph.json","fetch_events":"https://pith.science/api/pith-number/GXDII2TPIP4Y7ZM3YYDBTK2MIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG/action/storage_attestation","attest_author":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG/action/author_attestation","sign_citation":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG/action/citation_signature","submit_replication":"https://pith.science/pith/GXDII2TPIP4Y7ZM3YYDBTK2MIG/action/replication_record"}},"created_at":"2026-07-05T10:47:56.164460+00:00","updated_at":"2026-07-05T10:47:56.164460+00:00"}