{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HCAZIP5TNDDS7CNMPDSI5JANBQ","short_pith_number":"pith:HCAZIP5T","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"},"canonical_sha256":"3881943fb368c72f89ac78e48ea40d0c0229baf884d51b79cf804d8f9a51bbbc","source":{"kind":"arxiv","id":"1804.02452","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02452","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02452v5","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02452","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"HCAZIP5TNDDS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HCAZIP5TNDDS7CNM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HCAZIP5T","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HCAZIP5TNDDS7CNMPDSI5JANBQ","target":"record","payload":{"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"},"canonical_sha256":"3881943fb368c72f89ac78e48ea40d0c0229baf884d51b79cf804d8f9a51bbbc","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"},"source_kind":"arxiv","source_id":"1804.02452","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9C0R4C4rpWCqI5n2BW/BshL5WCuIbNWNIGm35FeUKfOkc+uXdbhbTBjIFMh3q9hnhmrJ41T7cDO2V/vwOKNrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:56:50.528827Z"},"content_sha256":"5ec44c79f717d238a70b65b222605389efdf293776839b321ccebea2aa7be4ad","schema_version":"1.0","event_id":"sha256:5ec44c79f717d238a70b65b222605389efdf293776839b321ccebea2aa7be4ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HCAZIP5TNDDS7CNMPDSI5JANBQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QgiYrV5A5LM1sULEhTVA+czk/q2W2IpFmpvRWmsm9ptXy1GTNz32/NcyWC9cP1LYo2/h5geF+/c2t6qo0BvgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:56:50.529177Z"},"content_sha256":"636111036728aeb5588d1559abec076f44ae932803317a140b59e58c44651ae7","schema_version":"1.0","event_id":"sha256:636111036728aeb5588d1559abec076f44ae932803317a140b59e58c44651ae7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/bundle.json","state_url":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T14:56:50Z","links":{"resolver":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ","bundle":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/bundle.json","state":"https://pith.science/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCAZIP5TNDDS7CNMPDSI5JANBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HCAZIP5TNDDS7CNMPDSI5JANBQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a1207d2214ff29590ad7f622a9f732bab11759382005b8ac69b41c3805d8949b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-06T20:47:21Z","title_canon_sha256":"82d63f355ac40483f7fd70704caf8fb009c717a902c9827b60ba2f8b5d56cbc9"},"schema_version":"1.0","source":{"id":"1804.02452","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02452","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02452v5","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02452","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"HCAZIP5TNDDS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HCAZIP5TNDDS7CNM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HCAZIP5T","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:636111036728aeb5588d1559abec076f44ae932803317a140b59e58c44651ae7","target":"graph","created_at":"2026-05-17T23:42:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christian Schulte, Gabriel Hjort Blindell, Mats Carlsson, Roberto Casta\\~neda Lozano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-06T20:47:21Z","title":"Combinatorial Register Allocation and Instruction Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02452","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5ec44c79f717d238a70b65b222605389efdf293776839b321ccebea2aa7be4ad","target":"record","created_at":"2026-05-17T23:42:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a1207d2214ff29590ad7f622a9f732bab11759382005b8ac69b41c3805d8949b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-06T20:47:21Z","title_canon_sha256":"82d63f355ac40483f7fd70704caf8fb009c717a902c9827b60ba2f8b5d56cbc9"},"schema_version":"1.0","source":{"id":"1804.02452","kind":"arxiv","version":5}},"canonical_sha256":"3881943fb368c72f89ac78e48ea40d0c0229baf884d51b79cf804d8f9a51bbbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3881943fb368c72f89ac78e48ea40d0c0229baf884d51b79cf804d8f9a51bbbc","first_computed_at":"2026-05-17T23:42:53.894984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:53.894984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hlz6UM6GKjqg/879lN69bAf67q0BbnqbsPXofelj4uBJsUcbrBui62H5e3/zHsF+0kdxEBxcIw0FoNr24+ZcCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:53.895622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02452","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ec44c79f717d238a70b65b222605389efdf293776839b321ccebea2aa7be4ad","sha256:636111036728aeb5588d1559abec076f44ae932803317a140b59e58c44651ae7"],"state_sha256":"c6d057405abe30ec8bbf2aec3edcede4d26b3f6f27dc102b348b17dc4e02fde7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bqT/OOABiffEd2TWGJ5kU6XHd8guypMeTR9Midbsk9E2q/jTLnVGCGfxNP7yLtyrzgX2BuunKSz8GHkOUefAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T14:56:50.531083Z","bundle_sha256":"a146417ab245962c19dd2a65f1a67623927a751538d9a22849242826cae5a5f2"}}