{"as_of":"2026-08-18T22:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96e95175050b24d321488e0181323a24c3bb8c3899556dfbdf41617feafaa0d6","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:51:31.515402Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2602.01027/citation-record","integrity":"/paper/2602.01027/integrity","json":"/paper/2602.01027/citation-record.json","paper":"/paper/2602.01027"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:51:31.066693Z","title":"This decomposition is performed offline, incurring no runtime overhead","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:31.066693Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:7a1c3372fbc0e418723d6fa454036eb51bb3981b210d334447de5c43a9748022","observation_id":"f99961bb-0201-4e3a-b6e7-71084d46ff01","resolution":{"observed_at":"2026-08-03T05:51:31.066693Z","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-03T05:51:30.390960Z","title":"FlexQuant: A flexible and effi- cient dynamic precision switching framework for LLM quantization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.390960Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:6287361653fdfe033122e1acb62c0dfad0e6e5352bd923544e41f9350eb44a82","observation_id":"96d42862-c698-47ab-916e-fc9e0d24e688","resolution":{"observed_at":"2026-08-03T05:51:30.390960Z","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-03T05:51:30.441751Z","title":"J., and Lee, D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.441751Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:004731af3ba578e7c383f44fc557b42fb770a27df9bfb19b41f72fe0d2de57f3","observation_id":"c07e462a-6dc3-4245-ac26-4920e9063e90","resolution":{"observed_at":"2026-08-03T05:51:30.441751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11243","last_updated":"2024-01-20T14:53:19Z","snapshot_observed_at":"2026-08-16T14:25:55.587530Z","submitted_at":"2024-01-20T14:53:19Z","title":"LRP-QViT: Mixed-Precision Vision Transformer Quantization via Layer-wise Relevance Propagation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11243","snapshot_observed_at":"2026-08-03T05:51:30.530975Z","title":"and Savakis, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.530975Z"},"links":{"cited_paper":"/paper/2401.11243","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:79091f33d2fae76dbe7af5370c254bf92429948549ccf381110f8c9c67da7c01","observation_id":"79ef2b9a-3ca7-4377-a13d-2a2811e76cec","resolution":{"observed_at":"2026-08-03T05:51:30.530975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06357","last_updated":"2025-01-10T21:36:20Z","snapshot_observed_at":"2026-08-16T12:59:14.529017Z","submitted_at":"2025-01-10T21:36:20Z","title":"Mix-QViT: Mixed-Precision Vision Transformer Quantization Driven by Layer Importance and Quantization Sensitivity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.06357","snapshot_observed_at":"2026-08-03T05:51:30.629706Z","title":"and Savakis, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.629706Z"},"links":{"cited_paper":"/paper/2501.06357","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:62af26211198ea888e9dcaa0227a7f5d09097f1da1b05a42a1a4e6bb0d2b6a7e","observation_id":"2c080e3a-e7b1-4c4c-b1a2-e41dee2f975a","resolution":{"observed_at":"2026-08-03T05:51:30.629706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18832","last_updated":"2024-06-27T02:02:26Z","snapshot_observed_at":"2026-08-18T08:37:15.489937Z","submitted_at":"2024-06-27T02:02:26Z","title":"OutlierTune: Efficient Channel-Wise Quantization for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18832","snapshot_observed_at":"2026-08-03T05:51:30.723176Z","title":"Outliertune: Efficient channel-wise quantization for large language models.arXiv preprint arXiv:2406.18832,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.723176Z"},"links":{"cited_paper":"/paper/2406.18832","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:99f3e3aa34146a52b39bdff25360489ffe21788d7a879c252f778be39ceddf7c","observation_id":"b09a6f1a-ac4a-4b30-bbf3-4870a44f81fe","resolution":{"observed_at":"2026-08-03T05:51:30.723176Z","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-03T05:51:30.866891Z","title":"Additional Related Works A.1","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.866891Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:a7a2f2a448913e457df2cd70130a9acf14552f3bf6401afb356243631a7466a7","observation_id":"371cd540-f097-4396-b6e0-45fd58509ee7","resolution":{"observed_at":"2026-08-03T05:51:30.866891Z","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-03T05:51:31.120544Z","title":"13 SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:31.120544Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:57de519019286f2a7328da2720f6f440be45ba19650675a4b1e9dbf9a70e82a1","observation_id":"a749092a-d018-46fe-bdcf-b7bc8319b8f7","resolution":{"observed_at":"2026-08-03T05:51:31.120544Z","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-03T05:51:31.185369Z","title":"For SliM-LLM, we use the official released code, while GPTQ is evaluated using GPTQModel","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:31.185369Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:a7c4fde3b394e5a50b74102e91ea82075994e1d438c7edba6fc3050c22d1e9be","observation_id":"c2dc53d0-a6c5-4b7b-801f-232c1b18e7c5","resolution":{"observed_at":"2026-08-03T05:51:31.185369Z","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-03T05:51:31.515402Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:31.515402Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:c1e833514ac2fab2893d6926e3acac905c0b5501cbd6f5562c30c0f583b552c2","observation_id":"aa679456-d946-43df-b99c-48e5a011b44e","resolution":{"observed_at":"2026-08-03T05:51:31.515402Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:51:31.360193Z","title":"The numbers on the left indicate the BPW per configuration","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":128,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:31.360193Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:b8b49551340ae1662838dd9169b4314622bdde86275140777836ad78ad108f28","observation_id":"3468b0bb-a256-4d36-ba76-0d782269076b","resolution":{"observed_at":"2026-08-03T05:51:31.360193Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:51:31.414333Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":256,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:31.414333Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:1e07ac35975d2d0a81840834dc98f50b94a1b7a925f8240dea1b2cf2bfe1c7f6","observation_id":"7c3e449b-1a75-4a89-80ae-c5a6aed7f933","resolution":{"observed_at":"2026-08-03T05:51:31.414333Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:51:31.289384Z","title":"Impact of Sample Size for Fisher Estimation Table 7 reports the impact of the sample size used for Fisher information estimation on model performance","venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":512,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:31.289384Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:dda61fe3d88b725a3334bc72518c780dbfbe10113a3a06b288b8b653b2486b5d","observation_id":"61100ab3-d2a0-4391-89c9-7b4d9f78fd43","resolution":{"observed_at":"2026-08-03T05:51:31.289384Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:51:30.297783Z","title":"Amq: Enabling automl for mixed-precision weight-only quan- tization of large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":1983,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.297783Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:a9c32e487a7438f6e44437ff4e645ac077a795d1ebbf1a8b39916e2d3ad3538a","observation_id":"c05316d8-3281-4afe-b72f-00f51767be64","resolution":{"observed_at":"2026-08-03T05:51:30.297783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14152","last_updated":"2025-04-19T02:51:45Z","snapshot_observed_at":"2026-08-17T04:20:01.222842Z","submitted_at":"2025-04-19T02:51:45Z","title":"FGMP: Fine-Grained Mixed-Precision Weight and Activation Quantization for Hardware-Accelerated LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14152","snapshot_observed_at":"2026-08-03T05:51:30.119869Z","title":"Fgmp: Fine-grained mixed-precision weight and activation quantization for hardware-accelerated llm inference.arXiv preprint arXiv:2504.14152,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.119869Z"},"links":{"cited_paper":"/paper/2504.14152","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:54cedfb014b46501ed27f87fa41ca074a2e5d67b752f254db74939f8e5737438","observation_id":"b67e4756-23bd-44ba-a7d9-efcd2a5e17aa","resolution":{"observed_at":"2026-08-03T05:51:30.119869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-03T05:51:29.913387Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:29.913387Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:da5e1d64f74fb20119ec8754c025dd3cd3f38ba93a2d8e6cec163648181339d1","observation_id":"d6f6817e-1509-4d4a-bbec-487f10be856c","resolution":{"observed_at":"2026-08-03T05:51:29.913387Z","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-03T05:51:29.818370Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:29.818370Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:1270868715484ee16dec790523911df154ccf4aa5b04f4fc5903162eef276766","observation_id":"e020b0d6-fda5-45f6-a1a0-524e09821236","resolution":{"observed_at":"2026-08-03T05:51:29.818370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11062","last_updated":"2025-05-19T06:20:01Z","snapshot_observed_at":"2026-08-16T13:35:20.246215Z","submitted_at":"2024-07-10T17:53:30Z","title":"EfficientQAT: Efficient Quantization-Aware Training for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11062","snapshot_observed_at":"2026-08-03T05:51:29.522870Z","title":"Efficientqat: Efficient quantization- aware training for large language models.arXiv preprint arXiv:2407.11062,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:29.522870Z"},"links":{"cited_paper":"/paper/2407.11062","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:d9463190c0b553093c50458b6db78a02fef3a7602cb49fa22ea76a84b63e3d4b","observation_id":"8a885373-c414-4ce8-ac78-1d6a1097dd49","resolution":{"observed_at":"2026-08-03T05:51:29.522870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-08-13T20:44:28.824685Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-03T05:51:30.007463Z","title":"Measuring mas- sive multitask language understanding.arXiv preprint arXiv:2009.03300,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.007463Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:081fe92d93358504e3144c84b83386b78581dd9cd1b857b8ee63e2254e844e7e","observation_id":"8d07b3f5-3007-4ee6-b7cb-87c2dc8ac0e2","resolution":{"observed_at":"2026-08-03T05:51:30.007463Z","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-03T05:51:29.699920Z","title":"BoolQ: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:29.699920Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:a40acca0a63e3f3c5070fd671046e2d4e8a987525a510165807a045202eade86","observation_id":"e6ce942e-894d-46d8-b40c-8b80fc05f889","resolution":{"observed_at":"2026-08-03T05:51:29.699920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-03T05:51:30.814398Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.814398Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:36610bb103fdb2b62470b2e534c8841a8597731061f9a941a505974290c08474","observation_id":"26d03976-9015-4ceb-8156-8d7d14806483","resolution":{"observed_at":"2026-08-03T05:51:30.814398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.04746","last_updated":"2026-05-18T07:28:29Z","snapshot_observed_at":"2026-08-18T01:59:02.646389Z","submitted_at":"2025-12-04T12:35:10Z","title":"SignRoundV2: Toward Closing the Performance Gap in Extremely Low-Bit Post-Training Quantization for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.04746","snapshot_observed_at":"2026-08-03T05:51:29.598001Z","title":"Sign- roundv2: Closing the performance gap in extremely low- bit post-training quantization for llms.arXiv preprint arXiv:2512.04746,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:29.598001Z"},"links":{"cited_paper":"/paper/2512.04746","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:af61baed35967546994c76a7a9e71b4be87d626dbd9c868d7402cd985ef2abf2","observation_id":"499fa78d-58e5-48d5-99f9-ddd4718a8c85","resolution":{"observed_at":"2026-08-03T05:51:29.598001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01704","last_updated":"2025-03-03T16:16:33Z","snapshot_observed_at":"2026-08-16T12:53:32.383591Z","submitted_at":"2025-03-03T16:16:33Z","title":"DILEMMA: Joint LLM Quantization and Distributed LLM Inference Over Edge Computing Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01704","snapshot_observed_at":"2026-08-03T05:51:30.204694Z","title":"and Khamfroush, H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.204694Z"},"links":{"cited_paper":"/paper/2503.01704","citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:3bf838e9f5aff9f38f27ef94a6f37bd65013a52a3a41bec7c8098370e50ca19b","observation_id":"703a82b9-2fee-4549-a5d1-79b90dae3a5a","resolution":{"observed_at":"2026-08-03T05:51:30.204694Z","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-03T05:51:30.979918Z","title":"Most approaches (Cheng et al., 2025; You et al.,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","version":2},"reference_index":2560,"source":"pdf_text","source_observed_at":"2026-08-03T05:51:30.979918Z"},"links":{"citing_paper":"/paper/2602.01027"},"observation_digest":"sha256:67e2ebbbd6adb6db6a2094db3b4eb27dd2c23cfd0bdb0e8310dd9635092df5a1","observation_id":"abfc6463-d4ef-4539-8a44-ea3504bea22d","resolution":{"observed_at":"2026-08-03T05:51:30.979918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.01027","last_updated":"2026-06-03T14:10:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:32:19.695888Z","submitted_at":"2026-02-01T05:24:19Z","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":24},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2602.01027."}