{"as_of":"2026-08-20T04:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1877e1e83a52f2478becba1f72fe112d81c6e41d5cb5a063f57d0f8c03d6cb6a","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:58:55.179531Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2608.13226/citation-record","integrity":"/paper/2608.13226/integrity","json":"/paper/2608.13226/citation-record.json","paper":"/paper/2608.13226"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:55.019132Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.019132Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:c24807a658ac6414a8599702fbbb7115cec1eeb333629dfe7fc28896a3389627","observation_id":"3f9627fd-1b87-4842-8d8e-e6f15f5f6d9f","resolution":{"observed_at":"2026-08-14T15:58:55.019132Z","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-08-14T15:58:55.023433Z","title":"In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.023433Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:e94c73a3558fadc490e13452f0bdd879e70a96e2aa3ae1136ba823659e06db81","observation_id":"b971f579-c396-4e10-9fd7-f3c501a25091","resolution":{"observed_at":"2026-08-14T15:58:55.023433Z","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-14T15:58:55.757448Z","title":"In: The Fourteenth International Conference on Learning Representations","venue":null,"work_id":"b3b1a7ec-8ece-4076-8b29-019fe885ffd4","year":null},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.028285Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:7136d575faa0a00f4c351dbb8cc9350be19ff4dc4a883c53535450b40506452c","observation_id":"ca6ea6cd-418d-4213-9d23-983dd4464a83","resolution":{"observed_at":"2026-08-14T15:58:55.761250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12966","last_updated":"2023-10-13T02:41:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-08-24T17:59:17Z","title":"Qwen-VL: A Versatile Vision-Language Model for Understanding, Localization, Text Reading, and Beyond","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12966","snapshot_observed_at":"2026-08-14T15:58:55.032344Z","title":"arXiv preprint arXiv:2308.129661(2), 3 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.032344Z"},"links":{"cited_paper":"/paper/2308.12966","citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:72771ee42f02b659bfdc463d3e04b9227cd453d944f3206c3d12a485496a0194","observation_id":"4834885b-2908-4c6c-97d2-d2370e4a048e","resolution":{"observed_at":"2026-08-14T15:58:55.032344Z","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-08-14T15:58:55.037127Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.037127Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:0bee051d193b7d1091c8a547c9c96280bbae1a53b45097f72145e3ead5c5a70d","observation_id":"5ad0755e-83c8-4420-9614-51428c6ca2a7","resolution":{"observed_at":"2026-08-14T15:58:55.037127Z","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-08-14T15:58:55.041160Z","title":"In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.041160Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:67931b3999c002356a9d234e8a42c86e9b2e9bfe094f0968ceafcefbb7f2dd68","observation_id":"adc1daa7-44f5-436b-9c9a-b0d8b55bb65e","resolution":{"observed_at":"2026-08-14T15:58:55.041160Z","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-14T15:58:55.737938Z","title":"In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H","venue":null,"work_id":"8745d73d-d61b-4c05-aec4-e3a700410c29","year":2020},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.045923Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:792838a3a6c5fab8b72e5905750ed7af340fe1f1ef0a7fdc6a4f5d07d2101880","observation_id":"b5b04ef7-1360-4bdd-b681-b65e917a2406","resolution":{"observed_at":"2026-08-14T15:58:55.742152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.049896Z","title":"In: European Conference on Computer Vision","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.049896Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:be408aa24b4343fe2c138a76e58ab0ca625b6dbf30976fa5ca0e4044123ad4e8","observation_id":"67841b58-8956-4f2d-87a1-cbe7cbf0fe20","resolution":{"observed_at":"2026-08-14T15:58:55.049896Z","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-08-14T15:58:55.053434Z","title":"arXiv preprint arXiv:2510.13800 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.053434Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:b66088e4acdad9f359a3fca19c9c33b25c9765535bd496b582e02c2ffc5ab147","observation_id":"454b10d6-bf25-4a7e-a2a9-5e26b7177622","resolution":{"observed_at":"2026-08-14T15:58:55.053434Z","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-14T15:58:55.720974Z","title":"In: Proceedings of the IEEE/CVF Conference on Com- puter Vision and Pattern Recognition","venue":null,"work_id":"65454c4f-a59e-4cd9-a4ae-6cca08c69fa5","year":2021},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.057042Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:24ca730a00b331512ad31de48c57110451ad5f67e320fe456d5a3cf4b2153037","observation_id":"cb8bcfe2-d670-430e-a066-87fe4d316b9b","resolution":{"observed_at":"2026-08-14T15:58:55.724630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.060737Z","title":"arXiv preprint arXiv:2509.13317 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.060737Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:a7b78d874926f819e849ad2c27ef0736a7a81f90d7776f90e45a9579f48e8aae","observation_id":"32a4f65d-ca3d-4398-8ab0-8527eab2761f","resolution":{"observed_at":"2026-08-14T15:58:55.060737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06261","last_updated":"2025-12-19T14:25:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-07T17:36:04Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.06261","snapshot_observed_at":"2026-08-14T15:58:55.065015Z","title":"arXiv preprint arXiv:2507.06261 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.065015Z"},"links":{"cited_paper":"/paper/2507.06261","citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:c6a7e1881b97818efcc3ae0b31734d5fe7b53e1b86c49a79aed56e6a65f54ae0","observation_id":"3dfc0935-cb73-42fa-b1ff-5d0bf2e6414f","resolution":{"observed_at":"2026-08-14T15:58:55.065015Z","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-08-14T15:58:55.069564Z","title":"Ad- vances in neural information processing systems26(2013)","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.069564Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:7ccf58db3937a3e80e0b053222c7083b006cd95b4743a6b11f0df3ea7bc79ef9","observation_id":"ec90e317-22df-4800-bf08-653f4703540d","resolution":{"observed_at":"2026-08-14T15:58:55.069564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20279","last_updated":"2026-04-21T02:48:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-26T17:56:30Z","title":"VLM-3R: Vision-Language Models Augmented with Instruction-Aligned 3D Reconstruction","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20279","snapshot_observed_at":"2026-08-14T15:58:55.073086Z","title":"arXiv preprint arXiv:2505.20279 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.073086Z"},"links":{"cited_paper":"/paper/2505.20279","citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:500529a89f1d5e4bb679b7d31490236c5a9bc66485b22381afd1707ae31668f7","observation_id":"e92a1bc7-cc7c-476d-85dc-3b045f448f0c","resolution":{"observed_at":"2026-08-14T15:58:55.073086Z","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-14T15:58:55.702880Z","title":"In: The Thirty-ninth Annual Conference on Neural Information Processing Systems Datasets and Benchmarks Track","venue":null,"work_id":"ef4312c1-17af-4d26-8d35-1319155b0f32","year":null},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.077029Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:7a0bc7268f3836bb921cb07bc2305084f8e050145f35f9f6f26f225e63276a7b","observation_id":"14a02461-34f1-46c4-9d8b-42c5252eb25d","resolution":{"observed_at":"2026-08-14T15:58:55.706853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.691687Z","title":"In: European Conference on Computer Vision","venue":null,"work_id":"a78c137e-b2a1-4b41-9188-eaaaefd25f3d","year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.080834Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:96a4cb6e001659007ae0d041b278c8228bcfdef90a3ae5757c3c23b7276f8e58","observation_id":"59980a3f-a89e-4bdb-8732-99e6ec4aa416","resolution":{"observed_at":"2026-08-14T15:58:55.695282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.085407Z","title":"In: Dong, Y., Kourtellis, N., Hammer, B., Lozano, J.A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.085407Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:8538be6ffaa90b5cec79e7504a0aa03045b7ebe81de05fe9c908feac9db17220","observation_id":"c6af7912-6d7d-49f7-8f66-b8db523e3c61","resolution":{"observed_at":"2026-08-14T15:58:55.085407Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:55.680754Z","title":"In: 2025 IEEE/RSJ International Conference on Intel- ligent Robots and Systems (IROS)","venue":null,"work_id":"dffcaffe-c425-42b1-8835-d86e3f84505d","year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.089308Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:fd036e6cc121191de78167b6df6451885d1d8271c46f60af3bea0058a0f2a084","observation_id":"6b6f9e3a-aee7-442a-a08e-c64d7ad46dfc","resolution":{"observed_at":"2026-08-14T15:58:55.684427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.670460Z","title":"In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","venue":null,"work_id":"978a8ecd-da52-443c-8acb-4ecd0293d8d9","year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.093117Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:a5d9fc6267d7fd2e13446db194531d4a40b96b47fa50739bd80720454a045743","observation_id":"5f11a15c-46aa-4fc6-8ef0-7c974abd3be7","resolution":{"observed_at":"2026-08-14T15:58:55.674018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.659142Z","title":"In: European conference on computer vision","venue":null,"work_id":"93f391b3-7100-4b68-9de1-a2ddd46d0f65","year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.097431Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:d876f8491fd580032e4fa3f0e36c0bc189c94bfbdeda01625943612f1f507be8","observation_id":"7f509367-b415-421f-bc88-547511cead5d","resolution":{"observed_at":"2026-08-14T15:58:55.663309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v36i7.20671","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:58:55.212949Z","title":null,"venue":null,"work_id":"d58681ac-dbe0-4f30-9677-04fc59ba6492","year":2022},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.101333Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:7b789db0309fd1d3659211ac5a4862ed37abb1a4c9a7f4344561faa9309f4227","observation_id":"ab99f847-4727-4fd9-9fb7-26d8e302d926","resolution":{"observed_at":"2026-08-14T15:58:55.217443Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.648670Z","title":null,"venue":null,"work_id":"0cbc05b8-37e1-4fa1-a2ec-727b9c7eb0b3","year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.105131Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:aac7427cb008efcbd8a7f09f9da22891e548d87e75ef1c28fd5602bb34960db6","observation_id":"4a1cc49c-93d0-4d5c-a575-2c6074caa24c","resolution":{"observed_at":"2026-08-14T15:58:55.652255Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15428","last_updated":"2025-07-21T09:27:45Z","snapshot_observed_at":"2026-08-15T02:35:16.298968Z","submitted_at":"2025-07-21T09:27:45Z","title":"EgoPrune: Efficient Token Pruning for Egomotion Video Reasoning in Embodied Agent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.15428","snapshot_observed_at":"2026-08-14T15:58:55.108853Z","title":"arXiv preprint arXiv:2507.15428 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.108853Z"},"links":{"cited_paper":"/paper/2507.15428","citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:bc168bc8dca92d38a86c4bcae827a1a7f89bcc9b1ef9182996f3e046457fcec2","observation_id":"7e1b064c-2abf-4262-b3f7-472fbd2deffa","resolution":{"observed_at":"2026-08-14T15:58:55.108853Z","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-08-14T15:58:55.112671Z","title":"In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.112671Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:630e3b1f94f2d3642ac91b0499e4658242853188def04237e58bce0192e5e839","observation_id":"a0555558-143b-4749-ac71-c8e375371e99","resolution":{"observed_at":"2026-08-14T15:58:55.112671Z","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-14T15:58:55.630385Z","title":"International Journal of Computer Vision133(10), 6794–6812 (2025)","venue":null,"work_id":"c3b6aa2d-2b2d-49d2-a793-e421a452bb14","year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.117001Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:39dd5c5c15b383976547b58bb829ee324d845c3e5d6c838eaad503ddac2808f5","observation_id":"b4356a81-490e-4bc0-a188-20154b3c28a4","resolution":{"observed_at":"2026-08-14T15:58:55.634314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.120770Z","title":"In: Proceedings of the 2024 conference on empirical methods in natural language processing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.120770Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:38074a436b5f17002719c09d7abb1edf50774e0a8af9a9cab444bafdcb9ab4f3","observation_id":"657325aa-c0f1-4982-b5d6-e38b2c16e3b3","resolution":{"observed_at":"2026-08-14T15:58:55.120770Z","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-14T15:58:55.612514Z","title":"In: Proceedings of the AAAI Conference on Artificial Intelligence","venue":null,"work_id":"ed79401c-d2fd-4132-9ed1-464e111a077c","year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.124322Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:cab7627d1a0dcf24eaf44591e2046d8e3868f3eb9f489e7c2833fe1f198bd60f","observation_id":"a1a827a3-a7af-4768-a797-e1a8876e4c7b","resolution":{"observed_at":"2026-08-14T15:58:55.616419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.127741Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.127741Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:3e7be93d3f05c81b4eeec0fbc788a0ddb8b0d349a2d630cbd21d7a1375287ec0","observation_id":"6a575bfc-595b-4455-bae6-da1a898458bc","resolution":{"observed_at":"2026-08-14T15:58:55.127741Z","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-14T15:58:55.591897Z","title":"In: International Conference on Learning Representations (2023),https://openreview.net/forum?id=IDJx97BC38","venue":null,"work_id":"611519a4-0fd0-4dbb-b54f-e419867cd69d","year":2023},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.131529Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:11982fd4f8948db4a4811c79f2150672152407dd9ee591ff685230b6383b7b98","observation_id":"0fff0ccd-e4ed-403b-b882-ba3f5d390c8a","resolution":{"observed_at":"2026-08-14T15:58:55.595974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.134949Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.134949Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:7d8b260a80ef416d8e48e57cae556922294b03c71d19588597f6507366600ae3","observation_id":"d431ea09-639a-4a61-86e8-d20da65c5dc3","resolution":{"observed_at":"2026-08-14T15:58:55.134949Z","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-14T15:58:55.579873Z","title":"Morgan Kaufmann (2006)","venue":null,"work_id":"07903497-7584-4058-b568-64f378d78c67","year":2006},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.138700Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:43d2d7033447f8cf4312a2c3265baddf25c74b3bbfcedd19c126c70bc167db7a","observation_id":"190376d6-2b8b-4fe3-9b27-44ce4029e8f0","resolution":{"observed_at":"2026-08-14T15:58:55.584014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.569112Z","title":"In: The Thirty-ninth Annual Conference on Neural Information Processing Systems","venue":null,"work_id":"cfc21b90-9598-4168-85aa-cbf844f604be","year":null},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.142280Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:6b570ca71bf7a08f95b465e1d7ab76afdc5fd8b56a56e479b4a795e02050f9c7","observation_id":"2d08f45b-a0ca-4a3f-96fe-5fde6d11cd4e","resolution":{"observed_at":"2026-08-14T15:58:55.572922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.145822Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.145822Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:f7945074fe92f29dc7d4a904d398eb60221fe0acd72af666402a5b3b4f18ee7f","observation_id":"a9871c44-0dc4-4c03-8d95-e7afae2f01dc","resolution":{"observed_at":"2026-08-14T15:58:55.145822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12191","last_updated":"2024-10-03T15:54:49Z","snapshot_observed_at":"2026-08-06T05:35:29.109022Z","submitted_at":"2024-09-18T17:59:32Z","title":"Qwen2-VL: Enhancing Vision-Language Model's Perception of the World at Any Resolution","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12191","snapshot_observed_at":"2026-08-14T15:58:55.149086Z","title":"arXiv preprint arXiv:2409.12191 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.149086Z"},"links":{"cited_paper":"/paper/2409.12191","citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:a7e3d6a86f74b11cf5a9ca7b75e6ee4decd4cb01902a44e3c76f6dd8fed86873","observation_id":"aa6facae-c9b2-4f7f-9d2a-c2016dfecb38","resolution":{"observed_at":"2026-08-14T15:58:55.149086Z","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-14T15:58:55.552487Z","title":"In: The Thirty-ninth Annual Conference on Neural Information Processing Systems","venue":null,"work_id":"1669c2c0-46a4-4a60-88fe-3e1c60e2f8e4","year":null},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.153364Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:6a99aec537e1d94f292f58c0a6c85b21c7cf1823852f9f166054a320188acf7b","observation_id":"21557d12-eff0-4efc-9f45-528ada5921a1","resolution":{"observed_at":"2026-08-14T15:58:55.556174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.542035Z","title":"In: The Thirty-ninth Annual Conference on Neural Information Processing Systems","venue":null,"work_id":"6acba0e6-6e64-4ab2-afb6-ac53d7e89f79","year":null},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.156902Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:92f113e97bf8c464d4af9f0bd2b6c807f14b1353f7349ed27897f4b3ba7c3b1e","observation_id":"41cd4e1d-ad62-4c8c-9efc-ecd7f36d9d93","resolution":{"observed_at":"2026-08-14T15:58:55.545572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.531344Z","title":"Advances in Neural Information Pro- cessing Systems37, 28828–28857 (2024) 18 P","venue":null,"work_id":"00cba3cc-238f-4755-8f60-3f2199232240","year":2024},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.160895Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:748386e04b6d79a0ed84ab2aed6fc01c2fab168d5684a8ad9789d2448c235e2c","observation_id":"701dbf73-2a48-4f0a-bc71-587f917b6420","resolution":{"observed_at":"2026-08-14T15:58:55.535610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.164238Z","title":"In: Pro- ceedings of the Computer Vision and Pattern Recognition Conference","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.164238Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:c353e4a67d29c30778539ef52144f43c22a5e5cb7ac1cba0c799c4bd948a23ff","observation_id":"e0c0e691-2322-4d91-b65a-67bd32792aaa","resolution":{"observed_at":"2026-08-14T15:58:55.164238Z","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-08-14T15:58:55.168539Z","title":"In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.168539Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:d8ba1a766db7570abadfc1585221f3e33ce42b1eb8951a23cc094bf2840584fa","observation_id":"eb3cc088-6039-4e0c-b2f6-8ee4efea902e","resolution":{"observed_at":"2026-08-14T15:58:55.168539Z","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-14T15:58:55.509713Z","title":"In: International Conference on Machine Learning","venue":null,"work_id":"2777c383-e88b-4fc9-8484-812505876805","year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.172118Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:1566a0e860137ab8ff3a05b14f6c1c141dfccf3be424d1a8edbc79471efd9a16","observation_id":"877b0537-0152-4fca-a363-f07089a17698","resolution":{"observed_at":"2026-08-14T15:58:55.513311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.498747Z","title":"In: The Thirty-ninth Annual Conference on Neural Information Processing Systems","venue":null,"work_id":"21ad06b0-1b9d-4d7d-9078-cc37b5a675dd","year":null},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.175378Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:07fe0b2975c06872fca409f3fdd8d93ce0ed381e8d7027467dbdf74b763f2cbe","observation_id":"92afc919-6010-44b3-9394-32c546a223eb","resolution":{"observed_at":"2026-08-14T15:58:55.502560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T15:58:55.487710Z","title":"In: Proceedings of the IEEE/CVF International Conference on Computer Vision","venue":null,"work_id":"2513f6b8-d670-42ed-92ef-aebf02ee8a39","year":2025},"citing_paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:55.179531Z"},"links":{"citing_paper":"/paper/2608.13226"},"observation_digest":"sha256:067c81320b4baca70819d0ea7b5edf93de36d61c5f4a3818ba81fe412917e277","observation_id":"dd2b7737-0d48-47f3-8c2d-b3de4aaae1be","resolution":{"observed_at":"2026-08-14T15:58:55.491935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.13226","last_updated":"2026-08-13T13:29:15Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-20T03:05:56.624064Z","submitted_at":"2026-08-13T13:29:15Z","title":"CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":1,"verified_fuzzy":19},"total_outbound_references":42},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2608.13226."}