{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IR6KEFTKRPATVDXVKWXNOIRWNL","short_pith_number":"pith:IR6KEFTK","schema_version":"1.0","canonical_sha256":"447ca2166a8bc13a8ef555aed722366ac1552e298b53eae99c4018bd2a91320e","source":{"kind":"arxiv","id":"2301.06434","version":1},"attestation_state":"computed","paper":{"title":"Behavior Trees for Robust Task Level Control in Robotic Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christian Smith, Matteo Iovino","submitted_at":"2023-01-16T13:52:25Z","abstract_excerpt":"Behavior Trees are a task switching policy representation that can grant reactiveness and fault tolerance. Moreover, because of their structure and modularity, a variety of methods can be used to generate them automatically. In this short paper we introduce Behavior Trees in the context of robotic applications, with overview of autonomous synthesis methods."},"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":"2301.06434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-01-16T13:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"0c360802f38148982a547ee9f73c724d2b9ba70ed944600e5052abc54c31dc25","abstract_canon_sha256":"7e6da95bf07d9be4c2d79b33cc6937ec2fc342af1ef1d4942b84fa4af391e3e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:31.565245Z","signature_b64":"xmS851qtQxlCFeQXI2xTyaZoKBCz69YVBY9cNEJfi2OK3zYxB7bJgUK5Yhr8LJGjt428DwCnVlojFVrJuEBhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"447ca2166a8bc13a8ef555aed722366ac1552e298b53eae99c4018bd2a91320e","last_reissued_at":"2026-07-05T05:33:31.564804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:31.564804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Behavior Trees for Robust Task Level Control in Robotic Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christian Smith, Matteo Iovino","submitted_at":"2023-01-16T13:52:25Z","abstract_excerpt":"Behavior Trees are a task switching policy representation that can grant reactiveness and fault tolerance. Moreover, because of their structure and modularity, a variety of methods can be used to generate them automatically. In this short paper we introduce Behavior Trees in the context of robotic applications, with overview of autonomous synthesis methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.06434","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/2301.06434/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":"2301.06434","created_at":"2026-07-05T05:33:31.564873+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.06434v1","created_at":"2026-07-05T05:33:31.564873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.06434","created_at":"2026-07-05T05:33:31.564873+00:00"},{"alias_kind":"pith_short_12","alias_value":"IR6KEFTKRPAT","created_at":"2026-07-05T05:33:31.564873+00:00"},{"alias_kind":"pith_short_16","alias_value":"IR6KEFTKRPATVDXV","created_at":"2026-07-05T05:33:31.564873+00:00"},{"alias_kind":"pith_short_8","alias_value":"IR6KEFTK","created_at":"2026-07-05T05:33:31.564873+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/IR6KEFTKRPATVDXVKWXNOIRWNL","json":"https://pith.science/pith/IR6KEFTKRPATVDXVKWXNOIRWNL.json","graph_json":"https://pith.science/api/pith-number/IR6KEFTKRPATVDXVKWXNOIRWNL/graph.json","events_json":"https://pith.science/api/pith-number/IR6KEFTKRPATVDXVKWXNOIRWNL/events.json","paper":"https://pith.science/paper/IR6KEFTK"},"agent_actions":{"view_html":"https://pith.science/pith/IR6KEFTKRPATVDXVKWXNOIRWNL","download_json":"https://pith.science/pith/IR6KEFTKRPATVDXVKWXNOIRWNL.json","view_paper":"https://pith.science/paper/IR6KEFTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.06434&json=true","fetch_graph":"https://pith.science/api/pith-number/IR6KEFTKRPATVDXVKWXNOIRWNL/graph.json","fetch_events":"https://pith.science/api/pith-number/IR6KEFTKRPATVDXVKWXNOIRWNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IR6KEFTKRPATVDXVKWXNOIRWNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IR6KEFTKRPATVDXVKWXNOIRWNL/action/storage_attestation","attest_author":"https://pith.science/pith/IR6KEFTKRPATVDXVKWXNOIRWNL/action/author_attestation","sign_citation":"https://pith.science/pith/IR6KEFTKRPATVDXVKWXNOIRWNL/action/citation_signature","submit_replication":"https://pith.science/pith/IR6KEFTKRPATVDXVKWXNOIRWNL/action/replication_record"}},"created_at":"2026-07-05T05:33:31.564873+00:00","updated_at":"2026-07-05T05:33:31.564873+00:00"}