{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LDECBQM7JLZMKR6W5FKVXHB7G6","short_pith_number":"pith:LDECBQM7","canonical_record":{"source":{"id":"1906.00180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-01T08:17:42Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"b5b0c38ec4052942fcaac66e5412333598d0a6c01de98dab7aa3430e2ca552c4","abstract_canon_sha256":"343a02de7656373589feab252327122455a8dcb07330c5f1ac12c272a8cf393f"},"schema_version":"1.0"},"canonical_sha256":"58c820c19f4af2c547d6e9555b9c3f379d9cc2164142006edcd68f37f00f1722","source":{"kind":"arxiv","id":"1906.00180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00180","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00180v1","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00180","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"LDECBQM7JLZM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LDECBQM7JLZMKR6W","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LDECBQM7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LDECBQM7JLZMKR6W5FKVXHB7G6","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-01T08:17:42Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"b5b0c38ec4052942fcaac66e5412333598d0a6c01de98dab7aa3430e2ca552c4","abstract_canon_sha256":"343a02de7656373589feab252327122455a8dcb07330c5f1ac12c272a8cf393f"},"schema_version":"1.0"},"canonical_sha256":"58c820c19f4af2c547d6e9555b9c3f379d9cc2164142006edcd68f37f00f1722","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:27.902617Z","signature_b64":"mG4U7plD39/867hXP/FX+w2oBEuO42Zo3WJxTwmcpsOkABzKDRTLHlVu94qNxwmsSe1WW0MVQXjXz4xSl0QsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c820c19f4af2c547d6e9555b9c3f379d9cc2164142006edcd68f37f00f1722","last_reissued_at":"2026-05-17T23:44:27.901933Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:27.901933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00180","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-05-17T23:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqc8M9fk2COtebLBaRWd0BpjUzUJTYf40ZawgSZL47CV2z0qqJJQdXa8PwSdpoM/hVaiLvfUUAQIixEGlBrMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:17:19.245787Z"},"content_sha256":"5b563662088dc603091b4e4f9075e9280620900fd9bd1f217d9f1ba3773d11fd","schema_version":"1.0","event_id":"sha256:5b563662088dc603091b4e4f9075e9280620900fd9bd1f217d9f1ba3773d11fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LDECBQM7JLZMKR6W5FKVXHB7G6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Siamese recurrent networks learn first-order logic reasoning and exhibit zero-shot compositional generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Mathijs Mul, Willem Zuidema","submitted_at":"2019-06-01T08:17:42Z","abstract_excerpt":"Can neural nets learn logic? We approach this classic question with current methods, and demonstrate that recurrent neural networks can learn to recognize first order logical entailment relations between expressions. We define an artificial language in first-order predicate logic, generate a large dataset of sample 'sentences', and use an automatic theorem prover to infer the relation between random pairs of such sentences. We describe a Siamese neural architecture trained to predict the logical relation, and experiment with recurrent and recursive networks. Siamese Recurrent Networks are surp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00180","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":""},"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-05-17T23:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjgS4QjoYXsV6EG+KBgz2SvVwgcV9djwxfz79blyG0IQJlSogSE/ynmmeK55+oM/POYcC94+JWqhPwM1zMHiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:17:19.246540Z"},"content_sha256":"bb0c834d088ddd5817355c419b139d5d69b3f9342a0be99bcf7aa043bc9a8938","schema_version":"1.0","event_id":"sha256:bb0c834d088ddd5817355c419b139d5d69b3f9342a0be99bcf7aa043bc9a8938"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDECBQM7JLZMKR6W5FKVXHB7G6/bundle.json","state_url":"https://pith.science/pith/LDECBQM7JLZMKR6W5FKVXHB7G6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDECBQM7JLZMKR6W5FKVXHB7G6/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-05-31T00:17:19Z","links":{"resolver":"https://pith.science/pith/LDECBQM7JLZMKR6W5FKVXHB7G6","bundle":"https://pith.science/pith/LDECBQM7JLZMKR6W5FKVXHB7G6/bundle.json","state":"https://pith.science/pith/LDECBQM7JLZMKR6W5FKVXHB7G6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDECBQM7JLZMKR6W5FKVXHB7G6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LDECBQM7JLZMKR6W5FKVXHB7G6","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":"343a02de7656373589feab252327122455a8dcb07330c5f1ac12c272a8cf393f","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-01T08:17:42Z","title_canon_sha256":"b5b0c38ec4052942fcaac66e5412333598d0a6c01de98dab7aa3430e2ca552c4"},"schema_version":"1.0","source":{"id":"1906.00180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00180","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00180v1","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00180","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"LDECBQM7JLZM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LDECBQM7JLZMKR6W","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LDECBQM7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:bb0c834d088ddd5817355c419b139d5d69b3f9342a0be99bcf7aa043bc9a8938","target":"graph","created_at":"2026-05-17T23:44:27Z","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"},"paper":{"abstract_excerpt":"Can neural nets learn logic? We approach this classic question with current methods, and demonstrate that recurrent neural networks can learn to recognize first order logical entailment relations between expressions. We define an artificial language in first-order predicate logic, generate a large dataset of sample 'sentences', and use an automatic theorem prover to infer the relation between random pairs of such sentences. We describe a Siamese neural architecture trained to predict the logical relation, and experiment with recurrent and recursive networks. Siamese Recurrent Networks are surp","authors_text":"Mathijs Mul, Willem Zuidema","cross_cats":["cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-01T08:17:42Z","title":"Siamese recurrent networks learn first-order logic reasoning and exhibit zero-shot compositional generalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00180","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:5b563662088dc603091b4e4f9075e9280620900fd9bd1f217d9f1ba3773d11fd","target":"record","created_at":"2026-05-17T23:44:27Z","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":"343a02de7656373589feab252327122455a8dcb07330c5f1ac12c272a8cf393f","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-01T08:17:42Z","title_canon_sha256":"b5b0c38ec4052942fcaac66e5412333598d0a6c01de98dab7aa3430e2ca552c4"},"schema_version":"1.0","source":{"id":"1906.00180","kind":"arxiv","version":1}},"canonical_sha256":"58c820c19f4af2c547d6e9555b9c3f379d9cc2164142006edcd68f37f00f1722","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c820c19f4af2c547d6e9555b9c3f379d9cc2164142006edcd68f37f00f1722","first_computed_at":"2026-05-17T23:44:27.901933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:27.901933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mG4U7plD39/867hXP/FX+w2oBEuO42Zo3WJxTwmcpsOkABzKDRTLHlVu94qNxwmsSe1WW0MVQXjXz4xSl0QsAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:27.902617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b563662088dc603091b4e4f9075e9280620900fd9bd1f217d9f1ba3773d11fd","sha256:bb0c834d088ddd5817355c419b139d5d69b3f9342a0be99bcf7aa043bc9a8938"],"state_sha256":"80b68bdf62af6256012f23c9b6c4684a65e7be84d5abe66df1f171f2f2210d52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2znw00J9EsB5s2zcXyqHnCImra3PW0afxInvoWvR8DH5GxHRf5ZwfZr6+Sg1YBVr8Cv0vmi15sbFFt2dPCpbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:17:19.250226Z","bundle_sha256":"ec125f2036cfb6208234d57c18e6f7be74eb0ec283f592c6a9d2de134996b9df"}}