{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BO6JF7VLCSJY2AI265Z4RW5FUR","short_pith_number":"pith:BO6JF7VL","canonical_record":{"source":{"id":"2306.05171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-06-08T13:10:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"82c2f96a03081080cafddc2a0344e082429ca12d125c4ee5625d64a5c3380ce7","abstract_canon_sha256":"1d7d673d6522d8871f0d95b864407040af633a4dfc31a3878f9d75a2baf14c1e"},"schema_version":"1.0"},"canonical_sha256":"0bbc92feab14938d011af773c8dba5a44a9dd05f7e97f75b9b86aa5153da3e44","source":{"kind":"arxiv","id":"2306.05171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.05171","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"2306.05171v1","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05171","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"BO6JF7VLCSJY","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"pith_short_16","alias_value":"BO6JF7VLCSJY2AI2","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"pith_short_8","alias_value":"BO6JF7VL","created_at":"2026-07-05T06:18:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BO6JF7VLCSJY2AI265Z4RW5FUR","target":"record","payload":{"canonical_record":{"source":{"id":"2306.05171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-06-08T13:10:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"82c2f96a03081080cafddc2a0344e082429ca12d125c4ee5625d64a5c3380ce7","abstract_canon_sha256":"1d7d673d6522d8871f0d95b864407040af633a4dfc31a3878f9d75a2baf14c1e"},"schema_version":"1.0"},"canonical_sha256":"0bbc92feab14938d011af773c8dba5a44a9dd05f7e97f75b9b86aa5153da3e44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:53.250584Z","signature_b64":"9wb0wLj7k2yLaad/iCwfqwRIH4l5jip23DSw0I5qmVw2i1AnAvZy9nha289yGDttvINW2ggeqjp0+ETSrgVIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bbc92feab14938d011af773c8dba5a44a9dd05f7e97f75b9b86aa5153da3e44","last_reissued_at":"2026-07-05T06:18:53.250146Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:53.250146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.05171","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-05T06:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBVDwH2+Xwlo/Y54bcY4hnRWmgcLD4fX5jjqF328GRjW6MF45R65LutVxeUgaYO32sXNK+lSbyRzbUkVOb++Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:45:16.343568Z"},"content_sha256":"188b13a896432ef2c8400d03324d61c7b47852d2a41997d89c48d5b84cb3664c","schema_version":"1.0","event_id":"sha256:188b13a896432ef2c8400d03324d61c7b47852d2a41997d89c48d5b84cb3664c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BO6JF7VLCSJY2AI265Z4RW5FUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robot Task Planning Based on Large Language Model Representing Knowledge with Directed Graph Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Chen Zi-rui, Fang Yi-shu, Lu Xing-tong, Pan Wei-qin, Sheng Bi, Shi Hai-peng, Yue Zhen","submitted_at":"2023-06-08T13:10:00Z","abstract_excerpt":"Traditional robot task planning methods face challenges when dealing with highly unstructured environments and complex tasks. We propose a task planning method that combines human expertise with an LLM and have designed an LLM prompt template, Think_Net_Prompt, with stronger expressive power to represent structured professional knowledge. We further propose a method to progressively decompose tasks and generate a task tree to reduce the planning volume for each task, and we have designed a strategy to decouple robot task planning. By dividing different planning entities and separating the task"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.05171","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/2306.05171/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-05T06:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRfezC89gSINupvaAZtkXuzpwy2H0ITD15AuZDpJrTZhXU4rHDRhJ0633/bnJ4X7XyEmCr03OLYXue3G66rhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:45:16.344068Z"},"content_sha256":"51bd59c0c4a315dd5f7305d3a2a59c8fd5d678eb96998166ce194c7957782b8a","schema_version":"1.0","event_id":"sha256:51bd59c0c4a315dd5f7305d3a2a59c8fd5d678eb96998166ce194c7957782b8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BO6JF7VLCSJY2AI265Z4RW5FUR/bundle.json","state_url":"https://pith.science/pith/BO6JF7VLCSJY2AI265Z4RW5FUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BO6JF7VLCSJY2AI265Z4RW5FUR/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-10T09:45:16Z","links":{"resolver":"https://pith.science/pith/BO6JF7VLCSJY2AI265Z4RW5FUR","bundle":"https://pith.science/pith/BO6JF7VLCSJY2AI265Z4RW5FUR/bundle.json","state":"https://pith.science/pith/BO6JF7VLCSJY2AI265Z4RW5FUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BO6JF7VLCSJY2AI265Z4RW5FUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BO6JF7VLCSJY2AI265Z4RW5FUR","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":"1d7d673d6522d8871f0d95b864407040af633a4dfc31a3878f9d75a2baf14c1e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-06-08T13:10:00Z","title_canon_sha256":"82c2f96a03081080cafddc2a0344e082429ca12d125c4ee5625d64a5c3380ce7"},"schema_version":"1.0","source":{"id":"2306.05171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.05171","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"2306.05171v1","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05171","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"BO6JF7VLCSJY","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"pith_short_16","alias_value":"BO6JF7VLCSJY2AI2","created_at":"2026-07-05T06:18:53Z"},{"alias_kind":"pith_short_8","alias_value":"BO6JF7VL","created_at":"2026-07-05T06:18:53Z"}],"graph_snapshots":[{"event_id":"sha256:51bd59c0c4a315dd5f7305d3a2a59c8fd5d678eb96998166ce194c7957782b8a","target":"graph","created_at":"2026-07-05T06:18:53Z","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/2306.05171/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Traditional robot task planning methods face challenges when dealing with highly unstructured environments and complex tasks. We propose a task planning method that combines human expertise with an LLM and have designed an LLM prompt template, Think_Net_Prompt, with stronger expressive power to represent structured professional knowledge. We further propose a method to progressively decompose tasks and generate a task tree to reduce the planning volume for each task, and we have designed a strategy to decouple robot task planning. By dividing different planning entities and separating the task","authors_text":"Chen Zi-rui, Fang Yi-shu, Lu Xing-tong, Pan Wei-qin, Sheng Bi, Shi Hai-peng, Yue Zhen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-06-08T13:10:00Z","title":"Robot Task Planning Based on Large Language Model Representing Knowledge with Directed Graph Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.05171","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:188b13a896432ef2c8400d03324d61c7b47852d2a41997d89c48d5b84cb3664c","target":"record","created_at":"2026-07-05T06:18:53Z","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":"1d7d673d6522d8871f0d95b864407040af633a4dfc31a3878f9d75a2baf14c1e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-06-08T13:10:00Z","title_canon_sha256":"82c2f96a03081080cafddc2a0344e082429ca12d125c4ee5625d64a5c3380ce7"},"schema_version":"1.0","source":{"id":"2306.05171","kind":"arxiv","version":1}},"canonical_sha256":"0bbc92feab14938d011af773c8dba5a44a9dd05f7e97f75b9b86aa5153da3e44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bbc92feab14938d011af773c8dba5a44a9dd05f7e97f75b9b86aa5153da3e44","first_computed_at":"2026-07-05T06:18:53.250146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:18:53.250146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9wb0wLj7k2yLaad/iCwfqwRIH4l5jip23DSw0I5qmVw2i1AnAvZy9nha289yGDttvINW2ggeqjp0+ETSrgVIBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:18:53.250584Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.05171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:188b13a896432ef2c8400d03324d61c7b47852d2a41997d89c48d5b84cb3664c","sha256:51bd59c0c4a315dd5f7305d3a2a59c8fd5d678eb96998166ce194c7957782b8a"],"state_sha256":"dca78bd97ae5945f848aa8dfab5c4cea9fdec92ffdf6757fc4b886dc05c56e55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JOj45KcSlU7ag+DMQgoNgpQnzkfSRzu/ngepKO/TtbIpPz6k5Z54Hzq5rmMgSQ+v0DuNj9BCkJ52ZO43HWBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:45:16.348914Z","bundle_sha256":"935d0a38b1dee2918c97c79aa18ef1005a9246ee5ae378dcc6d09faa03562328"}}