{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MIBS2L5LTCILTVA2PQXXOZAYER","short_pith_number":"pith:MIBS2L5L","canonical_record":{"source":{"id":"1301.2279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"fcd540335198e1214144f4ce4d8d6f4090d621f648b5705d138d714c0c031fbd","abstract_canon_sha256":"ea712f0489bd32e086579e3d07bdcf63fcdd3b3b5dc6f3ea967bba72fb044e41"},"schema_version":"1.0"},"canonical_sha256":"62032d2fab9890b9d41a7c2f7764182466732c3fabf965e8e9ac063796b4137d","source":{"kind":"arxiv","id":"1301.2279","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2279","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2279v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2279","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"MIBS2L5LTCIL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MIBS2L5LTCILTVA2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MIBS2L5L","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MIBS2L5LTCILTVA2PQXXOZAYER","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"fcd540335198e1214144f4ce4d8d6f4090d621f648b5705d138d714c0c031fbd","abstract_canon_sha256":"ea712f0489bd32e086579e3d07bdcf63fcdd3b3b5dc6f3ea967bba72fb044e41"},"schema_version":"1.0"},"canonical_sha256":"62032d2fab9890b9d41a7c2f7764182466732c3fabf965e8e9ac063796b4137d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.635033Z","signature_b64":"jkhoxdMUNgw4MQnNgc1y3SiX34JZOlk6pJMAG6H0FSWbEsF9P121K3hpUoGgwIebljo4FpEEgXSButrUiysdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62032d2fab9890b9d41a7c2f7764182466732c3fabf965e8e9ac063796b4137d","last_reissued_at":"2026-05-18T03:36:45.634440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.634440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2279","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-18T03:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXyWgmzFH2AQzVD3LUpp7iJTZ4NeSW5Rp908QNODHCYAhOEjsk848GRekW+8wjVP5ptlUcA+rzXw5D63isDlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:45:35.029464Z"},"content_sha256":"43b385ec5aad0011d4e7d3ca1885e99dc2f8f22b9a9b4404b1af5143e244d821","schema_version":"1.0","event_id":"sha256:43b385ec5aad0011d4e7d3ca1885e99dc2f8f22b9a9b4404b1af5143e244d821"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MIBS2L5LTCILTVA2PQXXOZAYER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bayesian Approach to Tackling Hard Computational Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bart Selman, Carla P. Gomes, David Maxwell Chickering, Eric J. Horvitz, Henry Kautz, Yongshao Ruan","submitted_at":"2013-01-10T16:24:15Z","abstract_excerpt":"We are developing a general framework for using learned Bayesian models for decision-theoretic control of search and reasoningalgorithms.  We illustrate the approach on the specific task of controlling both general and domain-specific solvers on a hard class of structured constraint satisfaction problems.  A successful strategyfor reducing the high (and even infinite) variance in running time typically exhibited by backtracking search algorithms is to cut off and restart the search if a solution is not found within a certainamount of time.  Previous work on restart strategies have employed fix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2279","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-18T03:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFvvvZpC2S/IT1pF7a9W19V8hBxF3j2zzU4kFbFK94VAe53+SCxagwtFXd2NgthIs6KThwJE9u72Xh3UlSgDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:45:35.029822Z"},"content_sha256":"cec54df7d789c8104c51f466c3ca5e3880a9da0450656e51f39b4178a96317ec","schema_version":"1.0","event_id":"sha256:cec54df7d789c8104c51f466c3ca5e3880a9da0450656e51f39b4178a96317ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIBS2L5LTCILTVA2PQXXOZAYER/bundle.json","state_url":"https://pith.science/pith/MIBS2L5LTCILTVA2PQXXOZAYER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIBS2L5LTCILTVA2PQXXOZAYER/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-05-30T02:45:35Z","links":{"resolver":"https://pith.science/pith/MIBS2L5LTCILTVA2PQXXOZAYER","bundle":"https://pith.science/pith/MIBS2L5LTCILTVA2PQXXOZAYER/bundle.json","state":"https://pith.science/pith/MIBS2L5LTCILTVA2PQXXOZAYER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIBS2L5LTCILTVA2PQXXOZAYER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MIBS2L5LTCILTVA2PQXXOZAYER","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":"ea712f0489bd32e086579e3d07bdcf63fcdd3b3b5dc6f3ea967bba72fb044e41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:24:15Z","title_canon_sha256":"fcd540335198e1214144f4ce4d8d6f4090d621f648b5705d138d714c0c031fbd"},"schema_version":"1.0","source":{"id":"1301.2279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2279","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2279v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2279","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"MIBS2L5LTCIL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MIBS2L5LTCILTVA2","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MIBS2L5L","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:cec54df7d789c8104c51f466c3ca5e3880a9da0450656e51f39b4178a96317ec","target":"graph","created_at":"2026-05-18T03:36:45Z","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":"We are developing a general framework for using learned Bayesian models for decision-theoretic control of search and reasoningalgorithms.  We illustrate the approach on the specific task of controlling both general and domain-specific solvers on a hard class of structured constraint satisfaction problems.  A successful strategyfor reducing the high (and even infinite) variance in running time typically exhibited by backtracking search algorithms is to cut off and restart the search if a solution is not found within a certainamount of time.  Previous work on restart strategies have employed fix","authors_text":"Bart Selman, Carla P. Gomes, David Maxwell Chickering, Eric J. Horvitz, Henry Kautz, Yongshao Ruan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:24:15Z","title":"A Bayesian Approach to Tackling Hard Computational Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2279","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:43b385ec5aad0011d4e7d3ca1885e99dc2f8f22b9a9b4404b1af5143e244d821","target":"record","created_at":"2026-05-18T03:36:45Z","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":"ea712f0489bd32e086579e3d07bdcf63fcdd3b3b5dc6f3ea967bba72fb044e41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:24:15Z","title_canon_sha256":"fcd540335198e1214144f4ce4d8d6f4090d621f648b5705d138d714c0c031fbd"},"schema_version":"1.0","source":{"id":"1301.2279","kind":"arxiv","version":1}},"canonical_sha256":"62032d2fab9890b9d41a7c2f7764182466732c3fabf965e8e9ac063796b4137d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62032d2fab9890b9d41a7c2f7764182466732c3fabf965e8e9ac063796b4137d","first_computed_at":"2026-05-18T03:36:45.634440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.634440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jkhoxdMUNgw4MQnNgc1y3SiX34JZOlk6pJMAG6H0FSWbEsF9P121K3hpUoGgwIebljo4FpEEgXSButrUiysdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.635033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43b385ec5aad0011d4e7d3ca1885e99dc2f8f22b9a9b4404b1af5143e244d821","sha256:cec54df7d789c8104c51f466c3ca5e3880a9da0450656e51f39b4178a96317ec"],"state_sha256":"034bef720d467cb3986009bd8698d0f5f907c3758311e84126f8aef010055bca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAine5CBhzcFOOzh5EUlnMX8ZO1B8NzprvoDnUAY9D0TtMzL0qRbbym5NGRnivixm+QwmFKc0lcVyHje0JDJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:45:35.031965Z","bundle_sha256":"d64e2bf03ea48c40774d9b6c840a375ea78a8976b95ed1215dadf45b1297bb0d"}}