{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B3GSQSK2YYDUL5E6ZTH5QGLSS4","short_pith_number":"pith:B3GSQSK2","schema_version":"1.0","canonical_sha256":"0ecd28495ac60745f49ecccfd8197297188acf5da2f1609a8e5f66e05baaa1d0","source":{"kind":"arxiv","id":"1401.3857","version":1},"attestation_state":"computed","paper":{"title":"Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ramon Lawrence, Vadim Bulitko, Yngvi Bj\\\"ornsson","submitted_at":"2014-01-16T05:02:02Z","abstract_excerpt":"Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action, independent of problem size. As a result, they scale up well as problems become larger. This property would make them well suited for video games where Artificial Intelligence controlled agents must react quickly to user commands and to other agents actions. On the downside, real-time search algorithms employ learning methods that frequently lead to poor solution quality and cause the agent to appear irrational by re-visiting the same problem states repeatedly. The situation changed recently wi"},"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":"1401.3857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"2a2613c99992f0d746c4ca0c3c9f9c8ce8396f3a1205b93a19e35df9a0c46d36","abstract_canon_sha256":"22bab9e4b7703d2c3aa3f7ac881ba7551dc562362c744eef913c5ea0e7416d64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.536992Z","signature_b64":"a/WHbhoO+iJgRWO7n87BuTMsOnwOo0WwMCBzMwCsdKOz7vCpzIPQi4Umla8jrAP8m/qEouHhg9LRok6CyGMyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ecd28495ac60745f49ecccfd8197297188acf5da2f1609a8e5f66e05baaa1d0","last_reissued_at":"2026-05-18T03:02:06.536114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.536114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ramon Lawrence, Vadim Bulitko, Yngvi Bj\\\"ornsson","submitted_at":"2014-01-16T05:02:02Z","abstract_excerpt":"Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action, independent of problem size. As a result, they scale up well as problems become larger. This property would make them well suited for video games where Artificial Intelligence controlled agents must react quickly to user commands and to other agents actions. On the downside, real-time search algorithms employ learning methods that frequently lead to poor solution quality and cause the agent to appear irrational by re-visiting the same problem states repeatedly. The situation changed recently wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3857","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":"1401.3857","created_at":"2026-05-18T03:02:06.536258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3857v1","created_at":"2026-05-18T03:02:06.536258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3857","created_at":"2026-05-18T03:02:06.536258+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3GSQSK2YYDU","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3GSQSK2YYDUL5E6","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3GSQSK2","created_at":"2026-05-18T12:28:19.803747+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/B3GSQSK2YYDUL5E6ZTH5QGLSS4","json":"https://pith.science/pith/B3GSQSK2YYDUL5E6ZTH5QGLSS4.json","graph_json":"https://pith.science/api/pith-number/B3GSQSK2YYDUL5E6ZTH5QGLSS4/graph.json","events_json":"https://pith.science/api/pith-number/B3GSQSK2YYDUL5E6ZTH5QGLSS4/events.json","paper":"https://pith.science/paper/B3GSQSK2"},"agent_actions":{"view_html":"https://pith.science/pith/B3GSQSK2YYDUL5E6ZTH5QGLSS4","download_json":"https://pith.science/pith/B3GSQSK2YYDUL5E6ZTH5QGLSS4.json","view_paper":"https://pith.science/paper/B3GSQSK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3857&json=true","fetch_graph":"https://pith.science/api/pith-number/B3GSQSK2YYDUL5E6ZTH5QGLSS4/graph.json","fetch_events":"https://pith.science/api/pith-number/B3GSQSK2YYDUL5E6ZTH5QGLSS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3GSQSK2YYDUL5E6ZTH5QGLSS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3GSQSK2YYDUL5E6ZTH5QGLSS4/action/storage_attestation","attest_author":"https://pith.science/pith/B3GSQSK2YYDUL5E6ZTH5QGLSS4/action/author_attestation","sign_citation":"https://pith.science/pith/B3GSQSK2YYDUL5E6ZTH5QGLSS4/action/citation_signature","submit_replication":"https://pith.science/pith/B3GSQSK2YYDUL5E6ZTH5QGLSS4/action/replication_record"}},"created_at":"2026-05-18T03:02:06.536258+00:00","updated_at":"2026-05-18T03:02:06.536258+00:00"}