{"as_of":"2026-08-08T01:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:028af3a22d3e70d5eacfd4f9415af116bc42b3bf7533ede58fdb983ed8501ab0","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:15:12.577103Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T06:33:36.846345Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T06:34:40.990815Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"cited_work":{"arxiv_id":"2505.15816","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15816","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tokensarenotequal: Token-levelreinforcementlearningforefficientreasoning.arXiv preprint","venue":null,"work_id":"f5f478e8-07ce-4a69-8220-cc82ac957a2a","year":2025},"citing_paper":{"arxiv_id":"2605.22138","last_updated":"2026-05-21T08:11:54Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T08:11:54Z","title":"Efficient Agentic Reasoning Through Self-Regulated Simulative Planning","version":1},"reference_index":108,"source":"pdf_text","source_observed_at":"2026-05-22T06:33:36.846345Z"},"links":{"cited_paper":"/paper/2505.15816","citing_paper":"/paper/2605.22138"},"observation_digest":"sha256:34ff7e2fef8b3b6cf2cc41854f50d76694cbcf99fff7d2670ff808459a8a65c3","observation_id":"f2b7f28a-61ff-4f35-b0ed-ca024f3c5c1b","resolution":{"observed_at":"2026-05-22T06:34:40.992784Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15816/citation-record","integrity":"/paper/2505.15816/integrity","json":"/paper/2505.15816/citation-record.json","paper":"/paper/2505.15816"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.14219","last_updated":"2024-08-30T21:17:17Z","snapshot_observed_at":"2026-07-06T18:03:47.096406Z","submitted_at":"2024-04-22T14:32:33Z","title":"Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14219","snapshot_observed_at":"2026-08-07T15:15:10.474248Z","title":"A., Bach, N., Bahree, A., Bakhtiari, A., Bao, J., Behl, H., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:10.474248Z"},"links":{"cited_paper":"/paper/2404.14219","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:08f914d318ec9104aaa8ef3833328fcec50fb170ab18cc0cfb98c88158ff73c2","observation_id":"8fc6bbe7-7958-4e92-bd2d-706296eb87c7","resolution":{"observed_at":"2026-08-07T15:15:10.474248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08691","last_updated":"2023-07-17T17:50:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-17T17:50:36Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08691","snapshot_observed_at":"2026-08-07T15:15:10.862879Z","title":"Flashattention-2: Faster attention with bet- ter parallelism and work partitioning.arXiv preprint arXiv:2307.08691,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:10.862879Z"},"links":{"cited_paper":"/paper/2307.08691","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:245b6406e368e33973964f4db64659a0bdfa55201659387fee5b117f24e623a6","observation_id":"8d8a034f-3e83-4553-b13a-e6c2bf8d0a3d","resolution":{"observed_at":"2026-08-07T15:15:10.862879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19092","last_updated":"2024-07-07T17:06:59Z","snapshot_observed_at":"2026-07-06T18:22:01.301152Z","submitted_at":"2024-05-29T13:54:12Z","title":"Benchmarking and Improving Detail Image Caption","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19092","snapshot_observed_at":"2026-08-07T15:15:10.933843Z","title":"Benchmarking and improving detail image caption","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:10.933843Z"},"links":{"cited_paper":"/paper/2405.19092","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:60afac6b7c47d177af465ba7dd1c471239c8e1c76eebe68b87fd4b5f7e09ef98","observation_id":"a33f1fad-b67d-4fe2-9011-183d95200ed5","resolution":{"observed_at":"2026-08-07T15:15:10.933843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T15:15:11.001417Z","title":"The llama 3 herd of models.arXiv preprint arXiv:2407.21783,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.001417Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:9d4fe86708661251f29710a90283fc055944163f3fdaea11c07e1efbd6793aca","observation_id":"f6891c77-ab35-42fa-b24e-ef3c1e9f02e6","resolution":{"observed_at":"2026-08-07T15:15:11.001417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13180","last_updated":"2025-07-31T22:51:46Z","snapshot_observed_at":"2026-08-08T00:47:16.263621Z","submitted_at":"2024-12-17T18:56:50Z","title":"Feather the Throttle: Revisiting Visual Token Pruning for Vision-Language Model Acceleration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13180","snapshot_observed_at":"2026-08-07T15:15:11.049280Z","title":"Feather the throt- tle: Revisiting visual token pruning for vision-language model acceleration.arXiv preprint arXiv:2412.13180,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.049280Z"},"links":{"cited_paper":"/paper/2412.13180","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:f367e5e8cf9e5ba6a2351588cc8577ef583d1185acedc1e56e3d1035b713bf8a","observation_id":"94df1105-1a71-4884-8784-4d314371a3d8","resolution":{"observed_at":"2026-08-07T15:15:11.049280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.13394","last_updated":"2025-10-24T02:45:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-23T09:22:36Z","title":"MME: A Comprehensive Evaluation Benchmark for Multimodal Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.13394","snapshot_observed_at":"2026-08-07T15:15:11.166214Z","title":"Mme: A comprehen- sive evaluation benchmark for multimodal large language models.arXiv preprint arXiv:2306.13394,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.166214Z"},"links":{"cited_paper":"/paper/2306.13394","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:9375a3550c431890cee31990eae6d483107ea0ceaccc2572a01cde60f90566b8","observation_id":"d2b73828-db75-412c-864a-12046d6b3fda","resolution":{"observed_at":"2026-08-07T15:15:11.166214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01801","last_updated":"2024-10-29T18:26:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-03T05:17:08Z","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01801","snapshot_observed_at":"2026-08-07T15:15:11.230877Z","title":"Model tells you what to discard: Adaptive kv cache compression for llms.arXiv preprint arXiv:2310.01801,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.230877Z"},"links":{"cited_paper":"/paper/2310.01801","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:6294ebc7bd62c14266dad0c23d1089fa947f93d0925d2314202f61aafdb6b25e","observation_id":"1ec9bd7f-f068-49cd-898b-b626a761f3dc","resolution":{"observed_at":"2026-08-07T15:15:11.230877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08584","last_updated":"2024-12-18T07:45:11Z","snapshot_observed_at":"2026-07-06T19:31:40.352383Z","submitted_at":"2024-10-11T07:24:21Z","title":"ZipVL: Efficient Large Vision-Language Models with Dynamic Token Sparsification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08584","snapshot_observed_at":"2026-08-07T15:15:11.315553Z","title":"Zipvl: Efficient large vision-language models with dynamic token sparsification and kv cache compression.arXiv preprint arXiv:2410.08584,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.315553Z"},"links":{"cited_paper":"/paper/2410.08584","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:86353f3ce365f554946f2137a2f373acac57f9914ef884ebab23e4c9ab1e04b8","observation_id":"94b725be-4ed1-45d0-8108-8c76e00512fb","resolution":{"observed_at":"2026-08-07T15:15:11.315553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12895","last_updated":"2024-03-19T16:48:40Z","snapshot_observed_at":"2026-08-07T02:52:27.054968Z","submitted_at":"2024-03-19T16:48:40Z","title":"mPLUG-DocOwl 1.5: Unified Structure Learning for OCR-free Document Understanding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12895","snapshot_observed_at":"2026-08-07T15:15:11.437146Z","title":"mplug-docowl 1.5: Unified structure learning for ocr-free document under- standing.arXiv preprint arXiv:2403.12895,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.437146Z"},"links":{"cited_paper":"/paper/2403.12895","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:a200e3523fa4287ad438a865c3c0d48f6bd4291fe3e8790b18925f695e9efda6","observation_id":"196ae3f1-9380-4d33-b451-9513513ea221","resolution":{"observed_at":"2026-08-07T15:15:11.437146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.16125","last_updated":"2023-08-02T08:02:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-30T04:25:16Z","title":"SEED-Bench: Benchmarking Multimodal LLMs with Generative Comprehension","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.16125","snapshot_observed_at":"2026-08-07T15:15:11.683559Z","title":"Seed-bench: Benchmarking multimodal llms with gener- ative comprehension.arXiv preprint arXiv:2307.16125, 2023a","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.683559Z"},"links":{"cited_paper":"/paper/2307.16125","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:8dbaa3a1e26cb446066f0be7982e5769f20f2c5c91131790c39f6757cd3c4df8","observation_id":"4a86901b-42a9-4789-a6b3-f2f91fcd9c1f","resolution":{"observed_at":"2026-08-07T15:15:11.683559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11795","last_updated":"2025-04-06T18:52:08Z","snapshot_observed_at":"2026-08-04T05:24:14.383678Z","submitted_at":"2024-08-21T17:36:37Z","title":"EE-MLLM: A Data-Efficient and Compute-Efficient Multimodal Large Language Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11795","snapshot_observed_at":"2026-08-07T15:15:11.721014Z","title":"Ee-mllm: A data-efficient and compute- efficient multimodal large language model.arXiv preprint arXiv:2408.11795,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.721014Z"},"links":{"cited_paper":"/paper/2408.11795","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:e3b9e6fe1b1db6be02fcc8857ac17d842ef3b1d2b9d57f0bf571bf834db7a8c0","observation_id":"0ab86f51-7054-440a-9b1d-2c94dd4b4332","resolution":{"observed_at":"2026-08-07T15:15:11.721014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18139","last_updated":"2024-06-26T07:44:24Z","snapshot_observed_at":"2026-08-04T06:27:25.663339Z","submitted_at":"2024-06-26T07:44:24Z","title":"LOOK-M: Look-Once Optimization in KV Cache for Efficient Multimodal Long-Context Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18139","snapshot_observed_at":"2026-08-07T15:15:11.922497Z","title":"Look-m: Look-once optimization in kv cache for efficient multimodal long-context inference","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.922497Z"},"links":{"cited_paper":"/paper/2406.18139","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:b42684b4fd7c1dbe852c88cb6152c406338b2a47f254af0eff5dedaae539e419","observation_id":"e0eeda1f-9f52-4ae6-9519-2ecb36638b25","resolution":{"observed_at":"2026-08-07T15:15:11.922497Z","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-07T15:15:11.997946Z","title":"Qwen2-vl: Enhancing vision-language model’s perception of the world at any resolution.arXiv preprint arXiv:2409.12191,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.997946Z"},"links":{"cited_paper":"/paper/2409.12191","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:25cc01f56d27fea47eb1fe0af8273b243b36991e15903579c665ba6a6658b7dc","observation_id":"b2fbaa53-77e2-40d8-81f3-e9f1d92dd550","resolution":{"observed_at":"2026-08-07T15:15:11.997946Z","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-07-06T02:11:23.670680Z","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-07T15:15:12.085010Z","title":"Pyramid- drop: Accelerating your large vision-language models via pyramid visual redundancy reduction.arXiv preprint arXiv:2410.17247,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:12.085010Z"},"links":{"cited_paper":"/paper/2410.17247","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:bf020138c79fafc45a3a15857ab9167dd29a8b0e952a52b7a970f5040b2118fb","observation_id":"176cf2c9-49f7-4d31-8b89-614b50ad2a88","resolution":{"observed_at":"2026-08-07T15:15:12.085010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10188","last_updated":"2024-12-13T02:32:06Z","snapshot_observed_at":"2026-08-05T14:57:53.592979Z","submitted_at":"2024-08-19T17:48:08Z","title":"LongVILA: Scaling Long-Context Visual Language Models for Long Videos","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10188","snapshot_observed_at":"2026-08-07T15:15:12.159249Z","title":"Longvila: Scaling long- context visual language models for long videos.arXiv preprint arXiv:2408.10188,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:12.159249Z"},"links":{"cited_paper":"/paper/2408.10188","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:83f9090575dcc369e7ad4d1f045f5252343458201a2935aeed02758dc1f74cf4","observation_id":"cccd9eeb-d8cc-44b5-a363-03d7c376bcdd","resolution":{"observed_at":"2026-08-07T15:15:12.159249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-07T15:15:12.191635Z","title":"Qwen2 technical report.arXiv preprint arXiv:2407.10671, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:12.191635Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:08c3844931bf8f1f8246a2212dc82658f47d89c72be3434c57b25b96d55b7dff","observation_id":"4a2e253e-b2ae-4f1c-89e2-10eceb1764c8","resolution":{"observed_at":"2026-08-07T15:15:12.191635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16852","last_updated":"2024-07-01T02:59:29Z","snapshot_observed_at":"2026-08-07T09:52:45.942315Z","submitted_at":"2024-06-24T17:58:06Z","title":"Long Context Transfer from Language to Vision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16852","snapshot_observed_at":"2026-08-07T15:15:12.258703Z","title":"Long con- text transfer from language to vision.arXiv preprint arXiv:2406.16852, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:12.258703Z"},"links":{"cited_paper":"/paper/2406.16852","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:d4f0be2d98ad61dfea66843e97210db4eb299b021fe9af966643ee4a755f8a8a","observation_id":"c45523ae-bfe6-4356-b6b4-3f7ce6e92d7d","resolution":{"observed_at":"2026-08-07T15:15:12.258703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00556","last_updated":"2024-12-08T04:41:32Z","snapshot_observed_at":"2026-08-08T00:43:47.244767Z","submitted_at":"2024-11-30T18:54:32Z","title":"Accelerating Multimodal Large Language Models by Searching Optimal Vision Token Reduction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00556","snapshot_observed_at":"2026-08-07T15:15:12.354668Z","title":"N., and Yu, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:12.354668Z"},"links":{"cited_paper":"/paper/2412.00556","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:5f401b57f073857d073b3e620c3167c00336b9d77d405799f01dd9509cb9f81c","observation_id":"709f18f3-12eb-4ec6-8bff-aff98e463c23","resolution":{"observed_at":"2026-08-07T15:15:12.354668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03248","last_updated":"2025-07-29T08:19:36Z","snapshot_observed_at":"2026-07-06T20:01:32.313250Z","submitted_at":"2024-12-04T11:47:57Z","title":"AIM: Adaptive Inference of Multi-Modal LLMs via Token Merging and Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03248","snapshot_observed_at":"2026-08-07T15:15:12.434364Z","title":"Aim: Adaptive inference of multi-modal llms via token merging and pruning.arXiv preprint arXiv:2412.03248,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:12.434364Z"},"links":{"cited_paper":"/paper/2412.03248","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:4acfb20b15b9588ae61a6a84e52b1be67f09e2cd1c6f4351da352ea4df3ef527","observation_id":"f61d0b3a-33cc-4d09-9490-858863c934ec","resolution":{"observed_at":"2026-08-07T15:15:12.434364Z","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-07T15:15:13.532774Z","title":null,"venue":null,"work_id":"fdf2ac0c-0928-4de1-a9b3-6901a3902e29","year":2025},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:12.501855Z"},"links":{"citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:9432bac5d0944528235154845c0714fc0656804c1fddd95abb3eccfabdcd8912","observation_id":"bfd9234e-3dbf-4d97-8a2c-b8b439605a8a","resolution":{"observed_at":"2026-08-07T15:15:13.582959Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"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-07T15:15:13.217274Z","title":"Table 7.Evaluation on a comprehensive set of general multimodal benchmarks","venue":null,"work_id":"bf45434c-032a-4770-8856-007722611cfa","year":2021},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:12.577103Z"},"links":{"citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:d2f7b3614c8e3363c3ed8c1c28353322791a3bf0f1dd001364451db3965e31f0","observation_id":"5871d1eb-3091-4db2-ba61-b4acaf0125b4","resolution":{"observed_at":"2026-08-07T15:15:13.371875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04652","last_updated":"2024-12-05T22:47:17Z","snapshot_observed_at":"2026-08-06T19:54:11.611467Z","submitted_at":"2024-12-05T22:47:17Z","title":"Cross-Self KV Cache Pruning for Efficient Vision-Language Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04652","snapshot_observed_at":"2026-08-07T15:15:11.783480Z","title":"Cross-self kv cache pruning for efficient vision-language inference.arXiv preprint arXiv:2412.04652,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.783480Z"},"links":{"cited_paper":"/paper/2412.04652","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:58e3fca3cddc00edac716153929ed8fec53139f5e7118a4fb988e44e1e253d33","observation_id":"4251acff-7482-4f44-af19-847fd10a068c","resolution":{"observed_at":"2026-08-07T15:15:11.783480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01483","last_updated":"2024-11-15T06:31:44Z","snapshot_observed_at":"2026-07-06T18:08:56.480769Z","submitted_at":"2024-05-02T17:14:57Z","title":"MANTIS: Interleaved Multi-Image Instruction Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01483","snapshot_observed_at":"2026-08-07T15:15:11.612694Z","title":"Mantis: Interleaved multi-image instruction tuning.arXiv preprint arXiv:2405.01483, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.612694Z"},"links":{"cited_paper":"/paper/2405.01483","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:11faf21093f1cf42d4563cb542c2a1c760c535c52148b8d2ae50ac9b844a680d","observation_id":"c1cb8a37-0ca7-474e-885f-539cee6ae2e8","resolution":{"observed_at":"2026-08-07T15:15:11.612694Z","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-07T15:15:11.852764Z","title":"J., and Yan, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.852764Z"},"links":{"citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:a9f4e3db8893617bfc66c390082354a8165cad7745807b3431c40e0d25e19819","observation_id":"4daf7dd9-aab9-4b1e-9937-3369bc9fb644","resolution":{"observed_at":"2026-08-07T15:15:11.852764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17297","last_updated":"2024-03-26T00:53:24Z","snapshot_observed_at":"2026-08-02T11:10:24.263044Z","submitted_at":"2024-03-26T00:53:24Z","title":"InternLM2 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17297","snapshot_observed_at":"2026-08-07T15:15:10.553356Z","title":"Internlm2 technical report.arXiv preprint arXiv:2403.17297,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:10.553356Z"},"links":{"cited_paper":"/paper/2403.17297","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:bdd42ef01ee85aa7f1fb930ae49ef0a3c3e1311b450a23a8ff5140481770bfe3","observation_id":"75c46191-e6b4-40e8-a942-e0c02d96293f","resolution":{"observed_at":"2026-08-07T15:15:10.553356Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11402","last_updated":"2024-10-22T23:13:34Z","snapshot_observed_at":"2026-07-06T19:17:02.745056Z","submitted_at":"2024-09-17T17:59:06Z","title":"NVLM: Open Frontier-Class Multimodal LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.11402","snapshot_observed_at":"2026-08-07T15:15:10.736485Z","title":"Nvlm: Open frontier-class multimodal llms.arXiv preprint arXiv:2409.11402,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:10.736485Z"},"links":{"cited_paper":"/paper/2409.11402","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:402c8b48466d91df72d6698cf830ffb364caa474ba771889b674653228787ddc","observation_id":"8824895c-1718-43fe-88e5-984ba981523e","resolution":{"observed_at":"2026-08-07T15:15:10.736485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.20330","last_updated":"2024-04-09T15:17:50Z","snapshot_observed_at":"2026-08-07T12:15:30.838846Z","submitted_at":"2024-03-29T17:59:34Z","title":"Are We on the Right Way for Evaluating Large Vision-Language Models?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.20330","snapshot_observed_at":"2026-08-07T15:15:10.643408Z","title":"Are we on the right way for evaluating large vision-language models? arXiv preprint arXiv:2403.20330, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:10.643408Z"},"links":{"cited_paper":"/paper/2403.20330","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:4ec27ee3389d88fc6beb5ffcbdf4ea294ca4010510fcebe3fe62bd32b6ad9f70","observation_id":"519b9643-f2d2-4432-b1a8-638dcc103ef5","resolution":{"observed_at":"2026-08-07T15:15:10.643408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07167","last_updated":"2024-10-16T07:23:03Z","snapshot_observed_at":"2026-08-04T00:02:13.091348Z","submitted_at":"2024-10-09T17:59:04Z","title":"Deciphering Cross-Modal Alignment in Large Vision-Language Models with Modality Integration Rate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07167","snapshot_observed_at":"2026-08-07T15:15:11.527741Z","title":"Deciphering cross-modal alignment in large vision-language models with modality integration rate.arXiv preprint arXiv:2410.07167,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:11.527741Z"},"links":{"cited_paper":"/paper/2410.07167","citing_paper":"/paper/2505.15816"},"observation_digest":"sha256:b66d6b4d43377be682547f56d1ce5576dfe21174bfd03f2fb8021e3fca1c268f","observation_id":"d6970a0a-68eb-4b8b-8841-49d7ff231925","resolution":{"observed_at":"2026-08-07T15:15:11.527741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.15816","last_updated":"2025-05-21T17:59:52Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-08T00:44:22.305190Z","submitted_at":"2025-05-21T17:59:52Z","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":28},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:2505.15816."}