{"as_of":"2026-08-09T21:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7753c3332ff8e151cb2be7b56fca0f19a2daf53963fa9173c53495c326f030ba","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T19:04:45.697164Z","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-02T07:06:43.718273Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":"2305.03053","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-07-02T07:06:43.718273Z","title":"03053, arXiv:2305.03053 [cs] 18 Belanec et al","venue":null,"work_id":"ce38ce79-063f-4644-be6c-9132a7b7ffdb","year":2024},"citing_paper":{"arxiv_id":"2405.07987","last_updated":"2024-07-25T09:33:50Z","snapshot_observed_at":"2026-08-06T11:02:06.607024Z","submitted_at":"2024-05-13T17:58:30Z","title":"The Platonic Representation Hypothesis","version":5},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-05-15T06:03:56.328012Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2405.07987"},"observation_digest":"sha256:ac96e6e811ba24d4ab4f683a2f81a7ff15cfb6697e81a53317c06b0725f5caef","observation_id":"29d83232-ca4e-4d79-b84a-ebb5f7fc2dc3","resolution":{"observed_at":"2026-05-15T06:03:56.658812Z","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":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":"2305.03053","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-07-02T07:06:43.718273Z","title":"03053, arXiv:2305.03053 [cs] 18 Belanec et al","venue":null,"work_id":"ce38ce79-063f-4644-be6c-9132a7b7ffdb","year":2024},"citing_paper":{"arxiv_id":"2408.01119","last_updated":"2026-05-12T18:55:05Z","snapshot_observed_at":"2026-08-03T11:44:22.495911Z","submitted_at":"2024-08-02T09:00:03Z","title":"Task Prompt Vectors: Effective Initialization through Multi-Task Soft-Prompt Transfer","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-23T22:11:59.206066Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2408.01119"},"observation_digest":"sha256:c1541252f28a125ee95dbc0889b5e8c436d042af599abdd94b98e1db8f4d0797","observation_id":"01c7b3f1-06bb-4fba-9b77-2f4a057c60e6","resolution":{"observed_at":"2026-05-23T22:13:30.133244Z","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":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-08-07T19:04:45.697164Z","title":"Stoica, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10216","last_updated":"2025-08-12T07:34:30Z","snapshot_observed_at":"2026-08-08T07:46:40.733541Z","submitted_at":"2025-02-14T15:10:43Z","title":"Forget the Data and Fine-Tuning! Just Fold the Network to Compress","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-07T19:04:45.697164Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2502.10216"},"observation_digest":"sha256:471b5a1c7dd86e3061661d49d90c043dfbc0d03e36f325d08485fdaa94ce4591","observation_id":"652daf9d-6396-473f-975b-92ee447a2c0e","resolution":{"observed_at":"2026-08-07T19:04:45.697164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-08-07T15:09:37.629205Z","title":"Zipit! merging models from different tasks without training.arXiv preprint arXiv:2305.03053, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16066","last_updated":"2025-05-21T22:34:13Z","snapshot_observed_at":"2026-08-09T02:51:38.941026Z","submitted_at":"2025-05-21T22:34:13Z","title":"Merge to Mix: Mixing Datasets via Model Merging","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T15:09:37.629205Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2505.16066"},"observation_digest":"sha256:02541ece2b61d31597fbc7f7c6bd6c4a11502995ddb496771b1449471b580e6e","observation_id":"f0bf9792-1fe0-479b-9a6d-f83b5d284d95","resolution":{"observed_at":"2026-08-07T15:09:37.629205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-08-07T15:08:51.229729Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16148","last_updated":"2025-05-22T02:46:08Z","snapshot_observed_at":"2026-08-09T08:13:03.628091Z","submitted_at":"2025-05-22T02:46:08Z","title":"NAN: A Training-Free Solution to Coefficient Estimation in Model Merging","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:08:51.229729Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2505.16148"},"observation_digest":"sha256:60ef5f2a11eeaeb3adfd36e53a252bc7464a9c65a1fc0a1b41708bafc6f909da","observation_id":"a39ba0a5-1c40-444d-8c60-5c22c4cf4cef","resolution":{"observed_at":"2026-08-07T15:08:51.229729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-08-07T13:03:13.110708Z","title":"arXiv preprint arXiv:2305.03053","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22934","last_updated":"2026-05-28T18:21:08Z","snapshot_observed_at":"2026-08-07T12:54:45.412963Z","submitted_at":"2025-05-28T23:28:12Z","title":"Unraveling LoRA Interference: Orthogonal Subspaces for Robust Model Merging","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:03:13.110708Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2505.22934"},"observation_digest":"sha256:8adcac4b960f03495b3e2536f13cd24110fcd8163db1e781795b885a5d0a8530","observation_id":"d7647234-63d5-492f-8cdc-2aca4ceba9f5","resolution":{"observed_at":"2026-08-07T13:03:13.110708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-08-05T13:48:49.015699Z","title":"Stoica, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00311","last_updated":"2025-08-30T01:59:19Z","snapshot_observed_at":"2026-08-08T03:57:59.247604Z","submitted_at":"2025-08-30T01:59:19Z","title":"MorphGen: Morphology-Guided Representation Learning for Robust Single-Domain Generalization in Histopathological Cancer Classification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T13:48:49.015699Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2509.00311"},"observation_digest":"sha256:1bf92a8809b0441d517a9727d5b64d019cbbe880b5018ee99141e38384221772","observation_id":"45d259d9-c93b-4c96-b2a6-901981b9c320","resolution":{"observed_at":"2026-08-05T13:48:49.015699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":"2305.03053","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-07-02T07:06:43.718273Z","title":"03053, arXiv:2305.03053 [cs] 18 Belanec et al","venue":null,"work_id":"ce38ce79-063f-4644-be6c-9132a7b7ffdb","year":2024},"citing_paper":{"arxiv_id":"2604.02719","last_updated":"2026-04-03T04:22:30Z","snapshot_observed_at":"2026-07-06T22:52:02.162758Z","submitted_at":"2026-04-03T04:22:30Z","title":"MOMO: Mars Orbital Model Foundation Model for Mars Orbital Applications","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-13T20:47:51.509798Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2604.02719"},"observation_digest":"sha256:040c96e94e33a07e47ea3bc05844b0d17c7a68d17c07b07ee82cd6e6d887adb0","observation_id":"602743fa-f922-4c61-903d-842de98d69b9","resolution":{"observed_at":"2026-05-13T20:48:15.098834Z","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":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":"2305.03053","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-07-02T07:06:43.718273Z","title":"03053, arXiv:2305.03053 [cs] 18 Belanec et al","venue":null,"work_id":"ce38ce79-063f-4644-be6c-9132a7b7ffdb","year":2024},"citing_paper":{"arxiv_id":"2604.22823","last_updated":"2026-07-13T15:11:18Z","snapshot_observed_at":"2026-08-07T22:24:37.598492Z","submitted_at":"2026-04-18T09:38:03Z","title":"PivotMerge: Bridging Heterogeneous Multimodal Pre-training via Post-Alignment Model Merging","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T07:04:54.909073Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2604.22823"},"observation_digest":"sha256:9f55761a51a84bb322deface26b45ef629acd65541d6668d115ec8cf3c375079","observation_id":"e6430a09-15d9-4bcc-ab8e-1dbd3b7e3ecf","resolution":{"observed_at":"2026-05-10T07:06:52.919186Z","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":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":"2305.03053","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-07-02T07:06:43.718273Z","title":"03053, arXiv:2305.03053 [cs] 18 Belanec et al","venue":null,"work_id":"ce38ce79-063f-4644-be6c-9132a7b7ffdb","year":2024},"citing_paper":{"arxiv_id":"2606.04754","last_updated":"2026-06-03T11:37:58Z","snapshot_observed_at":"2026-08-05T13:55:09.242635Z","submitted_at":"2026-06-03T11:37:58Z","title":"Beyond Structural Symmetries: Linear Mode Connectivity via Neuron Identifiability","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T07:26:25.407267Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2606.04754"},"observation_digest":"sha256:6e27968afc9dd38ebcca177f0dda0f40c58b0a4a774af597ad6bac164475fe1d","observation_id":"93c65973-4d6d-492e-bd45-cb68fad27830","resolution":{"observed_at":"2026-07-02T06:16:43.915441Z","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":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":"2305.03053","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-07-02T07:06:43.718273Z","title":"03053, arXiv:2305.03053 [cs] 18 Belanec et al","venue":null,"work_id":"ce38ce79-063f-4644-be6c-9132a7b7ffdb","year":2024},"citing_paper":{"arxiv_id":"2606.04945","last_updated":"2026-06-08T08:41:05Z","snapshot_observed_at":"2026-08-02T15:48:27.544154Z","submitted_at":"2026-06-03T14:34:35Z","title":"STaR-Quant: State-Time Consistent Post-Training Quantization for Diffusion Large Language Models","version":2},"reference_index":119,"source":"arxiv_source","source_observed_at":"2026-06-28T07:14:26.441339Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2606.04945"},"observation_digest":"sha256:129c2dc2af48f548bcb2f01a71a713ed06409d8d501557fe72223edcbd363082","observation_id":"d09b61ea-abf1-4278-bb06-768b2ba7cf91","resolution":{"observed_at":"2026-07-02T07:06:43.720286Z","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":"2305.03053","last_updated":"2024-03-13T02:04:06Z","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03053","snapshot_observed_at":"2026-08-01T16:24:20.617436Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18026","last_updated":"2026-07-20T14:58:53Z","snapshot_observed_at":"2026-08-04T12:31:14.531365Z","submitted_at":"2026-07-20T14:58:53Z","title":"Rethinking Heterogeneous LLM Merging: A Weighted Model Averaging Perspective","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T16:24:20.617436Z"},"links":{"cited_paper":"/paper/2305.03053","citing_paper":"/paper/2607.18026"},"observation_digest":"sha256:c46cbf4382d802489d6000d85afa07fcbf0a89732892d08daeaef267baa6a529","observation_id":"81328fa1-500f-4cf4-abd5-5fbedfdb4039","resolution":{"observed_at":"2026-08-01T16:24:20.617436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.03053/citation-record","integrity":"/paper/2305.03053/integrity","json":"/paper/2305.03053/citation-record.json","paper":"/paper/2305.03053"},"outbound":[],"paper":{"arxiv_id":"2305.03053","last_updated":"2024-03-13T02:04:06Z","latest_version":3,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-04T16:00:39.222919Z","submitted_at":"2023-05-04T17:59:58Z","title":"ZipIt! Merging Models from Different Tasks without Training"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2305.03053."}