{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A6WYOWR4OOHN622EMLX2M5CHMO","short_pith_number":"pith:A6WYOWR4","canonical_record":{"source":{"id":"1811.10475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-26T16:07:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9f159b1a43b22d21026e2bb22a259cb9a5d0c1c6c45d62e7ad2e912327fb261d","abstract_canon_sha256":"bb96befa84e2bb38cdc3ba906b7da8440bcc4d39cff2649307cd0859646a90f9"},"schema_version":"1.0"},"canonical_sha256":"07ad875a3c738edf6b4462efa6744763b9ce9e887eaae46f6a696f4fd445038f","source":{"kind":"arxiv","id":"1811.10475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10475","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10475v1","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10475","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"A6WYOWR4OOHN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A6WYOWR4OOHN622E","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A6WYOWR4","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A6WYOWR4OOHN622EMLX2M5CHMO","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-26T16:07:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9f159b1a43b22d21026e2bb22a259cb9a5d0c1c6c45d62e7ad2e912327fb261d","abstract_canon_sha256":"bb96befa84e2bb38cdc3ba906b7da8440bcc4d39cff2649307cd0859646a90f9"},"schema_version":"1.0"},"canonical_sha256":"07ad875a3c738edf6b4462efa6744763b9ce9e887eaae46f6a696f4fd445038f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:54.596726Z","signature_b64":"1d4CXp+BTB7GLZ6pZMupb05ovorW5744TJiab7TepzUQhDz0I5d4d9nMZXTNLHMpQdbvAoFcxS8AnovI99V/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ad875a3c738edf6b4462efa6744763b9ce9e887eaae46f6a696f4fd445038f","last_reissued_at":"2026-05-17T23:59:54.596084Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:54.596084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10475","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:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UfKNMrh4ckH7V6I76o08TDLaIesKa8GtaC3JbrGOUnhR7nRI74hj4giuA1qk37pR5sc2JzA1UrpnQglUW3UBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:23:50.428598Z"},"content_sha256":"1ec73cae34fb19d7cc362f63849201d7a07f6462c4907cc2f11b1860a5681884","schema_version":"1.0","event_id":"sha256:1ec73cae34fb19d7cc362f63849201d7a07f6462c4907cc2f11b1860a5681884"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A6WYOWR4OOHN622EMLX2M5CHMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sentence Encoding with Tree-constrained Relation Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Chris Dyer, Cyprien de Masson d'Autume, Lei Yu, Lingpeng Kong, Phil Blunsom, Wang Ling","submitted_at":"2018-11-26T16:07:36Z","abstract_excerpt":"The meaning of a sentence is a function of the relations that hold between its words. We instantiate this relational view of semantics in a series of neural models based on variants of relation networks (RNs) which represent a set of objects (for us, words forming a sentence) in terms of representations of pairs of objects. We propose two extensions to the basic RN model for natural language. First, building on the intuition that not all word pairs are equally informative about the meaning of a sentence, we use constraints based on both supervised and unsupervised dependency syntax to control "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10475","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:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGi+h17PRfM6wRmyIJt2fycV28Yhw5Ind2wyqCL0FktVm64d1jLIvw1r9NGsurLhRR1aIO75vRUWoFIfTqwWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:23:50.428950Z"},"content_sha256":"39761c1a8bdbb45aff3f0f1b537f598fc3ce483ca22c465fcd821efe4685496f","schema_version":"1.0","event_id":"sha256:39761c1a8bdbb45aff3f0f1b537f598fc3ce483ca22c465fcd821efe4685496f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6WYOWR4OOHN622EMLX2M5CHMO/bundle.json","state_url":"https://pith.science/pith/A6WYOWR4OOHN622EMLX2M5CHMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6WYOWR4OOHN622EMLX2M5CHMO/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-02T22:23:50Z","links":{"resolver":"https://pith.science/pith/A6WYOWR4OOHN622EMLX2M5CHMO","bundle":"https://pith.science/pith/A6WYOWR4OOHN622EMLX2M5CHMO/bundle.json","state":"https://pith.science/pith/A6WYOWR4OOHN622EMLX2M5CHMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6WYOWR4OOHN622EMLX2M5CHMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A6WYOWR4OOHN622EMLX2M5CHMO","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":"bb96befa84e2bb38cdc3ba906b7da8440bcc4d39cff2649307cd0859646a90f9","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-26T16:07:36Z","title_canon_sha256":"9f159b1a43b22d21026e2bb22a259cb9a5d0c1c6c45d62e7ad2e912327fb261d"},"schema_version":"1.0","source":{"id":"1811.10475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10475","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10475v1","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10475","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"A6WYOWR4OOHN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A6WYOWR4OOHN622E","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A6WYOWR4","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:39761c1a8bdbb45aff3f0f1b537f598fc3ce483ca22c465fcd821efe4685496f","target":"graph","created_at":"2026-05-17T23:59: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":"The meaning of a sentence is a function of the relations that hold between its words. We instantiate this relational view of semantics in a series of neural models based on variants of relation networks (RNs) which represent a set of objects (for us, words forming a sentence) in terms of representations of pairs of objects. We propose two extensions to the basic RN model for natural language. First, building on the intuition that not all word pairs are equally informative about the meaning of a sentence, we use constraints based on both supervised and unsupervised dependency syntax to control ","authors_text":"Chris Dyer, Cyprien de Masson d'Autume, Lei Yu, Lingpeng Kong, Phil Blunsom, Wang Ling","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-26T16:07:36Z","title":"Sentence Encoding with Tree-constrained Relation Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10475","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:1ec73cae34fb19d7cc362f63849201d7a07f6462c4907cc2f11b1860a5681884","target":"record","created_at":"2026-05-17T23:59: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":"bb96befa84e2bb38cdc3ba906b7da8440bcc4d39cff2649307cd0859646a90f9","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-26T16:07:36Z","title_canon_sha256":"9f159b1a43b22d21026e2bb22a259cb9a5d0c1c6c45d62e7ad2e912327fb261d"},"schema_version":"1.0","source":{"id":"1811.10475","kind":"arxiv","version":1}},"canonical_sha256":"07ad875a3c738edf6b4462efa6744763b9ce9e887eaae46f6a696f4fd445038f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07ad875a3c738edf6b4462efa6744763b9ce9e887eaae46f6a696f4fd445038f","first_computed_at":"2026-05-17T23:59:54.596084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:54.596084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1d4CXp+BTB7GLZ6pZMupb05ovorW5744TJiab7TepzUQhDz0I5d4d9nMZXTNLHMpQdbvAoFcxS8AnovI99V/Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:54.596726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ec73cae34fb19d7cc362f63849201d7a07f6462c4907cc2f11b1860a5681884","sha256:39761c1a8bdbb45aff3f0f1b537f598fc3ce483ca22c465fcd821efe4685496f"],"state_sha256":"cd05bc294321c3bf2dc456513c760e6acc86e57e504879388a0934376711df1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PHgIoHIshXtvR2cVbR1SVjuZLDRdoxg/kwImH2utbVLo2FZ49c0kd5pWDIaWkhruGopWHtj4D/z0GOreZx7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:23:50.431047Z","bundle_sha256":"3c1cf1c20fdb40c2ccea6757f78219b7b9052419ed8f651b7b15f65232049ead"}}