{"as_of":"2026-08-17T19:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4101ba48c434d5dda735a0c56d80826c6b17ccc291bb3f7a69a555b59d5e221b","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T03:50:32.524065Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.23046/citation-record","integrity":"/paper/2607.23046/integrity","json":"/paper/2607.23046/citation-record.json","paper":"/paper/2607.23046"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:50:32.261580Z","title":"In: Proceedings of the Computer Vision and Pattern Recognition Conference","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.261580Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:f2988ba88efd26756f7011d884c54cff647bd414e7eab49136009876114b94aa","observation_id":"16e403c6-ddf2-4aca-a116-d2781e29b806","resolution":{"observed_at":"2026-08-01T03:50:32.261580Z","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-01T03:50:32.267052Z","title":"In: Proceedings of the AAAI Conference on Artificial In- telligence","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.267052Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:de6a0e018e3dd1beefd30ce1db8e5862e7a4ee43e32d6f14f3a262cd1e2689de","observation_id":"78acec77-599f-4e94-870c-5afd40ee4170","resolution":{"observed_at":"2026-08-01T03:50:32.267052Z","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-01T03:50:32.271574Z","title":"In: The Fourteenth International Conference on Learning Representations (2026), https://openreview.net/forum?id=2NLkhPex1M","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.271574Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:0da2b0c0fc980555b6cbd4630246b27345878fb892491e821d0e9effef4e1551","observation_id":"44faedac-ef46-4808-aa4f-b7d358d52d94","resolution":{"observed_at":"2026-08-01T03:50:32.271574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13923","last_updated":"2025-02-19T18:00:14Z","snapshot_observed_at":"2026-08-14T04:17:22.593941Z","submitted_at":"2025-02-19T18:00:14Z","title":"Qwen2.5-VL Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13923","snapshot_observed_at":"2026-08-01T03:50:32.276280Z","title":"5-vl technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.276280Z"},"links":{"cited_paper":"/paper/2502.13923","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:4c12e9040428f629628b79afeedc4d89f61f664d01ea8492ac8329ba4b77418c","observation_id":"14de2fe4-b49e-407e-9ead-a800b46e34fd","resolution":{"observed_at":"2026-08-01T03:50:32.276280Z","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-01T03:50:32.281656Z","title":"In: Pro- ceedings of the IEEE/CVF International Conference on Computer Vision (ICCV)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.281656Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:7fa90d9b978aaaa0e657a04ec220d28e212e932506a98b078a6e4ac027f4b46d","observation_id":"b09ba6e7-23ca-4447-b025-060c7af20076","resolution":{"observed_at":"2026-08-01T03:50:32.281656Z","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-01T03:50:32.286382Z","title":"In: European Conference on Computer Vision","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.286382Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:4ddb849846c0fcecd63e24d3b2de82a243ab3ac9330de2b567ec09f14b4c121f","observation_id":"a774dfab-603b-466b-8c71-b259cf976c0b","resolution":{"observed_at":"2026-08-01T03:50:32.286382Z","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-01T03:50:32.291501Z","title":"In: CVPR (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.291501Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:dd253b2afd5b37888d7969980d5bc27a569fa514100243fbed834849ad37df91","observation_id":"d8679cfb-8a36-4403-848b-d66307f162a0","resolution":{"observed_at":"2026-08-01T03:50:32.291501Z","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-01T03:50:32.296094Z","title":"In: Proceedings of the IEEE conference on computer vision and pattern recognition","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.296094Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:b9dbd38f4038ea34cd8dddb21d5641ddb6ebb333686a321809eeb9239163808d","observation_id":"3c1ee93f-1018-41a4-8604-bfdb9dcd8984","resolution":{"observed_at":"2026-08-01T03:50:32.296094Z","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-01T03:50:32.300509Z","title":"In: Proceedings of the IEEE/CVF confer- ence on computer vision and pattern recognition","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.300509Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:9b95504d7d496d887f488b0a73707427a6fa0e03194cd1d5fce32787fcc719db","observation_id":"e50737ea-5198-430b-8d13-64c18485bbcb","resolution":{"observed_at":"2026-08-01T03:50:32.300509Z","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-01T03:50:32.304913Z","title":"In: The Thirteenth International Conference on Learning Representations (2025),https: //openreview.net/forum?id=8EfxjTCg2k","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.304913Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:9d24ac36ca77243cebc2dde9481114cf9f60d28becc832aba53b327a64ad1b40","observation_id":"8ef83c9d-387d-4798-8a68-5678c57b27e5","resolution":{"observed_at":"2026-08-01T03:50:32.304913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-08-15T17:27:11.980940Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-01T03:50:32.309372Z","title":"arXiv preprint arXiv:2412.19437 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.309372Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:f3c5cde9f62fcbd49fcd2ee7371f605e5ddd505e2db73c0700f5e9535fbb1dfc","observation_id":"c7382f62-96bb-4f61-b61f-109f40e98f53","resolution":{"observed_at":"2026-08-01T03:50:32.309372Z","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-01T03:50:32.314104Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.314104Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:41de9307cbab4d457cd8428bb19c0ec211bb614e493547e937611013292c0a3b","observation_id":"278382e3-5eaf-4b75-9bbb-2ef940d4915c","resolution":{"observed_at":"2026-08-01T03:50:32.314104Z","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-01T03:50:32.420089Z","title":"Advances in neural information processing systems36, 34892–34916 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.420089Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:52101bd0bfef86140a091e985a1b7c0ca09a0aa172e616a977bbb36a80b8cf54","observation_id":"9163bf6c-9f5f-4149-b283-45105462b4a2","resolution":{"observed_at":"2026-08-01T03:50:32.420089Z","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-01T03:50:32.424720Z","title":"Advances in Neural Information Processing Systems 35, 2507–2521 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.424720Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:37af9b8f5307acf3b1b9f68d15438a0e9d40e2bed2abad320b2316a1068a60ec","observation_id":"8e8af1e2-81ce-4fc7-8c01-9cbfc788b0c0","resolution":{"observed_at":"2026-08-01T03:50:32.424720Z","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-01T03:50:32.429435Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.429435Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:432d6d25dc893527d494930e9c5f262b427eb9190ffc5bea4acb6c62d7f26698","observation_id":"ddee05e0-11b5-4d8b-b8f9-74efe2aec3ed","resolution":{"observed_at":"2026-08-01T03:50:32.429435Z","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-01T03:50:32.433938Z","title":"In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.433938Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:23784c5e6f6b19241ba9c6e71188f0a58f4edd3a1309514d174c34eebd8794be","observation_id":"86ca9960-9704-4085-986e-c435243d0380","resolution":{"observed_at":"2026-08-01T03:50:32.433938Z","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-01T03:50:32.438344Z","title":"In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.438344Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:24b9c846d28534502e1271d12898ea04eac5d11d399f949f57d22d450634c89f","observation_id":"adbd0a40-3709-4694-ac62-3568030a41e1","resolution":{"observed_at":"2026-08-01T03:50:32.438344Z","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-01T03:50:32.442680Z","title":"In: ICCV (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.442680Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:d6f1ff76ee669da80d47525620f0fd6f9b73157cf420cc89d5c50daebafce36f","observation_id":"b7a5085d-2480-4aaf-a988-21ef7fc0337f","resolution":{"observed_at":"2026-08-01T03:50:32.442680Z","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-01T03:50:32.447186Z","title":"In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.447186Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:8f719adf62e6a36fef8815ffa94098cd93c9bf87c4c89ee275612b8fd9a403e8","observation_id":"4d4f4ef8-bc1c-4a56-a888-e83bb70769b8","resolution":{"observed_at":"2026-08-01T03:50:32.447186Z","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-01T03:50:32.451535Z","title":"In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) Findings","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.451535Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:7c7ca8191dfe15befed7341f8cb5a70f911dc59148d18e87300e443c5cd8787e","observation_id":"b96abf7a-2a15-4a40-85ba-ee325407a5a4","resolution":{"observed_at":"2026-08-01T03:50:32.451535Z","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-01T03:50:32.455953Z","title":"In: The Fourteenth International Conference on Learning Representations (2026),https://openreview.net/forum?id=0zIcPe4CtY","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.455953Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:46159acab96a2fd29ccb1b90ebbbc8ea6555abcce2bb61647467a9223f6cc893","observation_id":"78a3f2e3-866f-4054-a6de-80fa72ab8459","resolution":{"observed_at":"2026-08-01T03:50:32.455953Z","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-01T03:50:32.460402Z","title":"arXiv preprint arXiv:2409.12191 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.460402Z"},"links":{"cited_paper":"/paper/2409.12191","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:06927df29f216e4f5ff82f18c4f10721e538c726c235d7df0e6cfe9cb6e8b65d","observation_id":"e656d4cb-e425-4b01-ac88-0c82304b327f","resolution":{"observed_at":"2026-08-01T03:50:32.460402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11494","last_updated":"2025-06-08T08:35:58Z","snapshot_observed_at":"2026-08-16T12:57:51.270833Z","submitted_at":"2025-02-17T06:56:28Z","title":"Stop Looking for Important Tokens in Multimodal Language Models: Duplication Matters More","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11494","snapshot_observed_at":"2026-08-01T03:50:32.465130Z","title":"arXiv preprint arXiv:2502.11494 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.465130Z"},"links":{"cited_paper":"/paper/2502.11494","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:aeb0006b1c894e8005c096c6ae48eded1060cae95a3b67db362c250330d9e4f7","observation_id":"a41a2e29-286a-4b6b-aedb-4eb71454165f","resolution":{"observed_at":"2026-08-01T03:50:32.465130Z","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-01T03:50:32.469739Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.469739Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:286845fba09cf38179ea1f00112f8349f4127e094d0a32ca3b12d09c5847c5fa","observation_id":"ccff5abe-c5b7-475d-baa5-88044d7c4319","resolution":{"observed_at":"2026-08-01T03:50:32.469739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17247","last_updated":"2025-02-27T11:16:33Z","snapshot_observed_at":"2026-08-12T14:42:48.682739Z","submitted_at":"2024-10-22T17:59:53Z","title":"PyramidDrop: Accelerating Your Large Vision-Language Models via Pyramid Visual Redundancy Reduction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.17247","snapshot_observed_at":"2026-08-01T03:50:32.474118Z","title":"arXiv preprint arXiv:2410.17247 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.474118Z"},"links":{"cited_paper":"/paper/2410.17247","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:bf42649e49cb7b17249ac6f884f5e25806ae8337fb6f724ca9aeb697f05e62b5","observation_id":"927f931a-2ec1-4eed-b173-b312efb8a3c1","resolution":{"observed_at":"2026-08-01T03:50:32.474118Z","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-01T03:50:32.478897Z","title":"In: Proceedings of the Com- puter Vision and Pattern Recognition Conference","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.478897Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:5b32889fca1a57d1b771bcbd1ada8efa74e6ac563142dc3fa4d90df6552b506e","observation_id":"cfa712b6-70bf-4991-9366-e577e68ac768","resolution":{"observed_at":"2026-08-01T03:50:32.478897Z","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-01T03:50:32.483581Z","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":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.483581Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:cf134231ff3979a6a93e16939c3838bf52344e887c56dc49d8fd6b272211b19e","observation_id":"593157de-dd33-4ea8-acb8-a091da2ecb93","resolution":{"observed_at":"2026-08-01T03:50:32.483581Z","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-01T03:50:32.488129Z","title":"National Science Review11(12), nwae403 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.488129Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:febc00f7f0cafc2c44c0df2b37e6df264c2363600c16862ec2cebf7de86e0e19","observation_id":"a961a45b-9f44-44c6-955b-f1fd2be3bb81","resolution":{"observed_at":"2026-08-01T03:50:32.488129Z","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-01T03:50:32.492609Z","title":"In: Proceed- ings of the AAAI Conference on Artificial Intelligence (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.492609Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:1f3f0edcf94fba5a8fdc827f90c1ef07736b4eeadbcc2a6e477a88e60608cbd9","observation_id":"3ce1d3dd-d1fa-486e-a7a6-6931f65ea1a9","resolution":{"observed_at":"2026-08-01T03:50:32.492609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01818","last_updated":"2025-05-11T17:45:02Z","snapshot_observed_at":"2026-08-17T07:14:12.508584Z","submitted_at":"2024-12-02T18:57:40Z","title":"Beyond Text-Visual Attention: Exploiting Visual Cues for Effective Token Pruning in VLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01818","snapshot_observed_at":"2026-08-01T03:50:32.497038Z","title":"arXiv preprint arXiv:2412.01818 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.497038Z"},"links":{"cited_paper":"/paper/2412.01818","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:7ef80fd9628343c5aee7d042461e1e9171b634985bcee122237e3fecd6e03744","observation_id":"31e0ae82-63bd-4e86-aa8f-789c4ea6cec9","resolution":{"observed_at":"2026-08-01T03:50:32.497038Z","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-01T03:50:32.501753Z","title":"arXiv e-prints pp","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.501753Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:0929ba0c8d841a3184c8c5e2571c8198921510cb17e29ce4891bbd81cd87dbb8","observation_id":"4c72ec6a-35df-4a07-81c6-bd1faadfce0c","resolution":{"observed_at":"2026-08-01T03:50:32.501753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10967","last_updated":"2025-07-01T08:19:08Z","snapshot_observed_at":"2026-08-15T12:04:12.375959Z","submitted_at":"2025-06-12T17:59:09Z","title":"Beyond Attention or Similarity: Maximizing Conditional Diversity for Token Pruning in MLLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10967","snapshot_observed_at":"2026-08-01T03:50:32.506198Z","title":"arXiv preprint arXiv:2506.10967 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.506198Z"},"links":{"cited_paper":"/paper/2506.10967","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:f78f821af322527aaef845a6712e6923ab70d4fad4e612ac555346b17d70957d","observation_id":"1d712359-c0ab-48d8-8081-4f12ab56b5ef","resolution":{"observed_at":"2026-08-01T03:50:32.506198Z","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-01T03:50:32.510683Z","title":"In: International Conference on Machine Learning (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.510683Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:e4a7934ca6968ccd579d6f757b2f4c454ba5016f5f05c934e61d99d8fb6e5c9e","observation_id":"c480d6cf-48c6-4f09-ba37-13162da7c9cc","resolution":{"observed_at":"2026-08-01T03:50:32.510683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02713","last_updated":"2025-08-01T16:40:14Z","snapshot_observed_at":"2026-08-02T12:24:31.329178Z","submitted_at":"2024-10-03T17:36:49Z","title":"LLaVA-Video: Video Instruction Tuning With Synthetic Data","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02713","snapshot_observed_at":"2026-08-01T03:50:32.515082Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.515082Z"},"links":{"cited_paper":"/paper/2410.02713","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:02fe2f33b98c56a498f5825493e4631357e0b44ba651e5062594c032d5c86c04","observation_id":"db71024b-2b65-431a-8028-241d0398ca8f","resolution":{"observed_at":"2026-08-01T03:50:32.515082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04264","last_updated":"2025-01-01T15:53:58Z","snapshot_observed_at":"2026-08-03T20:38:36.602554Z","submitted_at":"2024-06-06T17:09:32Z","title":"MLVU: Benchmarking Multi-task Long Video Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04264","snapshot_observed_at":"2026-08-01T03:50:32.519587Z","title":"arXiv preprint arXiv:2406.04264 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.519587Z"},"links":{"cited_paper":"/paper/2406.04264","citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:8ae3c58a8cc505f3de7e848cf682e93d53d719709226b2cb44e7dd540d10f661","observation_id":"23bfea47-1ecb-423d-8aba-0cd14551af12","resolution":{"observed_at":"2026-08-01T03:50:32.519587Z","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-01T03:50:32.524065Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T03:50:32.524065Z"},"links":{"citing_paper":"/paper/2607.23046"},"observation_digest":"sha256:7e7666f3e2efc2087ce8179d7903dc98af59e8ec1b67df48387598ebe9ea0265","observation_id":"529ad669-1c02-4a53-8ccc-ea86bda63ee5","resolution":{"observed_at":"2026-08-01T03:50:32.524065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23046","last_updated":"2026-07-25T05:08:22Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-12T14:43:41.179970Z","submitted_at":"2026-07-25T05:08:22Z","title":"Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":36},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.23046."}