{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:V44WS33QDKOFBZBMG6T6H7NEVE","short_pith_number":"pith:V44WS33Q","schema_version":"1.0","canonical_sha256":"af39696f701a9c50e42c37a7e3fda4a91e7dab1324b2d3d11959de99953b27f7","source":{"kind":"arxiv","id":"2405.06127","version":2},"attestation_state":"computed","paper":{"title":"Efficiently Synthesizing Lowest Cost Rewrite Rules for Instruction Selection","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LO","authors_text":"Caleb Donovick, Caleb Terrill, Clark Barrett, Jackson Melchert, Pat Hanrahan, Priyanka Raina, Ross Daly","submitted_at":"2024-05-09T22:11:26Z","abstract_excerpt":"Compiling programs to an instruction set architecture (ISA) requires a set of rewrite rules that map patterns consisting of compiler instructions to patterns consisting of ISA instructions. We synthesize such rules by constructing SMT queries, whose solutions represent two functionally equivalent programs. These two programs are interpreted as an instruction selection rewrite rule. Existing work is limited to single-instruction ISA patterns, whereas our solution does not have that restriction. Furthermore, we address inefficiencies of existing work by developing two optimized algorithms. The f"},"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":"2405.06127","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2024-05-09T22:11:26Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"5216e5a126dc3e1de2f93dbf0a10a56d40aef2f6a1d2493ae39153e8ead22420","abstract_canon_sha256":"61810ccc02e15807d411a1a9ab97cee67146b8f65eb84bcfef32c540579308ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:29.786384Z","signature_b64":"tB2t8UsNK1F4P97+6WHnwZuDg2pqDy+vFNY0JHa4EBO5z+kfXV93+TyjGG4282Qk1LDnSmE+9LkC+SbrY1D/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af39696f701a9c50e42c37a7e3fda4a91e7dab1324b2d3d11959de99953b27f7","last_reissued_at":"2026-07-05T08:20:29.785929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:29.785929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Synthesizing Lowest Cost Rewrite Rules for Instruction Selection","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LO","authors_text":"Caleb Donovick, Caleb Terrill, Clark Barrett, Jackson Melchert, Pat Hanrahan, Priyanka Raina, Ross Daly","submitted_at":"2024-05-09T22:11:26Z","abstract_excerpt":"Compiling programs to an instruction set architecture (ISA) requires a set of rewrite rules that map patterns consisting of compiler instructions to patterns consisting of ISA instructions. We synthesize such rules by constructing SMT queries, whose solutions represent two functionally equivalent programs. These two programs are interpreted as an instruction selection rewrite rule. Existing work is limited to single-instruction ISA patterns, whereas our solution does not have that restriction. Furthermore, we address inefficiencies of existing work by developing two optimized algorithms. The f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.06127","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/2405.06127/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":"2405.06127","created_at":"2026-07-05T08:20:29.785990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.06127v2","created_at":"2026-07-05T08:20:29.785990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.06127","created_at":"2026-07-05T08:20:29.785990+00:00"},{"alias_kind":"pith_short_12","alias_value":"V44WS33QDKOF","created_at":"2026-07-05T08:20:29.785990+00:00"},{"alias_kind":"pith_short_16","alias_value":"V44WS33QDKOFBZBM","created_at":"2026-07-05T08:20:29.785990+00:00"},{"alias_kind":"pith_short_8","alias_value":"V44WS33Q","created_at":"2026-07-05T08:20:29.785990+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/V44WS33QDKOFBZBMG6T6H7NEVE","json":"https://pith.science/pith/V44WS33QDKOFBZBMG6T6H7NEVE.json","graph_json":"https://pith.science/api/pith-number/V44WS33QDKOFBZBMG6T6H7NEVE/graph.json","events_json":"https://pith.science/api/pith-number/V44WS33QDKOFBZBMG6T6H7NEVE/events.json","paper":"https://pith.science/paper/V44WS33Q"},"agent_actions":{"view_html":"https://pith.science/pith/V44WS33QDKOFBZBMG6T6H7NEVE","download_json":"https://pith.science/pith/V44WS33QDKOFBZBMG6T6H7NEVE.json","view_paper":"https://pith.science/paper/V44WS33Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.06127&json=true","fetch_graph":"https://pith.science/api/pith-number/V44WS33QDKOFBZBMG6T6H7NEVE/graph.json","fetch_events":"https://pith.science/api/pith-number/V44WS33QDKOFBZBMG6T6H7NEVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V44WS33QDKOFBZBMG6T6H7NEVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V44WS33QDKOFBZBMG6T6H7NEVE/action/storage_attestation","attest_author":"https://pith.science/pith/V44WS33QDKOFBZBMG6T6H7NEVE/action/author_attestation","sign_citation":"https://pith.science/pith/V44WS33QDKOFBZBMG6T6H7NEVE/action/citation_signature","submit_replication":"https://pith.science/pith/V44WS33QDKOFBZBMG6T6H7NEVE/action/replication_record"}},"created_at":"2026-07-05T08:20:29.785990+00:00","updated_at":"2026-07-05T08:20:29.785990+00:00"}