{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:37F3E5FURSDVXYZ4UTUZAXAOJV","short_pith_number":"pith:37F3E5FU","canonical_record":{"source":{"id":"1406.1827","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-06T22:09:27Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"ef6486ff85950a9e7261081e14ee2f2de450cef80d22f42f952b7da57c7f53e3","abstract_canon_sha256":"9020422f058b9d54c75d7aa0a9dc278dcaa88db8f2f9f278cfb619ef62b863a8"},"schema_version":"1.0"},"canonical_sha256":"dfcbb274b48c875be33ca4e9905c0e4d5f2474d5ec0bf19fdb2d71f101da3951","source":{"kind":"arxiv","id":"1406.1827","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1827","created_at":"2026-05-18T02:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1827v4","created_at":"2026-05-18T02:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1827","created_at":"2026-05-18T02:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"37F3E5FURSDV","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"37F3E5FURSDVXYZ4","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"37F3E5FU","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:37F3E5FURSDVXYZ4UTUZAXAOJV","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1827","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-06T22:09:27Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"ef6486ff85950a9e7261081e14ee2f2de450cef80d22f42f952b7da57c7f53e3","abstract_canon_sha256":"9020422f058b9d54c75d7aa0a9dc278dcaa88db8f2f9f278cfb619ef62b863a8"},"schema_version":"1.0"},"canonical_sha256":"dfcbb274b48c875be33ca4e9905c0e4d5f2474d5ec0bf19fdb2d71f101da3951","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:54.629216Z","signature_b64":"u0h6jnfrcLifh77M8Uoka2ggEVRAK9AhRRBB0D8Wd6aBx1uwTQDtGJ5qzgikAnJur+4Cgc8po3c7qJV1rLczAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfcbb274b48c875be33ca4e9905c0e4d5f2474d5ec0bf19fdb2d71f101da3951","last_reissued_at":"2026-05-18T02:09:54.628485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:54.628485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1827","source_version":4,"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-18T02:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwhx794rq3vRV8jPQCbAfaIkr0CfHLu3rCZyrce0rmZYobRwKi5l0V6b2MYzRzNcTDce48W5DWduNUTcvT3+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:54:08.969741Z"},"content_sha256":"29956a4a505001d761359af3926e1459ca06dd215d3b7f60686a21f59fcca4d7","schema_version":"1.0","event_id":"sha256:29956a4a505001d761359af3926e1459ca06dd215d3b7f60686a21f59fcca4d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:37F3E5FURSDVXYZ4UTUZAXAOJV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Neural Networks Can Learn Logical Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Christopher D. Manning, Christopher Potts, Samuel R. Bowman","submitted_at":"2014-06-06T22:09:27Z","abstract_excerpt":"Tree-structured recursive neural networks (TreeRNNs) for sentence meaning have been successful for many applications, but it remains an open question whether the fixed-length representations that they learn can support tasks as demanding as logical deduction. We pursue this question by evaluating whether two such models---plain TreeRNNs and tree-structured neural tensor networks (TreeRNTNs)---can correctly learn to identify logical relationships such as entailment and contradiction using these representations. In our first set of experiments, we generate artificial data from a logical grammar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1827","kind":"arxiv","version":4},"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-18T02:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RwyhDI/pKaG7YokEgdgzUU1bt5PFBvYQqXUZE58XYPZcs6XB1riav3JgtBI6MM4wamC/5yUDydyK0RUzYJUzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:54:08.970171Z"},"content_sha256":"4f20f2acecd59aeddd8fcacb09f23e38166b0b07d794dea1460a8a9a64c57a49","schema_version":"1.0","event_id":"sha256:4f20f2acecd59aeddd8fcacb09f23e38166b0b07d794dea1460a8a9a64c57a49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37F3E5FURSDVXYZ4UTUZAXAOJV/bundle.json","state_url":"https://pith.science/pith/37F3E5FURSDVXYZ4UTUZAXAOJV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37F3E5FURSDVXYZ4UTUZAXAOJV/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-06-03T08:54:08Z","links":{"resolver":"https://pith.science/pith/37F3E5FURSDVXYZ4UTUZAXAOJV","bundle":"https://pith.science/pith/37F3E5FURSDVXYZ4UTUZAXAOJV/bundle.json","state":"https://pith.science/pith/37F3E5FURSDVXYZ4UTUZAXAOJV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37F3E5FURSDVXYZ4UTUZAXAOJV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:37F3E5FURSDVXYZ4UTUZAXAOJV","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":"9020422f058b9d54c75d7aa0a9dc278dcaa88db8f2f9f278cfb619ef62b863a8","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-06T22:09:27Z","title_canon_sha256":"ef6486ff85950a9e7261081e14ee2f2de450cef80d22f42f952b7da57c7f53e3"},"schema_version":"1.0","source":{"id":"1406.1827","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1827","created_at":"2026-05-18T02:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1827v4","created_at":"2026-05-18T02:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1827","created_at":"2026-05-18T02:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"37F3E5FURSDV","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"37F3E5FURSDVXYZ4","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"37F3E5FU","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:4f20f2acecd59aeddd8fcacb09f23e38166b0b07d794dea1460a8a9a64c57a49","target":"graph","created_at":"2026-05-18T02:09:54Z","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":"Tree-structured recursive neural networks (TreeRNNs) for sentence meaning have been successful for many applications, but it remains an open question whether the fixed-length representations that they learn can support tasks as demanding as logical deduction. We pursue this question by evaluating whether two such models---plain TreeRNNs and tree-structured neural tensor networks (TreeRNTNs)---can correctly learn to identify logical relationships such as entailment and contradiction using these representations. In our first set of experiments, we generate artificial data from a logical grammar ","authors_text":"Christopher D. Manning, Christopher Potts, Samuel R. Bowman","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-06T22:09:27Z","title":"Recursive Neural Networks Can Learn Logical Semantics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1827","kind":"arxiv","version":4},"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:29956a4a505001d761359af3926e1459ca06dd215d3b7f60686a21f59fcca4d7","target":"record","created_at":"2026-05-18T02:09:54Z","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":"9020422f058b9d54c75d7aa0a9dc278dcaa88db8f2f9f278cfb619ef62b863a8","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-06T22:09:27Z","title_canon_sha256":"ef6486ff85950a9e7261081e14ee2f2de450cef80d22f42f952b7da57c7f53e3"},"schema_version":"1.0","source":{"id":"1406.1827","kind":"arxiv","version":4}},"canonical_sha256":"dfcbb274b48c875be33ca4e9905c0e4d5f2474d5ec0bf19fdb2d71f101da3951","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfcbb274b48c875be33ca4e9905c0e4d5f2474d5ec0bf19fdb2d71f101da3951","first_computed_at":"2026-05-18T02:09:54.628485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:54.628485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u0h6jnfrcLifh77M8Uoka2ggEVRAK9AhRRBB0D8Wd6aBx1uwTQDtGJ5qzgikAnJur+4Cgc8po3c7qJV1rLczAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:54.629216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1827","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29956a4a505001d761359af3926e1459ca06dd215d3b7f60686a21f59fcca4d7","sha256:4f20f2acecd59aeddd8fcacb09f23e38166b0b07d794dea1460a8a9a64c57a49"],"state_sha256":"b3ae051b70a42e865b00ace3e2cb2d58bee834fd70c1dfb5b8311b8179a9b373"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0S1Vf7Lmxg4xU65trJpD+0HwYMUxVYmv3cWrBKs0821qhMzZt/8BKjsP4/lNNBmbodjV91q+n6AIQxCvsPMdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:54:08.972099Z","bundle_sha256":"6b2916bc909e127cdec5460e76f4eccf3b50559f86170db566e694b9788dca4f"}}