{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JRYZUCHUKK6J5M3B4KPNXHAPS5","short_pith_number":"pith:JRYZUCHU","schema_version":"1.0","canonical_sha256":"4c719a08f452bc9eb361e29edb9c0f97586c8c37237aa3a8fde396fdd1677f83","source":{"kind":"arxiv","id":"1911.08119","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Routing Between Capsules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Lianghua He, Qiang Ren, Shaohua Shang","submitted_at":"2019-11-19T06:56:36Z","abstract_excerpt":"Capsule network is the most recent exciting advancement in the deep learning field and represents positional information by stacking features into vectors. The dynamic routing algorithm is used in the capsule network, however, there are some disadvantages such as the inability to stack multiple layers and a large amount of computation. In this paper, we propose an adaptive routing algorithm that can solve the problems mentioned above. First, the low-layer capsules adaptively adjust their direction and length in the routing algorithm and removing the influence of the coupling coefficient on the"},"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":"1911.08119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-19T06:56:36Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"5838e562c3789818bd26c185c9815e85bcaed225b2e2b76ed910d155fbff814a","abstract_canon_sha256":"e4c45a37bf76b4ab9a572f5c37f2ca17100f081f6981f90535930d1dee261a3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:25.357996Z","signature_b64":"3sn2hVL78JhaHpzBTyvOs0FpLHR3lHvX+waeBIcN6f+oekU6OA+RP57kpEkJ/4kERVp2q5UGpkcXd55NustnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c719a08f452bc9eb361e29edb9c0f97586c8c37237aa3a8fde396fdd1677f83","last_reissued_at":"2026-07-05T00:20:25.357616Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:25.357616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Routing Between Capsules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Lianghua He, Qiang Ren, Shaohua Shang","submitted_at":"2019-11-19T06:56:36Z","abstract_excerpt":"Capsule network is the most recent exciting advancement in the deep learning field and represents positional information by stacking features into vectors. The dynamic routing algorithm is used in the capsule network, however, there are some disadvantages such as the inability to stack multiple layers and a large amount of computation. In this paper, we propose an adaptive routing algorithm that can solve the problems mentioned above. First, the low-layer capsules adaptively adjust their direction and length in the routing algorithm and removing the influence of the coupling coefficient on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08119","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.08119/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.08119","created_at":"2026-07-05T00:20:25.357672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.08119v1","created_at":"2026-07-05T00:20:25.357672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08119","created_at":"2026-07-05T00:20:25.357672+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRYZUCHUKK6J","created_at":"2026-07-05T00:20:25.357672+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRYZUCHUKK6J5M3B","created_at":"2026-07-05T00:20:25.357672+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRYZUCHU","created_at":"2026-07-05T00:20:25.357672+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/JRYZUCHUKK6J5M3B4KPNXHAPS5","json":"https://pith.science/pith/JRYZUCHUKK6J5M3B4KPNXHAPS5.json","graph_json":"https://pith.science/api/pith-number/JRYZUCHUKK6J5M3B4KPNXHAPS5/graph.json","events_json":"https://pith.science/api/pith-number/JRYZUCHUKK6J5M3B4KPNXHAPS5/events.json","paper":"https://pith.science/paper/JRYZUCHU"},"agent_actions":{"view_html":"https://pith.science/pith/JRYZUCHUKK6J5M3B4KPNXHAPS5","download_json":"https://pith.science/pith/JRYZUCHUKK6J5M3B4KPNXHAPS5.json","view_paper":"https://pith.science/paper/JRYZUCHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.08119&json=true","fetch_graph":"https://pith.science/api/pith-number/JRYZUCHUKK6J5M3B4KPNXHAPS5/graph.json","fetch_events":"https://pith.science/api/pith-number/JRYZUCHUKK6J5M3B4KPNXHAPS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRYZUCHUKK6J5M3B4KPNXHAPS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRYZUCHUKK6J5M3B4KPNXHAPS5/action/storage_attestation","attest_author":"https://pith.science/pith/JRYZUCHUKK6J5M3B4KPNXHAPS5/action/author_attestation","sign_citation":"https://pith.science/pith/JRYZUCHUKK6J5M3B4KPNXHAPS5/action/citation_signature","submit_replication":"https://pith.science/pith/JRYZUCHUKK6J5M3B4KPNXHAPS5/action/replication_record"}},"created_at":"2026-07-05T00:20:25.357672+00:00","updated_at":"2026-07-05T00:20:25.357672+00:00"}