{"as_of":"2026-08-10T17:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d37dd4c6eb0de416ef897a0681d10b278187bd6aa31c73f8187f36892f373dd7","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:01:02.110444Z","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-03T17:58:46.734861Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-08-09T17:01:02.110444Z","title":"Localize-and-stitch: Efficient model merging via sparse task arithmetic.arXiv preprint arXiv:2408.13656,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01015","last_updated":"2026-06-23T02:24:17Z","snapshot_observed_at":"2026-08-09T22:17:27.125284Z","submitted_at":"2025-02-03T03:18:26Z","title":"Task Vector Bases: A Unified and Scalable Framework for Compressed Task Arithmetic","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T17:01:02.110444Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2502.01015"},"observation_digest":"sha256:9adac3a45b91b309f4bacf4cc6d611c57e98b1e564dd50b0d6714321e853babc","observation_id":"d680c1b8-2d0d-4e15-abb8-aa67118e3e70","resolution":{"observed_at":"2026-08-09T17:01:02.110444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-08-07T13:03:12.563994Z","title":"arXiv preprint arXiv:2408.13656","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-10T10:19:55.731709Z","submitted_at":"2025-05-28T23:28:12Z","title":"Unraveling LoRA Interference: Orthogonal Subspaces for Robust Model Merging","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:03:12.563994Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2505.22934"},"observation_digest":"sha256:08de4a384573d0a36578d321063e0a64a68fbec56ca00a7145607759de8e6d32","observation_id":"d75c328c-2c4d-42fc-b480-ad838db81328","resolution":{"observed_at":"2026-08-07T13:03:12.563994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-08-03T23:41:52.862989Z","title":"Localize-and-stitch: Efficient model merging via sparse task arithmetic, 2025 b","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.04805","last_updated":"2026-07-06T16:04:54Z","snapshot_observed_at":"2026-08-07T10:51:08.099986Z","submitted_at":"2025-11-06T20:53:02Z","title":"PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inference","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T23:41:52.862989Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2511.04805"},"observation_digest":"sha256:d3daab506dd844c014210fb419bf52e976d7e97f6af3ab1f6ab29e938e1e90f9","observation_id":"7f8a18a1-2ca8-4822-a646-55e5456bf810","resolution":{"observed_at":"2026-08-03T23:41:52.862989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":"2408.13656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-07-03T17:58:46.734861Z","title":"Localize-and-stitch: Efficient model merging via sparse task arithmetic","venue":null,"work_id":"96463424-67ac-4ac7-9e32-e4612cf0392a","year":2025},"citing_paper":{"arxiv_id":"2604.01674","last_updated":"2026-05-16T03:07:23Z","snapshot_observed_at":"2026-08-05T20:07:32.045019Z","submitted_at":"2026-04-02T06:21:21Z","title":"Can Heterogeneous Language Models Be Fused?","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T10:57:01.529364Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2604.01674"},"observation_digest":"sha256:4cb3c3afd63fd95902343109a12257b5e98ed20fe3b7ba40d8d9a474f89068fa","observation_id":"e43cc983-109c-48fd-bb3d-e5e1450ab239","resolution":{"observed_at":"2026-05-21T11:00:02.109077Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":"2408.13656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-07-03T17:58:46.734861Z","title":"Localize-and-stitch: Efficient model merging via sparse task arithmetic","venue":null,"work_id":"96463424-67ac-4ac7-9e32-e4612cf0392a","year":2025},"citing_paper":{"arxiv_id":"2605.12960","last_updated":"2026-05-20T10:12:11Z","snapshot_observed_at":"2026-07-06T23:24:37.915639Z","submitted_at":"2026-05-13T03:50:54Z","title":"DiM\\textsuperscript{3}: Bridging Multilingual and Multimodal Models via Direction- and Magnitude-Aware Merging","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-14T20:24:30.679219Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2605.12960"},"observation_digest":"sha256:a4dd667f5e4b95a84813b8393b8c65ed44af9c5b15e1b5698f46c8b0ecc7f00a","observation_id":"0808b502-bbc4-41ea-a039-f97a1d03be03","resolution":{"observed_at":"2026-05-14T20:42:58.890140Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":"2408.13656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-07-03T17:58:46.734861Z","title":"Localize-and-stitch: Efficient model merging via sparse task arithmetic","venue":null,"work_id":"96463424-67ac-4ac7-9e32-e4612cf0392a","year":2025},"citing_paper":{"arxiv_id":"2605.12960","last_updated":"2026-05-20T10:12:11Z","snapshot_observed_at":"2026-07-06T23:24:37.915639Z","submitted_at":"2026-05-13T03:50:54Z","title":"DiM\\textsuperscript{3}: Bridging Multilingual and Multimodal Models via Direction- and Magnitude-Aware Merging","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-21T09:12:22.712240Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2605.12960"},"observation_digest":"sha256:498734a024a38c1f5ead08a5ab0bac5bfa581ddc302dd21911a4dd5efd1228c3","observation_id":"ce9cfa11-ab37-4404-8414-5b54a5307de9","resolution":{"observed_at":"2026-05-21T09:14:05.744082Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":"2408.13656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-07-03T17:58:46.734861Z","title":"Localize-and-stitch: Efficient model merging via sparse task arithmetic","venue":null,"work_id":"96463424-67ac-4ac7-9e32-e4612cf0392a","year":2025},"citing_paper":{"arxiv_id":"2605.28649","last_updated":"2026-05-27T15:52:39Z","snapshot_observed_at":"2026-07-06T23:38:14.056361Z","submitted_at":"2026-05-27T15:52:39Z","title":"Interpretability-Guided Layer Selection over Subspace Projection: SAEs as Stethoscopes, Not Scalpels, for Raw Task Vector Model Editing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T14:00:31.962058Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2605.28649"},"observation_digest":"sha256:e0fd555d955551f6789d03a4c7894bcab100f77aa5e0ee78654cdc74b5909a39","observation_id":"6c131ad2-fe3b-4c4b-97e5-8b0cded19511","resolution":{"observed_at":"2026-06-29T14:03:29.419595Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":"2408.13656","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-07-03T17:58:46.734861Z","title":"Localize-and-stitch: Efficient model merging via sparse task arithmetic","venue":null,"work_id":"96463424-67ac-4ac7-9e32-e4612cf0392a","year":2025},"citing_paper":{"arxiv_id":"2607.01686","last_updated":"2026-07-02T04:27:45Z","snapshot_observed_at":"2026-08-09T02:25:47.839654Z","submitted_at":"2026-07-02T04:27:45Z","title":"WARP: Weight-Space Analysis for Recovering Training Data Portfolios","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-03T17:54:31.856386Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2607.01686"},"observation_digest":"sha256:5db41917ba394e123c984b74686cc4ca0f6556ca5b93a7d9129a6b6b123633e0","observation_id":"5bd723c9-72e6-4e9d-8d01-e9847e33520f","resolution":{"observed_at":"2026-07-03T17:58:46.736569Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2408.13656","last_updated":"2025-01-07T03:37:12Z","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13656","snapshot_observed_at":"2026-08-01T16:24:18.329081Z","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":20,"source":"arxiv_source","source_observed_at":"2026-08-01T16:24:18.329081Z"},"links":{"cited_paper":"/paper/2408.13656","citing_paper":"/paper/2607.18026"},"observation_digest":"sha256:b4847299ea700e214f09e1d0f09a327fc04570bb8a27087761bc1cf422809693","observation_id":"fe9f8c1b-a8ac-4368-890d-44b1e63881e6","resolution":{"observed_at":"2026-08-01T16:24:18.329081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.13656/citation-record","integrity":"/paper/2408.13656/integrity","json":"/paper/2408.13656/citation-record.json","paper":"/paper/2408.13656"},"outbound":[],"paper":{"arxiv_id":"2408.13656","last_updated":"2025-01-07T03:37:12Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T04:54:14.294842Z","submitted_at":"2024-08-24T19:14:02Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic"},"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-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 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2408.13656."}