{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YDXWMYYXMINIIHM3VSVPPZE2OK","short_pith_number":"pith:YDXWMYYX","canonical_record":{"source":{"id":"1109.2347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-11T20:09:48Z","cross_cats_sorted":[],"title_canon_sha256":"12d8bff017f11d54befcac2862dea0f26163a9eada7f209dff86241dd9461a08","abstract_canon_sha256":"3bb6c65dfecb74611c6e1a142ddf9711e067250844e406113410b806d016cfdf"},"schema_version":"1.0"},"canonical_sha256":"c0ef666317621a841d9bacaaf7e49a72991f9c18814f0d4d1c71f4b123733a41","source":{"kind":"arxiv","id":"1109.2347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2347","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2347v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2347","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"YDXWMYYXMINI","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YDXWMYYXMINIIHM3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YDXWMYYX","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YDXWMYYXMINIIHM3VSVPPZE2OK","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-11T20:09:48Z","cross_cats_sorted":[],"title_canon_sha256":"12d8bff017f11d54befcac2862dea0f26163a9eada7f209dff86241dd9461a08","abstract_canon_sha256":"3bb6c65dfecb74611c6e1a142ddf9711e067250844e406113410b806d016cfdf"},"schema_version":"1.0"},"canonical_sha256":"c0ef666317621a841d9bacaaf7e49a72991f9c18814f0d4d1c71f4b123733a41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:37.896844Z","signature_b64":"LWp9ZqZ0Cr6+I6vofKIN8s2eTs72ipWRTaKwX0iCtuEBXB9DZWFjqP+Vj/B7wJrXskmNoRl65jPpvhTsEWdxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ef666317621a841d9bacaaf7e49a72991f9c18814f0d4d1c71f4b123733a41","last_reissued_at":"2026-05-18T04:13:37.896183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:37.896183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2347","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7gxMTp4FkPnwfQpQ1bnBT6HVT9b8MgGVof6SN7q96DTtqawf961hQo5auTC7/Nc2wS0MisC05ktwNnSdNinBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:14:27.691805Z"},"content_sha256":"6c27af527a066c95647c92a970416b3f8ca91741cf6db06b083f6ff67b3fb620","schema_version":"1.0","event_id":"sha256:6c27af527a066c95647c92a970416b3f8ca91741cf6db06b083f6ff67b3fb620"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YDXWMYYXMINIIHM3VSVPPZE2OK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking Instance-Independent Symmetries In Exact Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"A. Ramani, F. A. Aloul, I. L. Markov, K. A. Sakallah","submitted_at":"2011-09-11T20:09:48Z","abstract_excerpt":"Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems,  such as graph coloring used in register allocation.  Graph coloring is also used to model more traditional CSPs relevant to AI, such as planning, time-tabling and scheduling.  Provably optimal solutions may be desirable for commercial and defense applications. Additionally, for applications such as register allocation and code optimization, naturally-occurring instances    of graph coloring are often small and can be solved optimally. A recent  wave of improvements in algorithms for B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2347","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOgE2f0q47lyriT9b9EAgJ8n0e4bSIlTy1N5noS2blhomJBmj6CkWWXgi5OzNyiiUc7KENUmfzvXAOXN9iwQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:14:27.692145Z"},"content_sha256":"2e972f4cfdf1e6eb183713587c037af1460be28d5abf74c71ab8c90a099b8bf8","schema_version":"1.0","event_id":"sha256:2e972f4cfdf1e6eb183713587c037af1460be28d5abf74c71ab8c90a099b8bf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDXWMYYXMINIIHM3VSVPPZE2OK/bundle.json","state_url":"https://pith.science/pith/YDXWMYYXMINIIHM3VSVPPZE2OK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDXWMYYXMINIIHM3VSVPPZE2OK/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-02T04:14:27Z","links":{"resolver":"https://pith.science/pith/YDXWMYYXMINIIHM3VSVPPZE2OK","bundle":"https://pith.science/pith/YDXWMYYXMINIIHM3VSVPPZE2OK/bundle.json","state":"https://pith.science/pith/YDXWMYYXMINIIHM3VSVPPZE2OK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDXWMYYXMINIIHM3VSVPPZE2OK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YDXWMYYXMINIIHM3VSVPPZE2OK","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":"3bb6c65dfecb74611c6e1a142ddf9711e067250844e406113410b806d016cfdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-11T20:09:48Z","title_canon_sha256":"12d8bff017f11d54befcac2862dea0f26163a9eada7f209dff86241dd9461a08"},"schema_version":"1.0","source":{"id":"1109.2347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2347","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2347v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2347","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"YDXWMYYXMINI","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YDXWMYYXMINIIHM3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YDXWMYYX","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:2e972f4cfdf1e6eb183713587c037af1460be28d5abf74c71ab8c90a099b8bf8","target":"graph","created_at":"2026-05-18T04:13:37Z","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":"Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems,  such as graph coloring used in register allocation.  Graph coloring is also used to model more traditional CSPs relevant to AI, such as planning, time-tabling and scheduling.  Provably optimal solutions may be desirable for commercial and defense applications. Additionally, for applications such as register allocation and code optimization, naturally-occurring instances    of graph coloring are often small and can be solved optimally. A recent  wave of improvements in algorithms for B","authors_text":"A. Ramani, F. A. Aloul, I. L. Markov, K. A. Sakallah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-11T20:09:48Z","title":"Breaking Instance-Independent Symmetries In Exact Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2347","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:6c27af527a066c95647c92a970416b3f8ca91741cf6db06b083f6ff67b3fb620","target":"record","created_at":"2026-05-18T04:13:37Z","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":"3bb6c65dfecb74611c6e1a142ddf9711e067250844e406113410b806d016cfdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-11T20:09:48Z","title_canon_sha256":"12d8bff017f11d54befcac2862dea0f26163a9eada7f209dff86241dd9461a08"},"schema_version":"1.0","source":{"id":"1109.2347","kind":"arxiv","version":1}},"canonical_sha256":"c0ef666317621a841d9bacaaf7e49a72991f9c18814f0d4d1c71f4b123733a41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0ef666317621a841d9bacaaf7e49a72991f9c18814f0d4d1c71f4b123733a41","first_computed_at":"2026-05-18T04:13:37.896183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:37.896183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LWp9ZqZ0Cr6+I6vofKIN8s2eTs72ipWRTaKwX0iCtuEBXB9DZWFjqP+Vj/B7wJrXskmNoRl65jPpvhTsEWdxBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:37.896844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c27af527a066c95647c92a970416b3f8ca91741cf6db06b083f6ff67b3fb620","sha256:2e972f4cfdf1e6eb183713587c037af1460be28d5abf74c71ab8c90a099b8bf8"],"state_sha256":"ac4c775099d9dd688fc1ed170bb6900625d09afb40b202ecbd642cbe593f207f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UK3kaVAq7iBIjcyzgnEZgMN7cCxMuJZfeKn5WhAhNReaQsQxIl+8uU63h2Jz3ypvXqUHu0+5xRKgXWyeLOLOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:14:27.694677Z","bundle_sha256":"fa2edb594f3909e2f9ac40e63465e2d167a6244f99cf008f2cf8a538ff5db9da"}}