{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B5UZZQ3P7AEXPYYJP6OKU2DDTA","short_pith_number":"pith:B5UZZQ3P","canonical_record":{"source":{"id":"1805.03876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-10T08:30:37Z","cross_cats_sorted":[],"title_canon_sha256":"0138d2acc1013ad4a328966f6dd3d47063126cd3317a9d2cac69412a6116303a","abstract_canon_sha256":"d5f90d999ccfbce074b43d82a8ba31cb28cdb90cddce797f0964078c86707ba2"},"schema_version":"1.0"},"canonical_sha256":"0f699cc36ff80977e3097f9caa686398318c3e0a7c9a1932a406bbd773525b26","source":{"kind":"arxiv","id":"1805.03876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03876","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03876v1","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03876","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"B5UZZQ3P7AEX","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B5UZZQ3P7AEXPYYJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B5UZZQ3P","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B5UZZQ3P7AEXPYYJP6OKU2DDTA","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-10T08:30:37Z","cross_cats_sorted":[],"title_canon_sha256":"0138d2acc1013ad4a328966f6dd3d47063126cd3317a9d2cac69412a6116303a","abstract_canon_sha256":"d5f90d999ccfbce074b43d82a8ba31cb28cdb90cddce797f0964078c86707ba2"},"schema_version":"1.0"},"canonical_sha256":"0f699cc36ff80977e3097f9caa686398318c3e0a7c9a1932a406bbd773525b26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:16.505354Z","signature_b64":"22eVpmnpbzIXLFIZ4iWT1hFikoW7GjVW9HxIn9IWf+dnrM/wECIpr0ekVqJNNQjJyR3kL9H7kBjRla2ADhyJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f699cc36ff80977e3097f9caa686398318c3e0a7c9a1932a406bbd773525b26","last_reissued_at":"2026-05-18T00:16:16.504832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:16.504832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03876","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-18T00:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4AlsvLfhGYf5irxKrR/2pGJ1DY09rF9miN60zewvkbHOsTcmqlDCj6rDg3+d9r2bCMFU/qu8EfT1eCgVlPvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:05:55.773037Z"},"content_sha256":"2d4a540f0b51a6e7cdc364a8a6dfe3b5de6645606a3055efcb5262e71fc2ce43","schema_version":"1.0","event_id":"sha256:2d4a540f0b51a6e7cdc364a8a6dfe3b5de6645606a3055efcb5262e71fc2ce43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B5UZZQ3P7AEXPYYJP6OKU2DDTA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Robust Search Strategies Using a Bandit-Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Roland H. C. Yap, Wei Xia","submitted_at":"2018-05-10T08:30:37Z","abstract_excerpt":"Effective solving of constraint problems often requires choosing good or specific search heuristics. However, choosing or designing a good search heuristic is non-trivial and is often a manual process. In this paper, rather than manually choosing/designing search heuristics, we propose the use of bandit-based learning techniques to automatically select search heuristics. Our approach is online where the solver learns and selects from a set of heuristics during search. The goal is to obtain automatic search heuristics which give robust performance. Preliminary experiments show that our adaptive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03876","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-18T00:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HE3pBZ0c57ZWLgqLmedR45tnP2NC10YcDtW8UyP5VyxKgqtaqboaGZWiBuC4aYhfvv10MuVyCeZkPKAdCqLpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:05:55.773600Z"},"content_sha256":"f072cfa97584e05560caded5027998716548ba3117b04e3530513c402345ba0d","schema_version":"1.0","event_id":"sha256:f072cfa97584e05560caded5027998716548ba3117b04e3530513c402345ba0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/bundle.json","state_url":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/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:05:55Z","links":{"resolver":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA","bundle":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/bundle.json","state":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B5UZZQ3P7AEXPYYJP6OKU2DDTA","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":"d5f90d999ccfbce074b43d82a8ba31cb28cdb90cddce797f0964078c86707ba2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-10T08:30:37Z","title_canon_sha256":"0138d2acc1013ad4a328966f6dd3d47063126cd3317a9d2cac69412a6116303a"},"schema_version":"1.0","source":{"id":"1805.03876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03876","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03876v1","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03876","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"B5UZZQ3P7AEX","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B5UZZQ3P7AEXPYYJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B5UZZQ3P","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:f072cfa97584e05560caded5027998716548ba3117b04e3530513c402345ba0d","target":"graph","created_at":"2026-05-18T00:16:16Z","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 solving of constraint problems often requires choosing good or specific search heuristics. However, choosing or designing a good search heuristic is non-trivial and is often a manual process. In this paper, rather than manually choosing/designing search heuristics, we propose the use of bandit-based learning techniques to automatically select search heuristics. Our approach is online where the solver learns and selects from a set of heuristics during search. The goal is to obtain automatic search heuristics which give robust performance. Preliminary experiments show that our adaptive","authors_text":"Roland H. C. Yap, Wei Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-10T08:30:37Z","title":"Learning Robust Search Strategies Using a Bandit-Based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03876","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:2d4a540f0b51a6e7cdc364a8a6dfe3b5de6645606a3055efcb5262e71fc2ce43","target":"record","created_at":"2026-05-18T00:16:16Z","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":"d5f90d999ccfbce074b43d82a8ba31cb28cdb90cddce797f0964078c86707ba2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-10T08:30:37Z","title_canon_sha256":"0138d2acc1013ad4a328966f6dd3d47063126cd3317a9d2cac69412a6116303a"},"schema_version":"1.0","source":{"id":"1805.03876","kind":"arxiv","version":1}},"canonical_sha256":"0f699cc36ff80977e3097f9caa686398318c3e0a7c9a1932a406bbd773525b26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f699cc36ff80977e3097f9caa686398318c3e0a7c9a1932a406bbd773525b26","first_computed_at":"2026-05-18T00:16:16.504832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:16.504832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"22eVpmnpbzIXLFIZ4iWT1hFikoW7GjVW9HxIn9IWf+dnrM/wECIpr0ekVqJNNQjJyR3kL9H7kBjRla2ADhyJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:16.505354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d4a540f0b51a6e7cdc364a8a6dfe3b5de6645606a3055efcb5262e71fc2ce43","sha256:f072cfa97584e05560caded5027998716548ba3117b04e3530513c402345ba0d"],"state_sha256":"56c49e85c9150e92436f9f96bb1b9104740170e47636e4a8eaecd77e5ad29336"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vYmkkvSIKmp9TaPzgUDo4BFhYFKXbXlA+i85mqEAUwhur5u6xguVewjNvHs+d1Pv1Mw3+N3lm+kRLy//yPODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:05:55.776642Z","bundle_sha256":"e6953c186c04ed80765822bb59afbb0bfe1199c1aa51cef023a4ba005014b502"}}