{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B5UZZQ3P7AEXPYYJP6OKU2DDTA","short_pith_number":"pith:B5UZZQ3P","schema_version":"1.0","canonical_sha256":"0f699cc36ff80977e3097f9caa686398318c3e0a7c9a1932a406bbd773525b26","source":{"kind":"arxiv","id":"1805.03876","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.03876","created_at":"2026-05-18T00:16:16.504920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03876v1","created_at":"2026-05-18T00:16:16.504920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03876","created_at":"2026-05-18T00:16:16.504920+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5UZZQ3P7AEX","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5UZZQ3P7AEXPYYJ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5UZZQ3P","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA","json":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA.json","graph_json":"https://pith.science/api/pith-number/B5UZZQ3P7AEXPYYJP6OKU2DDTA/graph.json","events_json":"https://pith.science/api/pith-number/B5UZZQ3P7AEXPYYJP6OKU2DDTA/events.json","paper":"https://pith.science/paper/B5UZZQ3P"},"agent_actions":{"view_html":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA","download_json":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA.json","view_paper":"https://pith.science/paper/B5UZZQ3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03876&json=true","fetch_graph":"https://pith.science/api/pith-number/B5UZZQ3P7AEXPYYJP6OKU2DDTA/graph.json","fetch_events":"https://pith.science/api/pith-number/B5UZZQ3P7AEXPYYJP6OKU2DDTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/action/storage_attestation","attest_author":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/action/author_attestation","sign_citation":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/action/citation_signature","submit_replication":"https://pith.science/pith/B5UZZQ3P7AEXPYYJP6OKU2DDTA/action/replication_record"}},"created_at":"2026-05-18T00:16:16.504920+00:00","updated_at":"2026-05-18T00:16:16.504920+00:00"}