{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EHP7GW4QV2T6ERGJFTLEQPLWTZ","short_pith_number":"pith:EHP7GW4Q","schema_version":"1.0","canonical_sha256":"21dff35b90aea7e244c92cd6483d769e7febd6f49a85b428a72fa37e237b1266","source":{"kind":"arxiv","id":"1110.2216","version":1},"attestation_state":"computed","paper":{"title":"The Generalized A* Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"D. McAllester, P. F. Felzenszwalb","submitted_at":"2011-10-10T22:14:15Z","abstract_excerpt":"We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules.  A large variety of inference problems in AI can be formulated in this framework.  We generalize A* search and heuristics derived from abstractions to a broad class of lightest derivation problems.  We also describe a new algorithm that searches for lightest derivations using a hierarchy of abstractions.  Our generalization of A* gives a new algorithm for searching AND/OR graphs in a bottom-up fashion. \nWe discuss how the algorithms described here provide a general architecture for a"},"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":"1110.2216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-10T22:14:15Z","cross_cats_sorted":[],"title_canon_sha256":"6fe9d1bf2d6c1083fb366c50921d35f57846e794a25e0f1d7ab0b42dd049c67b","abstract_canon_sha256":"6acb9914f51fa8be89fcb26962da822ef4fc5df5ff2b3c6be0075f4591c7cfb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:17.328884Z","signature_b64":"vv+t9n2Hz8sp0dIgDmHSp6uM/RrO21w1KA/vO3Wlm0nC4HMNc5uNeQelQuDouxp3Z/w/dADaA6bakVlJIhnDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21dff35b90aea7e244c92cd6483d769e7febd6f49a85b428a72fa37e237b1266","last_reissued_at":"2026-05-18T04:11:17.328352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:17.328352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Generalized A* Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"D. McAllester, P. F. Felzenszwalb","submitted_at":"2011-10-10T22:14:15Z","abstract_excerpt":"We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules.  A large variety of inference problems in AI can be formulated in this framework.  We generalize A* search and heuristics derived from abstractions to a broad class of lightest derivation problems.  We also describe a new algorithm that searches for lightest derivations using a hierarchy of abstractions.  Our generalization of A* gives a new algorithm for searching AND/OR graphs in a bottom-up fashion. \nWe discuss how the algorithms described here provide a general architecture for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2216","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":"1110.2216","created_at":"2026-05-18T04:11:17.328431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2216v1","created_at":"2026-05-18T04:11:17.328431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2216","created_at":"2026-05-18T04:11:17.328431+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHP7GW4QV2T6","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHP7GW4QV2T6ERGJ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHP7GW4Q","created_at":"2026-05-18T12:26:28.662955+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/EHP7GW4QV2T6ERGJFTLEQPLWTZ","json":"https://pith.science/pith/EHP7GW4QV2T6ERGJFTLEQPLWTZ.json","graph_json":"https://pith.science/api/pith-number/EHP7GW4QV2T6ERGJFTLEQPLWTZ/graph.json","events_json":"https://pith.science/api/pith-number/EHP7GW4QV2T6ERGJFTLEQPLWTZ/events.json","paper":"https://pith.science/paper/EHP7GW4Q"},"agent_actions":{"view_html":"https://pith.science/pith/EHP7GW4QV2T6ERGJFTLEQPLWTZ","download_json":"https://pith.science/pith/EHP7GW4QV2T6ERGJFTLEQPLWTZ.json","view_paper":"https://pith.science/paper/EHP7GW4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2216&json=true","fetch_graph":"https://pith.science/api/pith-number/EHP7GW4QV2T6ERGJFTLEQPLWTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/EHP7GW4QV2T6ERGJFTLEQPLWTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHP7GW4QV2T6ERGJFTLEQPLWTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHP7GW4QV2T6ERGJFTLEQPLWTZ/action/storage_attestation","attest_author":"https://pith.science/pith/EHP7GW4QV2T6ERGJFTLEQPLWTZ/action/author_attestation","sign_citation":"https://pith.science/pith/EHP7GW4QV2T6ERGJFTLEQPLWTZ/action/citation_signature","submit_replication":"https://pith.science/pith/EHP7GW4QV2T6ERGJFTLEQPLWTZ/action/replication_record"}},"created_at":"2026-05-18T04:11:17.328431+00:00","updated_at":"2026-05-18T04:11:17.328431+00:00"}