{"as_of":"2026-08-08T10:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77d4b7c5621d4e42ee6388bd8944777db218dd6ce0f3e2f64cd123ccd838403a","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:20:31.175344Z","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-07-04T15:59:57.424957Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-08-07T04:20:31.175344Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10967","last_updated":"2025-07-01T08:19:08Z","snapshot_observed_at":"2026-08-08T00:46:59.698739Z","submitted_at":"2025-06-12T17:59:09Z","title":"Beyond Attention or Similarity: Maximizing Conditional Diversity for Token Pruning in MLLMs","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T04:20:31.175344Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2506.10967"},"observation_digest":"sha256:98d806d538220aefb2ff43d9660997734aa51b2a67cb81d44f17903b2c877882","observation_id":"8e4ee5fe-b3d4-4fb5-864d-64b5088904fe","resolution":{"observed_at":"2026-08-07T04:20:31.175344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2604.07812","last_updated":"2026-04-09T05:09:22Z","snapshot_observed_at":"2026-08-02T06:27:25.025040Z","submitted_at":"2026-04-09T05:09:22Z","title":"HAWK: Head Importance-Aware Visual Token Pruning in Multimodal Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T17:20:19.653806Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2604.07812"},"observation_digest":"sha256:bd2c762e0254808de52068c1cbc3c5c1b0ed15e6d75180a8f4d70ae0b3c242bf","observation_id":"024ed357-3714-4cb4-b720-08028238635e","resolution":{"observed_at":"2026-05-11T07:01:06.116080Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2605.04075","last_updated":"2026-04-14T08:17:53Z","snapshot_observed_at":"2026-08-03T03:08:39.084770Z","submitted_at":"2026-04-14T08:17:53Z","title":"RetentiveKV: State-Space Memory for Uncertainty-Aware Multimodal KV Cache Eviction","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-10T15:29:17.567557Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2605.04075"},"observation_digest":"sha256:b33f595d1d5f60174971c801c249e8e13631859918cb629de2124ee5d7a0598f","observation_id":"d5a38039-ef7a-4bb5-92cf-1a675bbca74c","resolution":{"observed_at":"2026-05-11T10:26:02.138347Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2605.05899","last_updated":"2026-05-07T09:11:41Z","snapshot_observed_at":"2026-08-05T02:12:24.336765Z","submitted_at":"2026-05-07T09:11:41Z","title":"VisMMOE: Exploiting Visual-Expert Affinity for Efficient Visual-Language MoE Offloading","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-09T16:10:22.588945Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2605.05899"},"observation_digest":"sha256:8ad64ee5643bf6e99a34dc5374b71d7e98e35f93b7a6d3bbc6610a33e9541ac9","observation_id":"ca5aa4e9-997a-4e54-a2b7-e1df500d4ff6","resolution":{"observed_at":"2026-05-11T16:36:06.620346Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2605.19322","last_updated":"2026-05-19T04:02:01Z","snapshot_observed_at":"2026-08-02T06:11:11.606278Z","submitted_at":"2026-05-19T04:02:01Z","title":"DynaTok: Temporally Adaptive and Positional Bias-Aware Token Compression for Video-LLMs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T06:55:01.619441Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2605.19322"},"observation_digest":"sha256:9a16d35ce4a5ff3a0b5fc15bdce5c11c98e1e2f2879db3e06f0aaae65c23f2e4","observation_id":"e8bb49e9-c983-417c-b75d-cb3f87f50185","resolution":{"observed_at":"2026-05-20T06:58:06.004736Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2605.28051","last_updated":"2026-05-27T06:52:08Z","snapshot_observed_at":"2026-08-03T00:42:32.667278Z","submitted_at":"2026-05-27T06:52:08Z","title":"Beyond Surrogate Gradients: Fully Differentiable Token Pruning for Vision-Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T13:07:21.789901Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2605.28051"},"observation_digest":"sha256:5ea081a2de77a5c5ad70c8f95075785e80e592611886a2d9449dbc2b9b3f38d8","observation_id":"e37c1600-d6d6-4683-8888-1a566f0c04f9","resolution":{"observed_at":"2026-06-29T13:13:27.411246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2606.08156","last_updated":"2026-06-06T13:13:02Z","snapshot_observed_at":"2026-08-03T22:28:44.298960Z","submitted_at":"2026-06-06T13:13:02Z","title":"RAPID: Layer-Wise Redundancy-Aware Pruning and Importance-Driven Token Merging for Efficient ViT","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T19:46:23.188930Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2606.08156"},"observation_digest":"sha256:774805f9e9a0f23d78f71bed0aff596f309a3a729f32182a3f89990baadcb4a7","observation_id":"23ea4db1-ac06-4d3f-9fbd-9107811bef42","resolution":{"observed_at":"2026-07-02T21:27:24.487816Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2606.11576","last_updated":"2026-06-10T02:06:47Z","snapshot_observed_at":"2026-08-02T18:34:57.083557Z","submitted_at":"2026-06-10T02:06:47Z","title":"AVIS: Adaptive Test-Time Scaling for Vision-Language Models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-27T10:47:41.183211Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2606.11576"},"observation_digest":"sha256:9935b2ec68a333d51535dfb279bb16b6c4bdc06c3752367b660e2b59c4b26205","observation_id":"a1e3b4b9-1721-4539-9413-73f061516819","resolution":{"observed_at":"2026-07-03T08:17:45.886204Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2606.24156","last_updated":"2026-06-23T05:24:50Z","snapshot_observed_at":"2026-08-08T04:43:36.112271Z","submitted_at":"2026-06-23T05:24:50Z","title":"Accelerating Multimodal Large Language Models with Prior-Corrected Token Reduction","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T01:10:00.373247Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2606.24156"},"observation_digest":"sha256:b1e08362a91927780e5256a9dbd797d80192fe47aef5381bce9cd7d0b78d11a8","observation_id":"096ab6c4-a4bb-4e65-92ae-d45dcd9c0bb0","resolution":{"observed_at":"2026-07-04T15:59:56.757240Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2606.24165","last_updated":"2026-06-23T05:39:52Z","snapshot_observed_at":"2026-08-02T01:56:55.495306Z","submitted_at":"2026-06-23T05:39:52Z","title":"Spectral Evolution-Guided Token Pruning in Multimodal Large Language Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T01:04:20.802531Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2606.24165"},"observation_digest":"sha256:0b15a7f6946c9b40dbd9ec84e39a44edadc3b3d76b87ee2a1e0c59a5930c1736","observation_id":"8d76fb6d-49a5-45e0-8371-e81fbe9c6771","resolution":{"observed_at":"2026-07-04T15:59:57.426487Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":"2503.11549","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-07-04T15:59:57.424957Z","title":"Similarity-aware token pruning: Your vlm but faster","venue":null,"work_id":"ea8bff73-4c5f-498f-9fc2-0c1a010425c7","year":2025},"citing_paper":{"arxiv_id":"2606.27161","last_updated":"2026-06-25T15:29:37Z","snapshot_observed_at":"2026-08-04T02:05:59.242279Z","submitted_at":"2026-06-25T15:29:37Z","title":"TOPS: First-Principles Visual Token Pruning via Constructing Token Optimal Preservation Sets for Efficient MLLM Inference","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-26T04:24:38.917137Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2606.27161"},"observation_digest":"sha256:176f7089e5a9f3b2ad630c928306ef11d0c6f59827ece6a2d037f5bedb200c99","observation_id":"e38bd0a8-f4a2-43fc-8418-9115e89b8aa6","resolution":{"observed_at":"2026-07-04T14:09:53.804242Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-08-02T05:03:27.630859Z","title":"Similarity-aware token pruning: Your vlm but faster,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13500","last_updated":"2026-07-15T06:55:08Z","snapshot_observed_at":"2026-08-07T14:02:26.978919Z","submitted_at":"2026-07-15T06:55:08Z","title":"Attention-Free and Lightweight Token Reduction for Efficient Vision-Language Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:27.630859Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2607.13500"},"observation_digest":"sha256:44b41c73f8c87af1f2611447113c861d1b042bb271fff7f11ec8ceee776e3a2c","observation_id":"9774a8cb-bf6f-4697-814e-07c4097cb51e","resolution":{"observed_at":"2026-08-02T05:03:27.630859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-08-01T08:35:55.672675Z","title":"arXiv preprint arXiv:2503.11549 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21076","last_updated":"2026-07-23T09:08:57Z","snapshot_observed_at":"2026-08-07T17:22:43.277210Z","submitted_at":"2026-07-23T09:08:57Z","title":"C-PTQ: Fisher-weighted Channel-wise Sensitivity for Post-training Quantization of MLLMs","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T08:35:55.672675Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2607.21076"},"observation_digest":"sha256:322aca404176117dd08b6f41d3dcecf7382e938b2e60cd81c05e072c1b1e7fc6","observation_id":"6db57410-b9af-47f3-b175-37c0f9f2f26a","resolution":{"observed_at":"2026-08-01T08:35:55.672675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.11549","snapshot_observed_at":"2026-08-04T17:18:16.095066Z","title":"Similarity-aware token pruning: Your vlm but faster.arXiv preprint arXiv:2503.11549, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01985","last_updated":"2026-08-03T09:46:32Z","snapshot_observed_at":"2026-08-07T19:51:18.997802Z","submitted_at":"2026-08-03T09:46:32Z","title":"DiffPrune: differentiable information throttling for token pruning in vision-language models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T17:18:16.095066Z"},"links":{"cited_paper":"/paper/2503.11549","citing_paper":"/paper/2608.01985"},"observation_digest":"sha256:259b37c7e8f9713b90acca3ed8dccb4f61d2349cc4c9bdfb11cd5ff4d7b2c740","observation_id":"acbe806f-1b20-4e4b-a766-b8adb443d60e","resolution":{"observed_at":"2026-08-04T17:18:16.095066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.11549/citation-record","integrity":"/paper/2503.11549/integrity","json":"/paper/2503.11549/citation-record.json","paper":"/paper/2503.11549"},"outbound":[],"paper":{"arxiv_id":"2503.11549","last_updated":"2025-03-14T16:12:23Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-07T17:03:30.811010Z","submitted_at":"2025-03-14T16:12:23Z","title":"Similarity-Aware Token Pruning: Your VLM but Faster"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:2503.11549."}