{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M4FAIGRYZBYSMC6SZYIYTWHTJD","short_pith_number":"pith:M4FAIGRY","schema_version":"1.0","canonical_sha256":"670a041a38c871260bd2ce1189d8f348e336e2c1f0cae9b2e7292ae9ac10a370","source":{"kind":"arxiv","id":"2406.09308","version":1},"attestation_state":"computed","paper":{"title":"Transformers meet Neural Algorithmic Reasoners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Alex Vitvitskyi, Andrew Dudzik, Borja Ibarz, Jessica B. Hamrick, Larisa Markeeva, Petar Veli\\v{c}kovi\\'c, Razvan Pascanu, Wilfried Bounsi","submitted_at":"2024-06-13T16:42:06Z","abstract_excerpt":"Transformers have revolutionized machine learning with their simple yet effective architecture. Pre-training Transformers on massive text datasets from the Internet has led to unmatched generalization for natural language understanding (NLU) tasks. However, such language models remain fragile when tasked with algorithmic forms of reasoning, where computations must be precise and robust. To address this limitation, we propose a novel approach that combines the Transformer's language understanding with the robustness of graph neural network (GNN)-based neural algorithmic reasoners (NARs). Such N"},"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":"2406.09308","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-13T16:42:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"af4c3ac6720bc6978216c6cc51ec0e3238e1b36776728fb5b20ee8ed52280f09","abstract_canon_sha256":"ab5938cb92cedc48726727dcb92e6c548e3e7cd9f8f05fbb040ca2488b139676"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:31.337696Z","signature_b64":"JdfAO2WS/AjXERYxRVYvd/og5d2QyZ5emS6xECgyVzJR87iICm8bqogIpECw/loh/Oeeiz8bQJCgutqB9zucDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670a041a38c871260bd2ce1189d8f348e336e2c1f0cae9b2e7292ae9ac10a370","last_reissued_at":"2026-07-05T08:31:31.337199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:31.337199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transformers meet Neural Algorithmic Reasoners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Alex Vitvitskyi, Andrew Dudzik, Borja Ibarz, Jessica B. Hamrick, Larisa Markeeva, Petar Veli\\v{c}kovi\\'c, Razvan Pascanu, Wilfried Bounsi","submitted_at":"2024-06-13T16:42:06Z","abstract_excerpt":"Transformers have revolutionized machine learning with their simple yet effective architecture. Pre-training Transformers on massive text datasets from the Internet has led to unmatched generalization for natural language understanding (NLU) tasks. However, such language models remain fragile when tasked with algorithmic forms of reasoning, where computations must be precise and robust. To address this limitation, we propose a novel approach that combines the Transformer's language understanding with the robustness of graph neural network (GNN)-based neural algorithmic reasoners (NARs). Such N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09308","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/2406.09308/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":"2406.09308","created_at":"2026-07-05T08:31:31.337256+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.09308v1","created_at":"2026-07-05T08:31:31.337256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09308","created_at":"2026-07-05T08:31:31.337256+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4FAIGRYZBYS","created_at":"2026-07-05T08:31:31.337256+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4FAIGRYZBYSMC6S","created_at":"2026-07-05T08:31:31.337256+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4FAIGRY","created_at":"2026-07-05T08:31:31.337256+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20999","citing_title":"Inductive Generalization for Robotic Manipulation","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2506.21734","citing_title":"Hierarchical Reasoning Model","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD","json":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD.json","graph_json":"https://pith.science/api/pith-number/M4FAIGRYZBYSMC6SZYIYTWHTJD/graph.json","events_json":"https://pith.science/api/pith-number/M4FAIGRYZBYSMC6SZYIYTWHTJD/events.json","paper":"https://pith.science/paper/M4FAIGRY"},"agent_actions":{"view_html":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD","download_json":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD.json","view_paper":"https://pith.science/paper/M4FAIGRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.09308&json=true","fetch_graph":"https://pith.science/api/pith-number/M4FAIGRYZBYSMC6SZYIYTWHTJD/graph.json","fetch_events":"https://pith.science/api/pith-number/M4FAIGRYZBYSMC6SZYIYTWHTJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD/action/storage_attestation","attest_author":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD/action/author_attestation","sign_citation":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD/action/citation_signature","submit_replication":"https://pith.science/pith/M4FAIGRYZBYSMC6SZYIYTWHTJD/action/replication_record"}},"created_at":"2026-07-05T08:31:31.337256+00:00","updated_at":"2026-07-05T08:31:31.337256+00:00"}