{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MTBEWESDFIX72XJDUSH7Q4Q6FR","short_pith_number":"pith:MTBEWESD","canonical_record":{"source":{"id":"1806.01501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-05T05:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"940a5d6a3637ef9142efe86a31942ae032aac49d52c69bd7e4f0664548aab9fe","abstract_canon_sha256":"31228a8d49d9dc9c4d17778e2ef2ff2b3316fc4ce574cdffd2c340e73db22640"},"schema_version":"1.0"},"canonical_sha256":"64c24b12432a2ffd5d23a48ff8721e2c66a294afe6970391a57dbfd26d7beb2d","source":{"kind":"arxiv","id":"1806.01501","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01501","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01501v1","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01501","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"MTBEWESDFIX7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTBEWESDFIX72XJD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTBEWESD","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MTBEWESDFIX72XJDUSH7Q4Q6FR","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-05T05:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"940a5d6a3637ef9142efe86a31942ae032aac49d52c69bd7e4f0664548aab9fe","abstract_canon_sha256":"31228a8d49d9dc9c4d17778e2ef2ff2b3316fc4ce574cdffd2c340e73db22640"},"schema_version":"1.0"},"canonical_sha256":"64c24b12432a2ffd5d23a48ff8721e2c66a294afe6970391a57dbfd26d7beb2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:12.765875Z","signature_b64":"tQVYwYHPyTJKPBkjcSzzC8C6iKwWMMlqvOZdsKMOArFGZYoBn7lldWSl0/t44aoEqbHf3Q4NoEMGD5/zhvztCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64c24b12432a2ffd5d23a48ff8721e2c66a294afe6970391a57dbfd26d7beb2d","last_reissued_at":"2026-05-18T00:14:12.765292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:12.765292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01501","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-18T00:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxtH07WpMVx549AuK8t6Mx5jxywWaFNkucvDt7mFNIeoiqR3y0OhOlCELDiakK2CCJStU0QSvUtKdNzTtm6MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:09:41.790342Z"},"content_sha256":"50099772544aaf72b50b19baa8198acc0ea5cbb1ceaa2caa43ed6fc89dbe3980","schema_version":"1.0","event_id":"sha256:50099772544aaf72b50b19baa8198acc0ea5cbb1ceaa2caa43ed6fc89dbe3980"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MTBEWESDFIX72XJDUSH7Q4Q6FR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Aggregation via Dynamic Routing for Sequence Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jingjing Gong, Shaojing Wang, Xipeng Qiu, Xuanjing Huang","submitted_at":"2018-06-05T05:34:15Z","abstract_excerpt":"While much progress has been made in how to encode a text sequence into a sequence of vectors, less attention has been paid to how to aggregate these preceding vectors (outputs of RNN/CNN) into fixed-size encoding vector. Usually, a simple max or average pooling is used, which is a bottom-up and passive way of aggregation and lack of guidance by task information. In this paper, we propose an aggregation mechanism to obtain a fixed-size encoding with a dynamic routing policy. The dynamic routing policy is dynamically deciding that what and how much information need be transferred from each word"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01501","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-18T00:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kDQ90E47WGUK/EpelRvkuJx+zJiRB5CzzQMrYRF2QDH2FNwzK1U+q6GIRmJfY2BF8/4qBQ7dt+hVvtQKpLTaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:09:41.790706Z"},"content_sha256":"0643790a86949cee9150076c70dcaafdd35978c002ab2b57bd059fea51309170","schema_version":"1.0","event_id":"sha256:0643790a86949cee9150076c70dcaafdd35978c002ab2b57bd059fea51309170"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/bundle.json","state_url":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/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-23T08:09:41Z","links":{"resolver":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR","bundle":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/bundle.json","state":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MTBEWESDFIX72XJDUSH7Q4Q6FR","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":"31228a8d49d9dc9c4d17778e2ef2ff2b3316fc4ce574cdffd2c340e73db22640","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-05T05:34:15Z","title_canon_sha256":"940a5d6a3637ef9142efe86a31942ae032aac49d52c69bd7e4f0664548aab9fe"},"schema_version":"1.0","source":{"id":"1806.01501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01501","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01501v1","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01501","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"MTBEWESDFIX7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTBEWESDFIX72XJD","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTBEWESD","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:0643790a86949cee9150076c70dcaafdd35978c002ab2b57bd059fea51309170","target":"graph","created_at":"2026-05-18T00:14:12Z","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":"While much progress has been made in how to encode a text sequence into a sequence of vectors, less attention has been paid to how to aggregate these preceding vectors (outputs of RNN/CNN) into fixed-size encoding vector. Usually, a simple max or average pooling is used, which is a bottom-up and passive way of aggregation and lack of guidance by task information. In this paper, we propose an aggregation mechanism to obtain a fixed-size encoding with a dynamic routing policy. The dynamic routing policy is dynamically deciding that what and how much information need be transferred from each word","authors_text":"Jingjing Gong, Shaojing Wang, Xipeng Qiu, Xuanjing Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-05T05:34:15Z","title":"Information Aggregation via Dynamic Routing for Sequence Encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01501","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:50099772544aaf72b50b19baa8198acc0ea5cbb1ceaa2caa43ed6fc89dbe3980","target":"record","created_at":"2026-05-18T00:14:12Z","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":"31228a8d49d9dc9c4d17778e2ef2ff2b3316fc4ce574cdffd2c340e73db22640","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-05T05:34:15Z","title_canon_sha256":"940a5d6a3637ef9142efe86a31942ae032aac49d52c69bd7e4f0664548aab9fe"},"schema_version":"1.0","source":{"id":"1806.01501","kind":"arxiv","version":1}},"canonical_sha256":"64c24b12432a2ffd5d23a48ff8721e2c66a294afe6970391a57dbfd26d7beb2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64c24b12432a2ffd5d23a48ff8721e2c66a294afe6970391a57dbfd26d7beb2d","first_computed_at":"2026-05-18T00:14:12.765292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:12.765292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQVYwYHPyTJKPBkjcSzzC8C6iKwWMMlqvOZdsKMOArFGZYoBn7lldWSl0/t44aoEqbHf3Q4NoEMGD5/zhvztCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:12.765875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50099772544aaf72b50b19baa8198acc0ea5cbb1ceaa2caa43ed6fc89dbe3980","sha256:0643790a86949cee9150076c70dcaafdd35978c002ab2b57bd059fea51309170"],"state_sha256":"5745dcd98946bd49cee2ca0319460bd8ea47d215b0413bef8ce6874da100dfb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fv+/XYx+dq1zg6PlW5f3hQvvj5wk+d0JlawFIvMeIFi0dENf2CtdGWs0kMnOdbhRDQ+RKrUNWpGY/6v2DpuqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:09:41.794439Z","bundle_sha256":"644ea9be1275e6f8364afa49fb6e35738b0b7498af407fb9a7d0392b035f62df"}}