{"as_of":"2026-08-20T21:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:979f3ea1af17d14dfbfd747e115a88f52984ae0276b65bfb49bd6ecea06e9a6a","coverage":[{"denominator":78,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":78,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T03:07:59.787733Z","state":"measured"},{"denominator":78,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":78,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2607.03346/citation-record","integrity":"/paper/2607.03346/integrity","json":"/paper/2607.03346/citation-record.json","paper":"/paper/2607.03346"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8526.332958","doi":"10.1145/3328526.3329589","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A marketplace for data: An algorithmic solution","venue":null,"work_id":"503f3a73-3993-44fd-b64e-08698123e2df","year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:d27d930f7342d0ed678315adcbca5e1850ccbbe24097dd4e360297677334a935","observation_id":"1242f109-8928-4cd4-8b90-01e7a39356c1","resolution":{"observed_at":"2026-07-12T03:08:25.748831Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-13T17:49:32.518995+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T17:49:32.518995+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10801","last_updated":"2024-10-14T17:58:01Z","snapshot_observed_at":"2026-08-16T13:09:29.217700Z","submitted_at":"2024-10-14T17:58:01Z","title":"Mix Data or Merge Models? Optimizing for Diverse Multi-Task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10801","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Mix data or merge models? optimizing for diverse multi-task learning.arXiv preprint arXiv:2410.10801, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2410.10801","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:05ebd0e7f20cfc83576a2c68342c5a5e08d911afdcf04fc3c48feef31365f368","observation_id":"f3769548-ec5d-4676-ae7e-b504ffd47945","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Towards reversible model merging for low-rank weights.arXiv preprint arXiv:2510.14163, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:aab2c66bbb40b8dba171689e24da2fbba039a761830e467c29f4951302c7651f","observation_id":"dfbd41df-fbce-4c64-b6e2-8d25d8568063","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Fundamentals of task- agnostic data valuation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:e9009abe1e722af0bbdd2df74dcf9dc2214e4fafa076c69130f2a59457ff4e4f","observation_id":"da8a5da5-dfea-4ce5-a723-8a2c2c226e03","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Food-101–mining discriminative components with random forests","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:9b987c234553f1666c6b165bbf228ae2a72a0f8aac50833da3f207987d473360","observation_id":"6d501dab-1161-4dd8-bcf3-0fc87b779ad5","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11730","last_updated":"2025-01-22T17:05:51Z","snapshot_observed_at":"2026-08-20T06:23:31.744929Z","submitted_at":"2024-06-17T16:48:31Z","title":"CHG Shapley: Efficient Data Valuation and Selection towards Trustworthy Machine Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11730","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Chg shapley: Efficient data valuation and selection towards trustworthy machine learning.arXiv preprint arXiv:2406.11730, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2406.11730","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:8aee502511f2ef88110f0f2021da8f6c16e4f9b936f79e4f38c8d2a0c753d4ed","observation_id":"76f28ae9-4f99-462c-ac09-23a368e35473","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Towards model-based pricing for machine learning in a data marketplace","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:2f974a7fef1fae7566ce156c69da46e51192a798ff0715bf737d46ebe4ee003b","observation_id":"3dc27b28-c9b1-4cb8-8596-44d153ce78fe","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Defending unauthorized model merging via dual-stage weight protection.arXiv preprint arXiv:2511.11851, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:e1ce2a7e8e2f538ccd01a7edc0f6922328ae81966a31fab934a9c624cbd4f1ff","observation_id":"382c4e66-de17-414f-920b-1128408edf1e","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Remote sensing image scene classification: Benchmark and state of the art.Proceedings of the IEEE, 105(10):1865–1883, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:ace3209e6c010b001d96092d0b0b51b9e503dd2d26959496610340ea0fb3472a","observation_id":"77601dc2-3e43-4f42-bf54-26a3c24d0a1f","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07688","last_updated":"2024-12-10T17:25:14Z","snapshot_observed_at":"2026-08-17T02:05:08.919415Z","submitted_at":"2024-12-10T17:25:14Z","title":"A Joint Energy and Differentially-Private Smart Meter Data Market","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07688","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"A joint energy and differentially-private smart meter data market.arXiv preprint arXiv:2412.07688, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2412.07688","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:b9d18282c02e8027b5ca8e937e6f2a33e6b6d8ae9751696bec2ab0cbe4b117d4","observation_id":"9f2c4d2e-563e-405a-9d7c-e45b22a80e7c","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Aggarwal, and Yao Ma","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:446368525b73f0968352f5d6c3f931c59da59c7136e09d05e67bf094a1fcb418","observation_id":"fb151ccc-7427-49d0-b845-f5ba62d4d359","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11416","last_updated":"2022-12-06T21:39:48Z","snapshot_observed_at":"2026-08-18T19:51:48.688199Z","submitted_at":"2022-10-20T16:58:32Z","title":"Scaling Instruction-Finetuned Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.11416","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Chi, Jeff Dean, Jacob Devlin, Adam Roberts, Denny Zhou, Quoc V","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2210.11416","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:f388dfe4560606db8fd4e8abbd41e6f2237ff10e447cb6645fff71b5a1bad3d5","observation_id":"f6a260c3-9075-4ec4-923f-71069ab55add","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Describing textures in the wild","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:3357f8a076c869e2fa028efb351b67504a5f0c605944079f2bc1af838d62678e","observation_id":"8f2043da-44a0-48d2-bf56-04cfcea285f4","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Boolq: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:5469d693ffc7373a59e142ae6f12a3691d6699536df89e00ceed8ffb1e7135b0","observation_id":"026ab180-0987-44eb-b0b6-74c90c5f85f4","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-08-14T19:36:07.505691Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge.arXiv:1803.05457v1, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:a16f87f5439f05063418385354a33d4a7cc2cf25821a3709fd4f62739d9a0e43","observation_id":"89e827d4-c670-4ab6-8ae0-e1b1311205cd","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:ae7f56472965249c890a317d487b2156d4051dfea899608a6a756e47654c449a","observation_id":"b092aa5d-ca56-48af-855a-dc9a8d27b51b","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Emnist: Extending mnist to handwritten letters","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:35a2f12903fac9a934bc01effa5fc65984767d2da5d543648362f5296b5f33d8","observation_id":"85e581c0-7fb3-4772-9f85-69d2bdabd63b","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12659","last_updated":"2024-08-22T18:05:41Z","snapshot_observed_at":"2026-08-17T03:11:36.139823Z","submitted_at":"2024-08-22T18:05:41Z","title":"Disentangled Structural and Featural Representation for Task-Agnostic Graph Valuation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12659","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Disentangled structural and featural represen- tation for task-agnostic graph valuation.arXiv preprint arXiv:2408.12659, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2408.12659","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:4a87dc92ba050cec2242d3969cec3da3c731be82e5fb24587c000c6fa3de62fc","observation_id":"373031b5-4b7a-4ecf-852e-ccb988eb23e3","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Du-shapley: A shapley value proxy for efficient dataset valuation.Advances in Neural Information Processing Systems, 37:1973–2000, 2024","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:da1805c0a8ecaf98015b950bb276ce4a060af0e3f7fe983ca7f29ff8ce1b27c5","observation_id":"644527e2-8eab-426f-a572-3f3ad60b9a11","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Did aristotle use a laptop? a question answering benchmark with implicit reasoning strategies","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:2f3f2cdde895103acf2b3c80b523c5b0f7554907c68ca81824f3cb9ea05dc8a6","observation_id":"6c572775-97a2-46e5-9809-5e89c78368eb","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Data shapley: Equitable valuation of data for machine learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:c80eb1609bd09222082ae1797a17df2c9e30fae0bada0377d2b71abe9d4b53dc","observation_id":"7b529507-602d-4dfc-a179-d57309aa1bab","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"The llama 3 herd of models.arXiv preprint arXiv:2407.21783, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:69c906952e5dc5404a7c130d3209528379aa70f8eb5f63e64abbe3d2a67c20be","observation_id":"afb0c9bf-b708-4105-afe7-fc541af9ae1e","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:a6d623752daa6f0f0c3a37629ae0735af75df156692a35da798578de28560ef7","observation_id":"146f60eb-07d8-4201-9892-cbbcd287c859","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:615bc3b68f690fffce2c77fd6bd59ee0f277651256de9e09f89dfdbed9d7ea0c","observation_id":"5c27d139-f6fa-4f6e-ad4c-8965fca81052","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Editing models with task arithmetic","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:5e1ccd5c496946aaedf3080a25db08d7741c3426b05cd25c1061a68c1a8e9400","observation_id":"5b465638-5e42-46d6-a65c-c8bbb0a1b49d","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00745","last_updated":"2024-11-01T17:13:14Z","snapshot_observed_at":"2026-08-16T13:03:43.744130Z","submitted_at":"2024-11-01T17:13:14Z","title":"Private, Augmentation-Robust and Task-Agnostic Data Valuation Approach for Data Marketplace","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.00745","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Private, augmentation-robust and task-agnostic data valuation approach for data marketplace","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2411.00745","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:e2c497e82f85e52ec25ffd2ec0a91c3a85fe0a22367d9dafa9f61f84d424bc57","observation_id":"4f910584-5e2f-4881-8d53-948873df9f26","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Efficient task-specific data valuation for nearest neighbor algorithms.Proc","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:f98d7470343fb98778178094234c5b5b18f31cf2de5bced58508212520c01166","observation_id":"b523114c-278a-4f15-bb62-9b20d2c09441","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:f1ce24aff2a1d5e1d730c878a08c01b59fd50ddb399c3f28489d52671a54a013","observation_id":"ab2d0ad6-6ef5-467d-b454-149a3bc8b1ef","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Pubmedqa: A dataset for biomedical research question answering","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:de53a38294a60636f1e7a097b837ecc73b1699f3f91d766c8e9b51ed090d9923","observation_id":"3dd60136-7749-4a11-89fd-0c6c4199f242","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Disrupting model merging: A parameter-level defense without sacrificing accuracy","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:a05ccf612a3a739aa31753d6ad8831081024af059870bb3c2f873a4e0cef6bef","observation_id":"a0a99520-9b8a-4e74-abdd-2d3efa573b4c","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Understanding black-box predictions via influence functions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:89db833ba3fcc5651189101ac78e8f62193f5f9158e464f9e679c41ae450135c","observation_id":"4e2243cd-e143-46b8-8d67-e43dd78040cc","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"3d object representations for fine- grained categorization","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:e920216f235efabb8002cb43cafbd3d85a76cedb36c2b109750fa44c5e8e3c66","observation_id":"3b58fed8-063d-4889-9d8e-5b81f3c522d3","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:d76da91c69ddb8bb1b5d6a526efa628640b5ba0b87182ea6f3317ea767007dbe","observation_id":"8dfa7927-d6a3-4c88-998a-cdcec1e0dcb2","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Gradient-based learning applied to document recognition.Proceedings of the IEEE, 86(11):2278–2324, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:a29b9c148041ad442dd0831835e6b8d6d2e53e3e6ab915bde5568629d6c33398","observation_id":"f8fcebfa-ae16-4773-97f8-c51f46c037d6","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"When is task vector provably effective for model editing? a generalization analysis of nonlinear transformers","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:79027a751ab17d7a5459d69782b5e0e7091d244efeed5f24df35b4e9b808b6b5","observation_id":"3fae00a9-7268-4d00-bf20-39e103f6b564","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08124","last_updated":"2020-07-16T05:52:16Z","snapshot_observed_at":"2026-08-18T19:00:40.885312Z","submitted_at":"2020-07-16T05:52:16Z","title":"LogiQA: A Challenge Dataset for Machine Reading Comprehension with Logical Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08124","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Logiqa: A challenge dataset for machine reading comprehension with logical reasoning.arXiv preprint arXiv:2007.08124, 2020","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2007.08124","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:f1ac7eb694d70d1454283363039a35061c04ed7a4f36e9691374913e16338539","observation_id":"540c74c9-79ea-4f6e-b006-bed4a2a8b05c","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Dealer: an end-to-end model marketplace with differential privacy.Proc","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:42cab89cf5d0fe3c9ef4a2a00a8309e9708e28faf7b3b36c0147c50ae50b8f6b","observation_id":"9ef88f1a-08f1-4c05-9bfe-a1f77f23f9cd","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"doi: 10.14778/3447689.3447700","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:dbd7632d696747f4851cbff80cbdcd8187aae9218a50bda7fa55e3faaf5cc426","observation_id":"8e3b5bf7-13b1-418f-a2cd-53ac4c6d94bf","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04257","last_updated":"2024-06-06T17:03:51Z","snapshot_observed_at":"2026-08-18T22:14:10.347130Z","submitted_at":"2024-06-06T17:03:51Z","title":"Data Measurements for Decentralized Data Markets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04257","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Data measurements for decentralized data markets.arXiv preprint arXiv:2406.04257, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2406.04257","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:da130c199264052fb253c1a86c6abda28b20f46c52a2eb7522ed51e7059f0210","observation_id":"4afebfdf-0415-43cc-b815-1eaa0cd2c633","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Maas, Raymond E","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:48196ba49b720e3236ee81d78eecebb984e0ef0479e26512b2a75a25d05853d1","observation_id":"3a5263f3-7872-4811-9a5a-02cc96ea328b","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1306.4265","last_updated":"2014-02-12T22:51:33Z","snapshot_observed_at":"2026-08-15T15:25:03.089380Z","submitted_at":"2013-06-18T16:51:53Z","title":"Bounding the Estimation Error of Sampling-based Shapley Value Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1306.4265","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Bounding the es- timation error of sampling-based shapley value approximation.arXiv preprint arXiv:1306.4265, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/1306.4265","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:16f2a08f3a635d08cb50eadd99343d873b89c50f97e438bf5c78f18c562c4137","observation_id":"ee7dd67b-f52a-4e7d-9097-076f5e7ee421","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Merging models with fisher-weighted averaging","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:c07fbe3e9f3254f2ba758eeb85471fb5acce52b4264c91e95d235f66606ea78b","observation_id":"ebd7dc03-83d2-4ac9-8936-c8b32426e512","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:c9e3b84412aa99499725ef87f0cb1dffa93ff10301a4d19a816476b42d8c0e33","observation_id":"8e53842f-ca88-4904-8803-b1d63eb46f73","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Scalable data ablation approximations for language models through modular training and merging","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:ff6aac3928fcaa4fea3da5a2f39df7611be0a172d925bd4c3c60fe2f94b4f57b","observation_id":"3a809568-6eee-408c-bee5-51fbd9d71f33","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:8c5803aa6d91bc2446e5efac42aa53c99e61ce6f92bc52224eca21492e6667ba","observation_id":"4b90de15-ef19-4098-b84e-a63dccdc9e44","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Selectformer: Private and practical data selec- tion for transformers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:133623228a40045b50e184eb77cd22cfa1aec1bc025fd8a29048c96c7a9919b8","observation_id":"f91aa75e-7e94-4ebc-94b0-490fd486cf7e","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:cb1f0baf4d777b677e490871017954124bd81321fbe83d1a699c2bcecfd1ae57","observation_id":"23463c06-81cf-4eb5-9be1-2b0d81c68cb6","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Medmcqa: A large-scale multi-subject multi-choice dataset for medical domain question answering","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:3a31ed52e8594e59b8d1ec2f15fac7c12ebc711bbe6f75b4e216fb5baebf9f08","observation_id":"0661bbf0-e769-40e3-8ac3-356ca4e982d8","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Parkhi, Andrea Vedaldi, Andrew Zisserman, and C","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:21e9209ce3ee055d3615028c9a1227a325d8dd5f1a3473d949a4dcc6f8b168bb","observation_id":"51044b83-cfae-45e3-ba90-a31f992375a1","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Recognizing indoor scenes","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:4b8567106488a728bf6c52bb794b5cc67d78f1b0821107c75622f345908c2311","observation_id":"062b91b3-ace9-463e-961b-48f314d458c8","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-08-17T18:50:07.059564Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Qwen2.5 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:5ce71c19df88ca2527b8e9fe3fed148c2a447c3741723b053d5676f8f80aa337","observation_id":"e5aa3f48-32ef-40ec-9fa6-1274e94db4dd","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:93ef9e6c1f96a046bfabb6aeb835844d6a2f7258ada01716aecb893ba9aaefc6","observation_id":"53cb73d6-7699-4a0a-85b7-a38af64b128d","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"A value for n-person games","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:6bf1f3673652fe2162d7ea33aab27eaa1be0fe13e6cfefc7973f75a00920af90","observation_id":"b438f718-c092-4674-b44d-11f2b0463461","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"The german traffic sign recognition benchmark: A multi-class classification competition","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:a39038e81042ce52b8fa813a2dd5e147618f9ea2c9324731ba01ae125b764697","observation_id":"b5c5630f-bd37-40aa-afac-3cdad84a68c7","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"CommonsenseQA: A question answering challenge targeting commonsense knowledge","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:203840592408bca8dd724676aa0b830a49072262478370a8ca336f5a68b90b7e","observation_id":"c10c54ef-9329-410e-a7b2-b29e8638a40f","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Fusionbench: A comprehensive benchmark of deep model fusion.Journal of Machine Learning Research, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:f8f12765cefffe2a59389b858cdd5b669c64ec6a12f81d1a1a7cf6f66c6b5504","observation_id":"f011f85e-9220-4d84-9c50-446a6e9bd509","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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":"10.1109/y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T03:08:25.728971Z","title":"Heterogeneous graph data valuation: A shapley value- based approach","venue":null,"work_id":"1f4d6777-5500-4d03-89a0-dc28fd3c4110","year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:65c939e934cfa051697342330dc2e1806b797387a0d364bf5c32428a65692ff6","observation_id":"db07b7f5-d63f-4ac9-bcfd-118706f68778","resolution":{"observed_at":"2026-07-12T03:08:25.733204Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.16066","last_updated":"2025-05-21T22:34:13Z","snapshot_observed_at":"2026-08-16T06:41:41.617586Z","submitted_at":"2025-05-21T22:34:13Z","title":"Merge to Mix: Mixing Datasets via Model Merging","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.16066","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Merge to mix: Mixing datasets via model merging.arXiv preprint arXiv:2505.16066, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2505.16066","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:3e5efe4891dec39541a7e477b79461ac3233a8416ffb1af97f44f0f08281ca6e","observation_id":"583a8817-0454-458b-8787-464890970138","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.08723","last_updated":"2023-02-17T05:41:50Z","snapshot_observed_at":"2026-08-16T16:23:42.273205Z","submitted_at":"2022-10-17T03:39:54Z","title":"Private Data Valuation and Fair Payment in Data Marketplaces","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.08723","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Private data valuation and fair payment in data marketplaces.arXiv preprint arXiv:2210.08723, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2210.08723","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:41a91bc552153353721e482ed44e52f633f7191e5ec256d277444abee135a28e","observation_id":"8aefd375-a6f9-4d48-b7f1-6349a31d725e","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Attention is all you need.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:c0c26c24979291823c86954725e57ee7905844ca3468ae887f803588e4817321","observation_id":"edb5473a-e314-4044-9b06-7936a4d80e53","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"GLUE: A multi-task benchmark and analysis platform for natural language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:f1b9dfc8bb51bbcd268eea14dc1bef0e38b63a204eeb4e6533f796e261e448d5","observation_id":"bc518027-56e7-40b0-9329-9e8cd8fa3742","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Wang, Prateek Mittal, Dawn Song, and Ruoxi Jia","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:5ed405d7a28f3d289b9d3a9532c2beb353b6c3925ec74caaf347e4e8ce1fcf9e","observation_id":"72e052bc-72ad-436d-8260-3d2ab929e9ed","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.01548","last_updated":"2025-09-01T15:24:41Z","snapshot_observed_at":"2026-08-16T00:02:31.209481Z","submitted_at":"2025-09-01T15:24:41Z","title":"Model Unmerging: Making Your Models Unmergeable for Secure Model Sharing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.01548","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Model unmerging: Making your models unmergeable for secure model sharing.arXiv preprint arXiv:2509.01548, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2509.01548","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:b61f464f1793a09408836b949ccc24e81c6a2185115487091a340738ce105ce8","observation_id":"f00cdd65-48f9-44cd-b6bf-5ff577ec866e","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Scaling intelligence through model merging: A comprehensive survey.Authorea Preprints, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:f3d6f4a067e0405716c40364fd49dbf27bbeb0d5d9718d22f69ac21b621ae51e","observation_id":"d29c88be-d278-415e-8863-9d0e59ebc6aa","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference time","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:2e0f2b53dcbbf678e555b263fd5d775014fff1812f65b36615abbed4ee3d368b","observation_id":"70ffb220-3184-4b69-be35-36cc32251028","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Visual transformers: Token-based image representation and processing for computer vision, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:5ffbd2a8d6ea0a15d68416698a0c1ff2083bfad971442026b759918a80b23483","observation_id":"16342ac1-fac2-4836-9b6e-08e5518647ef","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-08-13T15:13:33.081929Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms.arXiv preprint arXiv:1708.07747, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:802be9da587aa826e93d813bdbdb0ac5308c8bffd8be192f97adf97c1bc335f2","observation_id":"e1613ffb-b867-4f57-9c13-0b55b3bfef6d","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Ehinger, Aude Oliva, and Antonio Torralba","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:b5d1efe62ebb09b7f57dc7aa4627e72186e1743c8ac7d77972d1ab9e1e2cdd07","observation_id":"fd50621d-10d8-4987-a4e4-cbce74cc72f7","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Ties-merging: Resolving interference when merging models.Advances in Neural Information Processing Systems, 36:7093–7115, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:f10daea1a438938b3fccd840ecc3129f2f5a51a732aba21b8265ad3f242a05c2","observation_id":"be351dd6-f97a-4a0d-bb27-df8848b72bbb","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17489","last_updated":"2024-05-25T03:26:33Z","snapshot_observed_at":"2026-08-16T13:49:33.752178Z","submitted_at":"2024-05-25T03:26:33Z","title":"On the Inflation of KNN-Shapley Value","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17489","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"On the inflation of knn-shapley value.arXiv preprint arXiv:2405.17489, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2405.17489","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:917462e87f46a1e1825bbb243f3a2bae0696ca0fc6346e9fe634ab4f4d0b6029","observation_id":"39ace9f7-171a-468f-a174-71af05241a93","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Data valuation using reinforcement learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:4e0d69ca803f46c5ee06858febedf96601a1142fa380fbe9d1b0baa36bae0e7a","observation_id":"e36d49c2-0c2d-4fdb-82ab-83d2d8803fd8","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Language models are super mario: Absorbing abilities from homologous models as a free lunch","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:18f95ffb8b09a2e6a1e38f4fb5c1a6017ab68bf83ae6251ba25f77bc1b4465e4","observation_id":"2d6971f2-09d9-4a85-85fb-8c92df047222","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Character-level convolutional networks for text classification.Advances in neural information processing systems, 28, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:047a0aea512da51a31919148580b40efcdd93650a40baaade123b73a2d0f4e97","observation_id":"b7062587-6939-4e06-a014-9d3cf5a208e7","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Paws: Paraphrase adversaries from word scrambling","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:ec97e1fff9ae72f0c008864b347be7ed372df3fe83d5ce69077d82e72f146156","observation_id":"aeefecca-af77-4605-8a28-8d332652688e","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.15651","last_updated":"2026-04-19T02:34:02Z","snapshot_observed_at":"2026-08-03T08:07:08.936291Z","submitted_at":"2025-09-19T06:20:54Z","title":"Toward Efficient Influence Function: Dropout as a Compression Tool","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.15651","snapshot_observed_at":"2026-07-12T03:07:59.787733Z","title":"Toward efficient influence function: Dropout as a compression tool.arXiv preprint arXiv:2509.15651, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"cited_paper":"/paper/2509.15651","citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:46db36aa48ab0224725160ddaf42cf684ba132192e61fc4f6e279d9fbe396c1f","observation_id":"2dc8e83e-f759-426a-9c6f-053d70f7c38c","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"On task vectors and gradients.arXiv preprint arXiv:2508.16082, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:ce91b4b50fe4f10cc875647fd9ef2d79ae16bca278a20a6c8572d02eceb2a4ca","observation_id":"2007e623-1b6e-4b5c-b5ff-3a913be9596b","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Multi-task code llms: Data mix or model merge?arXiv preprint arXiv:2601.21115, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:e5e9c2ceb9ea27987a64f75addaa19c82aece33ede8d41fe9a9a23c0e1a55df9","observation_id":"52c72c91-6dd8-4440-9e31-3087afc5de8a","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","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-07-12T03:07:59.787733Z","title":"Moreover, the Shapley coefficients form a convex combination, i.e., 1 n P S⊆[n]\\{i} 1 ( n−1 |S| ) = 1","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-07-12T03:07:59.787733Z"},"links":{"citing_paper":"/paper/2607.03346"},"observation_digest":"sha256:53be5005c2fdd4dbeabd1bdf4d107d86f02e7b6096ef39ee88088d29febde40f","observation_id":"a7578e75-6f95-454d-9820-16e21697561e","resolution":{"observed_at":"2026-07-12T03:07:59.787733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03346","last_updated":"2026-07-03T14:01:53Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-17T14:49:19.632052Z","submitted_at":"2026-07-03T14:01:53Z","title":"Efficient Decentralized Multi-task Dataset Valuation via Model Merging"},"reference_resolution":{"displayed":78,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":76,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":78},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 78 of 78 outbound references and 0 inbound Pith citation observations for arXiv:2607.03346."}