{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:R7XRTAIIQDE3DYOA2EK5RIB3CB","short_pith_number":"pith:R7XRTAII","schema_version":"1.0","canonical_sha256":"8fef19810880c9b1e1c0d115d8a03b104bec69035338fafd4c281d613fd641cd","source":{"kind":"arxiv","id":"2405.16137","version":1},"attestation_state":"computed","paper":{"title":"Comparison between Behavior Trees and Finite State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christian Smith, Jen Jen Chung, Julian F\\\"orster, Matteo Iovino, Pietro Falco, Roland Siegwart","submitted_at":"2024-05-25T09:14:10Z","abstract_excerpt":"Behavior Trees (BTs) were first conceived in the computer games industry as a tool to model agent behavior, but they received interest also in the robotics community as an alternative policy design to Finite State Machines (FSMs). The advantages of BTs over FSMs had been highlighted in many works, but there is no thorough practical comparison of the two designs. Such a comparison is particularly relevant in the robotic industry, where FSMs have been the state-of-the-art policy representation for robot control for many years. In this work we shed light on this matter by comparing how BTs and FS"},"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":"2405.16137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-05-25T09:14:10Z","cross_cats_sorted":[],"title_canon_sha256":"b61c5b1b36feb15a135b51fe36152c62530530e0d9e26c5bbb923eae19b739af","abstract_canon_sha256":"5f0b4691ef33f7f9cdf5dc7b6f391464bcf6e6546ba8bb7b873b8315e8553d8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:26.470889Z","signature_b64":"6D5JPunmL3c1gCqZb2/WlJ4OFuQQTgSUVtn0UPvwWXL2g4n1JLHFJLZTLe44p/GDbdi3Wjy0vr9xCkM4pgmBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fef19810880c9b1e1c0d115d8a03b104bec69035338fafd4c281d613fd641cd","last_reissued_at":"2026-07-05T08:23:26.469945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:26.469945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison between Behavior Trees and Finite State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christian Smith, Jen Jen Chung, Julian F\\\"orster, Matteo Iovino, Pietro Falco, Roland Siegwart","submitted_at":"2024-05-25T09:14:10Z","abstract_excerpt":"Behavior Trees (BTs) were first conceived in the computer games industry as a tool to model agent behavior, but they received interest also in the robotics community as an alternative policy design to Finite State Machines (FSMs). The advantages of BTs over FSMs had been highlighted in many works, but there is no thorough practical comparison of the two designs. Such a comparison is particularly relevant in the robotic industry, where FSMs have been the state-of-the-art policy representation for robot control for many years. In this work we shed light on this matter by comparing how BTs and FS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16137","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.16137/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.16137","created_at":"2026-07-05T08:23:26.470085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16137v1","created_at":"2026-07-05T08:23:26.470085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16137","created_at":"2026-07-05T08:23:26.470085+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7XRTAIIQDE3","created_at":"2026-07-05T08:23:26.470085+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7XRTAIIQDE3DYOA","created_at":"2026-07-05T08:23:26.470085+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7XRTAII","created_at":"2026-07-05T08:23:26.470085+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.16776","citing_title":"JoyAI-Sim: A Simulation-Enabled Interconversion Toolchain for the Embodied Data Pyramid","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2509.07674","citing_title":"Temporal Counterfactual Explanations of Behaviour Tree Decisions","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB","json":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB.json","graph_json":"https://pith.science/api/pith-number/R7XRTAIIQDE3DYOA2EK5RIB3CB/graph.json","events_json":"https://pith.science/api/pith-number/R7XRTAIIQDE3DYOA2EK5RIB3CB/events.json","paper":"https://pith.science/paper/R7XRTAII"},"agent_actions":{"view_html":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB","download_json":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB.json","view_paper":"https://pith.science/paper/R7XRTAII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16137&json=true","fetch_graph":"https://pith.science/api/pith-number/R7XRTAIIQDE3DYOA2EK5RIB3CB/graph.json","fetch_events":"https://pith.science/api/pith-number/R7XRTAIIQDE3DYOA2EK5RIB3CB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB/action/storage_attestation","attest_author":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB/action/author_attestation","sign_citation":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB/action/citation_signature","submit_replication":"https://pith.science/pith/R7XRTAIIQDE3DYOA2EK5RIB3CB/action/replication_record"}},"created_at":"2026-07-05T08:23:26.470085+00:00","updated_at":"2026-07-05T08:23:26.470085+00:00"}