{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2DSDPTIXPZDBOBHIYATTVXT7H2","short_pith_number":"pith:2DSDPTIX","canonical_record":{"source":{"id":"1901.00066","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-01-01T00:15:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"10d69abf11d8fe65e4f9add1fc9d0c8840bd79f6767b676dff07cd1a7ef59d13","abstract_canon_sha256":"e4f6a7ebc2ab95730a6c155a53fca78c0fa813d065b1eee94e44dd6d29ea86c0"},"schema_version":"1.0"},"canonical_sha256":"d0e437cd177e461704e8c0273ade7f3eb030cbc582213b9d444d51f259c4f131","source":{"kind":"arxiv","id":"1901.00066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00066","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00066v1","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00066","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"pith_short_12","alias_value":"2DSDPTIXPZDB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2DSDPTIXPZDBOBHI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2DSDPTIX","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2DSDPTIXPZDBOBHIYATTVXT7H2","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00066","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-01-01T00:15:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"10d69abf11d8fe65e4f9add1fc9d0c8840bd79f6767b676dff07cd1a7ef59d13","abstract_canon_sha256":"e4f6a7ebc2ab95730a6c155a53fca78c0fa813d065b1eee94e44dd6d29ea86c0"},"schema_version":"1.0"},"canonical_sha256":"d0e437cd177e461704e8c0273ade7f3eb030cbc582213b9d444d51f259c4f131","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:07.003367Z","signature_b64":"0OQtDbGlSKbzIL/bhq0OofJcXNSUWDm3g0wNEK2C0oJKlES09LDrA25097v6tUcEd6rAQCn5DY689oU+TvQbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0e437cd177e461704e8c0273ade7f3eb030cbc582213b9d444d51f259c4f131","last_reissued_at":"2026-05-17T23:57:07.003006Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:07.003006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00066","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:57:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ynzaw9S9WERZDh9z4NWvhuu6ScX8p9KpJlf4/lmNGVAtKRDFKs/AhAsAwDNdmA9ax9T8ClSktH4s0wUTvzwnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:09:31.225747Z"},"content_sha256":"3e651398d115300f531c2f68cd1f0e0409795504853d5b4728e4155157741546","schema_version":"1.0","event_id":"sha256:3e651398d115300f531c2f68cd1f0e0409795504853d5b4728e4155157741546"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2DSDPTIXPZDBOBHIYATTVXT7H2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Tree-LSTM with Tree Attention","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Mahtab Ahmed, Muhammad Rifayat Samee, Robert E. Mercer","submitted_at":"2019-01-01T00:15:45Z","abstract_excerpt":"In Natural Language Processing (NLP), we often need to extract information from tree topology. Sentence structure can be represented via a dependency tree or a constituency tree structure. For this reason, a variant of LSTMs, named Tree-LSTM, was proposed to work on tree topology. In this paper, we design a generalized attention framework for both dependency and constituency trees by encoding variants of decomposable attention inside a Tree-LSTM cell. We evaluated our models on a semantic relatedness task and achieved notable results compared to Tree-LSTM based methods with no attention as wel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00066","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:57:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJKVcPAIL5Y2EGZCOwdeCd0wGLRj6ylf0K4XfF2I5trr/x6HzT4wQmilChuTa/f6bEaDtsSvSFQZzMbsaF4BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:09:31.226088Z"},"content_sha256":"9450dcf5060e2bcb2964550812af087923518b508b07be72f2a240e3305c6fc5","schema_version":"1.0","event_id":"sha256:9450dcf5060e2bcb2964550812af087923518b508b07be72f2a240e3305c6fc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DSDPTIXPZDBOBHIYATTVXT7H2/bundle.json","state_url":"https://pith.science/pith/2DSDPTIXPZDBOBHIYATTVXT7H2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DSDPTIXPZDBOBHIYATTVXT7H2/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-01T20:09:31Z","links":{"resolver":"https://pith.science/pith/2DSDPTIXPZDBOBHIYATTVXT7H2","bundle":"https://pith.science/pith/2DSDPTIXPZDBOBHIYATTVXT7H2/bundle.json","state":"https://pith.science/pith/2DSDPTIXPZDBOBHIYATTVXT7H2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DSDPTIXPZDBOBHIYATTVXT7H2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2DSDPTIXPZDBOBHIYATTVXT7H2","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":"e4f6a7ebc2ab95730a6c155a53fca78c0fa813d065b1eee94e44dd6d29ea86c0","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-01-01T00:15:45Z","title_canon_sha256":"10d69abf11d8fe65e4f9add1fc9d0c8840bd79f6767b676dff07cd1a7ef59d13"},"schema_version":"1.0","source":{"id":"1901.00066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00066","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00066v1","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00066","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"pith_short_12","alias_value":"2DSDPTIXPZDB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2DSDPTIXPZDBOBHI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2DSDPTIX","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:9450dcf5060e2bcb2964550812af087923518b508b07be72f2a240e3305c6fc5","target":"graph","created_at":"2026-05-17T23:57:07Z","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":"In Natural Language Processing (NLP), we often need to extract information from tree topology. Sentence structure can be represented via a dependency tree or a constituency tree structure. For this reason, a variant of LSTMs, named Tree-LSTM, was proposed to work on tree topology. In this paper, we design a generalized attention framework for both dependency and constituency trees by encoding variants of decomposable attention inside a Tree-LSTM cell. We evaluated our models on a semantic relatedness task and achieved notable results compared to Tree-LSTM based methods with no attention as wel","authors_text":"Mahtab Ahmed, Muhammad Rifayat Samee, Robert E. Mercer","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-01-01T00:15:45Z","title":"Improving Tree-LSTM with Tree Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00066","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:3e651398d115300f531c2f68cd1f0e0409795504853d5b4728e4155157741546","target":"record","created_at":"2026-05-17T23:57:07Z","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":"e4f6a7ebc2ab95730a6c155a53fca78c0fa813d065b1eee94e44dd6d29ea86c0","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-01-01T00:15:45Z","title_canon_sha256":"10d69abf11d8fe65e4f9add1fc9d0c8840bd79f6767b676dff07cd1a7ef59d13"},"schema_version":"1.0","source":{"id":"1901.00066","kind":"arxiv","version":1}},"canonical_sha256":"d0e437cd177e461704e8c0273ade7f3eb030cbc582213b9d444d51f259c4f131","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0e437cd177e461704e8c0273ade7f3eb030cbc582213b9d444d51f259c4f131","first_computed_at":"2026-05-17T23:57:07.003006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:07.003006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0OQtDbGlSKbzIL/bhq0OofJcXNSUWDm3g0wNEK2C0oJKlES09LDrA25097v6tUcEd6rAQCn5DY689oU+TvQbCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:07.003367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e651398d115300f531c2f68cd1f0e0409795504853d5b4728e4155157741546","sha256:9450dcf5060e2bcb2964550812af087923518b508b07be72f2a240e3305c6fc5"],"state_sha256":"d9e2fc945cd0cafbb2e8d513bf15d583f3a6f573dd9ddac37d0363cdc60185ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a0ZAQhgIQ9ndhr/IB3XAYOQQ73Tx2VN+5XvFMU5fNd3cjUKCM29XXIyzSbcIurtiBDC1mnMF8JLQLBxaildrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:09:31.228038Z","bundle_sha256":"f38a21ac68e58ae36d98b247e21cf3b463eade2747bf954a3fa29159ed80ed6d"}}