{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WQEBUILKDVNOZMH66IA52R3O6L","short_pith_number":"pith:WQEBUILK","schema_version":"1.0","canonical_sha256":"b4081a216a1d5aecb0fef201dd476ef2c84b5a119464e0aa43365bb8b41afa18","source":{"kind":"arxiv","id":"2103.09036","version":1},"attestation_state":"computed","paper":{"title":"Combining Planning and Learning of Behavior Trees for Robotic Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Christian Smith, Jonathan Styrud, M{\\aa}rten Bj\\\"orkman, Matteo Iovino, Mikael Norrl\\\"of","submitted_at":"2021-03-16T13:11:39Z","abstract_excerpt":"Industrial robots can solve very complex tasks in controlled environments, but modern applications require robots able to operate in unpredictable surroundings as well. An increasingly popular reactive policy architecture in robotics is Behavior Trees but as with other architectures, programming time still drives cost and limits flexibility. There are two main branches of algorithms to generate policies automatically, automated planning and machine learning, both with their own drawbacks. We propose a method for generating Behavior Trees using a Genetic Programming algorithm and combining the "},"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":"2103.09036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-16T13:11:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2fca773db692b20fae4c5b95a6def11f499507cdd42eea31994924ea97bb328d","abstract_canon_sha256":"334b6b4643a310d4823a94396a656bd2e3f774f8883154d70151e925236b1a8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:23:34.470304Z","signature_b64":"QW193RDTEHpQhoUVdSf6klcKYq33I/PUV4fvCS20K2cFD6TyVEez0N+0oaJpkLTVDaBPYNDdyP0Zpp2XfiBUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4081a216a1d5aecb0fef201dd476ef2c84b5a119464e0aa43365bb8b41afa18","last_reissued_at":"2026-07-05T02:23:34.469952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:23:34.469952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Planning and Learning of Behavior Trees for Robotic Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Christian Smith, Jonathan Styrud, M{\\aa}rten Bj\\\"orkman, Matteo Iovino, Mikael Norrl\\\"of","submitted_at":"2021-03-16T13:11:39Z","abstract_excerpt":"Industrial robots can solve very complex tasks in controlled environments, but modern applications require robots able to operate in unpredictable surroundings as well. An increasingly popular reactive policy architecture in robotics is Behavior Trees but as with other architectures, programming time still drives cost and limits flexibility. There are two main branches of algorithms to generate policies automatically, automated planning and machine learning, both with their own drawbacks. We propose a method for generating Behavior Trees using a Genetic Programming algorithm and combining the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09036","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/2103.09036/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":"2103.09036","created_at":"2026-07-05T02:23:34.470011+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.09036v1","created_at":"2026-07-05T02:23:34.470011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09036","created_at":"2026-07-05T02:23:34.470011+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQEBUILKDVNO","created_at":"2026-07-05T02:23:34.470011+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQEBUILKDVNOZMH6","created_at":"2026-07-05T02:23:34.470011+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQEBUILK","created_at":"2026-07-05T02:23:34.470011+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/WQEBUILKDVNOZMH66IA52R3O6L","json":"https://pith.science/pith/WQEBUILKDVNOZMH66IA52R3O6L.json","graph_json":"https://pith.science/api/pith-number/WQEBUILKDVNOZMH66IA52R3O6L/graph.json","events_json":"https://pith.science/api/pith-number/WQEBUILKDVNOZMH66IA52R3O6L/events.json","paper":"https://pith.science/paper/WQEBUILK"},"agent_actions":{"view_html":"https://pith.science/pith/WQEBUILKDVNOZMH66IA52R3O6L","download_json":"https://pith.science/pith/WQEBUILKDVNOZMH66IA52R3O6L.json","view_paper":"https://pith.science/paper/WQEBUILK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.09036&json=true","fetch_graph":"https://pith.science/api/pith-number/WQEBUILKDVNOZMH66IA52R3O6L/graph.json","fetch_events":"https://pith.science/api/pith-number/WQEBUILKDVNOZMH66IA52R3O6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQEBUILKDVNOZMH66IA52R3O6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQEBUILKDVNOZMH66IA52R3O6L/action/storage_attestation","attest_author":"https://pith.science/pith/WQEBUILKDVNOZMH66IA52R3O6L/action/author_attestation","sign_citation":"https://pith.science/pith/WQEBUILKDVNOZMH66IA52R3O6L/action/citation_signature","submit_replication":"https://pith.science/pith/WQEBUILKDVNOZMH66IA52R3O6L/action/replication_record"}},"created_at":"2026-07-05T02:23:34.470011+00:00","updated_at":"2026-07-05T02:23:34.470011+00:00"}