{"as_of":"2026-08-09T21:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:180c4ad55d8f1a10193553d4bc1984d17cd886dc43071e0ef3b2e83098b9f7e2","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":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":19,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:01:02.034547Z","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-06-29T14:03:29.436660Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-09T17:01:02.034547Z","title":"Evolutionary optimization of model merging recipes.arXiv preprint arXiv:2403.13187,","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-09T16:50:36.024297Z","submitted_at":"2025-02-03T03:18:26Z","title":"Task Vector Bases: A Unified and Scalable Framework for Compressed Task Arithmetic","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T17:01:02.034547Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2502.01015"},"observation_digest":"sha256:9e9862a00df9bd1b3e08f14fcc5a9a3b2f3365c8002da4fe2f4fc89a6e98c1e7","observation_id":"7780313c-d19d-43d5-87d0-8c930ea6c721","resolution":{"observed_at":"2026-08-09T17:01:02.034547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-08T23:51:29.325818Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04030","last_updated":"2025-06-25T14:44:30Z","snapshot_observed_at":"2026-08-09T18:05:30.973187Z","submitted_at":"2025-02-06T12:47:25Z","title":"Fine, I'll Merge It Myself: A Multi-Fidelity Framework for Automated Model Merging","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T23:51:29.325818Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2502.04030"},"observation_digest":"sha256:26f4b53a6c1afc8feedf20975f865215254b07e7ece58a158ddc071627ab95be","observation_id":"17b3ccfc-1005-482d-9bb2-c47403f00b84","resolution":{"observed_at":"2026-08-08T23:51:29.325818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-07T22:52:27.435986Z","title":"Evolutionary Optimization of Model Merging Recipes , 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.09056","last_updated":"2025-03-27T06:45:16Z","snapshot_observed_at":"2026-08-09T11:47:34.382262Z","submitted_at":"2025-02-13T08:10:45Z","title":"Adapting Language-Specific LLMs to a Reasoning Model in One Day via Model Merging -- An Open Recipe","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T22:52:27.435986Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2502.09056"},"observation_digest":"sha256:2dcb1aba26f30da3e5aab6f8db416828ec267d043bcddffdf1a017dedbc2936f","observation_id":"bde4cb60-85b2-477d-bb19-4fcfb779b978","resolution":{"observed_at":"2026-08-07T22:52:27.435986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-07T00:59:40.413805Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-07T23:12:16.942292Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:40.413805Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:6c25b14957689ca75cea3b65f7c70017d143f591ed768628ee24c521e3d93a29","observation_id":"3f7e8a81-eee5-42dc-b672-dbc6ed454980","resolution":{"observed_at":"2026-08-07T00:59:40.413805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-06T22:53:07.973981Z","title":"Evolutionary optimization of model merging recipes.arXiv preprint arXiv:2403.13187, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20480","last_updated":"2025-06-25T14:24:59Z","snapshot_observed_at":"2026-08-08T05:07:43.279449Z","submitted_at":"2025-06-25T14:24:59Z","title":"GPTailor: Large Language Model Pruning Through Layer Cutting and Stitching","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:53:07.973981Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2506.20480"},"observation_digest":"sha256:cd0a9187352d2009de5d8b86028bb76439276d128e7a01a14a54a6ffddd5cf7f","observation_id":"46b3c6ab-3a85-48a5-9153-383a7a9fac6f","resolution":{"observed_at":"2026-08-06T22:53:07.973981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-06T21:15:07.514241Z","title":"Preprint, arXiv:2403.13187","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.00700","last_updated":"2025-07-01T11:56:45Z","snapshot_observed_at":"2026-08-06T21:06:42.926486Z","submitted_at":"2025-07-01T11:56:45Z","title":"Contrasting Cognitive Styles in Vision-Language Models: Holistic Attention in Japanese Versus Analytical Focus in English","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T21:15:07.514241Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2507.00700"},"observation_digest":"sha256:70f1982376dfe7ca354e8615bd234411a956d6681a05ac1ebb2fb5a3a760fc4b","observation_id":"f5aa8816-5b9f-42a5-83d0-bfab24b90a15","resolution":{"observed_at":"2026-08-06T21:15:07.514241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-06T18:57:16.032761Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07024","last_updated":"2025-08-23T00:44:49Z","snapshot_observed_at":"2026-08-08T13:03:17.550361Z","submitted_at":"2025-07-09T16:54:21Z","title":"FlexOlmo: Open Language Models for Flexible Data Use","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:16.032761Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2507.07024"},"observation_digest":"sha256:5e122f24109471c0813bb75d8b4d2a5f27e41a05a80d9530efc20b0b61a80e39","observation_id":"a990592b-822f-452a-a2ef-97ebe0364fc1","resolution":{"observed_at":"2026-08-06T18:57:16.032761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-06T19:07:32.863487Z","title":"Evolutionary optimization of model merging recipes, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-07T03:13:31.294588Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:32.863487Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:9392cc82e3d62a539366546c097790a54427927a786d5d3ccde00ade6352762a","observation_id":"a42f5d32-6a7d-4e88-949d-d0a5587b942e","resolution":{"observed_at":"2026-08-06T19:07:32.863487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-05T17:32:11.770242Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.16204","last_updated":"2025-08-22T08:24:02Z","snapshot_observed_at":"2026-08-06T04:07:58.633012Z","submitted_at":"2025-08-22T08:24:02Z","title":"Competition and Attraction Improve Model Fusion","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T17:32:11.770242Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2508.16204"},"observation_digest":"sha256:49342b19d4a23c2bc3d6f1f31a5e9baa8f3b4e4f73fb5122329a80c0ad05cd50","observation_id":"51d6f51a-db0b-4949-92bd-268b13d93ac3","resolution":{"observed_at":"2026-08-05T17:32:11.770242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-05T15:30:25.108083Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19839","last_updated":"2025-08-27T12:52:36Z","snapshot_observed_at":"2026-08-07T18:16:27.471819Z","submitted_at":"2025-08-27T12:52:36Z","title":"PSO-Merging: Merging Models Based on Particle Swarm Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:30:25.108083Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2508.19839"},"observation_digest":"sha256:3a8e9eb2d152658f87f3237e4ba1598cf1f494133faa326208180d425f511040","observation_id":"ad756850-0562-4568-9b9e-39a55d196488","resolution":{"observed_at":"2026-08-05T15:30:25.108083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":"2403.13187","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-06-29T14:03:29.436660Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":"95538e53-2a42-47b8-8a38-69cf8a9b241a","year":2024},"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":36,"source":"pdf_text","source_observed_at":"2026-05-21T10:57:01.529364Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2604.01674"},"observation_digest":"sha256:0b0718b39586a4530811ae1e3dd9bd035d1afa9ee528184fce54eeb269b3e1bc","observation_id":"bae88fb1-d1e1-4f79-b084-27d3829828c2","resolution":{"observed_at":"2026-05-21T11:00:02.091219Z","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":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":"2403.13187","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-06-29T14:03:29.436660Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":"95538e53-2a42-47b8-8a38-69cf8a9b241a","year":2024},"citing_paper":{"arxiv_id":"2604.26211","last_updated":"2026-04-29T01:30:08Z","snapshot_observed_at":"2026-08-02T05:40:26.169884Z","submitted_at":"2026-04-29T01:30:08Z","title":"OMEGA: Optimizing Machine Learning by Evaluating Generated Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-07T13:39:46.145409Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2604.26211"},"observation_digest":"sha256:6bd20492506366822d975dcd42333f58c7fa1f3dedf3dc458187cce560b7418c","observation_id":"de975470-a71a-45da-86ce-43f9f9b2ebaa","resolution":{"observed_at":"2026-05-12T08:51:24.288961Z","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":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":"2403.13187","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-06-29T14:03:29.436660Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":"95538e53-2a42-47b8-8a38-69cf8a9b241a","year":2024},"citing_paper":{"arxiv_id":"2605.12326","last_updated":"2026-05-12T16:08:47Z","snapshot_observed_at":"2026-08-02T13:11:06.216469Z","submitted_at":"2026-05-12T16:08:47Z","title":"Black-Box Optimization of Mixed Binary-Continuous Variables: Challenges and Opportunities in Evolutionary Model Merging","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-13T03:51:25.888170Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2605.12326"},"observation_digest":"sha256:713140a3fa490eb3505ef07229c4ec77d9ba15670d860d7746f36c5db18865d9","observation_id":"1b660dfa-a01a-41e1-802b-6e738bf4c30d","resolution":{"observed_at":"2026-05-13T03:52:12.543781Z","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":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":"2403.13187","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-06-29T14:03:29.436660Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":"95538e53-2a42-47b8-8a38-69cf8a9b241a","year":2024},"citing_paper":{"arxiv_id":"2605.14386","last_updated":"2026-05-14T05:09:12Z","snapshot_observed_at":"2026-08-03T20:31:55.519218Z","submitted_at":"2026-05-14T05:09:12Z","title":"Darwin Family: MRI-Trust-Weighted Evolutionary Merging for Training-Free Scaling of Language-Model Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-15T02:12:34.571185Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2605.14386"},"observation_digest":"sha256:87acba47e29d68aee563eebf8c84dc28c173627de577749fb6b4f2179c84b5d5","observation_id":"1810a655-c479-4d34-b73c-3d0e5aaa975f","resolution":{"observed_at":"2026-05-15T02:13:30.295728Z","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":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":"2403.13187","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-06-29T14:03:29.436660Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":"95538e53-2a42-47b8-8a38-69cf8a9b241a","year":2024},"citing_paper":{"arxiv_id":"2605.20803","last_updated":"2026-07-22T08:11:32Z","snapshot_observed_at":"2026-08-02T13:34:43.821108Z","submitted_at":"2026-05-20T06:50:10Z","title":"Tunable MAGMAX: Preference-Aware Model Merging for Continual Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T06:10:22.683330Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2605.20803"},"observation_digest":"sha256:257f4566c66e949c8b6db157d0be83157f11d0234aeed035a61fc80a239bca7b","observation_id":"93d89c0e-0668-443b-95c5-72041ac1831a","resolution":{"observed_at":"2026-05-21T06:13:59.634628Z","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":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-02T13:34:44.514715Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.20803","last_updated":"2026-07-22T08:11:32Z","snapshot_observed_at":"2026-08-02T13:34:43.821108Z","submitted_at":"2026-05-20T06:50:10Z","title":"Tunable MAGMAX: Preference-Aware Model Merging for Continual Learning","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T13:34:44.514715Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2605.20803"},"observation_digest":"sha256:2a4b8ff08238f5dd1e67215d42728c044d3c3ae2235bf09275d2acbc74a0fec5","observation_id":"a381ed56-52d4-42b4-8855-0735613cca3a","resolution":{"observed_at":"2026-08-02T13:34:44.514715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":"2403.13187","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-06-29T14:03:29.436660Z","title":"Evolutionary optimization of model merging recipes","venue":null,"work_id":"95538e53-2a42-47b8-8a38-69cf8a9b241a","year":2024},"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":26,"source":"pdf_text","source_observed_at":"2026-06-29T14:00:31.962058Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2605.28649"},"observation_digest":"sha256:c8c8083aaee2c0cc2e35e54771d70615b1c9c2efbda2e72611b8151aa2aac5e9","observation_id":"1a100bea-df10-4503-9d2e-fbab7f1a656c","resolution":{"observed_at":"2026-06-29T14:03:29.438676Z","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":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-02T13:37:01.988991Z","title":"Evolutionary","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21610","last_updated":"2026-05-20T04:43:02Z","snapshot_observed_at":"2026-08-06T13:09:35.487490Z","submitted_at":"2026-05-20T04:43:02Z","title":"SCOPE and SCION: A Benchmark and an Auditable Reference Pipeline for Schema Induction and Fusion from Text","version":1},"reference_index":158,"source":"arxiv_source","source_observed_at":"2026-08-02T13:37:01.988991Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2607.21610"},"observation_digest":"sha256:8326adf4283f57ffbd803ceade067ba80271b78362321a9b261f82c78045b520","observation_id":"d862950e-8f04-4d55-8cb9-18d6e9de172f","resolution":{"observed_at":"2026-08-02T13:37:01.988991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-07T12:24:12.964989Z","title":"Evolutionary optimization of model merging recipes.arXiv preprint arXiv:2403.13187, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.06216","last_updated":"2026-08-06T16:07:26Z","snapshot_observed_at":"2026-08-09T21:12:25.350542Z","submitted_at":"2026-08-06T16:07:26Z","title":"Continual Learning in Transition","version":1},"reference_index":183,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:12.964989Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2608.06216"},"observation_digest":"sha256:dc436716996ac87e69ef88a69c78fb6b9f56601ac0e39b6f43b059c7dfa1d40b","observation_id":"0aaa149e-518c-479a-a066-b4f9f784932c","resolution":{"observed_at":"2026-08-07T12:24:12.964989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.13187/citation-record","integrity":"/paper/2403.13187/integrity","json":"/paper/2403.13187/citation-record.json","paper":"/paper/2403.13187"},"outbound":[],"paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","latest_version":2,"primary_category":"cs.NE","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes"},"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 19 inbound Pith citation observations for arXiv:2403.13187."}