{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Z36K3WZJ4AJIIJLCPU2KPH44VG","short_pith_number":"pith:Z36K3WZJ","schema_version":"1.0","canonical_sha256":"cefcaddb29e0128425627d34a79f9ca9a41b03a3d9534cdb30492fa5be734482","source":{"kind":"arxiv","id":"1409.7628","version":3},"attestation_state":"computed","paper":{"title":"Survey on 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, Roberto Casta\\~neda Lozano","submitted_at":"2014-09-26T16:32:07Z","abstract_excerpt":"Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a compiler. In the last three decades, combinatorial optimization has emerged as an alternative to traditional, heuristic algorithms for these two tasks. Combinatorial optimization approaches can deliver optimal solutions according to a model, can precisely capture trade-offs between conflicting decisions, and are more flexible at the expense of increased compilation "},"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":"1409.7628","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-09-26T16:32:07Z","cross_cats_sorted":[],"title_canon_sha256":"5c88d5d4c8796b502c497b4ae91e612d9a557ac426588c8dd3ca345fffb285ee","abstract_canon_sha256":"e320b3595f86a08048772efa0122dae43daebac48b2692333feceb83fb4b492b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:57.078348Z","signature_b64":"fNEU6vPZhr+40FAsLylKC5ikVwpFjTPd0SBn1nr7P1EZKf397NVGc3necq+czpDW+BEu+GqvOvL7ISdObTZiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cefcaddb29e0128425627d34a79f9ca9a41b03a3d9534cdb30492fa5be734482","last_reissued_at":"2026-05-17T23:43:57.077628Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:57.077628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Survey on 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, Roberto Casta\\~neda Lozano","submitted_at":"2014-09-26T16:32:07Z","abstract_excerpt":"Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a compiler. In the last three decades, combinatorial optimization has emerged as an alternative to traditional, heuristic algorithms for these two tasks. Combinatorial optimization approaches can deliver optimal solutions according to a model, can precisely capture trade-offs between conflicting decisions, and are more flexible at the expense of increased compilation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7628","kind":"arxiv","version":3},"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":"1409.7628","created_at":"2026-05-17T23:43:57.077730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7628v3","created_at":"2026-05-17T23:43:57.077730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7628","created_at":"2026-05-17T23:43:57.077730+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z36K3WZJ4AJI","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z36K3WZJ4AJIIJLC","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z36K3WZJ","created_at":"2026-05-18T12:28:59.999130+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/Z36K3WZJ4AJIIJLCPU2KPH44VG","json":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG.json","graph_json":"https://pith.science/api/pith-number/Z36K3WZJ4AJIIJLCPU2KPH44VG/graph.json","events_json":"https://pith.science/api/pith-number/Z36K3WZJ4AJIIJLCPU2KPH44VG/events.json","paper":"https://pith.science/paper/Z36K3WZJ"},"agent_actions":{"view_html":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG","download_json":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG.json","view_paper":"https://pith.science/paper/Z36K3WZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7628&json=true","fetch_graph":"https://pith.science/api/pith-number/Z36K3WZJ4AJIIJLCPU2KPH44VG/graph.json","fetch_events":"https://pith.science/api/pith-number/Z36K3WZJ4AJIIJLCPU2KPH44VG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/action/storage_attestation","attest_author":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/action/author_attestation","sign_citation":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/action/citation_signature","submit_replication":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/action/replication_record"}},"created_at":"2026-05-17T23:43:57.077730+00:00","updated_at":"2026-05-17T23:43:57.077730+00:00"}