{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MTBEWESDFIX72XJDUSH7Q4Q6FR","short_pith_number":"pith:MTBEWESD","schema_version":"1.0","canonical_sha256":"64c24b12432a2ffd5d23a48ff8721e2c66a294afe6970391a57dbfd26d7beb2d","source":{"kind":"arxiv","id":"1806.01501","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.01501","created_at":"2026-05-18T00:14:12.765400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01501v1","created_at":"2026-05-18T00:14:12.765400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01501","created_at":"2026-05-18T00:14:12.765400+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTBEWESDFIX7","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTBEWESDFIX72XJD","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTBEWESD","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR","json":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR.json","graph_json":"https://pith.science/api/pith-number/MTBEWESDFIX72XJDUSH7Q4Q6FR/graph.json","events_json":"https://pith.science/api/pith-number/MTBEWESDFIX72XJDUSH7Q4Q6FR/events.json","paper":"https://pith.science/paper/MTBEWESD"},"agent_actions":{"view_html":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR","download_json":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR.json","view_paper":"https://pith.science/paper/MTBEWESD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01501&json=true","fetch_graph":"https://pith.science/api/pith-number/MTBEWESDFIX72XJDUSH7Q4Q6FR/graph.json","fetch_events":"https://pith.science/api/pith-number/MTBEWESDFIX72XJDUSH7Q4Q6FR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/action/storage_attestation","attest_author":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/action/author_attestation","sign_citation":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/action/citation_signature","submit_replication":"https://pith.science/pith/MTBEWESDFIX72XJDUSH7Q4Q6FR/action/replication_record"}},"created_at":"2026-05-18T00:14:12.765400+00:00","updated_at":"2026-05-18T00:14:12.765400+00:00"}