{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EBZP7JN3RPLMB5NRRYHCV4LKLY","short_pith_number":"pith:EBZP7JN3","schema_version":"1.0","canonical_sha256":"2072ffa5bb8bd6c0f5b18e0e2af16a5e0e164353f380b8db967df8c836ea5425","source":{"kind":"arxiv","id":"1908.08351","version":2},"attestation_state":"computed","paper":{"title":"Compositionality decomposed: how do neural networks generalise?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Dieuwke Hupkes, Elia Bruni, Mathijs Mul, Verna Dankers","submitted_at":"2019-08-22T13:08:26Z","abstract_excerpt":"Despite a multitude of empirical studies, little consensus exists on whether neural networks are able to generalise compositionally, a controversy that, in part, stems from a lack of agreement about what it means for a neural model to be compositional. As a response to this controversy, we present a set of tests that provide a bridge between, on the one hand, the vast amount of linguistic and philosophical theory about compositionality of language and, on the other, the successful neural models of language. We collect different interpretations of compositionality and translate them into five t"},"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":"1908.08351","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-22T13:08:26Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"340fa05ecea4a9be602122663a0277f483c20c16eb8881c6ae57e8beb204c072","abstract_canon_sha256":"5e1c7e759bfe005617489a9075209edebbb1bb797d6ee3e8fc3f9804afa16da7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:03.295150Z","signature_b64":"EZ79/QF14ENvDiwuVkQ1uk0IltQB+l7ls/8LtEF8tW3lGffuFiBxwTdhmE0Sm50l8Pb2K1/Ert3FCxNvmCwCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2072ffa5bb8bd6c0f5b18e0e2af16a5e0e164353f380b8db967df8c836ea5425","last_reissued_at":"2026-07-05T00:43:03.294671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:03.294671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositionality decomposed: how do neural networks generalise?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Dieuwke Hupkes, Elia Bruni, Mathijs Mul, Verna Dankers","submitted_at":"2019-08-22T13:08:26Z","abstract_excerpt":"Despite a multitude of empirical studies, little consensus exists on whether neural networks are able to generalise compositionally, a controversy that, in part, stems from a lack of agreement about what it means for a neural model to be compositional. As a response to this controversy, we present a set of tests that provide a bridge between, on the one hand, the vast amount of linguistic and philosophical theory about compositionality of language and, on the other, the successful neural models of language. We collect different interpretations of compositionality and translate them into five t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08351","kind":"arxiv","version":2},"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/1908.08351/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":"1908.08351","created_at":"2026-07-05T00:43:03.294728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08351v2","created_at":"2026-07-05T00:43:03.294728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08351","created_at":"2026-07-05T00:43:03.294728+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBZP7JN3RPLM","created_at":"2026-07-05T00:43:03.294728+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBZP7JN3RPLMB5NR","created_at":"2026-07-05T00:43:03.294728+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBZP7JN3","created_at":"2026-07-05T00:43:03.294728+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05106","citing_title":"Arithmetic Pedagogy for Language Models","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2510.01685","citing_title":"How Do Language Models Compose Functions?","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2102.01293","citing_title":"Scaling Laws for Transfer","ref_index":88,"is_internal_anchor":false},{"citing_arxiv_id":"2010.14701","citing_title":"Scaling Laws for Autoregressive Generative Modeling","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08934","citing_title":"From Mechanistic to Compositional Interpretability","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2112.00861","citing_title":"A General Language Assistant as a Laboratory for Alignment","ref_index":119,"is_internal_anchor":false},{"citing_arxiv_id":"2207.05221","citing_title":"Language Models (Mostly) Know What They Know","ref_index":177,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY","json":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY.json","graph_json":"https://pith.science/api/pith-number/EBZP7JN3RPLMB5NRRYHCV4LKLY/graph.json","events_json":"https://pith.science/api/pith-number/EBZP7JN3RPLMB5NRRYHCV4LKLY/events.json","paper":"https://pith.science/paper/EBZP7JN3"},"agent_actions":{"view_html":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY","download_json":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY.json","view_paper":"https://pith.science/paper/EBZP7JN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08351&json=true","fetch_graph":"https://pith.science/api/pith-number/EBZP7JN3RPLMB5NRRYHCV4LKLY/graph.json","fetch_events":"https://pith.science/api/pith-number/EBZP7JN3RPLMB5NRRYHCV4LKLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY/action/storage_attestation","attest_author":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY/action/author_attestation","sign_citation":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY/action/citation_signature","submit_replication":"https://pith.science/pith/EBZP7JN3RPLMB5NRRYHCV4LKLY/action/replication_record"}},"created_at":"2026-07-05T00:43:03.294728+00:00","updated_at":"2026-07-05T00:43:03.294728+00:00"}