{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5OJ4C5DETQPIN6XDTQFAWCGMUN","short_pith_number":"pith:5OJ4C5DE","canonical_record":{"source":{"id":"1711.01239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-03T17:07:51Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"1e01ca1af801526e0cba32fda905b992f7b4a93543bd0b80912dd7694d36ded9","abstract_canon_sha256":"e1d10cb3e37708fee71da5bb5e37a86c79feb2dc0de17204721f12ad5bf77fa6"},"schema_version":"1.0"},"canonical_sha256":"eb93c174649c1e86fae39c0a0b08cca3732dbfc3034c12fb5b7f8eb8257ac561","source":{"kind":"arxiv","id":"1711.01239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01239","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01239v2","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01239","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"5OJ4C5DETQPI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5OJ4C5DETQPIN6XD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5OJ4C5DE","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5OJ4C5DETQPIN6XDTQFAWCGMUN","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-03T17:07:51Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"1e01ca1af801526e0cba32fda905b992f7b4a93543bd0b80912dd7694d36ded9","abstract_canon_sha256":"e1d10cb3e37708fee71da5bb5e37a86c79feb2dc0de17204721f12ad5bf77fa6"},"schema_version":"1.0"},"canonical_sha256":"eb93c174649c1e86fae39c0a0b08cca3732dbfc3034c12fb5b7f8eb8257ac561","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:00.043462Z","signature_b64":"jH87KSsx774W6K/cm5D/HCCw3fkYS0mIyuGCxGDFmDWNn9zivqeExNi6y7ICnPNbIW/0JE0Ay9L2ACB29bAuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb93c174649c1e86fae39c0a0b08cca3732dbfc3034c12fb5b7f8eb8257ac561","last_reissued_at":"2026-05-18T00:27:00.042858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:00.042858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01239","source_version":2,"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:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tjBbudEvLC3wu99CowZMJIf7/F/xwF4n16iQAMQt2VTjHgozHvMKa9j7cLS0O3eTl66hPZpxfjH+zxxuRjAtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:51:16.582707Z"},"content_sha256":"ed0e3e6ecc51ccc184a7b882f01fac31ce0c5b15646a11c6e331c7b39be3dfd8","schema_version":"1.0","event_id":"sha256:ed0e3e6ecc51ccc184a7b882f01fac31ce0c5b15646a11c6e331c7b39be3dfd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5OJ4C5DETQPIN6XDTQFAWCGMUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Clemens Rosenbaum, Matthew Riemer, Tim Klinger","submitted_at":"2017-11-03T17:07:51Z","abstract_excerpt":"Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces the benefits of transfer. To address this issue we introduce the routing network paradigm, a novel neural network and training algorithm. A routing network is a kind of self-organizing neural network consisting of two components: a router and a set of one or more function blocks. A function block may be any neural network - for example a fully-connected or a convolutional layer. Given an input the router makes a routing decision, choosin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01239","kind":"arxiv","version":2},"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:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqeUUFtwgSOv54bOJO4mM8BW5lbOAUM+/IGmWTkpJF6p3nL1lHEKujoHRzF3G29gLo1/F/AfjWP3vfvxfeDHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:51:16.583175Z"},"content_sha256":"a8bddd4bf51747f1778fd7298f7676912edb6a7b0b02439e2bff10342c5be644","schema_version":"1.0","event_id":"sha256:a8bddd4bf51747f1778fd7298f7676912edb6a7b0b02439e2bff10342c5be644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OJ4C5DETQPIN6XDTQFAWCGMUN/bundle.json","state_url":"https://pith.science/pith/5OJ4C5DETQPIN6XDTQFAWCGMUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OJ4C5DETQPIN6XDTQFAWCGMUN/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-08-21T01:51:16Z","links":{"resolver":"https://pith.science/pith/5OJ4C5DETQPIN6XDTQFAWCGMUN","bundle":"https://pith.science/pith/5OJ4C5DETQPIN6XDTQFAWCGMUN/bundle.json","state":"https://pith.science/pith/5OJ4C5DETQPIN6XDTQFAWCGMUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OJ4C5DETQPIN6XDTQFAWCGMUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5OJ4C5DETQPIN6XDTQFAWCGMUN","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":"e1d10cb3e37708fee71da5bb5e37a86c79feb2dc0de17204721f12ad5bf77fa6","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-03T17:07:51Z","title_canon_sha256":"1e01ca1af801526e0cba32fda905b992f7b4a93543bd0b80912dd7694d36ded9"},"schema_version":"1.0","source":{"id":"1711.01239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01239","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01239v2","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01239","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"5OJ4C5DETQPI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5OJ4C5DETQPIN6XD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5OJ4C5DE","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:a8bddd4bf51747f1778fd7298f7676912edb6a7b0b02439e2bff10342c5be644","target":"graph","created_at":"2026-05-18T00:27:00Z","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":"Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces the benefits of transfer. To address this issue we introduce the routing network paradigm, a novel neural network and training algorithm. A routing network is a kind of self-organizing neural network consisting of two components: a router and a set of one or more function blocks. A function block may be any neural network - for example a fully-connected or a convolutional layer. Given an input the router makes a routing decision, choosin","authors_text":"Clemens Rosenbaum, Matthew Riemer, Tim Klinger","cross_cats":["cs.CV","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-03T17:07:51Z","title":"Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01239","kind":"arxiv","version":2},"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:ed0e3e6ecc51ccc184a7b882f01fac31ce0c5b15646a11c6e331c7b39be3dfd8","target":"record","created_at":"2026-05-18T00:27:00Z","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":"e1d10cb3e37708fee71da5bb5e37a86c79feb2dc0de17204721f12ad5bf77fa6","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-03T17:07:51Z","title_canon_sha256":"1e01ca1af801526e0cba32fda905b992f7b4a93543bd0b80912dd7694d36ded9"},"schema_version":"1.0","source":{"id":"1711.01239","kind":"arxiv","version":2}},"canonical_sha256":"eb93c174649c1e86fae39c0a0b08cca3732dbfc3034c12fb5b7f8eb8257ac561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb93c174649c1e86fae39c0a0b08cca3732dbfc3034c12fb5b7f8eb8257ac561","first_computed_at":"2026-05-18T00:27:00.042858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:00.042858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jH87KSsx774W6K/cm5D/HCCw3fkYS0mIyuGCxGDFmDWNn9zivqeExNi6y7ICnPNbIW/0JE0Ay9L2ACB29bAuBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:00.043462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed0e3e6ecc51ccc184a7b882f01fac31ce0c5b15646a11c6e331c7b39be3dfd8","sha256:a8bddd4bf51747f1778fd7298f7676912edb6a7b0b02439e2bff10342c5be644"],"state_sha256":"36f963bdf3a06a55e9d8a44409f1060d86f6ed7c8740bd36aec8db2b3c58330d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5lZyr9eeVBf4GE8MBPUik+eXYIk8/GFq1eFIS0YibhmT5wsA7+F7D8syPKwfmbvbl+pU27EVOfminSrNPyDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T01:51:16.588689Z","bundle_sha256":"4d45e56bf90e4f3ac16fa502829141a97f47db759b1f353a753205ee2a49bae7"}}