{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IYYDO3NVOKJH73QABSWW56I3EA","short_pith_number":"pith:IYYDO3NV","canonical_record":{"source":{"id":"1805.02205","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-06T13:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"e80923636706228f8dafb6138bbd285e6e43049c870659f213ad375898d843a3","abstract_canon_sha256":"113f4013313fcd04f169aedbd9132a41b9a8a80f2d9522a9d426a52c470dd3f0"},"schema_version":"1.0"},"canonical_sha256":"4630376db572927fee000cad6ef91b200e38fdd9fb56ed2ff358cca345c4d0ed","source":{"kind":"arxiv","id":"1805.02205","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02205","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02205v2","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02205","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"IYYDO3NVOKJH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IYYDO3NVOKJH73QA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IYYDO3NV","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IYYDO3NVOKJH73QABSWW56I3EA","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02205","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-06T13:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"e80923636706228f8dafb6138bbd285e6e43049c870659f213ad375898d843a3","abstract_canon_sha256":"113f4013313fcd04f169aedbd9132a41b9a8a80f2d9522a9d426a52c470dd3f0"},"schema_version":"1.0"},"canonical_sha256":"4630376db572927fee000cad6ef91b200e38fdd9fb56ed2ff358cca345c4d0ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:04.614274Z","signature_b64":"hSI0VsOXYoa8vkT+w5PJvIuGQ4qr500V2umkxm775j2JNQi/f14RAlT38Qcs+IJtEyJXregq91r5/TdhH00aCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4630376db572927fee000cad6ef91b200e38fdd9fb56ed2ff358cca345c4d0ed","last_reissued_at":"2026-05-18T00:15:04.613667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:04.613667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02205","source_version":2,"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-18T00:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXTEjByIknjgh4LGKWsLI41HXC36gqiYrxqrHTXxoZ+xeJG17iPvc+tfXo9tdjkzOJrbguQdgpbG+Km/4D6ZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:30:41.545638Z"},"content_sha256":"33bb0e3a988c5c570d337e6ad8e40ab5efd55d545ee532f08ec6f379f6826455","schema_version":"1.0","event_id":"sha256:33bb0e3a988c5c570d337e6ad8e40ab5efd55d545ee532f08ec6f379f6826455"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IYYDO3NVOKJH73QABSWW56I3EA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Correlation Heuristics for Constraint Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Roland H. C. Yap, Ruiwei Wang, Wei Xia","submitted_at":"2018-05-06T13:09:17Z","abstract_excerpt":"Effective general-purpose search strategies are an important component in Constraint Programming. We introduce a new idea, namely, using correlations between variables to guide search. Variable correlations are measured and maintained by using domain changes during constraint propagation. We propose two variable heuristics based on the correlation matrix, crbs-sum and crbs-max. We evaluate our correlation heuristics with well known heuristics, namely, dom/wdeg, impact-based search and activity-based search. Experiments on a large set of benchmarks show that our correlation heuristics are compe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02205","kind":"arxiv","version":2},"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-18T00:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bulLs2KSnLxe7V+DhCCtLXTZpXJWZ8+qp55TDv281QPHy3chE/DYda0MDi1zNh8uCw5OKwWNEKgg4kfg6eV8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:30:41.546162Z"},"content_sha256":"2718a80e3a21f373a95d45fcbeb6a14a91072f7a5b275c79ec838d6c8fc5672e","schema_version":"1.0","event_id":"sha256:2718a80e3a21f373a95d45fcbeb6a14a91072f7a5b275c79ec838d6c8fc5672e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYYDO3NVOKJH73QABSWW56I3EA/bundle.json","state_url":"https://pith.science/pith/IYYDO3NVOKJH73QABSWW56I3EA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYYDO3NVOKJH73QABSWW56I3EA/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-06T19:30:41Z","links":{"resolver":"https://pith.science/pith/IYYDO3NVOKJH73QABSWW56I3EA","bundle":"https://pith.science/pith/IYYDO3NVOKJH73QABSWW56I3EA/bundle.json","state":"https://pith.science/pith/IYYDO3NVOKJH73QABSWW56I3EA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYYDO3NVOKJH73QABSWW56I3EA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IYYDO3NVOKJH73QABSWW56I3EA","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":"113f4013313fcd04f169aedbd9132a41b9a8a80f2d9522a9d426a52c470dd3f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-06T13:09:17Z","title_canon_sha256":"e80923636706228f8dafb6138bbd285e6e43049c870659f213ad375898d843a3"},"schema_version":"1.0","source":{"id":"1805.02205","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02205","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02205v2","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02205","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"IYYDO3NVOKJH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IYYDO3NVOKJH73QA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IYYDO3NV","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:2718a80e3a21f373a95d45fcbeb6a14a91072f7a5b275c79ec838d6c8fc5672e","target":"graph","created_at":"2026-05-18T00:15:04Z","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":"Effective general-purpose search strategies are an important component in Constraint Programming. We introduce a new idea, namely, using correlations between variables to guide search. Variable correlations are measured and maintained by using domain changes during constraint propagation. We propose two variable heuristics based on the correlation matrix, crbs-sum and crbs-max. We evaluate our correlation heuristics with well known heuristics, namely, dom/wdeg, impact-based search and activity-based search. Experiments on a large set of benchmarks show that our correlation heuristics are compe","authors_text":"Roland H. C. Yap, Ruiwei Wang, Wei Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-06T13:09:17Z","title":"Correlation Heuristics for Constraint Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02205","kind":"arxiv","version":2},"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:33bb0e3a988c5c570d337e6ad8e40ab5efd55d545ee532f08ec6f379f6826455","target":"record","created_at":"2026-05-18T00:15:04Z","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":"113f4013313fcd04f169aedbd9132a41b9a8a80f2d9522a9d426a52c470dd3f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-06T13:09:17Z","title_canon_sha256":"e80923636706228f8dafb6138bbd285e6e43049c870659f213ad375898d843a3"},"schema_version":"1.0","source":{"id":"1805.02205","kind":"arxiv","version":2}},"canonical_sha256":"4630376db572927fee000cad6ef91b200e38fdd9fb56ed2ff358cca345c4d0ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4630376db572927fee000cad6ef91b200e38fdd9fb56ed2ff358cca345c4d0ed","first_computed_at":"2026-05-18T00:15:04.613667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:04.613667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hSI0VsOXYoa8vkT+w5PJvIuGQ4qr500V2umkxm775j2JNQi/f14RAlT38Qcs+IJtEyJXregq91r5/TdhH00aCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:04.614274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02205","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33bb0e3a988c5c570d337e6ad8e40ab5efd55d545ee532f08ec6f379f6826455","sha256:2718a80e3a21f373a95d45fcbeb6a14a91072f7a5b275c79ec838d6c8fc5672e"],"state_sha256":"cbc541e858f3f441a0cc22145d48970c07e40127ba8115e21724bfea5fd25fdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXSvfzogSK72CuFtY8peI658Adkz+6aQVU49k+BNoykEoZL7G7ELuRRnGKMBcGCKkUchqrrkhbcVmsP/6BFpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:30:41.549491Z","bundle_sha256":"e9f0dd9b5eae53dfb590944fa1eecab0f79e72450f8b6844bf0f71ad59ffb44c"}}