{"as_of":"2026-08-12T09:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e862636ecada24fa4eb479e31298a60a77ec3696678da1e309890002b31391a","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:22:23.041511Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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.02680/citation-record","integrity":"/paper/2602.02680/integrity","json":"/paper/2602.02680/citation-record.json","paper":"/paper/2602.02680"},"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:22:22.749966Z","title":"Note that the memory complexity is now independent ofNand scales asO(n 2 i )","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:22.749966Z"},"links":{"citing_paper":"/paper/2602.02680"},"observation_digest":"sha256:ba99c1ce2b62dcc4d82b18a332f2077bfcd43883792c6b87010b161cff6c54f4","observation_id":"13b22f30-fed3-4b41-a431-03bb6be2d7f5","resolution":{"observed_at":"2026-08-03T05:22:22.749966Z","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:22:22.286104Z","title":"URL https: //aclanthology.org/2025.acl-long.498/","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:22.286104Z"},"links":{"citing_paper":"/paper/2602.02680"},"observation_digest":"sha256:f1e426a940bd5f48baaaf939796e06ae2384d3e715e11ad7905fa38e39b78eb2","observation_id":"b5de9b83-0767-4c75-9b75-6777b00ecbc0","resolution":{"observed_at":"2026-08-03T05:22:22.286104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17764","last_updated":"2024-02-27T18:56:19Z","snapshot_observed_at":"2026-08-03T00:59:01.026576Z","submitted_at":"2024-02-27T18:56:19Z","title":"The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17764","snapshot_observed_at":"2026-08-03T05:22:22.448661Z","title":"Ma, S., Wang, H., Ma, L., Wang, L., Wang, W., Huang, S., Dong, L., Wang, R., Xue, J., and Wei, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:22.448661Z"},"links":{"cited_paper":"/paper/2402.17764","citing_paper":"/paper/2602.02680"},"observation_digest":"sha256:348fb3e53c756426104693aaebb0b639922c5e2d66bee675ba1b8a3e7384b14c","observation_id":"b0a5fbfe-cd90-43c3-b680-9c2addb12af4","resolution":{"observed_at":"2026-08-03T05:22:22.448661Z","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:22:22.820944Z","title":"whitened","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:22.820944Z"},"links":{"citing_paper":"/paper/2602.02680"},"observation_digest":"sha256:f340c337de2817f23151d81bc8b55e6a7e93c0bc73c24ab3996b8e8816333b3a","observation_id":"df22950c-6c52-474c-a6a5-040f39f7aa0c","resolution":{"observed_at":"2026-08-03T05:22:22.820944Z","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:22:22.946630Z","title":"For each layer l∈ {1,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:22.946630Z"},"links":{"citing_paper":"/paper/2602.02680"},"observation_digest":"sha256:8ef8c063afeedffc6fe1efd54145635653b336d79f223d49222163e8835b74f9","observation_id":"58f770d1-2f69-45d1-a2c6-c60cd5be7d82","resolution":{"observed_at":"2026-08-03T05:22:22.946630Z","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:22:23.041511Z","title":"We employ a Dynamic Programming (DP) algorithm to find the rank assignments across layers that maximize the aggregate performance for each global threshold βk","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:23.041511Z"},"links":{"citing_paper":"/paper/2602.02680"},"observation_digest":"sha256:d81735ef8401fc2ca4ccb446fe11e1caea6891426204c37ea3a650a4a6ad5c62","observation_id":"c4ebdacc-96ac-400d-bc2d-f498118de857","resolution":{"observed_at":"2026-08-03T05:22:23.041511Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02258","last_updated":"2024-04-02T19:28:11Z","snapshot_observed_at":"2026-07-06T17:54:47.689340Z","submitted_at":"2024-04-02T19:28:11Z","title":"Mixture-of-Depths: Dynamically allocating compute in transformer-based language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02258","snapshot_observed_at":"2026-08-03T05:22:22.596775Z","title":"out of the box","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:22.596775Z"},"links":{"cited_paper":"/paper/2404.02258","citing_paper":"/paper/2602.02680"},"observation_digest":"sha256:0f4c75cdbc0d6c06295bcad227db1cfbf80166e825dbf186813f7d14072e8fc4","observation_id":"0b0c4fef-8679-4ca6-a98d-7b1fff9c7100","resolution":{"observed_at":"2026-08-03T05:22:22.596775Z","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:22:22.179233Z","title":"Chen, M., Shao, W., Xu, P., Wang, J., Gao, P., Zhang, K., and Luo, P","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:22.179233Z"},"links":{"citing_paper":"/paper/2602.02680"},"observation_digest":"sha256:714811cf0043620dfa2e725ebde216129715f84e1d0f44a8668b58cfbc06a0e3","observation_id":"c1d0d706-477b-451f-9457-8dd0244ef1e6","resolution":{"observed_at":"2026-08-03T05:22:22.179233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.02680","last_updated":"2026-06-03T22:04:11Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T20:39:08.038451Z","submitted_at":"2026-02-02T19:01:40Z","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":8},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2602.02680."}