{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FXCMLP33BYJUKJUK7MZUGOM7EF","short_pith_number":"pith:FXCMLP33","schema_version":"1.0","canonical_sha256":"2dc4c5bf7b0e1345268afb3343399f2160c624cf0e6134ec5903f00e1e86a28a","source":{"kind":"arxiv","id":"1811.12889","version":3},"attestation_state":"computed","paper":{"title":"Systematic Generalization: What Is Required and Can It Be Learned?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Aaron Courville, Dzmitry Bahdanau, Harm de Vries, Michael Noukhovitch, Shikhar Murty, Thien Huu Nguyen","submitted_at":"2018-11-30T17:01:28Z","abstract_excerpt":"Numerous models for grounded language understanding have been recently proposed, including (i) generic models that can be easily adapted to any given task and (ii) intuitively appealing modular models that require background knowledge to be instantiated. We compare both types of models in how much they lend themselves to a particular form of systematic generalization. Using a synthetic VQA test, we evaluate which models are capable of reasoning about all possible object pairs after training on only a small subset of them. Our findings show that the generalization of modular models is much more"},"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":"1811.12889","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-30T17:01:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1644e0e042ddeeb3cd8aaeb446352dd957f25c625764db6c39c780fdcba5163d","abstract_canon_sha256":"a1a39481fd1acc04d53304abe53fab484d04f3fef6d800ee52e8552b6cd5c09f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:06.357329Z","signature_b64":"eWfr3Bzw0+BK3NHyNNTVKaCKSFsM9Of5J1rOe1+TVu3b+QLwfwd/dDqu0Qpa50dpysqVsvZZiiCK6wNFTYV3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dc4c5bf7b0e1345268afb3343399f2160c624cf0e6134ec5903f00e1e86a28a","last_reissued_at":"2026-05-17T23:48:06.356839Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:06.356839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Systematic Generalization: What Is Required and Can It Be Learned?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Aaron Courville, Dzmitry Bahdanau, Harm de Vries, Michael Noukhovitch, Shikhar Murty, Thien Huu Nguyen","submitted_at":"2018-11-30T17:01:28Z","abstract_excerpt":"Numerous models for grounded language understanding have been recently proposed, including (i) generic models that can be easily adapted to any given task and (ii) intuitively appealing modular models that require background knowledge to be instantiated. We compare both types of models in how much they lend themselves to a particular form of systematic generalization. Using a synthetic VQA test, we evaluate which models are capable of reasoning about all possible object pairs after training on only a small subset of them. Our findings show that the generalization of modular models is much more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12889","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":""},"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":"1811.12889","created_at":"2026-05-17T23:48:06.356910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12889v3","created_at":"2026-05-17T23:48:06.356910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12889","created_at":"2026-05-17T23:48:06.356910+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXCMLP33BYJU","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXCMLP33BYJUKJUK","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXCMLP33","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2511.02627","citing_title":"DecompSR: A dataset for decomposed analyses of compositional multihop spatial reasoning","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2303.08128","citing_title":"ViperGPT: Visual Inference via Python Execution for Reasoning","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03413","citing_title":"Learning to Theorize the World from Observation","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15306","citing_title":"Generalization in LLM Problem Solving: The Case of the Shortest Path","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF","json":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF.json","graph_json":"https://pith.science/api/pith-number/FXCMLP33BYJUKJUK7MZUGOM7EF/graph.json","events_json":"https://pith.science/api/pith-number/FXCMLP33BYJUKJUK7MZUGOM7EF/events.json","paper":"https://pith.science/paper/FXCMLP33"},"agent_actions":{"view_html":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF","download_json":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF.json","view_paper":"https://pith.science/paper/FXCMLP33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12889&json=true","fetch_graph":"https://pith.science/api/pith-number/FXCMLP33BYJUKJUK7MZUGOM7EF/graph.json","fetch_events":"https://pith.science/api/pith-number/FXCMLP33BYJUKJUK7MZUGOM7EF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF/action/storage_attestation","attest_author":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF/action/author_attestation","sign_citation":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF/action/citation_signature","submit_replication":"https://pith.science/pith/FXCMLP33BYJUKJUK7MZUGOM7EF/action/replication_record"}},"created_at":"2026-05-17T23:48:06.356910+00:00","updated_at":"2026-05-17T23:48:06.356910+00:00"}