{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:XDSAW7BIXYJ57LGQFKKTW3A4CB","short_pith_number":"pith:XDSAW7BI","canonical_record":{"source":{"id":"2302.12927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-24T22:53:10Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"b721aef519010e7d567add87c4e4dc9d6783cdee754b0dba609686f33dc28413","abstract_canon_sha256":"06df297a2700d612ed94368f514eae7af15b50b67f21e2e8e673352fad30f8d7"},"schema_version":"1.0"},"canonical_sha256":"b8e40b7c28be13dfacd02a953b6c1c1052c8c690d7d318115348010004f6acb8","source":{"kind":"arxiv","id":"2302.12927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.12927","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"2302.12927v1","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12927","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"XDSAW7BIXYJ5","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"pith_short_16","alias_value":"XDSAW7BIXYJ57LGQ","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"pith_short_8","alias_value":"XDSAW7BI","created_at":"2026-07-05T05:45:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:XDSAW7BIXYJ57LGQFKKTW3A4CB","target":"record","payload":{"canonical_record":{"source":{"id":"2302.12927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-24T22:53:10Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"b721aef519010e7d567add87c4e4dc9d6783cdee754b0dba609686f33dc28413","abstract_canon_sha256":"06df297a2700d612ed94368f514eae7af15b50b67f21e2e8e673352fad30f8d7"},"schema_version":"1.0"},"canonical_sha256":"b8e40b7c28be13dfacd02a953b6c1c1052c8c690d7d318115348010004f6acb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:40.895909Z","signature_b64":"qw3JY/gDSFvN2/U2ZmTW0ynO9bZ4+rdm0LUh0qcHCPU8b04gjih3TdtxkGRt/LBYfjQV+DvIDMF/Kzi9i4ZSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8e40b7c28be13dfacd02a953b6c1c1052c8c690d7d318115348010004f6acb8","last_reissued_at":"2026-07-05T05:45:40.895451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:40.895451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.12927","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LI7n/3byrt/CNXGnQVHYCz75+5WBrwflR47DZIUAmJufQTFgFonWcm8bafzO7jWJTd8muk+y6wS8IQKUb9k2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:54:42.295944Z"},"content_sha256":"0c2fc832b6f7a9fd479bc151cfa7f0b7993ba359f5556ec075f203f1cdac43e9","schema_version":"1.0","event_id":"sha256:0c2fc832b6f7a9fd479bc151cfa7f0b7993ba359f5556ec075f203f1cdac43e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:XDSAW7BIXYJ57LGQFKKTW3A4CB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robot Behavior-Tree-Based Task Generation with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.RO","authors_text":"C.S. George Lee, Yue Cao","submitted_at":"2023-02-24T22:53:10Z","abstract_excerpt":"Nowadays, the behavior tree is gaining popularity as a representation for robot tasks due to its modularity and reusability. Designing behavior-tree tasks manually is time-consuming for robot end-users, thus there is a need for investigating automatic behavior-tree-based task generation. Prior behavior-tree-based task generation approaches focus on fixed primitive tasks and lack generalizability to new task domains. To cope with this issue, we propose a novel behavior-tree-based task generation approach that utilizes state-of-the-art large language models. We propose a Phase-Step prompt design"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12927","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/2302.12927/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFIFPKbkqKCbkH/QSTCmjT6F4LP/PcfLgzwaIcs6OotT1dAMPNZ8QF0LjVSkDUiVRQmasBdsRuIOFU/fHZltAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:54:42.296472Z"},"content_sha256":"ca38f5ce85ad7220908594eb696ad5c3fe8bd0d3a981cdb2e2e0aca4ad400792","schema_version":"1.0","event_id":"sha256:ca38f5ce85ad7220908594eb696ad5c3fe8bd0d3a981cdb2e2e0aca4ad400792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDSAW7BIXYJ57LGQFKKTW3A4CB/bundle.json","state_url":"https://pith.science/pith/XDSAW7BIXYJ57LGQFKKTW3A4CB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDSAW7BIXYJ57LGQFKKTW3A4CB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T03:54:42Z","links":{"resolver":"https://pith.science/pith/XDSAW7BIXYJ57LGQFKKTW3A4CB","bundle":"https://pith.science/pith/XDSAW7BIXYJ57LGQFKKTW3A4CB/bundle.json","state":"https://pith.science/pith/XDSAW7BIXYJ57LGQFKKTW3A4CB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDSAW7BIXYJ57LGQFKKTW3A4CB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XDSAW7BIXYJ57LGQFKKTW3A4CB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"06df297a2700d612ed94368f514eae7af15b50b67f21e2e8e673352fad30f8d7","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-24T22:53:10Z","title_canon_sha256":"b721aef519010e7d567add87c4e4dc9d6783cdee754b0dba609686f33dc28413"},"schema_version":"1.0","source":{"id":"2302.12927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.12927","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"2302.12927v1","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12927","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"XDSAW7BIXYJ5","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"pith_short_16","alias_value":"XDSAW7BIXYJ57LGQ","created_at":"2026-07-05T05:45:40Z"},{"alias_kind":"pith_short_8","alias_value":"XDSAW7BI","created_at":"2026-07-05T05:45:40Z"}],"graph_snapshots":[{"event_id":"sha256:ca38f5ce85ad7220908594eb696ad5c3fe8bd0d3a981cdb2e2e0aca4ad400792","target":"graph","created_at":"2026-07-05T05:45:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2302.12927/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nowadays, the behavior tree is gaining popularity as a representation for robot tasks due to its modularity and reusability. Designing behavior-tree tasks manually is time-consuming for robot end-users, thus there is a need for investigating automatic behavior-tree-based task generation. Prior behavior-tree-based task generation approaches focus on fixed primitive tasks and lack generalizability to new task domains. To cope with this issue, we propose a novel behavior-tree-based task generation approach that utilizes state-of-the-art large language models. We propose a Phase-Step prompt design","authors_text":"C.S. George Lee, Yue Cao","cross_cats":["cs.AI","cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-24T22:53:10Z","title":"Robot Behavior-Tree-Based Task Generation with Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12927","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0c2fc832b6f7a9fd479bc151cfa7f0b7993ba359f5556ec075f203f1cdac43e9","target":"record","created_at":"2026-07-05T05:45:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"06df297a2700d612ed94368f514eae7af15b50b67f21e2e8e673352fad30f8d7","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-24T22:53:10Z","title_canon_sha256":"b721aef519010e7d567add87c4e4dc9d6783cdee754b0dba609686f33dc28413"},"schema_version":"1.0","source":{"id":"2302.12927","kind":"arxiv","version":1}},"canonical_sha256":"b8e40b7c28be13dfacd02a953b6c1c1052c8c690d7d318115348010004f6acb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8e40b7c28be13dfacd02a953b6c1c1052c8c690d7d318115348010004f6acb8","first_computed_at":"2026-07-05T05:45:40.895451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:40.895451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qw3JY/gDSFvN2/U2ZmTW0ynO9bZ4+rdm0LUh0qcHCPU8b04gjih3TdtxkGRt/LBYfjQV+DvIDMF/Kzi9i4ZSCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:40.895909Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.12927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c2fc832b6f7a9fd479bc151cfa7f0b7993ba359f5556ec075f203f1cdac43e9","sha256:ca38f5ce85ad7220908594eb696ad5c3fe8bd0d3a981cdb2e2e0aca4ad400792"],"state_sha256":"100938da10f6d2ab704fcc168eb4aa1045bdf7a8f8332b3c3a2c3a417398a8b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y1Ov4wO70GUD2WxyV012zWdUoKiMBnHhcI3ka95rA49DDi2Xz5+fzOA+TrU/KmgNlnmZeHexbRAU1lZxpqmuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:54:42.302252Z","bundle_sha256":"67624f3fceada342def46bbf56fba6de009fff0eabbcc870e96a28baf1838a83"}}