{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7WGJ3BBHO33XM4JYKDJ43PPSC6","short_pith_number":"pith:7WGJ3BBH","canonical_record":{"source":{"id":"2502.18822","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-26T04:53:07Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"1a0cf692d5432cfd6b7ffcd65b9ef95d34c041068a97efc5047102e5a421c146","abstract_canon_sha256":"6596694d790f22957dea2908a865347d525df254b8f896f93195bf6e26f3b95c"},"schema_version":"1.0"},"canonical_sha256":"fd8c9d842776f776713850d3cdbdf2179387bfab2457572800659a0b1023848c","source":{"kind":"arxiv","id":"2502.18822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.18822","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"2502.18822v1","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.18822","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"7WGJ3BBHO33X","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"pith_short_16","alias_value":"7WGJ3BBHO33XM4JY","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"pith_short_8","alias_value":"7WGJ3BBH","created_at":"2026-07-05T10:20:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7WGJ3BBHO33XM4JYKDJ43PPSC6","target":"record","payload":{"canonical_record":{"source":{"id":"2502.18822","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-26T04:53:07Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"1a0cf692d5432cfd6b7ffcd65b9ef95d34c041068a97efc5047102e5a421c146","abstract_canon_sha256":"6596694d790f22957dea2908a865347d525df254b8f896f93195bf6e26f3b95c"},"schema_version":"1.0"},"canonical_sha256":"fd8c9d842776f776713850d3cdbdf2179387bfab2457572800659a0b1023848c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:21.656242Z","signature_b64":"W0T+VB4lAkMKpTqGXcKsC59rijtfydTImHnfjPmmPgdX6LKT3VZAdLBgTZGGK+d27GHseJbnX9IW1mWL+W9ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8c9d842776f776713850d3cdbdf2179387bfab2457572800659a0b1023848c","last_reissued_at":"2026-07-05T10:20:21.655761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:21.655761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.18822","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:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfMR4+wG5WaE2C6JlrKKRYx3qAxUa9j5Av7Pox5TmHmcreQvIE3n1eDPyAJiKIO5OhLhYwhS5wiLSpzG7uiNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:51:28.389119Z"},"content_sha256":"cbd1c1b319cdf1403bba104458d4748fce931161a61dc92ac18ce9a3d6771fe8","schema_version":"1.0","event_id":"sha256:cbd1c1b319cdf1403bba104458d4748fce931161a61dc92ac18ce9a3d6771fe8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7WGJ3BBHO33XM4JYKDJ43PPSC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-Efficient Multi-Agent Spatial Planning with LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Aaron Walsman, Daniel Garces, Huangyuan Su, Sham Kakade, Stephanie Gil","submitted_at":"2025-02-26T04:53:07Z","abstract_excerpt":"In this project, our goal is to determine how to leverage the world-knowledge of pretrained large language models for efficient and robust learning in multiagent decision making. We examine this in a taxi routing and assignment problem where agents must decide how to best pick up passengers in order to minimize overall waiting time. While this problem is situated on a graphical road network, we show that with the proper prompting zero-shot performance is quite strong on this task. Furthermore, with limited fine-tuning along with the one-at-a-time rollout algorithm for look ahead, LLMs can out-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.18822","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/2502.18822/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:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Clzpjd1XyfKDJcDY0D/1pylMwc0vdBWSZrKilVsKEcJ4clHG5H/ftgGs0deOIEVxScq3ZUwGcg54F4dCy+6IDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:51:28.389625Z"},"content_sha256":"7b1e462f0746863fc3052c9f2466fd2a19cd68991f1b3701651605905b06d388","schema_version":"1.0","event_id":"sha256:7b1e462f0746863fc3052c9f2466fd2a19cd68991f1b3701651605905b06d388"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WGJ3BBHO33XM4JYKDJ43PPSC6/bundle.json","state_url":"https://pith.science/pith/7WGJ3BBHO33XM4JYKDJ43PPSC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WGJ3BBHO33XM4JYKDJ43PPSC6/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-04T06:51:28Z","links":{"resolver":"https://pith.science/pith/7WGJ3BBHO33XM4JYKDJ43PPSC6","bundle":"https://pith.science/pith/7WGJ3BBHO33XM4JYKDJ43PPSC6/bundle.json","state":"https://pith.science/pith/7WGJ3BBHO33XM4JYKDJ43PPSC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WGJ3BBHO33XM4JYKDJ43PPSC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7WGJ3BBHO33XM4JYKDJ43PPSC6","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":"6596694d790f22957dea2908a865347d525df254b8f896f93195bf6e26f3b95c","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-26T04:53:07Z","title_canon_sha256":"1a0cf692d5432cfd6b7ffcd65b9ef95d34c041068a97efc5047102e5a421c146"},"schema_version":"1.0","source":{"id":"2502.18822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.18822","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"2502.18822v1","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.18822","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"7WGJ3BBHO33X","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"pith_short_16","alias_value":"7WGJ3BBHO33XM4JY","created_at":"2026-07-05T10:20:21Z"},{"alias_kind":"pith_short_8","alias_value":"7WGJ3BBH","created_at":"2026-07-05T10:20:21Z"}],"graph_snapshots":[{"event_id":"sha256:7b1e462f0746863fc3052c9f2466fd2a19cd68991f1b3701651605905b06d388","target":"graph","created_at":"2026-07-05T10:20:21Z","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/2502.18822/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this project, our goal is to determine how to leverage the world-knowledge of pretrained large language models for efficient and robust learning in multiagent decision making. We examine this in a taxi routing and assignment problem where agents must decide how to best pick up passengers in order to minimize overall waiting time. While this problem is situated on a graphical road network, we show that with the proper prompting zero-shot performance is quite strong on this task. Furthermore, with limited fine-tuning along with the one-at-a-time rollout algorithm for look ahead, LLMs can out-","authors_text":"Aaron Walsman, Daniel Garces, Huangyuan Su, Sham Kakade, Stephanie Gil","cross_cats":["cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-26T04:53:07Z","title":"Data-Efficient Multi-Agent Spatial Planning with LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.18822","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:cbd1c1b319cdf1403bba104458d4748fce931161a61dc92ac18ce9a3d6771fe8","target":"record","created_at":"2026-07-05T10:20:21Z","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":"6596694d790f22957dea2908a865347d525df254b8f896f93195bf6e26f3b95c","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-26T04:53:07Z","title_canon_sha256":"1a0cf692d5432cfd6b7ffcd65b9ef95d34c041068a97efc5047102e5a421c146"},"schema_version":"1.0","source":{"id":"2502.18822","kind":"arxiv","version":1}},"canonical_sha256":"fd8c9d842776f776713850d3cdbdf2179387bfab2457572800659a0b1023848c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd8c9d842776f776713850d3cdbdf2179387bfab2457572800659a0b1023848c","first_computed_at":"2026-07-05T10:20:21.655761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:20:21.655761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W0T+VB4lAkMKpTqGXcKsC59rijtfydTImHnfjPmmPgdX6LKT3VZAdLBgTZGGK+d27GHseJbnX9IW1mWL+W9ICw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:20:21.656242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.18822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbd1c1b319cdf1403bba104458d4748fce931161a61dc92ac18ce9a3d6771fe8","sha256:7b1e462f0746863fc3052c9f2466fd2a19cd68991f1b3701651605905b06d388"],"state_sha256":"8264c9a7fea2b666464ed72a3f3de750ae71d1da36dfa2d42969fa8623395cec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNAeNjb9mDWSUmHNnpZ0bd9pU5bYUiHMZ+nUJcZU1Z4vj/DpIosnYZ/Xp/b8Wg7/UnrjwyQZ4O96X+B9DBzNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T06:51:28.393296Z","bundle_sha256":"f6966ec53349019f420985ee1bac8e1425476b7381018d12df04934f73cdea4c"}}