{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OPB265NXYYU62QNXZDOPZGEK7K","short_pith_number":"pith:OPB265NX","canonical_record":{"source":{"id":"1109.6618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-29T18:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"3f994211808708c9dcb3026b97ecf1d577b1a105a9e82aac8005741cfae2f7d4","abstract_canon_sha256":"39fe3edda9372c12c290027cc6ccda4baa601698b52d24509d7abdf6029859f5"},"schema_version":"1.0"},"canonical_sha256":"73c3af75b7c629ed41b7c8dcfc988afa8cc316772888deb8a16b0cfc03d6b7c8","source":{"kind":"arxiv","id":"1109.6618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6618","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6618v1","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6618","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"OPB265NXYYU6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OPB265NXYYU62QNX","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OPB265NX","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OPB265NXYYU62QNXZDOPZGEK7K","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-29T18:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"3f994211808708c9dcb3026b97ecf1d577b1a105a9e82aac8005741cfae2f7d4","abstract_canon_sha256":"39fe3edda9372c12c290027cc6ccda4baa601698b52d24509d7abdf6029859f5"},"schema_version":"1.0"},"canonical_sha256":"73c3af75b7c629ed41b7c8dcfc988afa8cc316772888deb8a16b0cfc03d6b7c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.086797Z","signature_b64":"RXXb1zvI1zKActntZKHRbmc1ohde9xIgFkCNJA1RgMNHzDlF057ki2qDF8aMI1KOkeG0PPQ7nMkUfgX9M3HbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73c3af75b7c629ed41b7c8dcfc988afa8cc316772888deb8a16b0cfc03d6b7c8","last_reissued_at":"2026-05-18T02:21:36.086258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.086258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6618","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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FD+VcPFQwcysF7E2TSdopGI7q7iZvwiBJ7t+lY1c7c84zE3KEKz+4/6IZ3ScWkSQOJZTEVtPd9EMAtkMSGlECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:41:26.761251Z"},"content_sha256":"96778b6aebab55fdd32801d54805fc51fc95a105223f69a46e2cea5e01ea3eeb","schema_version":"1.0","event_id":"sha256:96778b6aebab55fdd32801d54805fc51fc95a105223f69a46e2cea5e01ea3eeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OPB265NXYYU62QNXZDOPZGEK7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-Goal Heuristic Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"D. Davidov, S. Markovitch","submitted_at":"2011-09-29T18:50:13Z","abstract_excerpt":"This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of traditional distance-estimation heuristics for tasks of this type and present alternative heuristics that are more appropriate for multiple-goal search.  In particular, we introduce the marginal-utility heuristic, which estimates the cost and the benefit of exploring a subtree below a search node. We developed two methods for online learning of the marginal-utility heuristic. One is based on local similarity of the par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6618","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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBhI3G4dV6S4SO3NAqk5/CrZyXiCRBVS1wXVp74Y1BArAbsHzewGwugkjls1GKGrjzFoafF0r1h/FdRafAmZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:41:26.761662Z"},"content_sha256":"3c192430874888277f35d88acd313af4b7d92cc8c20f8958c9708005acd8242f","schema_version":"1.0","event_id":"sha256:3c192430874888277f35d88acd313af4b7d92cc8c20f8958c9708005acd8242f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPB265NXYYU62QNXZDOPZGEK7K/bundle.json","state_url":"https://pith.science/pith/OPB265NXYYU62QNXZDOPZGEK7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPB265NXYYU62QNXZDOPZGEK7K/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-24T17:41:26Z","links":{"resolver":"https://pith.science/pith/OPB265NXYYU62QNXZDOPZGEK7K","bundle":"https://pith.science/pith/OPB265NXYYU62QNXZDOPZGEK7K/bundle.json","state":"https://pith.science/pith/OPB265NXYYU62QNXZDOPZGEK7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPB265NXYYU62QNXZDOPZGEK7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OPB265NXYYU62QNXZDOPZGEK7K","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":"39fe3edda9372c12c290027cc6ccda4baa601698b52d24509d7abdf6029859f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-29T18:50:13Z","title_canon_sha256":"3f994211808708c9dcb3026b97ecf1d577b1a105a9e82aac8005741cfae2f7d4"},"schema_version":"1.0","source":{"id":"1109.6618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6618","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6618v1","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6618","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"OPB265NXYYU6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OPB265NXYYU62QNX","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OPB265NX","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:3c192430874888277f35d88acd313af4b7d92cc8c20f8958c9708005acd8242f","target":"graph","created_at":"2026-05-18T02:21:36Z","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":"This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of traditional distance-estimation heuristics for tasks of this type and present alternative heuristics that are more appropriate for multiple-goal search.  In particular, we introduce the marginal-utility heuristic, which estimates the cost and the benefit of exploring a subtree below a search node. We developed two methods for online learning of the marginal-utility heuristic. One is based on local similarity of the par","authors_text":"D. Davidov, S. Markovitch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-29T18:50:13Z","title":"Multiple-Goal Heuristic Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6618","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:96778b6aebab55fdd32801d54805fc51fc95a105223f69a46e2cea5e01ea3eeb","target":"record","created_at":"2026-05-18T02:21:36Z","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":"39fe3edda9372c12c290027cc6ccda4baa601698b52d24509d7abdf6029859f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-29T18:50:13Z","title_canon_sha256":"3f994211808708c9dcb3026b97ecf1d577b1a105a9e82aac8005741cfae2f7d4"},"schema_version":"1.0","source":{"id":"1109.6618","kind":"arxiv","version":1}},"canonical_sha256":"73c3af75b7c629ed41b7c8dcfc988afa8cc316772888deb8a16b0cfc03d6b7c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73c3af75b7c629ed41b7c8dcfc988afa8cc316772888deb8a16b0cfc03d6b7c8","first_computed_at":"2026-05-18T02:21:36.086258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.086258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RXXb1zvI1zKActntZKHRbmc1ohde9xIgFkCNJA1RgMNHzDlF057ki2qDF8aMI1KOkeG0PPQ7nMkUfgX9M3HbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.086797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96778b6aebab55fdd32801d54805fc51fc95a105223f69a46e2cea5e01ea3eeb","sha256:3c192430874888277f35d88acd313af4b7d92cc8c20f8958c9708005acd8242f"],"state_sha256":"5754a77d95c4882bcca3132038bd4f128b3dd37db741d6e69c7770ee9d716d64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gXld0ddbMZopnmWe1BlEzDK380glN2sCt6bd7JpBfg2qQdcXvyOo4weazRLyuBWnzQjYv6syePyTqHzvue9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:41:26.763614Z","bundle_sha256":"f78a5ab3a9dc639438dc96683d7036692bc0c029802c113db4256f87d62453a3"}}