{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DNBTJ2X5ZKOOQ6GZTUP5MXBIB3","short_pith_number":"pith:DNBTJ2X5","canonical_record":{"source":{"id":"2307.06399","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-12T18:29:37Z","cross_cats_sorted":[],"title_canon_sha256":"ccf23f94a9792c22d1b9b1bdf7d9e6c1acabfa24f2d769dae9a541a75b7c0154","abstract_canon_sha256":"5bdfa37bd69d1902e9867b63323c6a1dde8257890de53334986eb69e1dc05674"},"schema_version":"1.0"},"canonical_sha256":"1b4334eafdca9ce878d99d1fd65c280ec966ac6ec5dbb0d75e24ab6a3aa47c63","source":{"kind":"arxiv","id":"2307.06399","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.06399","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"arxiv_version","alias_value":"2307.06399v2","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.06399","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"pith_short_12","alias_value":"DNBTJ2X5ZKOO","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"pith_short_16","alias_value":"DNBTJ2X5ZKOOQ6GZ","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"pith_short_8","alias_value":"DNBTJ2X5","created_at":"2026-07-05T07:25:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DNBTJ2X5ZKOOQ6GZTUP5MXBIB3","target":"record","payload":{"canonical_record":{"source":{"id":"2307.06399","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-12T18:29:37Z","cross_cats_sorted":[],"title_canon_sha256":"ccf23f94a9792c22d1b9b1bdf7d9e6c1acabfa24f2d769dae9a541a75b7c0154","abstract_canon_sha256":"5bdfa37bd69d1902e9867b63323c6a1dde8257890de53334986eb69e1dc05674"},"schema_version":"1.0"},"canonical_sha256":"1b4334eafdca9ce878d99d1fd65c280ec966ac6ec5dbb0d75e24ab6a3aa47c63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:25:43.179057Z","signature_b64":"aDYqBpt95CpjKsz/jlYbcM14ND/Eygu6V4UuO2IPkCMg4rx50oGyhLVQrLEXLV9mcdygQp4bWwKrftTQhLxLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b4334eafdca9ce878d99d1fd65c280ec966ac6ec5dbb0d75e24ab6a3aa47c63","last_reissued_at":"2026-07-05T07:25:43.178530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:25:43.178530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.06399","source_version":2,"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-05T07:25:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRME1ciTBibY4wfyppnl8WwBBHQaB0H24U8oQxnAE3R40/TjmrezztRoasNBvfxxDm/rcGQ94AfQhwlfgtFrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:50:48.461316Z"},"content_sha256":"fff57b454663408da55b96782a5013788e65eab93879c29b202faab84e9cd2df","schema_version":"1.0","event_id":"sha256:fff57b454663408da55b96782a5013788e65eab93879c29b202faab84e9cd2df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DNBTJ2X5ZKOOQ6GZTUP5MXBIB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Designing Behavior Trees from Goal-Oriented LTLf Formulas","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aadesh Neupane, Eric G Mercer, Michael A. Goodrich","submitted_at":"2023-07-12T18:29:37Z","abstract_excerpt":"Temporal logic can be used to formally specify autonomous agent goals, but synthesizing planners that guarantee goal satisfaction can be computationally prohibitive. This paper shows how to turn goals specified using a subset of finite trace Linear Temporal Logic (LTL) into a behavior tree (BT) that guarantees that successful traces satisfy the LTL goal. Useful LTL formulas for achievement goals can be derived using achievement-oriented task mission grammars, leading to missions made up of tasks combined using LTL operators. Constructing BTs from LTL formulas leads to a relaxed behavior synthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.06399","kind":"arxiv","version":2},"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/2307.06399/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-05T07:25:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MhsX0z8/uZ2ANlxaV8jhokblAbwjHN0Wg47LlmUofjB/qnhEZkzD1C4yeP5SziGERPZqdhFSWybnlS9j354mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:50:48.461869Z"},"content_sha256":"613f4f85df156baae96df290e364ae85fcfa10643e9d8f15113bd6e9cfa12f50","schema_version":"1.0","event_id":"sha256:613f4f85df156baae96df290e364ae85fcfa10643e9d8f15113bd6e9cfa12f50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNBTJ2X5ZKOOQ6GZTUP5MXBIB3/bundle.json","state_url":"https://pith.science/pith/DNBTJ2X5ZKOOQ6GZTUP5MXBIB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNBTJ2X5ZKOOQ6GZTUP5MXBIB3/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-09T12:50:48Z","links":{"resolver":"https://pith.science/pith/DNBTJ2X5ZKOOQ6GZTUP5MXBIB3","bundle":"https://pith.science/pith/DNBTJ2X5ZKOOQ6GZTUP5MXBIB3/bundle.json","state":"https://pith.science/pith/DNBTJ2X5ZKOOQ6GZTUP5MXBIB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNBTJ2X5ZKOOQ6GZTUP5MXBIB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DNBTJ2X5ZKOOQ6GZTUP5MXBIB3","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":"5bdfa37bd69d1902e9867b63323c6a1dde8257890de53334986eb69e1dc05674","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-12T18:29:37Z","title_canon_sha256":"ccf23f94a9792c22d1b9b1bdf7d9e6c1acabfa24f2d769dae9a541a75b7c0154"},"schema_version":"1.0","source":{"id":"2307.06399","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.06399","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"arxiv_version","alias_value":"2307.06399v2","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.06399","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"pith_short_12","alias_value":"DNBTJ2X5ZKOO","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"pith_short_16","alias_value":"DNBTJ2X5ZKOOQ6GZ","created_at":"2026-07-05T07:25:43Z"},{"alias_kind":"pith_short_8","alias_value":"DNBTJ2X5","created_at":"2026-07-05T07:25:43Z"}],"graph_snapshots":[{"event_id":"sha256:613f4f85df156baae96df290e364ae85fcfa10643e9d8f15113bd6e9cfa12f50","target":"graph","created_at":"2026-07-05T07:25:43Z","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/2307.06399/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Temporal logic can be used to formally specify autonomous agent goals, but synthesizing planners that guarantee goal satisfaction can be computationally prohibitive. This paper shows how to turn goals specified using a subset of finite trace Linear Temporal Logic (LTL) into a behavior tree (BT) that guarantees that successful traces satisfy the LTL goal. Useful LTL formulas for achievement goals can be derived using achievement-oriented task mission grammars, leading to missions made up of tasks combined using LTL operators. Constructing BTs from LTL formulas leads to a relaxed behavior synthe","authors_text":"Aadesh Neupane, Eric G Mercer, Michael A. Goodrich","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-12T18:29:37Z","title":"Designing Behavior Trees from Goal-Oriented LTLf Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.06399","kind":"arxiv","version":2},"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:fff57b454663408da55b96782a5013788e65eab93879c29b202faab84e9cd2df","target":"record","created_at":"2026-07-05T07:25:43Z","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":"5bdfa37bd69d1902e9867b63323c6a1dde8257890de53334986eb69e1dc05674","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-12T18:29:37Z","title_canon_sha256":"ccf23f94a9792c22d1b9b1bdf7d9e6c1acabfa24f2d769dae9a541a75b7c0154"},"schema_version":"1.0","source":{"id":"2307.06399","kind":"arxiv","version":2}},"canonical_sha256":"1b4334eafdca9ce878d99d1fd65c280ec966ac6ec5dbb0d75e24ab6a3aa47c63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b4334eafdca9ce878d99d1fd65c280ec966ac6ec5dbb0d75e24ab6a3aa47c63","first_computed_at":"2026-07-05T07:25:43.178530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:25:43.178530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aDYqBpt95CpjKsz/jlYbcM14ND/Eygu6V4UuO2IPkCMg4rx50oGyhLVQrLEXLV9mcdygQp4bWwKrftTQhLxLCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:25:43.179057Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.06399","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fff57b454663408da55b96782a5013788e65eab93879c29b202faab84e9cd2df","sha256:613f4f85df156baae96df290e364ae85fcfa10643e9d8f15113bd6e9cfa12f50"],"state_sha256":"66d5f60bf552ccff26391f3aef2628309648d3607dcdd0e275c0e3f7091a7310"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfc9BDU3/1eGlO8sSmh0mLID+TF+2azkWOOOAcjNCRlU1VUjyL3K1kcsIBlEQ6MggyZj9JosgTTUcfXsYvQtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T12:50:48.465900Z","bundle_sha256":"3c0634ac356432174062dc0ba7f9abc09b82597b87b3cf17f7d06634269086c0"}}