{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EQYHBJ32RFTVELHODFEWMESL2T","short_pith_number":"pith:EQYHBJ32","schema_version":"1.0","canonical_sha256":"243070a77a8967522cee194966124bd4f65429711ea08013fc4dc02f7d8d6b8c","source":{"kind":"arxiv","id":"1805.08256","version":1},"attestation_state":"computed","paper":{"title":"Evolving Real-Time Heuristics Search Algorithms with Building Blocks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Md Solimul Chowdhury, Victor Silva","submitted_at":"2018-05-21T18:52:00Z","abstract_excerpt":"The research area of real-time heuristics search has produced quite many algorithms. In the landscape of real-time heuristics search research, it is not rare to find that an algorithm X that appears to perform better than algorithm Y on a group of problems, performed worse than Y for another group of problems. If these published algorithms are combined to generate a more powerful space of algorithms, then that novel space of algorithms may solve a distribution of problems more efficiently. Based on this intuition, a recent work Bulitko 2016 has defined the task of finding a combination of heur"},"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.08256","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-05-21T18:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"9cb910b00efc2aaebf1ee28c924e27bb50565ad45322981fe129345acb48e7c8","abstract_canon_sha256":"a6ed73d3c82068aa916ab47125d5f5d124125dd9da5dca9e38050e33e74a001e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:27.121030Z","signature_b64":"1gVSVkOU1cH10Jlg5ZgTKtqaLj6q5fb1HycIOObu0FhrlGcH1kV5JYfLScXzo1pIcjVdDu/5SU9GEo4sHmLsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"243070a77a8967522cee194966124bd4f65429711ea08013fc4dc02f7d8d6b8c","last_reissued_at":"2026-05-18T00:15:27.120223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:27.120223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolving Real-Time Heuristics Search Algorithms with Building Blocks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Md Solimul Chowdhury, Victor Silva","submitted_at":"2018-05-21T18:52:00Z","abstract_excerpt":"The research area of real-time heuristics search has produced quite many algorithms. In the landscape of real-time heuristics search research, it is not rare to find that an algorithm X that appears to perform better than algorithm Y on a group of problems, performed worse than Y for another group of problems. If these published algorithms are combined to generate a more powerful space of algorithms, then that novel space of algorithms may solve a distribution of problems more efficiently. Based on this intuition, a recent work Bulitko 2016 has defined the task of finding a combination of heur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08256","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.08256","created_at":"2026-05-18T00:15:27.120375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08256v1","created_at":"2026-05-18T00:15:27.120375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08256","created_at":"2026-05-18T00:15:27.120375+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQYHBJ32RFTV","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQYHBJ32RFTVELHO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQYHBJ32","created_at":"2026-05-18T12:32:22.470017+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/EQYHBJ32RFTVELHODFEWMESL2T","json":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T.json","graph_json":"https://pith.science/api/pith-number/EQYHBJ32RFTVELHODFEWMESL2T/graph.json","events_json":"https://pith.science/api/pith-number/EQYHBJ32RFTVELHODFEWMESL2T/events.json","paper":"https://pith.science/paper/EQYHBJ32"},"agent_actions":{"view_html":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T","download_json":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T.json","view_paper":"https://pith.science/paper/EQYHBJ32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08256&json=true","fetch_graph":"https://pith.science/api/pith-number/EQYHBJ32RFTVELHODFEWMESL2T/graph.json","fetch_events":"https://pith.science/api/pith-number/EQYHBJ32RFTVELHODFEWMESL2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/action/storage_attestation","attest_author":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/action/author_attestation","sign_citation":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/action/citation_signature","submit_replication":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/action/replication_record"}},"created_at":"2026-05-18T00:15:27.120375+00:00","updated_at":"2026-05-18T00:15:27.120375+00:00"}