{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3MA7JIE57UIOJRZ34GFMTQC44L","short_pith_number":"pith:3MA7JIE5","canonical_record":{"source":{"id":"1202.5539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-02-24T19:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"ba3dbddb1bd5a32385d0ec9271056ab48ec7860aaf3f48629b54ef97668b14ea","abstract_canon_sha256":"043b69a292735961b40faf832375221fdae45c8045b0e32eda7ab0e6afdb68b6"},"schema_version":"1.0"},"canonical_sha256":"db01f4a09dfd10e4c73be18ac9c05ce2ced3b89ea5270ac5e5283e6ca44f7c66","source":{"kind":"arxiv","id":"1202.5539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5539","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5539v1","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5539","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"3MA7JIE57UIO","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3MA7JIE57UIOJRZ3","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3MA7JIE5","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3MA7JIE57UIOJRZ34GFMTQC44L","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-02-24T19:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"ba3dbddb1bd5a32385d0ec9271056ab48ec7860aaf3f48629b54ef97668b14ea","abstract_canon_sha256":"043b69a292735961b40faf832375221fdae45c8045b0e32eda7ab0e6afdb68b6"},"schema_version":"1.0"},"canonical_sha256":"db01f4a09dfd10e4c73be18ac9c05ce2ced3b89ea5270ac5e5283e6ca44f7c66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:36.680683Z","signature_b64":"mdbu2sjFjSaog0tYdL3VSLyLtOJO3OxvUFU4TClX+XgdcJpvJpwvQqtWjOn+8nzl4JOzATTlND/0ajJVPcH/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db01f4a09dfd10e4c73be18ac9c05ce2ced3b89ea5270ac5e5283e6ca44f7c66","last_reissued_at":"2026-05-18T04:01:36.679923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:36.679923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5539","source_version":1,"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-18T04:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgruV/tYx1fWieCSK7RCzPEEw7uN1zrGN9yZ5olH01T4XdFx4T/X6cDBTTZ/2z3zFy4A2eBMN8dhPb7mnqX2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:03:53.940892Z"},"content_sha256":"7de73c99b7dba316563b66a17715eb7b73ffc3487259bef22ede2ee70f848134","schema_version":"1.0","event_id":"sha256:7de73c99b7dba316563b66a17715eb7b73ffc3487259bef22ede2ee70f848134"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3MA7JIE57UIOJRZ34GFMTQC44L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Register Allocation By Model Transformer Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"R. Kent Dybvig, Yin Wang","submitted_at":"2012-02-24T19:58:26Z","abstract_excerpt":"Register allocation has long been formulated as a graph coloring problem, coloring the conflict graph with physical registers. Such a formulation does not fully capture the goal of the allocation, which is to minimize the traffic between registers and memory. Linear scan has been proposed as an alternative to graph coloring, but in essence, it can be viewed as a greedy algorithm for graph coloring: coloring the vertices not in the order of their degrees, but in the order of their occurence in the program. Thus it suffers from almost the same constraints as graph coloring. In this article, I pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5539","kind":"arxiv","version":1},"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-18T04:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffiGwayqXDg47f3A95bbS478gnHcyTsGUrhTa4FMdvKsDr0WbcWecV41AnU0x7/R6GJuWMLhujxQFElCx/fFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:03:53.941608Z"},"content_sha256":"9d02d222fbee274fca6204baf45f84335bc793d35dab3eed245a521a4418d920","schema_version":"1.0","event_id":"sha256:9d02d222fbee274fca6204baf45f84335bc793d35dab3eed245a521a4418d920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MA7JIE57UIOJRZ34GFMTQC44L/bundle.json","state_url":"https://pith.science/pith/3MA7JIE57UIOJRZ34GFMTQC44L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MA7JIE57UIOJRZ34GFMTQC44L/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-10T23:03:53Z","links":{"resolver":"https://pith.science/pith/3MA7JIE57UIOJRZ34GFMTQC44L","bundle":"https://pith.science/pith/3MA7JIE57UIOJRZ34GFMTQC44L/bundle.json","state":"https://pith.science/pith/3MA7JIE57UIOJRZ34GFMTQC44L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MA7JIE57UIOJRZ34GFMTQC44L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3MA7JIE57UIOJRZ34GFMTQC44L","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":"043b69a292735961b40faf832375221fdae45c8045b0e32eda7ab0e6afdb68b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-02-24T19:58:26Z","title_canon_sha256":"ba3dbddb1bd5a32385d0ec9271056ab48ec7860aaf3f48629b54ef97668b14ea"},"schema_version":"1.0","source":{"id":"1202.5539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5539","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5539v1","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5539","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"3MA7JIE57UIO","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3MA7JIE57UIOJRZ3","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3MA7JIE5","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:9d02d222fbee274fca6204baf45f84335bc793d35dab3eed245a521a4418d920","target":"graph","created_at":"2026-05-18T04:01:36Z","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 has long been formulated as a graph coloring problem, coloring the conflict graph with physical registers. Such a formulation does not fully capture the goal of the allocation, which is to minimize the traffic between registers and memory. Linear scan has been proposed as an alternative to graph coloring, but in essence, it can be viewed as a greedy algorithm for graph coloring: coloring the vertices not in the order of their degrees, but in the order of their occurence in the program. Thus it suffers from almost the same constraints as graph coloring. In this article, I pr","authors_text":"R. Kent Dybvig, Yin Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-02-24T19:58:26Z","title":"Register Allocation By Model Transformer Semantics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5539","kind":"arxiv","version":1},"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:7de73c99b7dba316563b66a17715eb7b73ffc3487259bef22ede2ee70f848134","target":"record","created_at":"2026-05-18T04:01:36Z","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":"043b69a292735961b40faf832375221fdae45c8045b0e32eda7ab0e6afdb68b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-02-24T19:58:26Z","title_canon_sha256":"ba3dbddb1bd5a32385d0ec9271056ab48ec7860aaf3f48629b54ef97668b14ea"},"schema_version":"1.0","source":{"id":"1202.5539","kind":"arxiv","version":1}},"canonical_sha256":"db01f4a09dfd10e4c73be18ac9c05ce2ced3b89ea5270ac5e5283e6ca44f7c66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db01f4a09dfd10e4c73be18ac9c05ce2ced3b89ea5270ac5e5283e6ca44f7c66","first_computed_at":"2026-05-18T04:01:36.679923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:36.679923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mdbu2sjFjSaog0tYdL3VSLyLtOJO3OxvUFU4TClX+XgdcJpvJpwvQqtWjOn+8nzl4JOzATTlND/0ajJVPcH/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:36.680683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7de73c99b7dba316563b66a17715eb7b73ffc3487259bef22ede2ee70f848134","sha256:9d02d222fbee274fca6204baf45f84335bc793d35dab3eed245a521a4418d920"],"state_sha256":"7530c398603099d5008d4fd598496b2e5d4f3202e61924999db16963bdb51986"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2A1zaHJ8W07URN1NiK2J546uxhNK8h2VPVhm0zzmL56Xc/ze7XvoIzw/xdBGpThWoHUwIE42N+EEEzcLFF0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:03:53.945510Z","bundle_sha256":"481c3f4702e6996b26907943d7abf0695c4f48a76da098d446e0759e124788b3"}}