{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SBTRPNFVF33C5R56Y73A6UU52P","short_pith_number":"pith:SBTRPNFV","schema_version":"1.0","canonical_sha256":"906717b4b52ef62ec7bec7f60f529dd3f06510ccfed953a87e69a8a07c2d95a0","source":{"kind":"arxiv","id":"2504.01637","version":1},"attestation_state":"computed","paper":{"title":"LLM-mediated Dynamic Plan Generation with a Multi-Agent Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Akifumi Ito, Kanata Takayasu, Reo Abe, Satoshi Kurihara","submitted_at":"2025-04-02T11:42:49Z","abstract_excerpt":"Planning methods with high adaptability to dynamic environments are crucial for the development of autonomous and versatile robots. We propose a method for leveraging a large language model (GPT-4o) to automatically generate networks capable of adapting to dynamic environments. The proposed method collects environmental \"status,\" representing conditions and goals, and uses them to generate agents. These agents are interconnected on the basis of specific conditions, resulting in networks that combine flexibility and generality. We conducted evaluation experiments to compare the networks automat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.01637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-04-02T11:42:49Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"87ed9c6e56f03b19fa6a860727c9dbd61b06d6621f55bce235d9b86aa80a3783","abstract_canon_sha256":"713dddd1047ee505be4bf662e0c611d57617a1cc70abf7d5cac2a431b6745652"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:19.212772Z","signature_b64":"vc5XUOmpoK0fs0jt84MuFsrE2eXZMRXgHwEKv6cTYsvDq5WDGrEnSsjeQjKN1QSyaMvSJeDNdMVUzgjl0ureDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"906717b4b52ef62ec7bec7f60f529dd3f06510ccfed953a87e69a8a07c2d95a0","last_reissued_at":"2026-07-05T10:43:19.212273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:19.212273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM-mediated Dynamic Plan Generation with a Multi-Agent Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Akifumi Ito, Kanata Takayasu, Reo Abe, Satoshi Kurihara","submitted_at":"2025-04-02T11:42:49Z","abstract_excerpt":"Planning methods with high adaptability to dynamic environments are crucial for the development of autonomous and versatile robots. We propose a method for leveraging a large language model (GPT-4o) to automatically generate networks capable of adapting to dynamic environments. The proposed method collects environmental \"status,\" representing conditions and goals, and uses them to generate agents. These agents are interconnected on the basis of specific conditions, resulting in networks that combine flexibility and generality. We conducted evaluation experiments to compare the networks automat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01637","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/2504.01637/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.01637","created_at":"2026-07-05T10:43:19.212335+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.01637v1","created_at":"2026-07-05T10:43:19.212335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01637","created_at":"2026-07-05T10:43:19.212335+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBTRPNFVF33C","created_at":"2026-07-05T10:43:19.212335+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBTRPNFVF33C5R56","created_at":"2026-07-05T10:43:19.212335+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBTRPNFV","created_at":"2026-07-05T10:43:19.212335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.16493","citing_title":"Grounding Language Models with Semantic Digital Twins for Robotic Planning","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P","json":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P.json","graph_json":"https://pith.science/api/pith-number/SBTRPNFVF33C5R56Y73A6UU52P/graph.json","events_json":"https://pith.science/api/pith-number/SBTRPNFVF33C5R56Y73A6UU52P/events.json","paper":"https://pith.science/paper/SBTRPNFV"},"agent_actions":{"view_html":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P","download_json":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P.json","view_paper":"https://pith.science/paper/SBTRPNFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.01637&json=true","fetch_graph":"https://pith.science/api/pith-number/SBTRPNFVF33C5R56Y73A6UU52P/graph.json","fetch_events":"https://pith.science/api/pith-number/SBTRPNFVF33C5R56Y73A6UU52P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P/action/storage_attestation","attest_author":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P/action/author_attestation","sign_citation":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P/action/citation_signature","submit_replication":"https://pith.science/pith/SBTRPNFVF33C5R56Y73A6UU52P/action/replication_record"}},"created_at":"2026-07-05T10:43:19.212335+00:00","updated_at":"2026-07-05T10:43:19.212335+00:00"}