{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NTVTTTRCTOSML7EI7BOG3P44UH","short_pith_number":"pith:NTVTTTRC","schema_version":"1.0","canonical_sha256":"6ceb39ce229ba4c5fc88f85c6dbf9ca1e460da584b65fd924514026a9634e324","source":{"kind":"arxiv","id":"2201.05587","version":2},"attestation_state":"computed","paper":{"title":"Transfer-Tuning: Reusing Auto-Schedules for Efficient Tensor Program Code Generation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NE","cs.PF","cs.PL"],"primary_cat":"cs.LG","authors_text":"Jos\\'e Cano, Perry Gibson","submitted_at":"2022-01-14T18:17:05Z","abstract_excerpt":"Auto-scheduling for tensor programs is a process where a search algorithm automatically explores candidate schedules (program transformations) for a given program on a target hardware platform to improve its performance. However this can be a very time consuming process depending on the complexity of the tensor program and the capacity of the target device, with often many thousands of program variants being explored. To address this, in this paper we introduce the idea of transfer-tuning, a novel approach to identify and reuse auto-schedules between tensor programs. We demonstrate this concep"},"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":"2201.05587","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-14T18:17:05Z","cross_cats_sorted":["cs.NE","cs.PF","cs.PL"],"title_canon_sha256":"1b7f24b3ac0838f7af0b2c05ba1d52244b92f77b9f67d89816d74ab8ca9b0966","abstract_canon_sha256":"35de5bfe2043810e471104ec18eb45ce77cc9e7101ced804f83a5bf8fe52b6a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:28.931689Z","signature_b64":"MImV3ETcWa5Mb+Fy6AwzvugAClla5GnbcDG5yMMpZNkgioSugu/DF/Cwr9oCFjS5qLCxSamsxne5aWd9ScY+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ceb39ce229ba4c5fc88f85c6dbf9ca1e460da584b65fd924514026a9634e324","last_reissued_at":"2026-07-05T04:55:28.931203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:28.931203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transfer-Tuning: Reusing Auto-Schedules for Efficient Tensor Program Code Generation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NE","cs.PF","cs.PL"],"primary_cat":"cs.LG","authors_text":"Jos\\'e Cano, Perry Gibson","submitted_at":"2022-01-14T18:17:05Z","abstract_excerpt":"Auto-scheduling for tensor programs is a process where a search algorithm automatically explores candidate schedules (program transformations) for a given program on a target hardware platform to improve its performance. However this can be a very time consuming process depending on the complexity of the tensor program and the capacity of the target device, with often many thousands of program variants being explored. To address this, in this paper we introduce the idea of transfer-tuning, a novel approach to identify and reuse auto-schedules between tensor programs. We demonstrate this concep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.05587","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.05587/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":"2201.05587","created_at":"2026-07-05T04:55:28.931263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.05587v2","created_at":"2026-07-05T04:55:28.931263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.05587","created_at":"2026-07-05T04:55:28.931263+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTVTTTRCTOSM","created_at":"2026-07-05T04:55:28.931263+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTVTTTRCTOSML7EI","created_at":"2026-07-05T04:55:28.931263+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTVTTTRC","created_at":"2026-07-05T04:55:28.931263+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/NTVTTTRCTOSML7EI7BOG3P44UH","json":"https://pith.science/pith/NTVTTTRCTOSML7EI7BOG3P44UH.json","graph_json":"https://pith.science/api/pith-number/NTVTTTRCTOSML7EI7BOG3P44UH/graph.json","events_json":"https://pith.science/api/pith-number/NTVTTTRCTOSML7EI7BOG3P44UH/events.json","paper":"https://pith.science/paper/NTVTTTRC"},"agent_actions":{"view_html":"https://pith.science/pith/NTVTTTRCTOSML7EI7BOG3P44UH","download_json":"https://pith.science/pith/NTVTTTRCTOSML7EI7BOG3P44UH.json","view_paper":"https://pith.science/paper/NTVTTTRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.05587&json=true","fetch_graph":"https://pith.science/api/pith-number/NTVTTTRCTOSML7EI7BOG3P44UH/graph.json","fetch_events":"https://pith.science/api/pith-number/NTVTTTRCTOSML7EI7BOG3P44UH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTVTTTRCTOSML7EI7BOG3P44UH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTVTTTRCTOSML7EI7BOG3P44UH/action/storage_attestation","attest_author":"https://pith.science/pith/NTVTTTRCTOSML7EI7BOG3P44UH/action/author_attestation","sign_citation":"https://pith.science/pith/NTVTTTRCTOSML7EI7BOG3P44UH/action/citation_signature","submit_replication":"https://pith.science/pith/NTVTTTRCTOSML7EI7BOG3P44UH/action/replication_record"}},"created_at":"2026-07-05T04:55:28.931263+00:00","updated_at":"2026-07-05T04:55:28.931263+00:00"}