{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GKMQ4BQ7PJKLH57WT2HBMVJJIT","short_pith_number":"pith:GKMQ4BQ7","canonical_record":{"source":{"id":"2507.07302","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-09T22:01:32Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"2e051e1337e7c2507b4ffd139266c5351cd4f07ed9944fcac810769ec1cd5c6d","abstract_canon_sha256":"2e266b8b54853a9b7eacd4b0ad542e960a96a4f59e82b988a078e4b234bb7cb2"},"schema_version":"1.0"},"canonical_sha256":"32990e061f7a54b3f7f69e8e16552944eefbb6326e5f507b29b52253e1137464","source":{"kind":"arxiv","id":"2507.07302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07302","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07302v1","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07302","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"GKMQ4BQ7PJKL","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"pith_short_16","alias_value":"GKMQ4BQ7PJKLH57W","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"pith_short_8","alias_value":"GKMQ4BQ7","created_at":"2026-07-05T11:34:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GKMQ4BQ7PJKLH57WT2HBMVJJIT","target":"record","payload":{"canonical_record":{"source":{"id":"2507.07302","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-09T22:01:32Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"2e051e1337e7c2507b4ffd139266c5351cd4f07ed9944fcac810769ec1cd5c6d","abstract_canon_sha256":"2e266b8b54853a9b7eacd4b0ad542e960a96a4f59e82b988a078e4b234bb7cb2"},"schema_version":"1.0"},"canonical_sha256":"32990e061f7a54b3f7f69e8e16552944eefbb6326e5f507b29b52253e1137464","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:55.418674Z","signature_b64":"2WGeBhGtHVaZgn/R+UcdRXkKCpxk5w1+X/ZvX+1W18+AI/22pGfri76/oi9xEajgm4eE7uePll6ORMOW4guvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32990e061f7a54b3f7f69e8e16552944eefbb6326e5f507b29b52253e1137464","last_reissued_at":"2026-07-05T11:34:55.418199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:55.418199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.07302","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-05T11:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieOQuPzWif3gWhX0RuXLIeQI51p1Pq4jzo2IhyloTC4bh7+Vv19TbXuBkE9N/FXxI4EcMKxR65Gzyb5CuzUfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:19:32.675091Z"},"content_sha256":"e0267f069be81764ee845c42647523b831fd2d21d05c2845948851df7457c3e9","schema_version":"1.0","event_id":"sha256:e0267f069be81764ee845c42647523b831fd2d21d05c2845948851df7457c3e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GKMQ4BQ7PJKLH57WT2HBMVJJIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Ashish Kumar","submitted_at":"2025-07-09T22:01:32Z","abstract_excerpt":"Efficient exploration is a well known problem in deep reinforcement learning and this problem is exacerbated in multi-agent reinforcement learning due the intrinsic complexities of such algorithms. There are several approaches to efficiently explore an environment to learn to solve tasks by multi-agent operating in that environment, of which, the idea of expert exploration is investigated in this work. More specifically, this work investigates the application of large-language models as expert planners for efficient exploration in planning based tasks for multiple agents."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07302","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/2507.07302/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-05T11:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CC7Hxi9jXOSG/GSNHBiZP+4D8VWZcwZGZ71CC7VNOk7opLtS/EWKz9WIb6TMcaPYwLuqzzyxSccJYK2NQusYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:19:32.676014Z"},"content_sha256":"e546948500dd5d838657ff7e801b52b99c193f87da966f1ed54643cf092c34df","schema_version":"1.0","event_id":"sha256:e546948500dd5d838657ff7e801b52b99c193f87da966f1ed54643cf092c34df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKMQ4BQ7PJKLH57WT2HBMVJJIT/bundle.json","state_url":"https://pith.science/pith/GKMQ4BQ7PJKLH57WT2HBMVJJIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKMQ4BQ7PJKLH57WT2HBMVJJIT/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-11T02:19:32Z","links":{"resolver":"https://pith.science/pith/GKMQ4BQ7PJKLH57WT2HBMVJJIT","bundle":"https://pith.science/pith/GKMQ4BQ7PJKLH57WT2HBMVJJIT/bundle.json","state":"https://pith.science/pith/GKMQ4BQ7PJKLH57WT2HBMVJJIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKMQ4BQ7PJKLH57WT2HBMVJJIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GKMQ4BQ7PJKLH57WT2HBMVJJIT","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":"2e266b8b54853a9b7eacd4b0ad542e960a96a4f59e82b988a078e4b234bb7cb2","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-09T22:01:32Z","title_canon_sha256":"2e051e1337e7c2507b4ffd139266c5351cd4f07ed9944fcac810769ec1cd5c6d"},"schema_version":"1.0","source":{"id":"2507.07302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07302","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07302v1","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07302","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"GKMQ4BQ7PJKL","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"pith_short_16","alias_value":"GKMQ4BQ7PJKLH57W","created_at":"2026-07-05T11:34:55Z"},{"alias_kind":"pith_short_8","alias_value":"GKMQ4BQ7","created_at":"2026-07-05T11:34:55Z"}],"graph_snapshots":[{"event_id":"sha256:e546948500dd5d838657ff7e801b52b99c193f87da966f1ed54643cf092c34df","target":"graph","created_at":"2026-07-05T11:34:55Z","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/2507.07302/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient exploration is a well known problem in deep reinforcement learning and this problem is exacerbated in multi-agent reinforcement learning due the intrinsic complexities of such algorithms. There are several approaches to efficiently explore an environment to learn to solve tasks by multi-agent operating in that environment, of which, the idea of expert exploration is investigated in this work. More specifically, this work investigates the application of large-language models as expert planners for efficient exploration in planning based tasks for multiple agents.","authors_text":"Ashish Kumar","cross_cats":["cs.RO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07302","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:e0267f069be81764ee845c42647523b831fd2d21d05c2845948851df7457c3e9","target":"record","created_at":"2026-07-05T11:34:55Z","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":"2e266b8b54853a9b7eacd4b0ad542e960a96a4f59e82b988a078e4b234bb7cb2","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-09T22:01:32Z","title_canon_sha256":"2e051e1337e7c2507b4ffd139266c5351cd4f07ed9944fcac810769ec1cd5c6d"},"schema_version":"1.0","source":{"id":"2507.07302","kind":"arxiv","version":1}},"canonical_sha256":"32990e061f7a54b3f7f69e8e16552944eefbb6326e5f507b29b52253e1137464","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32990e061f7a54b3f7f69e8e16552944eefbb6326e5f507b29b52253e1137464","first_computed_at":"2026-07-05T11:34:55.418199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:55.418199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2WGeBhGtHVaZgn/R+UcdRXkKCpxk5w1+X/ZvX+1W18+AI/22pGfri76/oi9xEajgm4eE7uePll6ORMOW4guvAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:55.418674Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.07302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0267f069be81764ee845c42647523b831fd2d21d05c2845948851df7457c3e9","sha256:e546948500dd5d838657ff7e801b52b99c193f87da966f1ed54643cf092c34df"],"state_sha256":"43de33c403b825cedff101db2d1bd5c1e51de6cfcf83273c1bfca8c05143d749"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CRl49udnUXJfnX1AYLtii8tHHsTWG700JDrBPuYmJZ2lw/BqlNiER7zbuF/52zLuutYbcxfresT8bPoWalv4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:19:32.682182Z","bundle_sha256":"3df8e2ced65b732e64cf69b7b733c00ba3820fe11bf3da2072aef12b6c468059"}}