{"as_of":"2026-08-10T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:678d3bce7782b5806a7903399fa0a5c8ae4e0971376e81fc08462bf04b109a6f","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:07:44.134485Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T23:39:04.004920Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.01230","last_updated":"2025-05-26T13:01:08Z","snapshot_observed_at":"2026-07-06T20:15:45.334609Z","submitted_at":"2025-01-02T12:45:21Z","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.01230","snapshot_observed_at":"2026-08-06T21:07:44.134485Z","title":"Modeling multi-task model merg- ing as adaptive projective gradient descent","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00992","last_updated":"2025-07-02T04:08:46Z","snapshot_observed_at":"2026-08-09T13:03:24.791483Z","submitted_at":"2025-07-01T17:42:19Z","title":"UniGlyph: Unified Segmentation-Conditioned Diffusion for Precise Visual Text Synthesis","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T21:07:44.134485Z"},"links":{"cited_paper":"/paper/2501.01230","citing_paper":"/paper/2507.00992"},"observation_digest":"sha256:88f5694bd381577a324c3077f64effef94698b0695b44b3d2490f4dd0df87fd3","observation_id":"522060b4-323c-494b-873b-20e3b2127e82","resolution":{"observed_at":"2026-08-06T21:07:44.134485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01230","last_updated":"2025-05-26T13:01:08Z","snapshot_observed_at":"2026-07-06T20:15:45.334609Z","submitted_at":"2025-01-02T12:45:21Z","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.01230","snapshot_observed_at":"2026-08-06T05:28:04.469147Z","title":"Modeling multi-task model merging as adaptive projective gradient descent,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.01819","last_updated":"2026-06-18T10:30:18Z","snapshot_observed_at":"2026-08-07T19:32:12.583689Z","submitted_at":"2025-08-03T16:15:49Z","title":"Decoding the Alzheimer's Continuum: Interpretable Multi-Gate Routing for Diagnosis and Transition Prediction","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T05:28:04.469147Z"},"links":{"cited_paper":"/paper/2501.01230","citing_paper":"/paper/2508.01819"},"observation_digest":"sha256:b073bdf299b11b00cd3d70db716aea5417eba3f2f439a50e2b73d9def0708f8c","observation_id":"22d323b3-7571-4dec-9019-54fa9ed12f17","resolution":{"observed_at":"2026-08-06T05:28:04.469147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01230","last_updated":"2025-05-26T13:01:08Z","snapshot_observed_at":"2026-07-06T20:15:45.334609Z","submitted_at":"2025-01-02T12:45:21Z","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","version":3},"cited_work":{"arxiv_id":"2501.01230","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.01230","snapshot_observed_at":"2026-07-03T23:39:04.004920Z","title":"Modeling multi-task model merging as adaptive projective gradient descent","venue":null,"work_id":"1536d28f-4ab7-44e4-be84-256988414655","year":2025},"citing_paper":{"arxiv_id":"2605.20948","last_updated":"2026-05-20T09:35:04Z","snapshot_observed_at":"2026-07-06T23:31:27.989406Z","submitted_at":"2026-05-20T09:35:04Z","title":"Memory Grafting: Scaling Language Model Pre-training via Offline Conditional Memory","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-21T05:49:14.789955Z"},"links":{"cited_paper":"/paper/2501.01230","citing_paper":"/paper/2605.20948"},"observation_digest":"sha256:276067b0991a572b9d496a4052eace0243e6f63329aa5240695621b91b58c4d7","observation_id":"fb236d1c-a0f1-4398-9576-592034ebae49","resolution":{"observed_at":"2026-05-21T05:49:40.739292Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01230","last_updated":"2025-05-26T13:01:08Z","snapshot_observed_at":"2026-07-06T20:15:45.334609Z","submitted_at":"2025-01-02T12:45:21Z","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","version":3},"cited_work":{"arxiv_id":"2501.01230","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.01230","snapshot_observed_at":"2026-07-03T23:39:04.004920Z","title":"Modeling multi-task model merging as adaptive projective gradient descent","venue":null,"work_id":"1536d28f-4ab7-44e4-be84-256988414655","year":2025},"citing_paper":{"arxiv_id":"2606.03391","last_updated":"2026-06-02T09:33:33Z","snapshot_observed_at":"2026-08-02T22:40:46.303545Z","submitted_at":"2026-06-02T09:33:33Z","title":"When Model Merging Breaks Routing: Training-Free Calibration for MoE","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T11:47:22.486110Z"},"links":{"cited_paper":"/paper/2501.01230","citing_paper":"/paper/2606.03391"},"observation_digest":"sha256:c4ad13ceb6b681b8be871f1126f9abb49338e70c4d2ff5fdf3c6c7b6d4291e01","observation_id":"1c75680b-0745-4f6a-9d28-35642506e310","resolution":{"observed_at":"2026-07-02T01:36:25.397282Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01230","last_updated":"2025-05-26T13:01:08Z","snapshot_observed_at":"2026-07-06T20:15:45.334609Z","submitted_at":"2025-01-02T12:45:21Z","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","version":3},"cited_work":{"arxiv_id":"2501.01230","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.01230","snapshot_observed_at":"2026-07-03T23:39:04.004920Z","title":"Modeling multi-task model merging as adaptive projective gradient descent","venue":null,"work_id":"1536d28f-4ab7-44e4-be84-256988414655","year":2025},"citing_paper":{"arxiv_id":"2606.18627","last_updated":"2026-06-23T03:37:22Z","snapshot_observed_at":"2026-08-03T04:42:05.437110Z","submitted_at":"2026-06-17T02:48:35Z","title":"PACT: Preserving Anchored Cores in Task-vectors for Model Merging","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T21:57:07.546038Z"},"links":{"cited_paper":"/paper/2501.01230","citing_paper":"/paper/2606.18627"},"observation_digest":"sha256:56512d2fe4c1f6b1b3e85133deeeaf8597bb2c5c7195219a43c889e25b7b660c","observation_id":"fa8b28fa-519b-4f3e-8e8e-bdb76bc72952","resolution":{"observed_at":"2026-07-03T23:39:04.007530Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01230","last_updated":"2025-05-26T13:01:08Z","snapshot_observed_at":"2026-07-06T20:15:45.334609Z","submitted_at":"2025-01-02T12:45:21Z","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","version":3},"cited_work":{"arxiv_id":"2501.01230","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.01230","snapshot_observed_at":"2026-07-03T23:39:04.004920Z","title":"Modeling multi-task model merging as adaptive projective gradient descent","venue":null,"work_id":"1536d28f-4ab7-44e4-be84-256988414655","year":2025},"citing_paper":{"arxiv_id":"2607.01689","last_updated":"2026-07-02T04:30:51Z","snapshot_observed_at":"2026-08-01T04:09:58.591230Z","submitted_at":"2026-07-02T04:30:51Z","title":"Model Merging as Probabilistic Inference in Fine-Tuning Parameter Space","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-03T17:51:43.100153Z"},"links":{"cited_paper":"/paper/2501.01230","citing_paper":"/paper/2607.01689"},"observation_digest":"sha256:5487e8e3ea5d2c508c9bc3e12c2360848a5ea5a1f32002cb1d5f9156df381164","observation_id":"96cef20c-1d22-4a77-9cfa-d9c90b1d24a5","resolution":{"observed_at":"2026-07-03T17:58:46.824162Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.01230/citation-record","integrity":"/paper/2501.01230/integrity","json":"/paper/2501.01230/citation-record.json","paper":"/paper/2501.01230"},"outbound":[],"paper":{"arxiv_id":"2501.01230","last_updated":"2025-05-26T13:01:08Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:15:45.334609Z","submitted_at":"2025-01-02T12:45:21Z","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2501.01230."}