{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EQYHBJ32RFTVELHODFEWMESL2T","short_pith_number":"pith:EQYHBJ32","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"},"canonical_sha256":"243070a77a8967522cee194966124bd4f65429711ea08013fc4dc02f7d8d6b8c","source":{"kind":"arxiv","id":"1805.08256","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08256","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08256v1","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08256","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"EQYHBJ32RFTV","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EQYHBJ32RFTVELHO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EQYHBJ32","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EQYHBJ32RFTVELHODFEWMESL2T","target":"record","payload":{"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"},"canonical_sha256":"243070a77a8967522cee194966124bd4f65429711ea08013fc4dc02f7d8d6b8c","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"},"source_kind":"arxiv","source_id":"1805.08256","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:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/kDHcrMPky+wKWVUVY198nvYeo+5PnmuAClWeGr2kD/RFkPq6VSBhgPTahpIkx4out3+tZbk/6LjuerTLlSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:12:12.789729Z"},"content_sha256":"1f10b941d9d8051acfbce184848e7aa8f22bdec913364f0738f812d78cd217fd","schema_version":"1.0","event_id":"sha256:1f10b941d9d8051acfbce184848e7aa8f22bdec913364f0738f812d78cd217fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EQYHBJ32RFTVELHODFEWMESL2T","target":"graph","payload":{"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"},"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:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXdSptnH0PgITydroCYz0OCbdjBH5NwC5W+Z7pkVdIfaz8cN+HEmQ2SDr18NOeyxnlTJOhTezQsipe8ArIwfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:12:12.790452Z"},"content_sha256":"dd5d573af719e3caf24bb94e6f7d38043dbaff366e4d27d5db7b7d76206d3f61","schema_version":"1.0","event_id":"sha256:dd5d573af719e3caf24bb94e6f7d38043dbaff366e4d27d5db7b7d76206d3f61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/bundle.json","state_url":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQYHBJ32RFTVELHODFEWMESL2T/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-31T02:12:12Z","links":{"resolver":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T","bundle":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/bundle.json","state":"https://pith.science/pith/EQYHBJ32RFTVELHODFEWMESL2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQYHBJ32RFTVELHODFEWMESL2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EQYHBJ32RFTVELHODFEWMESL2T","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":"a6ed73d3c82068aa916ab47125d5f5d124125dd9da5dca9e38050e33e74a001e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-05-21T18:52:00Z","title_canon_sha256":"9cb910b00efc2aaebf1ee28c924e27bb50565ad45322981fe129345acb48e7c8"},"schema_version":"1.0","source":{"id":"1805.08256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08256","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08256v1","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08256","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"EQYHBJ32RFTV","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EQYHBJ32RFTVELHO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EQYHBJ32","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:dd5d573af719e3caf24bb94e6f7d38043dbaff366e4d27d5db7b7d76206d3f61","target":"graph","created_at":"2026-05-18T00:15:27Z","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":"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","authors_text":"Md Solimul Chowdhury, Victor Silva","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-05-21T18:52:00Z","title":"Evolving Real-Time Heuristics Search Algorithms with Building Blocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08256","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:1f10b941d9d8051acfbce184848e7aa8f22bdec913364f0738f812d78cd217fd","target":"record","created_at":"2026-05-18T00:15:27Z","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":"a6ed73d3c82068aa916ab47125d5f5d124125dd9da5dca9e38050e33e74a001e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-05-21T18:52:00Z","title_canon_sha256":"9cb910b00efc2aaebf1ee28c924e27bb50565ad45322981fe129345acb48e7c8"},"schema_version":"1.0","source":{"id":"1805.08256","kind":"arxiv","version":1}},"canonical_sha256":"243070a77a8967522cee194966124bd4f65429711ea08013fc4dc02f7d8d6b8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"243070a77a8967522cee194966124bd4f65429711ea08013fc4dc02f7d8d6b8c","first_computed_at":"2026-05-18T00:15:27.120223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:27.120223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1gVSVkOU1cH10Jlg5ZgTKtqaLj6q5fb1HycIOObu0FhrlGcH1kV5JYfLScXzo1pIcjVdDu/5SU9GEo4sHmLsDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:27.121030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f10b941d9d8051acfbce184848e7aa8f22bdec913364f0738f812d78cd217fd","sha256:dd5d573af719e3caf24bb94e6f7d38043dbaff366e4d27d5db7b7d76206d3f61"],"state_sha256":"fc0a3bbe571e61f0dd3f33876656f6c9b647d7c4b8ee16e05530adbc75af3cb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVJx5eVCzL0HDu9NUQ/4ikXySgfey2FWZX+uquRSqjVQtLKNPEBhmqm9ALP1anHybKCdOVg3KPQSwbFEffACCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:12:12.794123Z","bundle_sha256":"824e739ebe130c0809bf75db2d7ee5c3b5700ea1e7280b367caf4b210472d70c"}}