{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IBPOIL6TQMFGDYTKDGSN7NVMFP","short_pith_number":"pith:IBPOIL6T","canonical_record":{"source":{"id":"2501.15901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-01-27T09:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"cab1bcf4e14c6f5d6895e5dbfdaaa1a75323ae7948647529b4233128c8fb0710","abstract_canon_sha256":"a20351d07baedbdd80fbafea64135a18c8bad2db76ffb787840ae6e9a1f25499"},"schema_version":"1.0"},"canonical_sha256":"405ee42fd3830a61e26a19a4dfb6ac2bc0124a3402e94093562e55ae0b513091","source":{"kind":"arxiv","id":"2501.15901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15901","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15901v1","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15901","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"IBPOIL6TQMFG","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"pith_short_16","alias_value":"IBPOIL6TQMFGDYTK","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"pith_short_8","alias_value":"IBPOIL6T","created_at":"2026-07-05T10:05:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IBPOIL6TQMFGDYTKDGSN7NVMFP","target":"record","payload":{"canonical_record":{"source":{"id":"2501.15901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-01-27T09:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"cab1bcf4e14c6f5d6895e5dbfdaaa1a75323ae7948647529b4233128c8fb0710","abstract_canon_sha256":"a20351d07baedbdd80fbafea64135a18c8bad2db76ffb787840ae6e9a1f25499"},"schema_version":"1.0"},"canonical_sha256":"405ee42fd3830a61e26a19a4dfb6ac2bc0124a3402e94093562e55ae0b513091","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:51.766638Z","signature_b64":"zgh8JA1Sdex8EDcF8jXb5NviJzT8WqLZHMljIeoA0ev6h+ejzMGwmq78iUa/QytpKZKvzSRbAazioQ9twOmmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405ee42fd3830a61e26a19a4dfb6ac2bc0124a3402e94093562e55ae0b513091","last_reissued_at":"2026-07-05T10:05:51.766209Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:51.766209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.15901","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-05T10:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TjHzlcq9tCyfJEHU3DLhcuyMhJgBB5F1Ips9Q7P8+1ND0oaKAyWjhg7U8L15D2gx05GXMU0FmFYLY6Mg59quBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:06:33.024451Z"},"content_sha256":"c253c934e5fd368a902680b91fe31ea416bea1f1dde1e988210ab4353dc3805b","schema_version":"1.0","event_id":"sha256:c253c934e5fd368a902680b91fe31ea416bea1f1dde1e988210ab4353dc3805b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IBPOIL6TQMFGDYTKDGSN7NVMFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Mobile Robot Path Planning via LLM-Based Dynamic Waypoint Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Congqing Wang, Muhammad Taha Tariq, Yasir Hussain","submitted_at":"2025-01-27T09:51:48Z","abstract_excerpt":"Mobile robot path planning in complex environments remains a significant challenge, especially in achieving efficient, safe and robust paths. The traditional path planning techniques like DRL models typically trained for a given configuration of the starting point and target positions, these models only perform well when these conditions are satisfied. In this paper, we proposed a novel path planning framework that embeds Large Language Models to empower mobile robots with the capability of dynamically interpreting natural language commands and autonomously generating efficient, collision-free"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15901","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/2501.15901/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-05T10:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ke5uvXuHuRmUT1bZOlyKkWiUqY7xNcON8F9PYhXv+Z2Mk91ZqIRiUTDObOC6EJ8dt7Kymi+NTvzRdP9RRbFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:06:33.025405Z"},"content_sha256":"f923879d0ab51b423f7495f002bfbd2db2463888772483e90176775063baa6c1","schema_version":"1.0","event_id":"sha256:f923879d0ab51b423f7495f002bfbd2db2463888772483e90176775063baa6c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBPOIL6TQMFGDYTKDGSN7NVMFP/bundle.json","state_url":"https://pith.science/pith/IBPOIL6TQMFGDYTKDGSN7NVMFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBPOIL6TQMFGDYTKDGSN7NVMFP/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-11T16:06:33Z","links":{"resolver":"https://pith.science/pith/IBPOIL6TQMFGDYTKDGSN7NVMFP","bundle":"https://pith.science/pith/IBPOIL6TQMFGDYTKDGSN7NVMFP/bundle.json","state":"https://pith.science/pith/IBPOIL6TQMFGDYTKDGSN7NVMFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBPOIL6TQMFGDYTKDGSN7NVMFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IBPOIL6TQMFGDYTKDGSN7NVMFP","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":"a20351d07baedbdd80fbafea64135a18c8bad2db76ffb787840ae6e9a1f25499","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-01-27T09:51:48Z","title_canon_sha256":"cab1bcf4e14c6f5d6895e5dbfdaaa1a75323ae7948647529b4233128c8fb0710"},"schema_version":"1.0","source":{"id":"2501.15901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15901","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15901v1","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15901","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"IBPOIL6TQMFG","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"pith_short_16","alias_value":"IBPOIL6TQMFGDYTK","created_at":"2026-07-05T10:05:51Z"},{"alias_kind":"pith_short_8","alias_value":"IBPOIL6T","created_at":"2026-07-05T10:05:51Z"}],"graph_snapshots":[{"event_id":"sha256:f923879d0ab51b423f7495f002bfbd2db2463888772483e90176775063baa6c1","target":"graph","created_at":"2026-07-05T10:05:51Z","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/2501.15901/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Mobile robot path planning in complex environments remains a significant challenge, especially in achieving efficient, safe and robust paths. The traditional path planning techniques like DRL models typically trained for a given configuration of the starting point and target positions, these models only perform well when these conditions are satisfied. In this paper, we proposed a novel path planning framework that embeds Large Language Models to empower mobile robots with the capability of dynamically interpreting natural language commands and autonomously generating efficient, collision-free","authors_text":"Congqing Wang, Muhammad Taha Tariq, Yasir Hussain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-01-27T09:51:48Z","title":"Robust Mobile Robot Path Planning via LLM-Based Dynamic Waypoint Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15901","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:c253c934e5fd368a902680b91fe31ea416bea1f1dde1e988210ab4353dc3805b","target":"record","created_at":"2026-07-05T10:05:51Z","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":"a20351d07baedbdd80fbafea64135a18c8bad2db76ffb787840ae6e9a1f25499","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-01-27T09:51:48Z","title_canon_sha256":"cab1bcf4e14c6f5d6895e5dbfdaaa1a75323ae7948647529b4233128c8fb0710"},"schema_version":"1.0","source":{"id":"2501.15901","kind":"arxiv","version":1}},"canonical_sha256":"405ee42fd3830a61e26a19a4dfb6ac2bc0124a3402e94093562e55ae0b513091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405ee42fd3830a61e26a19a4dfb6ac2bc0124a3402e94093562e55ae0b513091","first_computed_at":"2026-07-05T10:05:51.766209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:05:51.766209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zgh8JA1Sdex8EDcF8jXb5NviJzT8WqLZHMljIeoA0ev6h+ejzMGwmq78iUa/QytpKZKvzSRbAazioQ9twOmmBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:05:51.766638Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.15901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c253c934e5fd368a902680b91fe31ea416bea1f1dde1e988210ab4353dc3805b","sha256:f923879d0ab51b423f7495f002bfbd2db2463888772483e90176775063baa6c1"],"state_sha256":"552948f0b341eba03c7be88edc86a0b2707299c68291f366d494e797da8ae0c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ywd0OvkcxYk31Ht0tuTOLiN+SAGVjzj92fY9VSP5Uyj55F/wqn8aHYNaChtwPDwLwdoExW35KG2YwzU/vk9rDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T16:06:33.032798Z","bundle_sha256":"381b3acb296a22e62a16ca264a2e39dc03d1491c204c37d9b84c0a1d3a040db1"}}