{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZVAMQYHQYCLCVS4TPUE4UEHTS3","short_pith_number":"pith:ZVAMQYHQ","schema_version":"1.0","canonical_sha256":"cd40c860f0c0962acb937d09ca10f396e19460c40ce31e35d64c6bdc73eb9875","source":{"kind":"arxiv","id":"1912.13503","version":4},"attestation_state":"computed","paper":{"title":"Side-Tuning: A Baseline for Network Adaptation via Additive Side Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE","cs.RO"],"primary_cat":"cs.LG","authors_text":"Alexander Sax, Amir Zamir, Jeffrey O Zhang, Jitendra Malik, Leonidas Guibas","submitted_at":"2019-12-31T18:52:32Z","abstract_excerpt":"When training a neural network for a desired task, one may prefer to adapt a pre-trained network rather than starting from randomly initialized weights. Adaptation can be useful in cases when training data is scarce, when a single learner needs to perform multiple tasks, or when one wishes to encode priors in the network. The most commonly employed approaches for network adaptation are fine-tuning and using the pre-trained network as a fixed feature extractor, among others.\n  In this paper, we propose a straightforward alternative: side-tuning. Side-tuning adapts a pre-trained network by train"},"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":"1912.13503","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-12-31T18:52:32Z","cross_cats_sorted":["cs.CV","cs.NE","cs.RO"],"title_canon_sha256":"514b3f358f6d301ef4fe6b3becce702dd8e4292c96a3d2448b09a02de05bd4b0","abstract_canon_sha256":"5681a76a53bb7773689e2be26640b10069e84929a8674c3c9f1ba58a0536d8b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:34.985229Z","signature_b64":"zPw0aJ+z1RIQC/WSx4IspTlZEfQNhKrLGFE98XRswNqWuO6o1GcDJzYnqIxLNxmJb6wX3GsceaHBNhDqksxjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd40c860f0c0962acb937d09ca10f396e19460c40ce31e35d64c6bdc73eb9875","last_reissued_at":"2026-07-05T01:23:34.984799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:34.984799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Side-Tuning: A Baseline for Network Adaptation via Additive Side Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE","cs.RO"],"primary_cat":"cs.LG","authors_text":"Alexander Sax, Amir Zamir, Jeffrey O Zhang, Jitendra Malik, Leonidas Guibas","submitted_at":"2019-12-31T18:52:32Z","abstract_excerpt":"When training a neural network for a desired task, one may prefer to adapt a pre-trained network rather than starting from randomly initialized weights. Adaptation can be useful in cases when training data is scarce, when a single learner needs to perform multiple tasks, or when one wishes to encode priors in the network. The most commonly employed approaches for network adaptation are fine-tuning and using the pre-trained network as a fixed feature extractor, among others.\n  In this paper, we propose a straightforward alternative: side-tuning. Side-tuning adapts a pre-trained network by train"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.13503","kind":"arxiv","version":4},"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/1912.13503/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":"1912.13503","created_at":"2026-07-05T01:23:34.984854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.13503v4","created_at":"2026-07-05T01:23:34.984854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.13503","created_at":"2026-07-05T01:23:34.984854+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVAMQYHQYCLC","created_at":"2026-07-05T01:23:34.984854+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVAMQYHQYCLCVS4T","created_at":"2026-07-05T01:23:34.984854+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVAMQYHQ","created_at":"2026-07-05T01:23:34.984854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2101.00190","citing_title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01542","citing_title":"Mesh Based Simulations with Spatial and Temporal awareness","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3","json":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3.json","graph_json":"https://pith.science/api/pith-number/ZVAMQYHQYCLCVS4TPUE4UEHTS3/graph.json","events_json":"https://pith.science/api/pith-number/ZVAMQYHQYCLCVS4TPUE4UEHTS3/events.json","paper":"https://pith.science/paper/ZVAMQYHQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3","download_json":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3.json","view_paper":"https://pith.science/paper/ZVAMQYHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.13503&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVAMQYHQYCLCVS4TPUE4UEHTS3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVAMQYHQYCLCVS4TPUE4UEHTS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3/action/storage_attestation","attest_author":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3/action/author_attestation","sign_citation":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3/action/citation_signature","submit_replication":"https://pith.science/pith/ZVAMQYHQYCLCVS4TPUE4UEHTS3/action/replication_record"}},"created_at":"2026-07-05T01:23:34.984854+00:00","updated_at":"2026-07-05T01:23:34.984854+00:00"}