{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MUG5HFAKU74PD5KKS7XVNOTLHL","short_pith_number":"pith:MUG5HFAK","canonical_record":{"source":{"id":"1610.02806","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2016-10-10T08:52:36Z","cross_cats_sorted":[],"title_canon_sha256":"3c97f89c9d418e9d44e6dd79909866d0b4d0609bf491d86a82e92886633cc690","abstract_canon_sha256":"43dcb8a06ad412d7405d8f6a5b85dce08163bea9dc324aed216d583b606e9f6d"},"schema_version":"1.0"},"canonical_sha256":"650dd3940aa7f8f1f54a97ef56ba6b3ae8d100dd86d448e5f489692a42aa3d3a","source":{"kind":"arxiv","id":"1610.02806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02806","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02806v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02806","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"MUG5HFAKU74P","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MUG5HFAKU74PD5KK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MUG5HFAK","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MUG5HFAKU74PD5KKS7XVNOTLHL","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02806","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2016-10-10T08:52:36Z","cross_cats_sorted":[],"title_canon_sha256":"3c97f89c9d418e9d44e6dd79909866d0b4d0609bf491d86a82e92886633cc690","abstract_canon_sha256":"43dcb8a06ad412d7405d8f6a5b85dce08163bea9dc324aed216d583b606e9f6d"},"schema_version":"1.0"},"canonical_sha256":"650dd3940aa7f8f1f54a97ef56ba6b3ae8d100dd86d448e5f489692a42aa3d3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.677440Z","signature_b64":"qjgE9nBOWawq5uruTRdxOtBRdMa/WoPuVLNj5xXdduLA48q9T9Lq/sQw4Ne/nvkiJvZiOs26NHDWie+BbvwZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650dd3940aa7f8f1f54a97ef56ba6b3ae8d100dd86d448e5f489692a42aa3d3a","last_reissued_at":"2026-05-18T01:02:50.676848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.676848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02806","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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yxri9L0jydR2IDgETubSR9HuKEWDO4FqgdTORll8jEMtHYg8u/3aVJwrpPqJ132FkXRPDNYf+KY+Prxj+jCuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:01:21.097999Z"},"content_sha256":"3b93dfed738283841f207175d121676e1044cd9c1a9e56259503058dc89b4854","schema_version":"1.0","event_id":"sha256:3b93dfed738283841f207175d121676e1044cd9c1a9e56259503058dc89b4854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MUG5HFAKU74PD5KKS7XVNOTLHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modelling Sentence Pairs with Tree-structured Attentive Encoder","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Cong Liu, Yan Pan, Yao Zhou","submitted_at":"2016-10-10T08:52:36Z","abstract_excerpt":"We describe an attentive encoder that combines tree-structured recursive neural networks and sequential recurrent neural networks for modelling sentence pairs. Since existing attentive models exert attention on the sequential structure, we propose a way to incorporate attention into the tree topology. Specially, given a pair of sentences, our attentive encoder uses the representation of one sentence, which generated via an RNN, to guide the structural encoding of the other sentence on the dependency parse tree. We evaluate the proposed attentive encoder on three tasks: semantic similarity, par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02806","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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFcOcu99TlXELnJUOI94o9JwWEx7JkupIMc7u/+yZ/npJcfQJwT+3rSFLajLyVZSpYidaRfenorVXkeYMskwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:01:21.098357Z"},"content_sha256":"5f556bf29730da473a0af6e9356b846c5c1e45544ae7c5bdfe1d4a6a268c87f1","schema_version":"1.0","event_id":"sha256:5f556bf29730da473a0af6e9356b846c5c1e45544ae7c5bdfe1d4a6a268c87f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUG5HFAKU74PD5KKS7XVNOTLHL/bundle.json","state_url":"https://pith.science/pith/MUG5HFAKU74PD5KKS7XVNOTLHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUG5HFAKU74PD5KKS7XVNOTLHL/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-30T20:01:21Z","links":{"resolver":"https://pith.science/pith/MUG5HFAKU74PD5KKS7XVNOTLHL","bundle":"https://pith.science/pith/MUG5HFAKU74PD5KKS7XVNOTLHL/bundle.json","state":"https://pith.science/pith/MUG5HFAKU74PD5KKS7XVNOTLHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUG5HFAKU74PD5KKS7XVNOTLHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MUG5HFAKU74PD5KKS7XVNOTLHL","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":"43dcb8a06ad412d7405d8f6a5b85dce08163bea9dc324aed216d583b606e9f6d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2016-10-10T08:52:36Z","title_canon_sha256":"3c97f89c9d418e9d44e6dd79909866d0b4d0609bf491d86a82e92886633cc690"},"schema_version":"1.0","source":{"id":"1610.02806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02806","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02806v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02806","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"MUG5HFAKU74P","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MUG5HFAKU74PD5KK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MUG5HFAK","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:5f556bf29730da473a0af6e9356b846c5c1e45544ae7c5bdfe1d4a6a268c87f1","target":"graph","created_at":"2026-05-18T01:02:50Z","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":"We describe an attentive encoder that combines tree-structured recursive neural networks and sequential recurrent neural networks for modelling sentence pairs. Since existing attentive models exert attention on the sequential structure, we propose a way to incorporate attention into the tree topology. Specially, given a pair of sentences, our attentive encoder uses the representation of one sentence, which generated via an RNN, to guide the structural encoding of the other sentence on the dependency parse tree. We evaluate the proposed attentive encoder on three tasks: semantic similarity, par","authors_text":"Cong Liu, Yan Pan, Yao Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2016-10-10T08:52:36Z","title":"Modelling Sentence Pairs with Tree-structured Attentive Encoder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02806","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:3b93dfed738283841f207175d121676e1044cd9c1a9e56259503058dc89b4854","target":"record","created_at":"2026-05-18T01:02:50Z","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":"43dcb8a06ad412d7405d8f6a5b85dce08163bea9dc324aed216d583b606e9f6d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2016-10-10T08:52:36Z","title_canon_sha256":"3c97f89c9d418e9d44e6dd79909866d0b4d0609bf491d86a82e92886633cc690"},"schema_version":"1.0","source":{"id":"1610.02806","kind":"arxiv","version":1}},"canonical_sha256":"650dd3940aa7f8f1f54a97ef56ba6b3ae8d100dd86d448e5f489692a42aa3d3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"650dd3940aa7f8f1f54a97ef56ba6b3ae8d100dd86d448e5f489692a42aa3d3a","first_computed_at":"2026-05-18T01:02:50.676848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:50.676848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qjgE9nBOWawq5uruTRdxOtBRdMa/WoPuVLNj5xXdduLA48q9T9Lq/sQw4Ne/nvkiJvZiOs26NHDWie+BbvwZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:50.677440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b93dfed738283841f207175d121676e1044cd9c1a9e56259503058dc89b4854","sha256:5f556bf29730da473a0af6e9356b846c5c1e45544ae7c5bdfe1d4a6a268c87f1"],"state_sha256":"7a80cec1da9df0f6648fd56c79f7fd950c50b44ade8f25506ec6e6eb36f6f9ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6+6gmQn20f+6QH7mKkQOaszeumjuWxZoi5uW5UL38PYuGqXa47mtc7X64VKl3dzpc/mZPSJ1lVnYg0e0MCOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:01:21.100370Z","bundle_sha256":"e5da8289d5286158c8e0a005ddaca2f47aa48aa8f4ec74282668d740d645c665"}}