{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HCAZIP5TNDDS7CNMPDSI5JANBQ","short_pith_number":"pith:HCAZIP5T","schema_version":"1.0","canonical_sha256":"3881943fb368c72f89ac78e48ea40d0c0229baf884d51b79cf804d8f9a51bbbc","source":{"kind":"arxiv","id":"1804.02452","version":5},"attestation_state":"computed","paper":{"title":"Combinatorial Register Allocation and Instruction Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christian Schulte, Gabriel Hjort Blindell, Mats Carlsson, Roberto Casta\\~neda Lozano","submitted_at":"2018-04-06T20:47:21Z","abstract_excerpt":"This paper introduces a combinatorial optimization approach to register allocation and instruction scheduling, two central compiler problems. Combinatorial optimization has the potential to solve these problems optimally and to exploit processor-specific features readily. Our approach is the first to leverage this potential in practice: it captures the complete set of program transformations used in state-of-the-art compilers, scales to medium-sized functions of up to 1000 instructions, and generates executable code. This level of practicality is reached by using constraint programming, a part"},"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":"1804.02452","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-06T20:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"82d63f355ac40483f7fd70704caf8fb009c717a902c9827b60ba2f8b5d56cbc9","abstract_canon_sha256":"a1207d2214ff29590ad7f622a9f732bab11759382005b8ac69b41c3805d8949b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:53.895622Z","signature_b64":"hlz6UM6GKjqg/879lN69bAf67q0BbnqbsPXofelj4uBJsUcbrBui62H5e3/zHsF+0kdxEBxcIw0FoNr24+ZcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3881943fb368c72f89ac78e48ea40d0c0229baf884d51b79cf804d8f9a51bbbc","last_reissued_at":"2026-05-17T23:42:53.894984Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:53.894984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Register Allocation and Instruction Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christian Schulte, Gabriel Hjort Blindell, Mats Carlsson, Roberto Casta\\~neda Lozano","submitted_at":"2018-04-06T20:47:21Z","abstract_excerpt":"This paper introduces a combinatorial optimization approach to register allocation and instruction scheduling, two central compiler problems. Combinatorial optimization has the potential to solve these problems optimally and to exploit processor-specific features readily. Our approach is the first to leverage this potential in practice: it captures the complete set of program transformations used in state-of-the-art compilers, scales to medium-sized functions of up to 1000 instructions, and generates executable code. This level of practicality is reached by using constraint programming, a part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02452","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.02452","created_at":"2026-05-17T23:42:53.895087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02452v5","created_at":"2026-05-17T23:42:53.895087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02452","created_at":"2026-05-17T23:42:53.895087+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCAZIP5TNDDS","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCAZIP5TNDDS7CNM","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCAZIP5T","created_at":"2026-05-18T12:32:28.185984+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/HCAZIP5TNDDS7CNMPDSI5JANBQ","json":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ.json","graph_json":"https://pith.science/api/pith-number/HCAZIP5TNDDS7CNMPDSI5JANBQ/graph.json","events_json":"https://pith.science/api/pith-number/HCAZIP5TNDDS7CNMPDSI5JANBQ/events.json","paper":"https://pith.science/paper/HCAZIP5T"},"agent_actions":{"view_html":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ","download_json":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ.json","view_paper":"https://pith.science/paper/HCAZIP5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02452&json=true","fetch_graph":"https://pith.science/api/pith-number/HCAZIP5TNDDS7CNMPDSI5JANBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HCAZIP5TNDDS7CNMPDSI5JANBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/action/storage_attestation","attest_author":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/action/author_attestation","sign_citation":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/action/citation_signature","submit_replication":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/action/replication_record"}},"created_at":"2026-05-17T23:42:53.895087+00:00","updated_at":"2026-05-17T23:42:53.895087+00:00"}