{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z36K3WZJ4AJIIJLCPU2KPH44VG","short_pith_number":"pith:Z36K3WZJ","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"},"canonical_sha256":"cefcaddb29e0128425627d34a79f9ca9a41b03a3d9534cdb30492fa5be734482","source":{"kind":"arxiv","id":"1409.7628","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7628","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7628v3","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7628","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"pith_short_12","alias_value":"Z36K3WZJ4AJI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z36K3WZJ4AJIIJLC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z36K3WZJ","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z36K3WZJ4AJIIJLCPU2KPH44VG","target":"record","payload":{"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"},"canonical_sha256":"cefcaddb29e0128425627d34a79f9ca9a41b03a3d9534cdb30492fa5be734482","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"},"source_kind":"arxiv","source_id":"1409.7628","source_version":3,"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:43:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JNGc4ljQ5tg+gYs8zyW82zXBVmzg/K2LK8IIWXkF1ZtcAa10AAa/VmlCQVm4jUBr32pyCSL2bAIls50sacymCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:40:57.183765Z"},"content_sha256":"3a0cd63c905098cd5809bfed79263631b3822419c0c89c2e9a78a0e1c1d55071","schema_version":"1.0","event_id":"sha256:3a0cd63c905098cd5809bfed79263631b3822419c0c89c2e9a78a0e1c1d55071"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z36K3WZJ4AJIIJLCPU2KPH44VG","target":"graph","payload":{"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"},"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:43:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HrKCj2VtI9inOThD5DziNdBhBvpmPmp0jEyqvt1V7E2dso0KPWXjRbpFSDsd87nsiP/3BUcEiAckuKrmUuiADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:40:57.184105Z"},"content_sha256":"5293f185079a04d3c107bf21a1b56f4dbc126a383d81acf0de1f4a3b9ca4e24d","schema_version":"1.0","event_id":"sha256:5293f185079a04d3c107bf21a1b56f4dbc126a383d81acf0de1f4a3b9ca4e24d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/bundle.json","state_url":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/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-20T08:40:57Z","links":{"resolver":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG","bundle":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/bundle.json","state":"https://pith.science/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z36K3WZJ4AJIIJLCPU2KPH44VG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z36K3WZJ4AJIIJLCPU2KPH44VG","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":"e320b3595f86a08048772efa0122dae43daebac48b2692333feceb83fb4b492b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-09-26T16:32:07Z","title_canon_sha256":"5c88d5d4c8796b502c497b4ae91e612d9a557ac426588c8dd3ca345fffb285ee"},"schema_version":"1.0","source":{"id":"1409.7628","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7628","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7628v3","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7628","created_at":"2026-05-17T23:43:57Z"},{"alias_kind":"pith_short_12","alias_value":"Z36K3WZJ4AJI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z36K3WZJ4AJIIJLC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z36K3WZJ","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:5293f185079a04d3c107bf21a1b56f4dbc126a383d81acf0de1f4a3b9ca4e24d","target":"graph","created_at":"2026-05-17T23:43:57Z","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":"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 ","authors_text":"Christian Schulte, Roberto Casta\\~neda Lozano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-09-26T16:32:07Z","title":"Survey on Combinatorial Register Allocation and Instruction Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7628","kind":"arxiv","version":3},"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:3a0cd63c905098cd5809bfed79263631b3822419c0c89c2e9a78a0e1c1d55071","target":"record","created_at":"2026-05-17T23:43:57Z","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":"e320b3595f86a08048772efa0122dae43daebac48b2692333feceb83fb4b492b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-09-26T16:32:07Z","title_canon_sha256":"5c88d5d4c8796b502c497b4ae91e612d9a557ac426588c8dd3ca345fffb285ee"},"schema_version":"1.0","source":{"id":"1409.7628","kind":"arxiv","version":3}},"canonical_sha256":"cefcaddb29e0128425627d34a79f9ca9a41b03a3d9534cdb30492fa5be734482","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cefcaddb29e0128425627d34a79f9ca9a41b03a3d9534cdb30492fa5be734482","first_computed_at":"2026-05-17T23:43:57.077628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:57.077628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fNEU6vPZhr+40FAsLylKC5ikVwpFjTPd0SBn1nr7P1EZKf397NVGc3necq+czpDW+BEu+GqvOvL7ISdObTZiDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:57.078348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7628","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a0cd63c905098cd5809bfed79263631b3822419c0c89c2e9a78a0e1c1d55071","sha256:5293f185079a04d3c107bf21a1b56f4dbc126a383d81acf0de1f4a3b9ca4e24d"],"state_sha256":"cadc7ca0c8cc1742e04bc32aae34b0a1f794d7f48575403ec2a6cb8ed32176dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0v7wsxBxnrVlTQeI8SOU50t89d0H87L8LSSEDCGnjqEnf/q35z+OosP0DjTy6u9yJA/thgfHUHJbsGwctEM1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:40:57.186002Z","bundle_sha256":"b474cf10d08ea8d3e088fce88b22c5319b626c94a91b67b33682519785d7f947"}}