{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5UJUBPOX6UGZO5USROHP43RQGC","short_pith_number":"pith:5UJUBPOX","schema_version":"1.0","canonical_sha256":"ed1340bdd7f50d9776928b8efe6e3030b70518d7386d286ccae8086f9024cf71","source":{"kind":"arxiv","id":"1904.08368","version":2},"attestation_state":"computed","paper":{"title":"Relay: A High-Level Compiler for Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jared Roesch, Josh Pollock, Logan Weber, Luis Vega, Marisa Kirisame, Steven Lyubomirsky, Thierry Moreau, Tianqi Chen, Zachary Tatlock, Ziheng Jiang","submitted_at":"2019-04-17T17:08:23Z","abstract_excerpt":"Frameworks for writing, compiling, and optimizing deep learning (DL) models have recently enabled progress in areas like computer vision and natural language processing. Extending these frameworks to accommodate the rapidly diversifying landscape of DL models and hardware platforms presents challenging tradeoffs between expressivity, composability, and portability. We present Relay, a new compiler framework for DL. Relay's functional, statically typed intermediate representation (IR) unifies and generalizes existing DL IRs to express state-of-the-art models. The introduction of Relay's express"},"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":"1904.08368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T17:08:23Z","cross_cats_sorted":["cs.PL","stat.ML"],"title_canon_sha256":"58e3bd85f3ab93b44b8dd97becbcf2aa90a1e202b5cf843762ea6cd9c91c64de","abstract_canon_sha256":"1af4d34aff6e64c00d7b64619b49894bf9599782c90edd6772a5b490b7027d6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:31.793903Z","signature_b64":"cXjVwEn7f4DBtU7TTSmQUoeM9WH8TCJdLa4t083Pw4+DccWXrcr84gn9zA2uJIASwBl1jEk1daVZm421b9eXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed1340bdd7f50d9776928b8efe6e3030b70518d7386d286ccae8086f9024cf71","last_reissued_at":"2026-07-04T23:59:31.793391Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:31.793391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relay: A High-Level Compiler for Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jared Roesch, Josh Pollock, Logan Weber, Luis Vega, Marisa Kirisame, Steven Lyubomirsky, Thierry Moreau, Tianqi Chen, Zachary Tatlock, Ziheng Jiang","submitted_at":"2019-04-17T17:08:23Z","abstract_excerpt":"Frameworks for writing, compiling, and optimizing deep learning (DL) models have recently enabled progress in areas like computer vision and natural language processing. Extending these frameworks to accommodate the rapidly diversifying landscape of DL models and hardware platforms presents challenging tradeoffs between expressivity, composability, and portability. We present Relay, a new compiler framework for DL. Relay's functional, statically typed intermediate representation (IR) unifies and generalizes existing DL IRs to express state-of-the-art models. The introduction of Relay's express"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08368","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/1904.08368/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":"1904.08368","created_at":"2026-07-04T23:59:31.793451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08368v2","created_at":"2026-07-04T23:59:31.793451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08368","created_at":"2026-07-04T23:59:31.793451+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UJUBPOX6UGZ","created_at":"2026-07-04T23:59:31.793451+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UJUBPOX6UGZO5US","created_at":"2026-07-04T23:59:31.793451+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UJUBPOX","created_at":"2026-07-04T23:59:31.793451+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12891","citing_title":"TCL: Enabling Fast and Efficient Cross-Hardware Tensor Program Optimization via Continual Learning","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC","json":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC.json","graph_json":"https://pith.science/api/pith-number/5UJUBPOX6UGZO5USROHP43RQGC/graph.json","events_json":"https://pith.science/api/pith-number/5UJUBPOX6UGZO5USROHP43RQGC/events.json","paper":"https://pith.science/paper/5UJUBPOX"},"agent_actions":{"view_html":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC","download_json":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC.json","view_paper":"https://pith.science/paper/5UJUBPOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08368&json=true","fetch_graph":"https://pith.science/api/pith-number/5UJUBPOX6UGZO5USROHP43RQGC/graph.json","fetch_events":"https://pith.science/api/pith-number/5UJUBPOX6UGZO5USROHP43RQGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC/action/storage_attestation","attest_author":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC/action/author_attestation","sign_citation":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC/action/citation_signature","submit_replication":"https://pith.science/pith/5UJUBPOX6UGZO5USROHP43RQGC/action/replication_record"}},"created_at":"2026-07-04T23:59:31.793451+00:00","updated_at":"2026-07-04T23:59:31.793451+00:00"}