{"as_of":"2026-08-07T09:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5fd186cafb1e5ceb8aef32d1652f23dcbe7fbb80a9e359474f3a657d176daf8","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T01:48:40.840857Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.09603/citation-record","integrity":"/paper/2607.09603/integrity","json":"/paper/2607.09603/citation-record.json","paper":"/paper/2607.09603"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.17246","last_updated":"2025-03-25T23:39:13Z","snapshot_observed_at":"2026-08-02T22:31:10.937767Z","submitted_at":"2024-03-25T22:47:13Z","title":"TwoStep: Multi-agent Task Planning using Classical Planners and Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17246","snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"Claude sonnet 4.5 system card","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"cited_paper":"/paper/2403.17246","citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:20dd7fc6f16e3e153337304cd845ef50e5f8dfeee7b3299546c847db6dd3c2d9","observation_id":"bc72975c-0e30-458e-b0e0-71c1beb213de","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05155","last_updated":"2020-04-10T17:57:29Z","snapshot_observed_at":"2026-08-03T20:13:33.650943Z","submitted_at":"2020-04-10T17:57:29Z","title":"Learning to Explore using Active Neural SLAM","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05155","snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"S., Gandhi, D., Gupta, S., Gupta, A., and Salakhutdinov, R","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"cited_paper":"/paper/2004.05155","citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:c2a71bfe4f63b4780725bce3ffd481c84389741296722f07b5d0cd3d9e6541c0","observation_id":"673144ad-34cc-487b-ac82-b4ca6dde5265","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"com/deepmind-media/Model-Cards/ Gemini-3-Flash-Model-Card.pdf","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:ff52e732d8e18f400ce2cbdb565005a943ef39f7ac4b7c5ec3185bd9b0397792","observation_id":"55632874-4ec6-4b81-ae6d-da26d02f6a5a","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"Optimal task and motion planning and execution for multiagent systems in dynamic envi- ronments.IEEE Transactions on Cybernetics, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:31ba4c74690a71bfa7ca43738a7afd0763375f95acbffc7778b7336eda33e244","observation_id":"4f7ebd30-0f29-4dcf-b2f9-ca45de5ab11d","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"P., Perelman, A., Ramesh, A., Clark, A., Ostrow, A., Welihinda, A., Hayes, A., Radford, A., et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:b60cb6090dc9bbc5e51757bbfd99d3c2e63dc5a9aaf2904f6bddabbe5b663024","observation_id":"4912d4e6-b040-4e0c-8a14-d745f6dae926","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:74c08fbd763e1a463a0350352960ac74da8412ddcaf084bef2ab02b555456af3","observation_id":"317277a7-129e-4feb-a82e-19c0148f072a","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.05474","last_updated":"2022-08-26T17:12:17Z","snapshot_observed_at":"2026-07-06T06:14:28.435222Z","submitted_at":"2017-12-14T23:17:24Z","title":"AI2-THOR: An Interactive 3D Environment for Visual AI","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.05474","snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"AI2-THOR: An Interactive 3D Environment for Visual AI.arXiv preprint 1712.05474, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"cited_paper":"/paper/1712.05474","citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:f1a4b960a6203e19f053169c0a4ca27b748644668fb4d65191ddc3bc4b279eae","observation_id":"c4ea89e5-5691-4495-9081-e700aae794e3","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"and Montana, G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:35e9464a46b24f30a12064cc7261251aca1d0e0ca08231f8d289d2942a91f82e","observation_id":"6189feb0-d221-44cc-a678-2c2ba8a4fb27","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"Scaling large language model-based multi-agent collab- oration","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:53d0c7b1144a84f010216ee547f5638e13baf1697939fa0159fff6d6aa0adf72","observation_id":"83d3c816-dee5-4e2c-be3f-5eddbb25a1b3","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03673","last_updated":"2025-06-05T23:45:32Z","snapshot_observed_at":"2026-07-06T21:19:49.709528Z","submitted_at":"2025-05-06T16:11:49Z","title":"RoboOS: A Hierarchical Embodied Framework for Cross-Embodiment and Multi-Agent Collaboration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03673","snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"Decentralized monte carlo tree search for partially observable multi-agent pathfinding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"cited_paper":"/paper/2505.03673","citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:9c16968ab1ddceb65ba9cc5f1c0d189fb93e5c433e902308f3d50ce5f0bf9438","observation_id":"bd5dba63-632e-4a7b-a656-070d8b7b9ac2","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07398","last_updated":"2025-06-16T08:45:10Z","snapshot_observed_at":"2026-08-07T05:32:29.009208Z","submitted_at":"2025-06-09T03:43:46Z","title":"G-Memory: Tracing Hierarchical Memory for Multi-Agent Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07398","snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"just ahead","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"cited_paper":"/paper/2506.07398","citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:cd57f33776725aecb500a3701f9e29e8d6a29edf20b9ff5a88bc89e0ce63b1d0","observation_id":"d65400a8-1f43-46cc-93eb-21bf779d78b8","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"No agent has PickupObject candidates if they’re already holding something","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:6da532e6bc200957eb3eb5674f61a1433cc76d4b8d7e9521c163e2d96b6b4f55","observation_id":"05c819b0-2b84-4ebc-8102-8ebbb1983a77","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:9d68f9ab74df5c78f5fc62c56e9447e06ab5316740bb5a0aabd15bd401f7c48e","observation_id":"9ff6f28e-4efa-47a0-862d-db2c2d566ef0","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:6d469d1dd6445649385efb54d89318ced856648d9c2d472d609baea7e16d31f5","observation_id":"ba7e8b74-2a7f-4ddc-a933-9287fef08c52","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:34dc8047284ca3e1d74a24fe3c451e5ef7018ef0f708da6c7f5c285c66ad00a6","observation_id":"bd2ec63f-1e97-43ae-be62-8de4fe356c74","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:b83ae8653e414a04e1094e5043f5ca7bd7bcc5823c7292a8551cac0ae91d905b","observation_id":"56354075-5eed-459d-8425-e075f5124e48","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:440f51fed8098ea770fdf153fa1a83d79cb3ac6d291e8fb983dba7e43fef2fe2","observation_id":"9e44c0e3-0c78-4fd5-834c-5d1b51e40012","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T01:48:40.840857Z","title":"Book 1 - Alice: Far left (4 moves), Bob: Just ahead (1 move)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:40.840857Z"},"links":{"citing_paper":"/paper/2607.09603"},"observation_digest":"sha256:b66ad9a34301b8370148be5f10d90b2fc3ab40628523df823fa0ddb8685f851c","observation_id":"1e4e2c28-cbc8-4802-a440-4e39e36a27c3","resolution":{"observed_at":"2026-07-13T01:48:40.840857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09603","last_updated":"2026-07-10T16:57:37Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-03T03:31:00.074943Z","submitted_at":"2026-07-10T16:57:37Z","title":"Mosaic: Runtime-Efficient Multi-Agent Embodied Planning"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":18},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2607.09603."}