{"as_of":"2026-08-10T18:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6c0a3d0d15979ac0a11f58d3bd8dacf2d9374013fef7cce26e15990a3dc9d53","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:50:32.617056Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2507.01841/citation-record","integrity":"/paper/2507.01841/integrity","json":"/paper/2507.01841/citation-record.json","paper":"/paper/2507.01841"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.459999Z","title":"Foundation mod- els defining a new era in vision: a survey and outlook","venue":null,"work_id":"6bd6f215-652f-49e2-9906-6eb6988f98ed","year":2025},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.367029Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:785c698b9193e1b5a00b7805ab15adbf3c4a06859a001b4137f2c4e4f5eef8a1","observation_id":"48d19968-0436-418b-917e-ca6d00924ed6","resolution":{"observed_at":"2026-08-06T20:50:33.465180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01376","last_updated":"2024-02-05T12:42:52Z","snapshot_observed_at":"2026-07-06T17:24:16.787573Z","submitted_at":"2024-02-02T13:00:38Z","title":"LoTR: Low Tensor Rank Weight Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01376","snapshot_observed_at":"2026-08-06T20:50:32.372815Z","title":"LoTR: Low tensor rank weight adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.372815Z"},"links":{"cited_paper":"/paper/2402.01376","citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:e8f0014b6ebdfb5898a819f5132b0ea0a3f4acb05c81852292e998962a24b412","observation_id":"42c31b59-5cf9-4822-b4c5-495f14fa136d","resolution":{"observed_at":"2026-08-06T20:50:32.372815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.443363Z","title":"The challenges of the nonlinear regime for physics-informed neural networks","venue":null,"work_id":"eb56d995-1641-4481-8fb4-c05ac7ae1e19","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.378625Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:43541493d9ad751535e4a5ab53c03e2e7c2cb91a693d526a8ea4169c96ac9c65","observation_id":"fa9d0279-e1e0-4e4e-b66a-15636e7cb77d","resolution":{"observed_at":"2026-08-06T20:50:33.448647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.427556Z","title":"AdaptFormer: Adapting vision Transformers for scalable visual recognition","venue":null,"work_id":"ca6ec228-6e06-454e-913a-63a9d1737787","year":2022},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.384561Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:a44d94cc35cb93df8c375d887ff1b7bd16d217f17f4ba8e8edb2600b02ac3137","observation_id":"2455da63-6a2a-46c9-9a7e-b78838e8f940","resolution":{"observed_at":"2026-08-06T20:50:33.432380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.410973Z","title":"QLoRA: Efficient fine- tuning of quantized LLMs","venue":null,"work_id":"a68e1938-4aa3-46c3-aa6b-20808fc3d36d","year":2023},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.390164Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:e4992f159714b0412a37a0fc33a34cb58140e04f3ef5ec81b9c1bccf0b8c77d2","observation_id":"4c0513e4-8f50-4f45-a432-be7bee979f4c","resolution":{"observed_at":"2026-08-06T20:50:33.416236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16954","last_updated":"2024-11-23T02:35:18Z","snapshot_observed_at":"2026-08-07T07:09:47.433281Z","submitted_at":"2024-10-22T12:33:45Z","title":"LoRA-C: Parameter-Efficient Fine-Tuning of Robust CNN for IoT Devices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16954","snapshot_observed_at":"2026-08-06T20:50:32.395645Z","title":"LoRA-C: Parameter-efficient fine-tuning of robust CNN for IoT devices","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.395645Z"},"links":{"cited_paper":"/paper/2410.16954","citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:661032258c026bdea00d539ceed5eb363d9b218486505715c5c27d51110df85e","observation_id":"bcfeb679-0937-4aef-b123-19928436c505","resolution":{"observed_at":"2026-08-06T20:50:32.395645Z","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-06T20:50:32.401899Z","title":"Parameter-efficient fine-tuning of large-scale pre-trained language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.401899Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:9d5dfdab3c2ad7bbc1d8693ecbc35f391bdcc2780524eb7d6142e0c7eadaedec","observation_id":"80465611-7247-43da-b165-90d3d71c138a","resolution":{"observed_at":"2026-08-06T20:50:32.401899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10650","last_updated":"2022-12-20T20:56:52Z","snapshot_observed_at":"2026-08-09T04:51:56.558555Z","submitted_at":"2022-12-20T20:56:52Z","title":"KronA: Parameter Efficient Tuning with Kronecker Adapter","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10650","snapshot_observed_at":"2026-08-06T20:50:32.406929Z","title":"KronA: Parameter efficient tuning with Kronecker adapter","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.406929Z"},"links":{"cited_paper":"/paper/2212.10650","citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:0c69c09dfc978f9d42a94202533b9be500e1c8c17eb86275b0bbf868a4551a79","observation_id":"f87a2c81-1f99-4e29-b0c3-378801538e89","resolution":{"observed_at":"2026-08-06T20:50:32.406929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.383201Z","title":"Implicit style-content sepa- ration using B-LoRA","venue":null,"work_id":"e9fd0905-98f0-4f38-9cc2-475ce0379953","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.413176Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:3dd0827d2cf6051f66b88041338c2c8761c35c07abd1d6ab9f5fbf25816716ca","observation_id":"35381c0a-5f57-4769-a91b-bb493b6c7800","resolution":{"observed_at":"2026-08-06T20:50:33.388589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.418771Z","title":"Submodular functions and optimization, volume 58","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.418771Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:43b49b7f6f62774a9be10068f29751d591c9284f0f03c6c59dc1b8a6fd094aa2","observation_id":"1aba0e5e-60b4-487b-a29a-3f7cb04fb6dc","resolution":{"observed_at":"2026-08-06T20:50:32.418771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06153","last_updated":"2025-02-14T01:43:07Z","snapshot_observed_at":"2026-08-09T04:46:40.996804Z","submitted_at":"2025-02-10T04:57:07Z","title":"Low Tensor-Rank Adaptation of Kolmogorov--Arnold Networks","version":2},"cited_work":{"arxiv_id":"2502.06153","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.06153","snapshot_observed_at":"2026-08-06T20:50:32.775614Z","title":"Low Tensor-Rank Adaptation of Kolmogorov--Arnold Networks","venue":"cs.LG","work_id":"7ee6f918-e8ff-4d76-8416-0f648b324d41","year":2025},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.424797Z"},"links":{"cited_paper":"/paper/2502.06153","citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:5c48f09776dd0ec05e78a177ee3a00e5796207b66a0df930f3be972956cb372d","observation_id":"2fa23cd2-d967-41cd-919d-c03bc4818702","resolution":{"observed_at":"2026-08-06T20:50:32.783182Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.354481Z","title":"Escaping from saddle points—online stochastic gradient for tensor decomposition","venue":null,"work_id":"c5f4ced8-e720-4f51-a892-84cb96b6884e","year":null},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.430342Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:a06537aa9e43a9fda64d528de0b8fc40fc38c69ae3615552e29c72283974745f","observation_id":"8052b575-2606-493d-b7a7-816b65e2122d","resolution":{"observed_at":"2026-08-06T20:50:33.359558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.336474Z","title":"Matrix completion has no spurious local minimum","venue":null,"work_id":"d8aec90e-8778-4f9c-9e88-8966d6180807","year":2016},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.436266Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:e0f3367a36962b54e8ece2d3611fe0f69cfc53cd2e4d0c5692188c9472a82dc4","observation_id":"5afb3fba-b986-4eaf-b755-9352f90f397a","resolution":{"observed_at":"2026-08-06T20:50:33.341921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.318729Z","title":"Parameter-efficient fine- tuning for large models: A comprehensive survey","venue":null,"work_id":"34507ea0-cd93-4e1e-b427-66bf2c747f31","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.442065Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:10c0f9d07c5cc78186a6c50691eac5a3fd890230ea00188dcb2f2953f8af66fc","observation_id":"1bdfbe2b-24d6-4b0a-a151-340a866bb133","resolution":{"observed_at":"2026-08-06T20:50:33.324311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.300804Z","title":"LoRA+: Efficient low rank adaptation of large models","venue":null,"work_id":"536fcc84-40e5-49e8-a80e-9d010116a16c","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.447214Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:27c6bc00e08fe4b11304d740e4065a2ed314c21248a0d90f714d2fccf7985afa","observation_id":"e9057990-4c27-4e0e-9d0f-79d0ffe9e9eb","resolution":{"observed_at":"2026-08-06T20:50:33.306120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.283921Z","title":"LoRA: Low-rank adaptation of large language models","venue":null,"work_id":"06bbebc4-0299-412f-9f17-d0577825ab4b","year":2022},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.452011Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:8bf612ff2f916198831c35623f392aa2abc7f180546d16c092f06af0759c4f60","observation_id":"faa1fbd5-7488-4214-ba54-6db42511624b","resolution":{"observed_at":"2026-08-06T20:50:33.289183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.267525Z","title":"Lee, and Ernest K","venue":null,"work_id":"f73bfaf8-15cc-4eb0-9345-91a3498ff2bd","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.458566Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:aa34e7ce370fba9f8f3bd51a6ec8c185d18a0200d5d45d5364f3292d482c3b57","observation_id":"09374d3d-fe54-49b9-9cce-7c8e213921fe","resolution":{"observed_at":"2026-08-06T20:50:33.272660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.463929Z","title":"Visual prompt tuning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.463929Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:f34ac165dd1453002fb1c6f128a03d7d6975bc0041159dc44dbbccaf575d9f1d","observation_id":"2fc523b2-0ef3-4eef-8efc-b2b62b57cc56","resolution":{"observed_at":"2026-08-06T20:50:32.463929Z","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-06T20:50:32.470024Z","title":"Physics-informed machine learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.470024Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:bfd03ce8e679d0cab4f933e64784c3cbfb99216771a15a1dd9990f5e828ccc46","observation_id":"f48cf59a-1f84-4a0a-b8a5-f1a2c8fd97ff","resolution":{"observed_at":"2026-08-06T20:50:32.470024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.229437Z","title":null,"venue":null,"work_id":"980b305e-2f96-4291-a8b8-8aa50b0c5793","year":2025},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.475515Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:0a0342165fbad70fc48fe34d1da7f15d1531a5684ac1fdfc499a333b97b2848f","observation_id":"7c2da706-7662-4bfa-8fb6-dd1a5cbf5889","resolution":{"observed_at":"2026-08-06T20:50:33.234836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.481014Z","title":"Submodular function maximization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.481014Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:3116c97e3c8133f109e343632c1ccdbb08ecfef27d0d85aff1d8b90faf1f6b75","observation_id":"296cc1fd-aedd-495e-a8e5-f5afe873b2cc","resolution":{"observed_at":"2026-08-06T20:50:32.481014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.199991Z","title":"Lorasculpt: Sculpting lora for harmonizing general and specialized knowledge in multimodal large language models","venue":null,"work_id":"33e4f16d-e158-44a2-9e6e-21ca7afe3cc0","year":2025},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.486055Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:65592ed346d326f8f008bbbd5467f5db2100ab01b5a1355f6fd57281d67b5180","observation_id":"ba85fff2-448b-4834-9afe-f7ce0c8c9d8d","resolution":{"observed_at":"2026-08-06T20:50:33.206277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.183733Z","title":"ALoRA: Allocating low- rank adaptation for fine-tuning large language models","venue":null,"work_id":"58d3cac6-1dcb-4b01-81a3-aaee5f935958","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.492745Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:21c562905250b169aae1482e1ec851d275799faf765fd10b4629bb01e450ed08","observation_id":"cec1c613-c655-4b4d-b6da-cbbffbfa6f5f","resolution":{"observed_at":"2026-08-06T20:50:33.188831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09290","last_updated":"2023-08-18T04:29:48Z","snapshot_observed_at":"2026-08-10T16:00:00.550885Z","submitted_at":"2023-08-18T04:29:48Z","title":"HyperLoRA for PDEs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09290","snapshot_observed_at":"2026-08-06T20:50:32.503880Z","title":"HyperLoRA for PDEs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.503880Z"},"links":{"cited_paper":"/paper/2308.09290","citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:5441d23fa44a7b3d8f8b2f2bbc43d5b33fd29e219f1adda86b7d6e83c193efcb","observation_id":"ac5be458-b0cb-41a5-94d6-41b138c60841","resolution":{"observed_at":"2026-08-06T20:50:32.503880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.155011Z","title":"PIHLoRA: Physics-informed hypernetworks for low-ranked adapta- tion","venue":null,"work_id":"d44bf7a4-94df-4851-a081-4b263511f00e","year":2023},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.510026Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:fa002dee0b345be95f95c0ac9efc7aa89e37e152c429ed1273ca30d62a807c35","observation_id":"7c9c1975-1587-42f8-8e7b-be8a95075984","resolution":{"observed_at":"2026-08-06T20:50:33.160012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.137607Z","title":"A kernel- based view of language model fine-tuning","venue":null,"work_id":"94e39eb9-a99b-40e6-8682-9fa0208e1c52","year":2023},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.515591Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:7af5e52effc2306a83fec327ce5bc9e613fd6ee7089413db415ec54c89227a6b","observation_id":"d3dcf278-c143-4e6e-845b-9758b238c86e","resolution":{"observed_at":"2026-08-06T20:50:33.143627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.121663Z","title":"A survey on LoRA of large language models","venue":null,"work_id":"d1d1fcf3-e8b5-4c38-b607-e74e5c60bff3","year":2025},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.521040Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:0bb9c1da310b8f6655456cb10152927215cebb1fe592c9ee25021135dfb8b503","observation_id":"26763338-ee1d-440d-b34e-36696670768f","resolution":{"observed_at":"2026-08-06T20:50:33.126645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.103972Z","title":"Near-optimal sketchy natu- ral gradients for physics-informed neural networks","venue":null,"work_id":"7eac53c7-356b-4216-acf6-b9be157ce16f","year":2025},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.526229Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:5363d32dc174bcf8ced9ca73c5e0ca938615dc40c723bb372642a805c03ea1fe","observation_id":"6468e8a2-9a56-47d4-848c-7d1ffafeb2e4","resolution":{"observed_at":"2026-08-06T20:50:33.109375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.086578Z","title":"Achieving high accuracy with PINNs via energy nat- ural gradient descent","venue":null,"work_id":"f6daf731-72bb-443f-8218-82f051260b72","year":2023},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.531059Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:93b89d0637ae7bfa2b63c61008138c07f2487541a9ff05fbee2974027b9352f8","observation_id":"b7413970-6d79-4c7f-aa2a-aea8c8a23382","resolution":{"observed_at":"2026-08-06T20:50:33.091830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.070201Z","title":"Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear par- tial differential equations","venue":null,"work_id":"6b0adea1-7604-44b3-895d-e9cc591169c7","year":2019},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.537890Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:57d235363ef6f167580912930020e656dc5381aa8ae714f5cb6bd0ee51199f5e","observation_id":"775f186c-ebc9-40ff-97d1-9ba9920b607e","resolution":{"observed_at":"2026-08-06T20:50:33.075366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.052589Z","title":"Fine-tuning protein language mod- els boosts predictions across diverse tasks","venue":null,"work_id":"52896960-097c-48e0-bd4a-0fa9642b81ea","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.543227Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:de19391e56decf0e59df572d931dceb6c37850024d61f36122b1c9d9d395cba1","observation_id":"d59c02bc-c115-43bd-92d5-6a2eb17b11ce","resolution":{"observed_at":"2026-08-06T20:50:33.058245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.549403Z","title":"LoRA vs full fine-tuning: An illusion of equivalence","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.549403Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:b50a28e4df958d51028f64a8fb84d33b3139a68091cac14145abe61eeb45c988","observation_id":"3c4e2b39-5859-4e48-9d8e-dbad0e756118","resolution":{"observed_at":"2026-08-06T20:50:32.549403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.032413Z","title":"Tensor decomposition for compressing recurrent neural network","venue":null,"work_id":"ec352ee7-e9eb-4745-a40a-a551cb66c324","year":2018},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.554508Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:29fdab3cf9fcfd6e0fc843e55699590806f1a97f8bbf270d94bc27b5882f837b","observation_id":"f2787a93-acdf-4008-a83e-1d751b3b5d7b","resolution":{"observed_at":"2026-08-06T20:50:33.038124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:33.014543Z","title":"DyLoRA: Parameter-efficient tuning of pre-trained models using dynamic search-free low-rank adap- tation","venue":null,"work_id":"f2cd689d-8467-4fe6-b09a-2c50230f040a","year":2023},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.559711Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:98f667ff65b360596cef1037f2e6e6fcf22fe243090e5c5ce1a701e23d8a820a","observation_id":"a7e28d8d-1f8e-4433-8080-401f9d3e7fb0","resolution":{"observed_at":"2026-08-06T20:50:33.019870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.993790Z","title":"Parameter-efficient fine-tuning in large language models: A survey of methodologies","venue":null,"work_id":"3d20b2e0-511d-416d-83fd-ff64b4c94fc6","year":2025},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.566421Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:4a9c5f2cbaffa43315d8f1fdb492afd5d2840b9ab389c8bc985eacb8e6d67ba7","observation_id":"b688931c-2d24-491a-819b-c82bc61ba177","resolution":{"observed_at":"2026-08-06T20:50:33.001093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.975523Z","title":"Metaxas, and Hao Wang","venue":null,"work_id":"bdc03edb-623e-41a5-af5d-a31b557f0e57","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.571943Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:f87d4d94a32975c5bdc0b9a3561194df52caa7997a1b0754359ffabeed87c430","observation_id":"ef3f0cfe-6b25-4e72-bdab-cc1b7ca77fe6","resolution":{"observed_at":"2026-08-06T20:50:32.980782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.958842Z","title":"Transfer learning in physics-informed neurals networks: Full fine-tuning, lightweight fine-tuning, and low-rank adaptation","venue":null,"work_id":"031fce9b-ab48-4fbe-aeee-a0efe1a6e0da","year":2025},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.578213Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:307c97dea750bccbb4cc74d9bb5c71586097b803fb31319f0a34704a2e65a0d9","observation_id":"f5ec345c-d9f3-40c2-8505-d6ceaed764f9","resolution":{"observed_at":"2026-08-06T20:50:32.963991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.941735Z","title":"Yang, Maxime Robeyns, Xi Wang, and Laurence Aitchison","venue":null,"work_id":"173869ff-18fe-4c06-a08e-89428623aeba","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.583564Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:ad4558a2a7b13cd5e7016196beacfd51355b7686da491d9e01ac7d04c8129930","observation_id":"492f002b-2cf1-442e-b712-d24f5a6d7377","resolution":{"observed_at":"2026-08-06T20:50:32.947119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.924428Z","title":"LoRETTA: Low-rank economic tensor-train adaptation for ultra-low-parameter fine-tuning of large language models","venue":null,"work_id":"2946bef1-1478-4c68-8f62-250a39dbdbf6","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.588741Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:2b6886e44621132b903db942a244369e3de2dd22f46e24a0a2da7d67a3116808","observation_id":"2496fe8d-d940-45f5-bb5d-a20511df51dc","resolution":{"observed_at":"2026-08-06T20:50:32.930047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.906739Z","title":"Ranking and tuning pre-trained models: A new paradigm for exploiting model hubs","venue":null,"work_id":"f930cd69-2559-420a-b7ba-d79b756797db","year":2022},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.594744Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:5a49e5c7a48b2694c474b926c33eadd88798c3f232f7ecbdf0d51cd656ffd111","observation_id":"f0b5d45b-2372-4d07-b2c9-5ef411a33e0e","resolution":{"observed_at":"2026-08-06T20:50:32.913160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.600394Z","title":"The expressive power of low-rank adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.600394Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:204fb60a8c7e29269b506a97d84cfe05f31911536079df5bdd163c13523da500","observation_id":"7ba0554b-df99-4dba-8ac0-cbb9c1a251ac","resolution":{"observed_at":"2026-08-06T20:50:32.600394Z","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-06T20:50:32.605767Z","title":"Adaptive budget allocation for parameter-efficient fine-tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.605767Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:7567e3dd03387805edb5997d2fcbc5411ccc6ec26c1de219b868960531ab578c","observation_id":"c451a1ec-7944-42b0-9f82-8fffb1af7df7","resolution":{"observed_at":"2026-08-06T20:50:32.605767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.866058Z","title":"Personalized LoRA for human-centered text understanding","venue":null,"work_id":"baf0fbf6-73d3-4cc3-9d36-ef4a7bce512f","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.611821Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:4d543d90ec9ca8f0c6903cfc27c3b9898f98d3a60027828aabee717285735259","observation_id":"3cdf865b-e39d-465f-b662-610cad7fc237","resolution":{"observed_at":"2026-08-06T20:50:32.872246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.849221Z","title":"Neural prompt search","venue":null,"work_id":"9483649b-1e38-4f81-8fd8-438fbb791f43","year":2024},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.617056Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:2168bab01aa8adf8ddffe263943872f7ff42ed33e5624c28055404ffd4f7a605","observation_id":"c25ef6ab-fc64-4970-954d-e552e4e7bf09","resolution":{"observed_at":"2026-08-06T20:50:32.854743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:50:32.498696Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T20:50:32.498696Z"},"links":{"citing_paper":"/paper/2507.01841"},"observation_digest":"sha256:c63416f47a0eef7114b4219a6f28a49ee6a5c2df2d224baaac7c8d26320b9bd1","observation_id":"d69c62c5-5b4b-48f3-97f6-e9be8a0c6ee1","resolution":{"observed_at":"2026-08-06T20:50:32.498696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.01841","last_updated":"2025-07-02T15:56:40Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T07:10:34.789441Z","submitted_at":"2025-07-02T15:56:40Z","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":1,"verified_fuzzy":30},"total_outbound_references":45},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2507.01841."}