{"as_of":"2026-08-14T18:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:310c21d3796dab9ad7ac1ff22f0dfdd7e34805f91f0d039a703df5cf62028929","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:54:30.971584Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T21:08:56.188382Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T22:34:03.013230Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"cited_work":{"arxiv_id":"2506.20579","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.20579","snapshot_observed_at":"2026-06-29T22:34:03.013230Z","title":null,"venue":null,"work_id":"548c0883-d670-471e-8614-1cdc31018925","year":2025},"citing_paper":{"arxiv_id":"2605.26304","last_updated":"2026-05-29T13:13:49Z","snapshot_observed_at":"2026-08-03T15:31:32.883558Z","submitted_at":"2026-05-25T19:55:59Z","title":"Collaborative Navigation and Exploration with $\\beta$-Sparse Gaussian Processes","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T21:08:56.188382Z"},"links":{"cited_paper":"/paper/2506.20579","citing_paper":"/paper/2605.26304"},"observation_digest":"sha256:ba8df1eaaa68f84cf89b1dbe6c4c69e5d56369cfa7f5f32de800d90ce5aae088","observation_id":"6c398022-c023-4558-8733-cc7f5be4544c","resolution":{"observed_at":"2026-06-29T22:34:03.014910Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.20579/citation-record","integrity":"/paper/2506.20579/integrity","json":"/paper/2506.20579/citation-record.json","paper":"/paper/2506.20579"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:36.127804Z","title":"Collaborative multi-robot search and rescue: Planning, coordination, perception, and active vision,","venue":null,"work_id":"9a2fd5b4-3882-4baa-a7c1-edf76497dc46","year":2020},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:27.957332Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:5737835d7902f3939987745de2b7adf4c4d064d41a462fe165dfa90cdaf9e320","observation_id":"41c2ba67-49b8-48d4-b26c-3c046a7e796c","resolution":{"observed_at":"2026-08-06T22:54:36.203964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:35.942221Z","title":"Traversing Mars: Cooperative informative path planning to efficiently navigate unknown scenes,","venue":null,"work_id":"a0bc5052-a9ac-468c-a398-24eeae3f3b4f","year":2025},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.047502Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:6773a49bd1ffbb17b1a741d8af11698f7e6c165a9100c9ac59929e4b814d3ff1","observation_id":"9a1d0317-776d-4504-a939-752707e475fa","resolution":{"observed_at":"2026-08-06T22:54:36.015114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:35.815339Z","title":"Where to map? Iterative rover-copter path planning for Mars explo- ration,","venue":null,"work_id":"7e6992f9-c82b-437a-b447-469cfa5a0648","year":2020},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.182912Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:169f89efe5bb7cea4238fbad713d758392a21ecdf330fa5c07e96d13691d4f8b","observation_id":"5504a978-8edb-4010-8ca8-c782991c1a31","resolution":{"observed_at":"2026-08-06T22:54:35.869652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:35.644034Z","title":"Multi-agent task-driven ex- ploration via intelligent map compression and sharing,","venue":null,"work_id":"e32a2fcd-adb3-4efc-85e0-c696b1a25560","year":2024},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.329964Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:28dcda7ea48c2fb5ee094dd9c445f5fea4f8af2f6b065b499adfdec8b4d3bdd2","observation_id":"bea68af5-72cd-458a-8131-0a41ba1d548b","resolution":{"observed_at":"2026-08-06T22:54:35.737795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:28.474723Z","title":"Cooperative air and ground surveillance,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.474723Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:5d5cef0f4032e54f33d691a76ba7eb5c9373d7ffba35603e73f5e7134e6c4ce5","observation_id":"2158618c-b432-4346-a4b5-150081eab495","resolution":{"observed_at":"2026-08-06T22:54:28.474723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07169","last_updated":"2024-05-12T05:42:22Z","snapshot_observed_at":"2026-08-13T00:09:34.346982Z","submitted_at":"2024-05-12T05:42:22Z","title":"Challenges and Opportunities for Large-Scale Exploration with Air-Ground Teams using Semantics","version":1},"cited_work":{"arxiv_id":"2405.07169","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.07169","snapshot_observed_at":"2026-08-06T22:54:31.113602Z","title":"Challenges and Opportunities for Large-Scale Exploration with Air-Ground Teams using Semantics","venue":"cs.RO","work_id":"522ce37a-d130-4b62-8a1a-221563c8a21c","year":2024},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.535909Z"},"links":{"cited_paper":"/paper/2405.07169","citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:fa975250d95e390b40d291d5bef21b90a7477a66dbb0eb0d90256ee8180d4d9e","observation_id":"91a5c3b5-fca5-4d87-9432-8c1636eabe7f","resolution":{"observed_at":"2026-08-06T22:54:31.218253Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:35.438289Z","title":"An information gain formulation for active volumetric 3D reconstruction,","venue":null,"work_id":"1ea50e4f-340f-4574-8e09-7bcd22d59b2d","year":2016},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.624518Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:499430adcba600e406ea71c17b320611896e064a6954fa07761ce3e3086690d6","observation_id":"9c80a1b9-e2dd-43c1-8c21-b5f1fab8d442","resolution":{"observed_at":"2026-08-06T22:54:35.535547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:35.222175Z","title":"Collabo- rative semantic understanding and mapping framework for autonomous systems,","venue":null,"work_id":"8110c175-cd57-4a25-bf71-37224065f88c","year":2020},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.757015Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:53e30d6a2536764add3e77e74ba6cb82154264d799c2d6802f34812a6491f809","observation_id":"5dada49f-b1ba-4dc3-843e-8e66ba5327fa","resolution":{"observed_at":"2026-08-06T22:54:35.349579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:34.975329Z","title":"DDF-SAM 2.0: Consis- tent distributed smoothing and mapping,","venue":null,"work_id":"245f9fb6-cae7-476c-a8a5-7eb25fef7b1e","year":2013},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.854696Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:7c89d7bd91d92c5b505e23959e597e474f4da6cc86cd1e2a85b95674e06b9210","observation_id":"7f851da0-b198-49de-98ce-4381278374b3","resolution":{"observed_at":"2026-08-06T22:54:35.112225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:34.759354Z","title":"D-lite: Navigation-oriented compression of 3D scene graphs for multi-robot collaboration,","venue":null,"work_id":"953bb042-43f3-4f60-916d-0ac7310e96c9","year":2023},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:28.952158Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:e53c6c1b4efc5ff064ae70df435d5df43eb62039baae1a1531f1ffdbcffb29f6","observation_id":"963c9a58-0188-404c-9507-7ca5b831ca44","resolution":{"observed_at":"2026-08-06T22:54:34.865066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:34.502344Z","title":"Communication-aware control of large data transmissions via centralized cognition and 5G networks for multi-robot map merging,","venue":null,"work_id":"df691d67-ab07-4a24-b2d3-ba9e2df9bfac","year":2024},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.050545Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:62f42c69584f8ad989ec7f20bf6f5e0a76447fbb7444c3d8ef05a0949f4d5ffb","observation_id":"bdaca323-d0e7-472c-9021-f79b7fa3d0d4","resolution":{"observed_at":"2026-08-06T22:54:34.604883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:34.259560Z","title":"Communication- aware iterative map compression for online path-planning,","venue":null,"work_id":"25f68d86-52c5-4da6-981c-b3eb7368f8a4","year":2025},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.136115Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:8f4b6104286d07f11662d93c3687a0c0496370b55ff36b30d8bd9f1b6484f5ab","observation_id":"276a0db9-1a6a-4c6b-a2a6-b4207c82369d","resolution":{"observed_at":"2026-08-06T22:54:34.367443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:34.024753Z","title":"The information bottleneck method,","venue":null,"work_id":"e074c711-82c3-41f6-9802-20fe71f97876","year":1999},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.221565Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:85ff1e59541e66bae0246e063f44948de73c2002618566bfeaaef6756930ae69","observation_id":"dc92f1d9-f168-4251-a239-5dcacebe19d1","resolution":{"observed_at":"2026-08-06T22:54:34.114406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:33.801456Z","title":"Optimal controller synthesis and dynamic quantizer switching for linear-quadratic-Gaussian systems,","venue":null,"work_id":"110d28b8-4f88-4f2f-b2fd-d0ea3a03e29c","year":2021},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.327460Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:592a4daa244cf6d5a7914a6cc2cdcd031d5dd64948465a295b1bb08c00934179","observation_id":"cf51b49e-0e5c-4b3b-a12c-72373f109a4e","resolution":{"observed_at":"2026-08-06T22:54:33.908929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:33.648709Z","title":"Optimal quantizer scheduling and controller synthesis for partially observable linear systems,","venue":null,"work_id":"5152f04e-b5bc-4b45-bcf0-aa177bbc9699","year":2023},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.413566Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:bb4069657f398fcd9effc60e6d3d67c1b3603992e7a9a0435f5d53136c3e4010","observation_id":"5260c547-39ea-4edd-a8b7-e27de749e406","resolution":{"observed_at":"2026-08-06T22:54:33.721087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:33.490593Z","title":"Gaussian belief space path planning for minimum sensing navigation,","venue":null,"work_id":"174e25d4-8ee8-4326-a651-b7adce041562","year":2022},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.505264Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:327aeaf454e0b5a7ff24f3fc47e2c505de2902988aced54b5f58e6a6e77fd9d4","observation_id":"a0280717-870d-4637-8a8e-79cad29b465b","resolution":{"observed_at":"2026-08-06T22:54:33.564451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:33.296139Z","title":"Simultaneous perception–action design via invariant finite belief sets,","venue":null,"work_id":"51db839c-b171-4fdf-9175-6d562eb8d60c","year":2023},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.601555Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:67a0226734a12dd2001f84cb26d877aca43baad7ce9beba2abb1ef4102d2887c","observation_id":"74f81fab-0ab2-46a4-8df2-285ee9d3a656","resolution":{"observed_at":"2026-08-06T22:54:33.364479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:33.141856Z","title":"Improved upper bounds to the causal quadratic rate-distortion function for Gaussian stationary sources,","venue":null,"work_id":"4d1dfcc3-9f98-4224-a8d6-852a26163996","year":2012},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.704488Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:4e57b3ba0fdb494861ad4e52215ccbf8faf769c2d158693b71090fcfebf0bd76","observation_id":"fa22283b-2073-4e5b-afe9-4accbb1c2c62","resolution":{"observed_at":"2026-08-06T22:54:33.226431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:29.806458Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.806458Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:6e35a68cd142f3cefc21becd2a2f87712675ab60a4beb301620e4b4c0a5a9a3f","observation_id":"95e9872d-8ac7-4c00-8fc5-e01593ea1df0","resolution":{"observed_at":"2026-08-06T22:54:29.806458Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:32.936256Z","title":"Rate of prefix-free codes in LQG control systems,","venue":null,"work_id":"f373ee3e-2b58-4eb2-bc07-91d7d3d58eb0","year":2016},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:29.997415Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:286f4cb307962038f5c5368d466356f5edd0adef3ca927eacb33e130e1c3c3e4","observation_id":"02a564d0-603d-42d7-8621-78336988f15c","resolution":{"observed_at":"2026-08-06T22:54:33.042007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.01227","last_updated":"2016-04-05T11:59:51Z","snapshot_observed_at":"2026-08-05T12:53:32.825640Z","submitted_at":"2016-04-05T11:59:51Z","title":"Rate of Prefix-free Codes in LQG Control Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.01227","snapshot_observed_at":"2026-08-06T22:54:30.112777Z","title":"Tanaka, K","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.112777Z"},"links":{"cited_paper":"/paper/1604.01227","citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:f8ace69f8f3da6f08e62f0c070b49dd3009f7be519737d3e969f7e09af91391c","observation_id":"28842344-827e-4c28-a81a-c57fce60a71a","resolution":{"observed_at":"2026-08-06T22:54:30.112777Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:32.766588Z","title":"Optimal and efficient path planning for partially-known environments,","venue":null,"work_id":"5ebb3f64-28a5-40d0-9032-ed1bdcc9b9bc","year":1994},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.236075Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:942c7406b39edf1a36f129b774023add8928c6812241b470847fdd18e3690d8a","observation_id":"050c600f-1d69-450a-97b9-78ebd149edbf","resolution":{"observed_at":"2026-08-06T22:54:32.837242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:32.582206Z","title":"Communication-aware map compression for online path-planning,","venue":null,"work_id":"07413ad9-d61b-469f-bdaf-4f4eb6ad09d2","year":2024},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.324740Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:248eb8c04f6b46a1adb79e8e5c8d2e2ce6cff861e0204d20fc76a2c7fda9e843","observation_id":"76e4facf-edc7-46e5-9cd3-f7988ef103ec","resolution":{"observed_at":"2026-08-06T22:54:32.665206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:32.379453Z","title":null,"venue":null,"work_id":"ce54ff23-1fa3-4d7c-a104-0bcb3fa4caf1","year":2009},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.454941Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:ac07be7388c95843a0bcab3a599ca15c4bb23bf9c0ebd126270d2ea740ede16e","observation_id":"928a19ae-696b-48a2-bcd8-5225fa208a13","resolution":{"observed_at":"2026-08-06T22:54:32.486272Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:32.198271Z","title":"Optimized data rate allocation for dynamic sensor fusion over resource constrained com- munication networks,","venue":null,"work_id":"d50d7bc4-048b-4bed-892c-4675d982c920","year":2023},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.519783Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:1f07c4a77c08aad87e8d19d2f8874de06b344a9e9a942827ea4bf5bfaf0b0ed5","observation_id":"fe06be33-f7a6-4b3a-9964-e72469569672","resolution":{"observed_at":"2026-08-06T22:54:32.283398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:32.047499Z","title":"Semidefinite programming approach to Gaussian sequential rate-distortion trade-offs,","venue":null,"work_id":"90f2cfcc-04f8-4431-b5cd-c3a910761abe","year":1910},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.598467Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:d4fd83c559061117f26313d26e16c964dd13368f44b15234e3a0b06ac936648a","observation_id":"ba25f195-fa6b-4f87-ad41-175f6ddf5b8a","resolution":{"observed_at":"2026-08-06T22:54:32.130674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:31.910967Z","title":"Determinant maximization with linear matrix inequality constraints,","venue":null,"work_id":"0f3c8479-dca2-4238-8d77-3976663efe3b","year":1998},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.706029Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:5b726566a76d69bd72dbb20d25dcfecf1abcdef15c7b81031f5bf28ad508b265","observation_id":"dd51ff63-91b8-4d0e-8691-b9a832b79710","resolution":{"observed_at":"2026-08-06T22:54:31.976607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:31.703499Z","title":null,"venue":null,"work_id":"215f8b36-0c0a-44df-a5b9-61bd35309608","year":1950},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.794391Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:c1036ef3f6cc73dcd72aaf0a3f27df2236a77bae81f66117bb500e72b2f20048","observation_id":"2139b57c-db0b-43e6-9b2f-1e6c6e24497f","resolution":{"observed_at":"2026-08-06T22:54:31.788496Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:31.558594Z","title":"Digital Terrain Models (DTMs), Map: DTEEC 041277 2115 040776 2115 A01,","venue":null,"work_id":"0e7621c6-aa30-4081-91b1-16421252b5ff","year":2024},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.884902Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:1c214105ad97621df9f1299e8d0ba57cbdff42c20909d263236f2a15be35ef49","observation_id":"73b86e43-bde9-46a3-9ab1-c6dbf698a5d4","resolution":{"observed_at":"2026-08-06T22:54:31.619510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:54:31.333111Z","title":null,"venue":null,"work_id":"6a0ff30f-04ca-4a47-b7ac-4fa0ea9f346d","year":1998},"citing_paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:54:30.971584Z"},"links":{"citing_paper":"/paper/2506.20579"},"observation_digest":"sha256:b311776928666173e6fc8ba62700c3a73eb591fccaca7a194024b471664000f4","observation_id":"afa90646-d8c4-49d9-8f70-1e00e6a2978a","resolution":{"observed_at":"2026-08-06T22:54:31.416047Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.20579","last_updated":"2025-06-25T16:14:17Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-13T05:37:26.649807Z","submitted_at":"2025-06-25T16:14:17Z","title":"Communication-Aware Map Compression for Online Path-Planning: A Rate-Distortion Approach"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":30},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2506.20579."}