{"as_of":"2026-08-19T21:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dac99873ab3029ea39029bf5dee0738125654d5315fed8cb21b6cdb879fff178","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:24:22.892118Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2510.05544/citation-record","integrity":"/paper/2510.05544/integrity","json":"/paper/2510.05544/citation-record.json","paper":"/paper/2510.05544"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:24:18.637912Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:18.637912Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:c74ff1335691f8e1497e23f7996d4e76ce5f7b826e107052172cb5658e0df3f4","observation_id":"d0d1e160-f787-46b2-afe4-f8a51f0335e3","resolution":{"observed_at":"2026-08-04T11:24:18.637912Z","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-04T11:24:18.713611Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:18.713611Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:1d43d3a33dd8b1fb98d6bed178bb4f357e89651370455852bb8c10bfdff784c0","observation_id":"23cf64ab-08b4-41ef-b90c-59bdf871df09","resolution":{"observed_at":"2026-08-04T11:24:18.713611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-08-17T20:30:34.016254Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-04T11:24:18.798652Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:18.798652Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:7b2f53ab130fa0989a156178e85ec5a308371493d32d06252e1009f237da1b66","observation_id":"26055cd8-d25c-4d06-8d58-0e321548f1a3","resolution":{"observed_at":"2026-08-04T11:24:18.798652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15024","last_updated":"2024-02-09T17:59:40Z","snapshot_observed_at":"2026-08-16T14:24:10.346445Z","submitted_at":"2024-01-26T17:35:45Z","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15024","snapshot_observed_at":"2026-08-04T11:24:18.867014Z","title":"Croci, Marcelo Gennari do Nascimento, Torsten Hoefler, and James Hensman","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:18.867014Z"},"links":{"cited_paper":"/paper/2401.15024","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:de44d589ea9934ae23d42e9155333fbccf419ef597a85e998db3f3b71a329a7f","observation_id":"01ead0a4-d3a7-48ff-91d0-9d526fa35d4d","resolution":{"observed_at":"2026-08-04T11:24:18.867014Z","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-04T11:24:18.937122Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:18.937122Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:ceaedc6c0e7ff1a4745827386cc9f79a9c6f00236fe298cce59bba165076b976","observation_id":"37254611-fdc5-4e0e-a81b-beed6637e605","resolution":{"observed_at":"2026-08-04T11:24:18.937122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07258","last_updated":"2022-07-12T23:45:14Z","snapshot_observed_at":"2026-08-02T09:20:40.804790Z","submitted_at":"2021-08-16T17:50:08Z","title":"On the Opportunities and Risks of Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07258","snapshot_observed_at":"2026-08-04T11:24:19.018192Z","title":"Hudson, Ehsan Adeli, Russ Altman, Simran Arora, Sydney von Arx, Michael S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.018192Z"},"links":{"cited_paper":"/paper/2108.07258","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:97efd04e352c591d8ef7ac7d9e13b1ec26d50a4b4daa64506df8b608bf252e36","observation_id":"6f6cbfb9-1845-4a85-9545-6078845efc2f","resolution":{"observed_at":"2026-08-04T11:24:19.018192Z","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-04T11:24:19.087656Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.087656Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:02549a0f49792c1a4508922b1306b0d4ee2ccaa16b3e6c225ad6cbe1c128155a","observation_id":"5915bfd0-278b-46c1-8818-b3b7aa512b4e","resolution":{"observed_at":"2026-08-04T11:24:19.087656Z","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-04T11:24:19.154138Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.154138Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:cff7faef9896d188abc68d2f10ca375c0b9bc9f679d159283f270d6de9295542","observation_id":"3d75ceda-b2b3-4db8-a238-4363314d5442","resolution":{"observed_at":"2026-08-04T11:24:19.154138Z","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-04T11:24:19.236445Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.236445Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:f5ee78773c49bcbaa8cb3ba80c4fb8970a514ee02a7b0c8accb9ef3d309c561e","observation_id":"15bfa6ff-cc10-4066-9e3a-67d416f632a2","resolution":{"observed_at":"2026-08-04T11:24:19.236445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-08-14T19:36:07.505691Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-04T11:24:19.318507Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.318507Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:b4603b410179df73f0610be4022340269dca1acaa861b6d32c59cfe1eaf210df","observation_id":"d611f6db-f5e3-4bf3-a043-eda22c7c7661","resolution":{"observed_at":"2026-08-04T11:24:19.318507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03078","last_updated":"2023-06-05T17:53:28Z","snapshot_observed_at":"2026-08-19T14:44:54.976757Z","submitted_at":"2023-06-05T17:53:28Z","title":"SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03078","snapshot_observed_at":"2026-08-04T11:24:19.403461Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.403461Z"},"links":{"cited_paper":"/paper/2306.03078","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:f898c4943abdef423392eb6653ba867e0b3513c098d9d70e8f28a184e90d6de5","observation_id":"dc117cc0-8f7c-4e3e-94a1-dbcfbac4d388","resolution":{"observed_at":"2026-08-04T11:24:19.403461Z","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-04T11:24:19.520329Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.520329Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:c092b71d97076a1c8f9491b4645882c2ff70261270f6ac5648297e74bf86f9dc","observation_id":"a06c3700-f30e-40f3-a845-17c56f1e760b","resolution":{"observed_at":"2026-08-04T11:24:19.520329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00774","last_updated":"2023-03-22T12:33:46Z","snapshot_observed_at":"2026-08-19T20:16:07.393402Z","submitted_at":"2023-01-02T17:48:56Z","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00774","snapshot_observed_at":"2026-08-04T11:24:19.604307Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.604307Z"},"links":{"cited_paper":"/paper/2301.00774","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:eeb6693c144de064c026262f0a26b57901af253c411cb38f44fbd5bae72bb0b1","observation_id":"3068a465-8887-469d-b294-a199d14cc643","resolution":{"observed_at":"2026-08-04T11:24:19.604307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.11580","last_updated":"2023-01-08T11:49:36Z","snapshot_observed_at":"2026-08-16T16:37:09.174107Z","submitted_at":"2022-08-24T14:33:35Z","title":"Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.11580","snapshot_observed_at":"2026-08-04T11:24:19.687202Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.687202Z"},"links":{"cited_paper":"/paper/2208.11580","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:2f0fe05d7a8cace0bf2ad0d42460a7b54087542cd4a49e5a1bd49a145fd867c0","observation_id":"d5e534a4-2568-4718-bbb8-63f13ca98782","resolution":{"observed_at":"2026-08-04T11:24:19.687202Z","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-04T11:24:19.776073Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.776073Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:243375a61ce24e0d3c450d4e71defe6cf20dde19d6b89c2908685f3cfa843695","observation_id":"cf68e53c-eddd-44f6-9f4c-2494f8a2daba","resolution":{"observed_at":"2026-08-04T11:24:19.776073Z","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-04T11:24:19.837822Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.837822Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:e8cf329aa3a895a5f5398540e11eaab7e43a7102958563edf32ce87941774325","observation_id":"faaf3980-222b-4a1b-98d9-24e0d1f89cf2","resolution":{"observed_at":"2026-08-04T11:24:19.837822Z","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-04T11:24:19.911066Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.911066Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:67afe6c0e8f723ee1cc051e3dce9c5669232d4216d69608d393d0601a88ff249","observation_id":"0491c477-269c-4f5f-be83-e6e376313134","resolution":{"observed_at":"2026-08-04T11:24:19.911066Z","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-04T11:24:19.982340Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:19.982340Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:89d031791077c67155088708bc374e4eb8085dad3efafcf6a03b26d51bf55afb","observation_id":"6436b2bf-bc3f-459d-b28d-18e6596a5c3d","resolution":{"observed_at":"2026-08-04T11:24:19.982340Z","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-04T11:24:20.065000Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.065000Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:047e3ec6a5221f87b49aa35c6c99e1f984ca595c1ea91af2dc14aec2b6adcd05","observation_id":"831bdf68-bba5-4bd6-9ddb-8d5b3e23fd77","resolution":{"observed_at":"2026-08-04T11:24:20.065000Z","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-04T11:24:20.149959Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.149959Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:c29ef86bbad42ac3046726ddd77919b3733c685e03c5e4c24ef160aaa5cad7d4","observation_id":"71a184b7-2e2e-4ea8-a850-e70025a403e8","resolution":{"observed_at":"2026-08-04T11:24:20.149959Z","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-04T11:24:20.232691Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.232691Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:49f9b4172a3bb7c191cb7217c401383e8ce37b3ec842d1e52cc1e3d5abb8df4e","observation_id":"998a8e79-a273-4208-b430-f2ea706474c1","resolution":{"observed_at":"2026-08-04T11:24:20.232691Z","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-04T11:24:20.339490Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.339490Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:615b61d748f03e3c13206f0f54bcbaf8f77455e55264d5d2b5b5bc841c6901a3","observation_id":"efad20e0-6edd-4c0b-934b-b81dc26700c0","resolution":{"observed_at":"2026-08-04T11:24:20.339490Z","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-04T11:24:20.514523Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.514523Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:eaf8ef458ef46feb7565fca3f87b3317c24e26d82e8637f0713948928ff4150f","observation_id":"9c1aee6c-75f4-4d73-8489-eebf697546ba","resolution":{"observed_at":"2026-08-04T11:24:20.514523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11627","last_updated":"2023-09-28T03:59:27Z","snapshot_observed_at":"2026-08-16T15:31:43.348408Z","submitted_at":"2023-05-19T12:10:53Z","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.11627","snapshot_observed_at":"2026-08-04T11:24:20.613129Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.613129Z"},"links":{"cited_paper":"/paper/2305.11627","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:3fe3a581cb07e3fb58150f30a7e23d525469ea286205b71707076356e22b594d","observation_id":"29c8c2d7-ed2a-4609-8bc0-4e1936135af8","resolution":{"observed_at":"2026-08-04T11:24:20.613129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03853","last_updated":"2024-10-11T09:43:32Z","snapshot_observed_at":"2026-08-16T14:12:14.696997Z","submitted_at":"2024-03-06T17:04:18Z","title":"ShortGPT: Layers in Large Language Models are More Redundant Than You Expect","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03853","snapshot_observed_at":"2026-08-04T11:24:20.705738Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.705738Z"},"links":{"cited_paper":"/paper/2403.03853","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:14ff2edaa624a7190bcd47ffe0be48dc3955a6173c5d3848a6b9a60858f26932","observation_id":"dd5fba71-c122-4447-971f-22107578d000","resolution":{"observed_at":"2026-08-04T11:24:20.705738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-08-17T01:46:43.513643Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-04T11:24:20.789338Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.789338Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:9b5751464e5914c74d4a86082542f1479e4a89aadae92b30c4a50b8134aa7bf3","observation_id":"d0b3db6a-66d4-4651-9442-dc2e472aa5a0","resolution":{"observed_at":"2026-08-04T11:24:20.789338Z","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-04T11:24:20.870999Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.870999Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:73805a9595666d9297ca5385273b91265efef8a015bb434abf888048b035e5ca","observation_id":"0e151229-f9a6-45bb-83ef-8738029c65ab","resolution":{"observed_at":"2026-08-04T11:24:20.870999Z","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-04T11:24:20.948018Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:20.948018Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:74228620328f8c411ecef8c8829969cc756671e9462a6d762fdb36361f76fb53","observation_id":"c158114e-2690-48b3-a559-83ad1bf5393c","resolution":{"observed_at":"2026-08-04T11:24:20.948018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.10350","last_updated":"2021-04-23T14:26:29Z","snapshot_observed_at":"2026-08-16T05:11:57.545339Z","submitted_at":"2021-04-21T04:44:25Z","title":"Carbon Emissions and Large Neural Network Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.10350","snapshot_observed_at":"2026-08-04T11:24:21.082098Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.082098Z"},"links":{"cited_paper":"/paper/2104.10350","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:6fb6ffab383f5792e8cebf7bd24207465da6fecd154d60071b4e72ccbfb0c795","observation_id":"6c145c5d-fe36-4490-92fd-08b455b798a9","resolution":{"observed_at":"2026-08-04T11:24:21.082098Z","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-04T11:24:21.200118Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.200118Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:75bdbecfdd92c80b2cb76e826cd57e56bcb669ecfeeb36bcf95fe458fef399d0","observation_id":"464363f7-6a38-4324-8c22-5a00dcf44e52","resolution":{"observed_at":"2026-08-04T11:24:21.200118Z","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-04T11:24:21.269118Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.269118Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:8ce034738553dec4d2a5776de1acd308a8c7a0efd4cfe385f388934b97e55255","observation_id":"86957d4d-8a68-48ac-881b-5cebba608541","resolution":{"observed_at":"2026-08-04T11:24:21.269118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01108","last_updated":"2020-03-01T02:57:50Z","snapshot_observed_at":"2026-08-07T19:07:36.327251Z","submitted_at":"2019-10-02T17:56:28Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01108","snapshot_observed_at":"2026-08-04T11:24:21.347981Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.347981Z"},"links":{"cited_paper":"/paper/1910.01108","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:06d39b5f6b98a670fada97d419dada4f64e9ff918100c0efbb5053a4fcf9850b","observation_id":"894b8610-9548-4554-92cd-971f6a247c15","resolution":{"observed_at":"2026-08-04T11:24:21.347981Z","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-04T11:24:21.478084Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.478084Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:61d56092b446409b78c2e67d8cb9cfafd9315019bad67626497cbea0bfea89a2","observation_id":"df40e1eb-f8a9-425d-a0bb-37f7a1155d47","resolution":{"observed_at":"2026-08-04T11:24:21.478084Z","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-04T11:24:21.561658Z","title":"Mahoney, and Kurt Keutzer","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.561658Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:f2c87e760f0ad143c112ea5d524877b390fb648cde19d179bb7e5a018854238f","observation_id":"a13b23e6-ed76-4c8e-9e9f-fe1bed11f83d","resolution":{"observed_at":"2026-08-04T11:24:21.561658Z","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-04T11:24:21.645161Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.645161Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:a31c666a57b98d0e9368e244e5eb2675d9fe3d1c202595e117188bc0bc743080","observation_id":"f48310f8-a7e8-45d8-addc-985332470042","resolution":{"observed_at":"2026-08-04T11:24:21.645161Z","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-04T11:24:21.698127Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.698127Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:1dace08e2922481b5735cbf820936c048fa9b15613ed508e6020f3a5c19a5d4e","observation_id":"651382d6-febf-457e-b5e2-192e0cfd0f89","resolution":{"observed_at":"2026-08-04T11:24:21.698127Z","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-04T11:24:21.770431Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.770431Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:9211b613467352cd915a68992cce43fea197ee977ca286f898688dde92aebad9","observation_id":"c482d799-f41d-4f88-983a-dd3f0097fb70","resolution":{"observed_at":"2026-08-04T11:24:21.770431Z","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-04T11:24:21.857655Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.857655Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:30b24ae508de8fef37cf817bece1d273ab32206ac5358785cf9d741d82138487","observation_id":"e0755647-4706-43cf-afa0-299059b67953","resolution":{"observed_at":"2026-08-04T11:24:21.857655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-04T11:24:21.919187Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:21.919187Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:881b2f2fa58295f5dd3503fcdd00d151478faa3fa2040a7c5c526b872e939e41","observation_id":"5833e74b-8834-4595-b485-0799f052f2a3","resolution":{"observed_at":"2026-08-04T11:24:21.919187Z","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-04T11:24:22.070366Z","title":"Gomez, ukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:22.070366Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:d3649ada0d595d4cdd4a8e6cffea68b858b85220d6597959090252f35e5e0963","observation_id":"1dd0ac82-2cb9-4bb1-a0d6-dc25f29c9c4a","resolution":{"observed_at":"2026-08-04T11:24:22.070366Z","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-04T11:24:22.218615Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:22.218615Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:5afb99c3051fb45b82e314f7b1a2297501d31ce8aad71e6c1ba6aab265e2167e","observation_id":"820982c6-6508-4cf5-b934-5af21ad676c3","resolution":{"observed_at":"2026-08-04T11:24:22.218615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07378","last_updated":"2025-03-16T03:27:33Z","snapshot_observed_at":"2026-08-18T15:56:23.038008Z","submitted_at":"2024-03-12T07:31:18Z","title":"SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07378","snapshot_observed_at":"2026-08-04T11:24:22.318841Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:22.318841Z"},"links":{"cited_paper":"/paper/2403.07378","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:a39cb03bae5f0e422ebb811197b0603c2b823e095e0cf8b3f33b7a763e044f51","observation_id":"b7f2ea23-d96e-423f-8e5d-98f8cb8bc2eb","resolution":{"observed_at":"2026-08-04T11:24:22.318841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.12345","last_updated":"2024-04-18T17:20:16Z","snapshot_observed_at":"2026-08-16T13:59:41.360362Z","submitted_at":"2024-04-18T17:20:16Z","title":"High spin axion insulator","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.12345","snapshot_observed_at":"2026-08-04T11:24:22.495816Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:22.495816Z"},"links":{"cited_paper":"/paper/2404.12345","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:f3981be34c7565dec981fe967d90c391e245fc0d35042e5e911c0e3771ff68d4","observation_id":"f97a5a90-c2d8-4344-89b5-7ea64585848b","resolution":{"observed_at":"2026-08-04T11:24:22.495816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14178","last_updated":"2024-03-29T08:13:38Z","snapshot_observed_at":"2026-08-16T17:13:28.893408Z","submitted_at":"2023-04-27T13:27:01Z","title":"mPLUG-Owl: Modularization Empowers Large Language Models with Multimodality","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.14178","snapshot_observed_at":"2026-08-04T11:24:22.627249Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:22.627249Z"},"links":{"cited_paper":"/paper/2304.14178","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:982c8c83ab5a8720a0bfbd825cd5ad07e6654d5a922d002b4f687e8b443937f1","observation_id":"6f18ac0c-2eff-4346-8fd9-94fb847f3974","resolution":{"observed_at":"2026-08-04T11:24:22.627249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05821","last_updated":"2025-08-28T03:57:52Z","snapshot_observed_at":"2026-08-16T15:03:40.750477Z","submitted_at":"2023-12-10T08:41:24Z","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05821","snapshot_observed_at":"2026-08-04T11:24:22.723894Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:22.723894Z"},"links":{"cited_paper":"/paper/2312.05821","citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:5fe453dab5ac9cb601555412efb099522720ef5451ced20a512667c5b580cd47","observation_id":"03ff2d04-3bcd-45f3-bd00-6955ff09faf7","resolution":{"observed_at":"2026-08-04T11:24:22.723894Z","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-04T11:24:22.823887Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:22.823887Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:4de68b8167dc6c5b173cef09c34b0b4a398e2654e7a9230bf38726f8e01e3c06","observation_id":"4fbb4f1b-58fb-40f3-a95f-c82277e4c714","resolution":{"observed_at":"2026-08-04T11:24:22.823887Z","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-04T11:24:22.892118Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T11:24:22.892118Z"},"links":{"citing_paper":"/paper/2510.05544"},"observation_digest":"sha256:68579fba2b9dabbaec86d68e4909e170a68c98f38a2bbdbac80ac11a702ca277","observation_id":"4ecd1c22-32c2-4c3a-a3e9-dd8df5632dab","resolution":{"observed_at":"2026-08-04T11:24:22.892118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.05544","last_updated":"2026-06-03T18:20:52Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-17T12:32:06.937701Z","submitted_at":"2025-10-07T03:07:47Z","title":"Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2510.05544."}