{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4GVW4XBLKOEFZNSTL5ZUOX6YRH","short_pith_number":"pith:4GVW4XBL","canonical_record":{"source":{"id":"1909.00111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-31T02:41:49Z","cross_cats_sorted":[],"title_canon_sha256":"0d1c17940bf6776e7c3c7240bdef0be5922ceb9d9fd89350c8c6fa9dc932775e","abstract_canon_sha256":"d204874425fc2b2d4377e8a60edb6c5e916aa721fb5175b27123ac77483f6d62"},"schema_version":"1.0"},"canonical_sha256":"e1ab6e5c2b53885cb6535f73475fd889d32b527c391f70bd350f110ff734877e","source":{"kind":"arxiv","id":"1909.00111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00111","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00111v1","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00111","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"4GVW4XBLKOEF","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"pith_short_16","alias_value":"4GVW4XBLKOEFZNST","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"pith_short_8","alias_value":"4GVW4XBL","created_at":"2026-07-05T00:01:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4GVW4XBLKOEFZNSTL5ZUOX6YRH","target":"record","payload":{"canonical_record":{"source":{"id":"1909.00111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-31T02:41:49Z","cross_cats_sorted":[],"title_canon_sha256":"0d1c17940bf6776e7c3c7240bdef0be5922ceb9d9fd89350c8c6fa9dc932775e","abstract_canon_sha256":"d204874425fc2b2d4377e8a60edb6c5e916aa721fb5175b27123ac77483f6d62"},"schema_version":"1.0"},"canonical_sha256":"e1ab6e5c2b53885cb6535f73475fd889d32b527c391f70bd350f110ff734877e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:05.539355Z","signature_b64":"rD7ij/ztv0tHIWzmSqnzkZrY/H25hXFlXbpSYCH9h7c125GsxvS3oL+UQHwmyacbCmTIqEVKKXngHF2NAd2TDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1ab6e5c2b53885cb6535f73475fd889d32b527c391f70bd350f110ff734877e","last_reissued_at":"2026-07-05T00:01:05.538883Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:05.538883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.00111","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSnoVk+RkS4uscZ6eD9ccUg8zw9HGIAz1p6sa/0v4Gpvmi5YqRqE5Xhr9jeOIfpXzeb09+b7Zul5bi6soWp2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:37:17.779659Z"},"content_sha256":"ee8abd4190a75e3c7b2a583897ef408d4e09b160a0638f66bd693b570a77f293","schema_version":"1.0","event_id":"sha256:ee8abd4190a75e3c7b2a583897ef408d4e09b160a0638f66bd693b570a77f293"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4GVW4XBLKOEFZNSTL5ZUOX6YRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantity doesn't buy quality syntax with neural language models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aaron Mueller, Marten van Schijndel, Tal Linzen","submitted_at":"2019-08-31T02:41:49Z","abstract_excerpt":"Recurrent neural networks can learn to predict upcoming words remarkably well on average; in syntactically complex contexts, however, they often assign unexpectedly high probabilities to ungrammatical words. We investigate to what extent these shortcomings can be mitigated by increasing the size of the network and the corpus on which it is trained. We find that gains from increasing network size are minimal beyond a certain point. Likewise, expanding the training corpus yields diminishing returns; we estimate that the training corpus would need to be unrealistically large for the models to mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00111","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/1909.00111/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ka2YDPQzVg4g7zqkJubzC5JnXgJrIkVGhLZerpYdC2Utb8gFXnxuhwbVAHiXz26Yfue2UQJ1xAdhz/Af43NuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:37:17.780168Z"},"content_sha256":"bb87be69d7b3f0fcc0c277bce3a0c6729636ef020fba0e3bc655e008acbdabc0","schema_version":"1.0","event_id":"sha256:bb87be69d7b3f0fcc0c277bce3a0c6729636ef020fba0e3bc655e008acbdabc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GVW4XBLKOEFZNSTL5ZUOX6YRH/bundle.json","state_url":"https://pith.science/pith/4GVW4XBLKOEFZNSTL5ZUOX6YRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GVW4XBLKOEFZNSTL5ZUOX6YRH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T22:37:17Z","links":{"resolver":"https://pith.science/pith/4GVW4XBLKOEFZNSTL5ZUOX6YRH","bundle":"https://pith.science/pith/4GVW4XBLKOEFZNSTL5ZUOX6YRH/bundle.json","state":"https://pith.science/pith/4GVW4XBLKOEFZNSTL5ZUOX6YRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GVW4XBLKOEFZNSTL5ZUOX6YRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4GVW4XBLKOEFZNSTL5ZUOX6YRH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d204874425fc2b2d4377e8a60edb6c5e916aa721fb5175b27123ac77483f6d62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-31T02:41:49Z","title_canon_sha256":"0d1c17940bf6776e7c3c7240bdef0be5922ceb9d9fd89350c8c6fa9dc932775e"},"schema_version":"1.0","source":{"id":"1909.00111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00111","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00111v1","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00111","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"4GVW4XBLKOEF","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"pith_short_16","alias_value":"4GVW4XBLKOEFZNST","created_at":"2026-07-05T00:01:05Z"},{"alias_kind":"pith_short_8","alias_value":"4GVW4XBL","created_at":"2026-07-05T00:01:05Z"}],"graph_snapshots":[{"event_id":"sha256:bb87be69d7b3f0fcc0c277bce3a0c6729636ef020fba0e3bc655e008acbdabc0","target":"graph","created_at":"2026-07-05T00:01:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.00111/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recurrent neural networks can learn to predict upcoming words remarkably well on average; in syntactically complex contexts, however, they often assign unexpectedly high probabilities to ungrammatical words. We investigate to what extent these shortcomings can be mitigated by increasing the size of the network and the corpus on which it is trained. We find that gains from increasing network size are minimal beyond a certain point. Likewise, expanding the training corpus yields diminishing returns; we estimate that the training corpus would need to be unrealistically large for the models to mat","authors_text":"Aaron Mueller, Marten van Schijndel, Tal Linzen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-31T02:41:49Z","title":"Quantity doesn't buy quality syntax with neural language models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00111","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ee8abd4190a75e3c7b2a583897ef408d4e09b160a0638f66bd693b570a77f293","target":"record","created_at":"2026-07-05T00:01:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d204874425fc2b2d4377e8a60edb6c5e916aa721fb5175b27123ac77483f6d62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-31T02:41:49Z","title_canon_sha256":"0d1c17940bf6776e7c3c7240bdef0be5922ceb9d9fd89350c8c6fa9dc932775e"},"schema_version":"1.0","source":{"id":"1909.00111","kind":"arxiv","version":1}},"canonical_sha256":"e1ab6e5c2b53885cb6535f73475fd889d32b527c391f70bd350f110ff734877e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1ab6e5c2b53885cb6535f73475fd889d32b527c391f70bd350f110ff734877e","first_computed_at":"2026-07-05T00:01:05.538883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:01:05.538883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rD7ij/ztv0tHIWzmSqnzkZrY/H25hXFlXbpSYCH9h7c125GsxvS3oL+UQHwmyacbCmTIqEVKKXngHF2NAd2TDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:01:05.539355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.00111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee8abd4190a75e3c7b2a583897ef408d4e09b160a0638f66bd693b570a77f293","sha256:bb87be69d7b3f0fcc0c277bce3a0c6729636ef020fba0e3bc655e008acbdabc0"],"state_sha256":"2b26c2bef0b03e013fb5a62d02e614962a837ab61f22f3ae9efe70b44161adbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlrgLvGZR/HvxsQLtoNNvLqJ4VAXu7qHhLhIfgh0omFRs0LefQDX+50J+VmfOqPMwp/VOaiV80svAIANrjmJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T22:37:17.784199Z","bundle_sha256":"38affbe0640d68dc7a362f6ee3c2a849298ce989ef89b8b65fc9afaa2a225671"}}