{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K2W2ZMEGRPK4TH7DCBPZXMBI2C","short_pith_number":"pith:K2W2ZMEG","canonical_record":{"source":{"id":"1604.03539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-04-12T19:43:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"811d3217d73eb89c933a4886625e3357081b52027c860f08824aa1d8cc7aa6ce","abstract_canon_sha256":"b452ad2b8eae6122b1557149eaca967bc8b470b7ffdd6c003606dd194a4e10a2"},"schema_version":"1.0"},"canonical_sha256":"56adacb0868bd5c99fe3105f9bb028d0b73f2aed253c7df48854352d8b6adfa7","source":{"kind":"arxiv","id":"1604.03539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03539","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03539v1","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03539","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"K2W2ZMEGRPK4","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K2W2ZMEGRPK4TH7D","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K2W2ZMEG","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K2W2ZMEGRPK4TH7DCBPZXMBI2C","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-04-12T19:43:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"811d3217d73eb89c933a4886625e3357081b52027c860f08824aa1d8cc7aa6ce","abstract_canon_sha256":"b452ad2b8eae6122b1557149eaca967bc8b470b7ffdd6c003606dd194a4e10a2"},"schema_version":"1.0"},"canonical_sha256":"56adacb0868bd5c99fe3105f9bb028d0b73f2aed253c7df48854352d8b6adfa7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:13.225929Z","signature_b64":"G8kxjnRtAYMNhffItIisAtsiuqiiet0EoS105LurwePtEDmdSrCCKVaeQeMeTbVRyaZJ9s1eHjj+b12U6OfEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56adacb0868bd5c99fe3105f9bb028d0b73f2aed253c7df48854352d8b6adfa7","last_reissued_at":"2026-05-18T01:17:13.225228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:13.225228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03539","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-18T01:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2z1rC7DBvKFB58LORtT03KbIIr34vBblf7241crgK07karPqECbtVRfz5gpyjkebnKn/cDTwjZvajAspq4yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:38:52.601690Z"},"content_sha256":"0c64905b238fb6e9f4fb9773beb643b5017b59139282acfda81d8a4077bb8324","schema_version":"1.0","event_id":"sha256:0c64905b238fb6e9f4fb9773beb643b5017b59139282acfda81d8a4077bb8324"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K2W2ZMEGRPK4TH7DCBPZXMBI2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-stitch Networks for Multi-task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Abhinav Gupta, Abhinav Shrivastava, Ishan Misra, Martial Hebert","submitted_at":"2016-04-12T19:43:25Z","abstract_excerpt":"Multi-task learning in Convolutional Networks has displayed remarkable success in the field of recognition. This success can be largely attributed to learning shared representations from multiple supervisory tasks. However, existing multi-task approaches rely on enumerating multiple network architectures specific to the tasks at hand, that do not generalize. In this paper, we propose a principled approach to learn shared representations in ConvNets using multi-task learning. Specifically, we propose a new sharing unit: \"cross-stitch\" unit. These units combine the activations from multiple netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03539","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-18T01:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dIE0oT7mq+ImIRFn3ctdID0YaEkGwXzn3Nrq/ng9LmFov2o1NpoayVlOS4dS/0FYs82K58nWEYoj6OncrcbKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:38:52.602371Z"},"content_sha256":"3002095b89c42935ab2acb4f7665fc0b10ce4b182d7cbb2b35c264a250d72020","schema_version":"1.0","event_id":"sha256:3002095b89c42935ab2acb4f7665fc0b10ce4b182d7cbb2b35c264a250d72020"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2W2ZMEGRPK4TH7DCBPZXMBI2C/bundle.json","state_url":"https://pith.science/pith/K2W2ZMEGRPK4TH7DCBPZXMBI2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2W2ZMEGRPK4TH7DCBPZXMBI2C/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-25T17:38:52Z","links":{"resolver":"https://pith.science/pith/K2W2ZMEGRPK4TH7DCBPZXMBI2C","bundle":"https://pith.science/pith/K2W2ZMEGRPK4TH7DCBPZXMBI2C/bundle.json","state":"https://pith.science/pith/K2W2ZMEGRPK4TH7DCBPZXMBI2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2W2ZMEGRPK4TH7DCBPZXMBI2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K2W2ZMEGRPK4TH7DCBPZXMBI2C","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":"b452ad2b8eae6122b1557149eaca967bc8b470b7ffdd6c003606dd194a4e10a2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-04-12T19:43:25Z","title_canon_sha256":"811d3217d73eb89c933a4886625e3357081b52027c860f08824aa1d8cc7aa6ce"},"schema_version":"1.0","source":{"id":"1604.03539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03539","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03539v1","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03539","created_at":"2026-05-18T01:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"K2W2ZMEGRPK4","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K2W2ZMEGRPK4TH7D","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K2W2ZMEG","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:3002095b89c42935ab2acb4f7665fc0b10ce4b182d7cbb2b35c264a250d72020","target":"graph","created_at":"2026-05-18T01:17:13Z","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 in Convolutional Networks has displayed remarkable success in the field of recognition. This success can be largely attributed to learning shared representations from multiple supervisory tasks. However, existing multi-task approaches rely on enumerating multiple network architectures specific to the tasks at hand, that do not generalize. In this paper, we propose a principled approach to learn shared representations in ConvNets using multi-task learning. Specifically, we propose a new sharing unit: \"cross-stitch\" unit. These units combine the activations from multiple netw","authors_text":"Abhinav Gupta, Abhinav Shrivastava, Ishan Misra, Martial Hebert","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-04-12T19:43:25Z","title":"Cross-stitch Networks for Multi-task Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03539","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:0c64905b238fb6e9f4fb9773beb643b5017b59139282acfda81d8a4077bb8324","target":"record","created_at":"2026-05-18T01:17:13Z","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":"b452ad2b8eae6122b1557149eaca967bc8b470b7ffdd6c003606dd194a4e10a2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-04-12T19:43:25Z","title_canon_sha256":"811d3217d73eb89c933a4886625e3357081b52027c860f08824aa1d8cc7aa6ce"},"schema_version":"1.0","source":{"id":"1604.03539","kind":"arxiv","version":1}},"canonical_sha256":"56adacb0868bd5c99fe3105f9bb028d0b73f2aed253c7df48854352d8b6adfa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56adacb0868bd5c99fe3105f9bb028d0b73f2aed253c7df48854352d8b6adfa7","first_computed_at":"2026-05-18T01:17:13.225228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:13.225228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8kxjnRtAYMNhffItIisAtsiuqiiet0EoS105LurwePtEDmdSrCCKVaeQeMeTbVRyaZJ9s1eHjj+b12U6OfEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:13.225929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c64905b238fb6e9f4fb9773beb643b5017b59139282acfda81d8a4077bb8324","sha256:3002095b89c42935ab2acb4f7665fc0b10ce4b182d7cbb2b35c264a250d72020"],"state_sha256":"3b1a00a5c73aa381222e821ed1f5e4059bb4c90daf06fe9721ac8001eddb8f34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTwm4BS7rgfFJvt8P4ukOHI5hd15Lq19ciJTBSn/Op18F8lBmG+t4cld71uzB4T1mdXqrAJKO7aWMNb5UyMnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:38:52.606250Z","bundle_sha256":"2e3bae8e8318b9e4711a665f7ae5076f334db0d49cd12191a176e4412e093bd5"}}