{"as_of":"2026-08-16T11:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3bf6e413eeb2dac968d5593af3bce05eb0ff3a46048efa5d0a00722e056bd47d","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:15:10.622938Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2608.12842/citation-record","integrity":"/paper/2608.12842/integrity","json":"/paper/2608.12842/citation-record.json","paper":"/paper/2608.12842"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.171219Z","title":"Task vector quantization for memory-efficient model merging,","venue":null,"work_id":"947f85ad-37ee-464c-b8bc-a326887d9156","year":2025},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.423149Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:d7d1d1ee88e591b0a2f7c63034adb919b08f1c216501b63dda89d336700ae719","observation_id":"bbe4926f-f097-417d-9e8a-15b763f94dbc","resolution":{"observed_at":"2026-08-15T22:15:11.174390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.163081Z","title":"Parameter competition balancing for model merging,","venue":null,"work_id":"25d5ab39-f360-4c2c-8bf7-37e65215cfbb","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.426817Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:cfbcdc28b1800cc063154aaf203598165ce77bb329db4839449ecd3768077def","observation_id":"6dd877a2-3143-48c7-b13d-2d501a9e10c5","resolution":{"observed_at":"2026-08-15T22:15:11.166175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.153532Z","title":"Toward Effective Model Merging in Semantic Segmen- tation,","venue":null,"work_id":"af24222b-ecfc-4f7a-b6aa-ce5833e03e70","year":1948},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.430102Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:333f75afc8bd710cd2067b2aebf46b661ade67c5c655a9468ed3b581de1942fa","observation_id":"33a4ebb4-d396-4f24-97ba-c7807dfb83b1","resolution":{"observed_at":"2026-08-15T22:15:11.157267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.144410Z","title":"Deep Model Fusion: A Survey,","venue":null,"work_id":"f54bd8c9-2787-4b98-8744-dead90a17854","year":2025},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.433596Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:7c3e1c04eeaa253e88ffec6b84b28f2cc93f3a36d324c6b83956491c2d5488b5","observation_id":"2200b1f0-be9b-44ec-a8f0-6a57186fc174","resolution":{"observed_at":"2026-08-15T22:15:11.148313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.136410Z","title":"Dataless Knowledge Fusion by Merging Weights of Language Models,","venue":null,"work_id":"2a7855f8-ae22-429b-ba63-fa954e474765","year":2022},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.436697Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:bf9182f5f5b8fb5a718d460a2dd76f2cd9057312318662c44d669004942906d8","observation_id":"e9fb9e96-9b7f-4162-9e37-5da3a2bb6b25","resolution":{"observed_at":"2026-08-15T22:15:11.139450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.128383Z","title":"Evolutionary optimization of model merging recipes,","venue":null,"work_id":"fa80f162-138e-4c87-a5fc-7c48625daa2a","year":2025},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.440037Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:fba327a9937561f83cd317f7022af37850bbfcde7f6ea34b5491085ada8f4e5e","observation_id":"abc7d0c3-8377-4496-8d06-e447ca02f17b","resolution":{"observed_at":"2026-08-15T22:15:11.131406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.120559Z","title":"Editing models with task arithmetic,","venue":null,"work_id":"63971f14-feb2-4ce0-822b-34c58c7db702","year":2023},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.443405Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:1f4793b5a52af0429684c55e657063921c7cda8f5fae45be55261fd5875d31b3","observation_id":"26d521ac-47b7-4bc2-bba4-d009372cda7a","resolution":{"observed_at":"2026-08-15T22:15:11.123561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.112704Z","title":"Adamerging: Adaptive model merging for multi- task learning,","venue":null,"work_id":"acb9b141-7415-46a4-868d-6730fcf43e02","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.446390Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:793c1080a6297022924486b50c79d6fa872ba263448e3733648a07e17e1cc1de","observation_id":"c7882b4f-ac03-4b10-90f0-1d05ea54fea8","resolution":{"observed_at":"2026-08-15T22:15:11.115700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.102926Z","title":"Whoever started the interference should end it: Guiding data-free model merging via task vectors,","venue":null,"work_id":"469e61b3-af4f-4451-a489-df77df6de3f9","year":2025},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.449462Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:82013cb9014ab2508af144a499f9b4cae7daa33cea7a001fcf4ad55470e4e5a6","observation_id":"ee3386dd-0dae-49e3-a7f5-2340065283ed","resolution":{"observed_at":"2026-08-15T22:15:11.106780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.094558Z","title":"Channel merging: Preserving specialization for merged experts,","venue":null,"work_id":"3e5a7f66-13af-471d-981c-0e417ae5519b","year":2025},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.452358Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:7fb1fe967bc0d63715569fd4b94db71126fbf12aaa9fb5ac8a2e84eae21b7712","observation_id":"d45af402-7512-4b92-8b5c-4ec6302ee8b6","resolution":{"observed_at":"2026-08-15T22:15:11.097802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.084930Z","title":"Mergebench: A benchmark for merging domain-specialized LLMs,","venue":null,"work_id":"f8515bfa-a576-4dbc-8587-106c45ffbae3","year":2026},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.455275Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:727d9e54932f4206a67fc1266dec73755c263ff1affe44037762015be4984cac","observation_id":"7b3fb521-9618-47bf-9183-e738c99f6902","resolution":{"observed_at":"2026-08-15T22:15:11.088991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.076639Z","title":"Language models are super mario: Absorbing abilities from homologous models as a free lunch,","venue":null,"work_id":"af6e4460-ba88-40f2-8db3-5b224facb49a","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.458345Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:b86542cf54aeb1a285328fcf928d4dc6a373516e3ad296a78040e7f389430fcf","observation_id":"f85d8fae-0096-4c39-b118-7faf82535391","resolution":{"observed_at":"2026-08-15T22:15:11.079726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.066672Z","title":"TIES- Merging: Resolving Interference When Merging Models,","venue":null,"work_id":"4e7aa840-a3f2-4456-ac06-09f65e704bc0","year":2023},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.461148Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:7c4b94e23778fa3ec8bd442b843a59612156c2646388789bdf9c57ae4b980c44","observation_id":"90e032a4-b9f8-46f2-a6ae-89f078daf778","resolution":{"observed_at":"2026-08-15T22:15:11.070748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.057774Z","title":"Model breadcrumbs: Scaling multi- task model merging with sparse masks,","venue":null,"work_id":"02a637cb-d157-48a9-9043-2aa61782e328","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.464121Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:258e21f2a2c5272e5604ab5a711819bf9d31900b5a8711c5518567e26fb4be1c","observation_id":"89b0cc6a-01b0-406e-b101-9ab2f3b4fd9e","resolution":{"observed_at":"2026-08-15T22:15:11.061049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.049458Z","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic,","venue":null,"work_id":"dfa415f4-cae7-4fca-a826-298cff487bdb","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.466877Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:de2c7144d023759afba5fbdee45e3eae67a542107e1eab6943ed9c54ec06fc53","observation_id":"f40a4f64-8fa8-4d32-a7e4-a8855c6c078d","resolution":{"observed_at":"2026-08-15T22:15:11.052584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.039353Z","title":"Pruning and quantization for deep neural network acceleration: A survey,","venue":null,"work_id":"391bce7f-2dc4-40f9-b874-d64df291f10b","year":2021},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.469758Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:d12ae9280e55d187845b020f984b964e1ba05ca7751a08231106268085bbb0e0","observation_id":"62c9b841-d8a9-4cc7-bb8c-868867353b09","resolution":{"observed_at":"2026-08-15T22:15:11.043532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.030485Z","title":"Knowledge composition using task vectors with learned anisotropic scaling,","venue":null,"work_id":"9ddafed0-ca3e-4c19-869a-35beda014897","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.472631Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:7165fd3e2d5ca10eb74060cbf74de1e735773894947457f35fc39d5a81f3e4e4","observation_id":"02061807-045b-4dfb-a6a5-f872ec73864d","resolution":{"observed_at":"2026-08-15T22:15:11.033775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.022097Z","title":"Learn to merge: Meta-learning for adaptive multi-task model merging,","venue":null,"work_id":"619cb35b-8e73-47dd-9d2b-4d8e773e3db0","year":2026},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.475320Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:9da7588fb1190b572ff1460cf5963b3759a558cbfe9a39ed7c13e507198c2112","observation_id":"9a4f40de-bc1d-458b-aa6b-36ad32c746b3","resolution":{"observed_at":"2026-08-15T22:15:11.025284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.013704Z","title":"Averaging weights leads to wider optima and better generalization,","venue":null,"work_id":"4ffa3ebf-1ed4-49b4-8325-5f5479b69d40","year":2018},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.478172Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:54c64caf8de06393db36d19a361041a50740dafefa17f5b1f0619990b381eef3","observation_id":"ab7f93ad-6ef0-4586-b1cc-68c9a6dd9c3e","resolution":{"observed_at":"2026-08-15T22:15:11.017179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.997396Z","title":"Model soups: averaging weights of multiple fine- tuned models improves accuracy without increasing inference time,","venue":null,"work_id":"f1152846-fbe0-4935-a3ba-33632e1d10c3","year":2022},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.483980Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:954a6e0326087766b1f5cba51d552ff50c93990caba8e8770196cf571b7acac4","observation_id":"6e6db414-8619-4060-bfee-dd8d929fa007","resolution":{"observed_at":"2026-08-15T22:15:11.000676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.988455Z","title":"Merging Models with Fisher- Weighted Averaging,","venue":null,"work_id":"39f3e41b-76b3-4159-9cce-15f0555356bc","year":2022},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.487206Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:7da4e12997ab7024e8cab6d0b968ddc880cf8411720a968d396f5c876c2652af","observation_id":"449ebed5-0c79-487b-8413-426a39147ccc","resolution":{"observed_at":"2026-08-15T22:15:10.991733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18729","last_updated":"2025-01-09T03:34:55Z","snapshot_observed_at":"2026-08-14T18:36:23.555197Z","submitted_at":"2024-11-27T20:08:55Z","title":"Multi-Task Model Merging via Adaptive Weight Disentanglement","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18729","snapshot_observed_at":"2026-08-15T22:15:10.490081Z","title":"Multi-task model merging via adaptive weight disen- tanglement,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.490081Z"},"links":{"cited_paper":"/paper/2411.18729","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:df43ba30d7d8f389bf68042359c0fca588ca02eafe7c088cb0e05a003f4e40a9","observation_id":"067e8b91-3bc9-4868-9b9f-a9a3a26a9bb7","resolution":{"observed_at":"2026-08-15T22:15:10.490081Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.979372Z","title":"Modeling multi-task model merging as adaptive projective gradient descent,","venue":null,"work_id":"a7a2a416-9add-4b0f-acb9-cafa5a448a1f","year":2025},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.493447Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:0422e38d9bb8a73d7db36d17aed2e0239e8a9940e04cbfa36f54bb3d7c6d9039","observation_id":"e66e60ef-67d7-4a98-a2cd-8da1df472d42","resolution":{"observed_at":"2026-08-15T22:15:10.982675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.970179Z","title":"Representation surgery in model merging with proba- bilistic modeling,","venue":null,"work_id":"5a3cdf74-67ef-4055-aebc-f0f5f9621c55","year":2025},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.496426Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:a9c9136e25fce79108590656fbd5751ebc420683a7406a9e7f69636649071ccd","observation_id":"f473ba77-6f97-4873-a7a7-ecbdc9929aaf","resolution":{"observed_at":"2026-08-15T22:15:10.973264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.961239Z","title":"Localizing task information for improved model merging and com- pression,","venue":null,"work_id":"11529566-7d54-4f49-80dd-97a5c1ab144d","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.499092Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:7eb1989d4e76705a8a67928f7f65ab9ba5ca744deb2ff5eca92984af3472fb84","observation_id":"7150f574-fe8e-4042-bc2e-ad1d6aa8e465","resolution":{"observed_at":"2026-08-15T22:15:10.964439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.952252Z","title":"Dropout: a simple way to prevent neural networks from overfit- ting,","venue":null,"work_id":"a90fd5e0-a197-4d68-bdb8-8e3350cb0ea4","year":1929},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.502034Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:375d9b1a1ff53e714fac794693caab1256d475ae024badc18ab24ad713463828","observation_id":"0dcb386b-4b59-4d08-aebc-a8c503d8efff","resolution":{"observed_at":"2026-08-15T22:15:10.955699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.942811Z","title":"BERT busters: Outlier dimensions that disrupt transformers,","venue":null,"work_id":"062c9036-ad49-477c-a4e3-6e646a6723d0","year":2021},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.505999Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:044b0618b38cc97c87632849f63efacb2d14c9ac7a461b61884840f6627fb709","observation_id":"b7bf7b3a-04ed-4407-bf2d-83cc9604b868","resolution":{"observed_at":"2026-08-15T22:15:10.946208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.933990Z","title":"Outlier Dimen- sions that Disrupt Transformers are Driven by Frequency,","venue":null,"work_id":"3be19824-501e-41d1-812b-1e2489e5bf7b","year":2022},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.509050Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:8522889d7b9e41b90dba5ca9de72fa59eea360bf91c784e8a5c18a358bc4ba4d","observation_id":"d814395c-5a92-4302-9b4e-75d6ab078282","resolution":{"observed_at":"2026-08-15T22:15:10.937313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.924979Z","title":"Outlier weighed layerwise sparsity (OWL): a missing secret sauce for pruning LLMs to high sparsity,","venue":null,"work_id":"d294ea97-2824-467e-8b08-11ecfdcb7790","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.512035Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:dead59fa34e6437b83c1ce3dce44570cc06efae5b5c5fdf6980defa5548c3bcb","observation_id":"273fa4f3-be0a-4dee-9bf2-674d2811f99d","resolution":{"observed_at":"2026-08-15T22:15:10.928362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.915848Z","title":"Learning n:m fine-grained structured sparse neural networks from scratch,","venue":null,"work_id":"28dc27cb-0c0d-4f0b-b307-7d401d7d75ba","year":2021},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.515097Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:633cb5ff6dc02fd71d9cfba0fd0ff09421d01c943f0c28903034955a87dbf1c9","observation_id":"a6081797-95d2-49fc-98f4-fe264ff82b54","resolution":{"observed_at":"2026-08-15T22:15:10.919096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.907229Z","title":"Structured Pruning Learns Compact and Accurate Models,","venue":null,"work_id":"372a3230-1ce1-4d28-ad5d-91a904f77a70","year":2022},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.518753Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:9077c8329f51294fc001dbe926572aa61897ee3717a9f7261c3e4025847448f4","observation_id":"4676f095-9456-408a-a51f-bb62ecb9fc95","resolution":{"observed_at":"2026-08-15T22:15:10.910324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.521586Z","title":"Completely derandomized self- adaptation in evolution strategies,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.521586Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:92a53292df555fd050694ac955d09be95d2431ef160cb6ba17d89205e996356c","observation_id":"0afccf73-acdf-463d-811e-f6a0f8e5b267","resolution":{"observed_at":"2026-08-15T22:15:10.521586Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.893617Z","title":"Open llm leaderboard,","venue":null,"work_id":"ddf6ece3-2e53-434f-b6a9-8625ba08f5e4","year":2023},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.524508Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:e60225626992edb584572cfd5305bafacad8b289f283f8a60359c37187e5dedd","observation_id":"ce537473-0a55-4b03-b726-2e79d4d79f2e","resolution":{"observed_at":"2026-08-15T22:15:10.896770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-15T22:15:10.527494Z","title":"Mistral 7B,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.527494Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:bb74f14a7a63dcb5e0ddcf290b039928b30ff107c242fef837343676768336fa","observation_id":"2ce9f17c-b6f0-4a14-934b-756bda1b0f79","resolution":{"observed_at":"2026-08-15T22:15:10.527494Z","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-08-15T22:15:10.531154Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.531154Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:471e19dedfd3d662b9ad9ea3da6ffb1209b3df8373b8a8cbffdec2598ec1aed5","observation_id":"e9b35433-4f5d-4039-8ac4-f7d50fd69e9c","resolution":{"observed_at":"2026-08-15T22:15:10.531154Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.884453Z","title":"Hellaswag: Can a machine really finish your sentence?","venue":null,"work_id":"80ed75eb-a2df-44bf-9293-9925d4eb0d53","year":2019},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.534736Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:579fa1afb9da20e387a79ccb9208ed17fc00a19c21887491b169274520819d6b","observation_id":"5eb0e630-1326-4f2e-b9a6-fe05887c1f7d","resolution":{"observed_at":"2026-08-15T22:15:10.887997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01574","last_updated":"2024-11-06T02:54:00Z","snapshot_observed_at":"2026-08-06T00:29:17.674418Z","submitted_at":"2024-06-03T17:53:00Z","title":"MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01574","snapshot_observed_at":"2026-08-15T22:15:10.537584Z","title":"MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.537584Z"},"links":{"cited_paper":"/paper/2406.01574","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:2de85a6b02ae748437273e6430ea3d6ffe4b5a7923646bbb042d693c1e3dde15","observation_id":"deed67e1-f0bc-49b9-b811-ff42eacaa4c4","resolution":{"observed_at":"2026-08-15T22:15:10.537584Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.874778Z","title":"TruthfulQA: Measuring How Models Mimic Human Falsehoods,","venue":null,"work_id":"baae024a-d0ee-4f19-9d42-d84d81e40041","year":2022},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.540690Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:d758a95f37cb3f70eca7b10e1836423256e8aa326f40fa40e73d0aca3e2c58c9","observation_id":"d665f01a-2b99-4740-925f-0266d09a0196","resolution":{"observed_at":"2026-08-15T22:15:10.879012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.543548Z","title":"Winogrande: An adversarial winograd schema challenge at scale,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.543548Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:d8089b9799091e7ee6e5980592bf8629c735282e6c6f23f867728f078f1c72a9","observation_id":"ccb4d6f6-34b2-4bf6-8963-265f5ce214e4","resolution":{"observed_at":"2026-08-15T22:15:10.543548Z","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-08-15T22:15:10.546381Z","title":"Training verifiers to solve math word problems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.546381Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:c9fa1addce5e2b71225bd70eb80833730b4ef3ecb30ca494ba9175ddc0cd9360","observation_id":"c2d450a1-c59b-4896-92ad-e62b832b5209","resolution":{"observed_at":"2026-08-15T22:15:10.546381Z","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-08-15T22:15:10.549826Z","title":"Open llm leaderboard v2,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.549826Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:be2cf5dc856f47b08e140364fa8dc4479edd7a5ef780cc002f4eb23daf57540e","observation_id":"87aaa833-0cfa-4eb8-a043-175a13b2224a","resolution":{"observed_at":"2026-08-15T22:15:10.549826Z","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-07-06T02:11:23.670680Z","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-08-15T22:15:10.552765Z","title":"Qwen2. 5 technical report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.552765Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:1f34baaab4185fe31478283e64e693c415c6e19273577f0ab3bce6630e3f83d1","observation_id":"ed13bfe8-1d4a-442f-8d47-5c36c926679f","resolution":{"observed_at":"2026-08-15T22:15:10.552765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07911","last_updated":"2023-11-14T05:13:55Z","snapshot_observed_at":"2026-07-06T16:47:08.877195Z","submitted_at":"2023-11-14T05:13:55Z","title":"Instruction-Following Evaluation for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07911","snapshot_observed_at":"2026-08-15T22:15:10.556645Z","title":"Instruction-following evaluation for large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.556645Z"},"links":{"cited_paper":"/paper/2311.07911","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:adc72b9ded8cd33521cba762e496d6485c8ed7682149fcf854cd5a9404465f1b","observation_id":"2172882c-f8c2-4cde-bc0a-562f40ecbc1c","resolution":{"observed_at":"2026-08-15T22:15:10.556645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.09261","last_updated":"2022-10-17T17:08:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-17T17:08:26Z","title":"Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Them","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.09261","snapshot_observed_at":"2026-08-15T22:15:10.560113Z","title":"Challenging big-bench tasks and whether chain-of- thought can solve them,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.560113Z"},"links":{"cited_paper":"/paper/2210.09261","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:229c6fc40ac126f03740a3c4422c15334f2f62b1a90f51f7a438603697fcb4cf","observation_id":"80ddd53f-2996-40ee-92c9-168f4ed89506","resolution":{"observed_at":"2026-08-15T22:15:10.560113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-15T22:15:10.563052Z","title":"Measuring mathematical problem solving with the math dataset,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.563052Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:59ba20a8ef4348c9bdd451267bbd4a64e3c52dacd3b425ba6ecd6b8fb02e398b","observation_id":"1da6f259-d865-4987-bdf8-63f39a6a9d38","resolution":{"observed_at":"2026-08-15T22:15:10.563052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12022","last_updated":"2023-11-20T18:57:34Z","snapshot_observed_at":"2026-08-16T07:06:07.822225Z","submitted_at":"2023-11-20T18:57:34Z","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12022","snapshot_observed_at":"2026-08-15T22:15:10.566224Z","title":"Gpqa: A graduate-level google-proof qa benchmark,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.566224Z"},"links":{"cited_paper":"/paper/2311.12022","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:599101db0b97ee9fc04b7983e5d46514caf4e2b340d0019dd155e4fe622674bd","observation_id":"4e0db9cc-d7b3-47d6-8bba-b277fc33d1a3","resolution":{"observed_at":"2026-08-15T22:15:10.566224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16049","last_updated":"2024-03-23T21:21:44Z","snapshot_observed_at":"2026-08-13T05:41:56.424552Z","submitted_at":"2023-10-24T17:59:20Z","title":"MuSR: Testing the Limits of Chain-of-thought with Multistep Soft Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16049","snapshot_observed_at":"2026-08-15T22:15:10.569632Z","title":"Musr: Testing the limits of chain-of-thought with multistep soft reasoning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.569632Z"},"links":{"cited_paper":"/paper/2310.16049","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:109ba41559bb0bc1fa7b10bad3d8f267181043950d7d6bde5b40377209a0b898","observation_id":"f1aa158d-0097-41b1-96dd-fb951a5b2eb6","resolution":{"observed_at":"2026-08-15T22:15:10.569632Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.855514Z","title":"A framework for few-shot language model evaluation,","venue":null,"work_id":"cacdc376-9bc1-4569-ba5c-ed7c9de6549b","year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.573135Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:95301b08f112271193bcf20b7eb54453584d38bb0ccfedc9058a476f1bdd4869","observation_id":"228e29ee-e8fb-43c5-ae5b-6f64d8591143","resolution":{"observed_at":"2026-08-15T22:15:10.858759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-15T22:15:10.576426Z","title":"Roberta: A robustly optimized bert pretraining approach,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.576426Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:113d7fbd8b1cea63427287bc35a3ca33ddee60480015f7fa61dd339951cced49","observation_id":"75f44b2a-a4db-4160-b60a-8af9ec370414","resolution":{"observed_at":"2026-08-15T22:15:10.576426Z","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-08-15T22:15:10.580334Z","title":"Language models are unsupervised multitask learn- ers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.580334Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:3195f3fc179fe4b523decdb2d4faa84dc2b4f150d75c6d4f7ad747b50f18d2e8","observation_id":"4dd9137f-af3c-4a29-b435-060217069308","resolution":{"observed_at":"2026-08-15T22:15:10.580334Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.840114Z","title":"Glue: A multi-task benchmark and analysis platform for natural lan- guage understanding,","venue":null,"work_id":"cb2a26c3-ec3d-40ca-bc1c-6b524da220e3","year":2018},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.583436Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:4e6dbb17f459752036afe9d0ce6302ce5d3b6ae94a8300a3eaa536c8137db0b8","observation_id":"4aeef558-3112-44b1-a84a-66530f9cd88e","resolution":{"observed_at":"2026-08-15T22:15:10.844608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.586427Z","title":"Neural network accept- ability judgments,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.586427Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:27ccb00fc8148002ae766c79246398d57fb2c16b60b49e268b5b146111ecb355","observation_id":"31737bd9-1668-4e57-b10b-1956d422a22d","resolution":{"observed_at":"2026-08-15T22:15:10.586427Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.826427Z","title":"The repeval 2017 shared task: Multi-genre natural language inference with sentence representations,","venue":null,"work_id":"f1136831-6092-4660-9968-ca2276118f40","year":2017},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.589845Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:d3ee6feb6fca197973757d1c5e61489ee31db3fcf2480d49bddbd1919416d705","observation_id":"3eaa67e6-73e0-4a7e-a12c-01c9a3f1d895","resolution":{"observed_at":"2026-08-15T22:15:10.829691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.592859Z","title":"Automatically constructing a corpus of sen- tential paraphrases,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.592859Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:0350f1d806294d5eca15935d702c05d75e42469120bbb947579a5c4341f9d51f","observation_id":"d9e136dc-9025-47f9-9d3c-2878781823fb","resolution":{"observed_at":"2026-08-15T22:15:10.592859Z","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-08-15T22:15:10.595713Z","title":"The pascal recognising textual entailment challenge,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.595713Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:887c7c0218d7659338c170345a92ba5d4306033e5d88928a6bcfefd1f9fd34ad","observation_id":"148bd1f9-0c4d-49aa-ab5c-8e5184defb58","resolution":{"observed_at":"2026-08-15T22:15:10.595713Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.808081Z","title":"The second pascal recognising textual entailment challenge,","venue":null,"work_id":"b9cf49b5-7e8b-44b9-96da-49dde451c28d","year":2006},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.598464Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:051bfdac4a4660434c27d903d2e257f7e6e1218a828a0a5b4a6df58582e8438b","observation_id":"afdf93a2-58db-479d-b177-96b2488882c8","resolution":{"observed_at":"2026-08-15T22:15:10.811245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.798818Z","title":"The third pascal recognizing textual entailment challenge,","venue":null,"work_id":"94fc53bb-cb0e-4334-8258-e36783861d97","year":2007},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.601496Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:9c7e38efa0946db39cecc6906cf1fb5406e1c80978a24439d8918f84efa22524","observation_id":"9a8eb261-5999-4111-b7bc-62b0f7e6d612","resolution":{"observed_at":"2026-08-15T22:15:10.802140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.788596Z","title":"The fifth pascal recognizing textual entailment challenge","venue":null,"work_id":"1a99c005-09d5-4b48-ab50-98781c4f63a9","year":2009},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.605149Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:78338683a4428196220dad7da1ca4b63e0d97ba6bb10dff3d77c94514ed6faef","observation_id":"e74b9a3d-a32d-4235-bf72-21765cb5b658","resolution":{"observed_at":"2026-08-15T22:15:10.792766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.778789Z","title":"Recursive deep models for semantic compositionality over a sentiment treebank,","venue":null,"work_id":"a4610243-6344-4962-bcba-10217821ee67","year":2013},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.608323Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:abe7c01e8ed6a9ba318656a4db2bee2ea03f1ed3c4be6ba41bb4f3ce30787203","observation_id":"625257d9-280b-4546-b737-772daa097f6d","resolution":{"observed_at":"2026-08-15T22:15:10.783030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.769568Z","title":"Race: Large-scale reading comprehension dataset from examinations,","venue":null,"work_id":"2d154664-5540-4fd8-882c-314afd08e93d","year":2017},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.611225Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:4bdba776fda00755009bfff27bdad18542245172ae7168e305f033c163bb2d34","observation_id":"710cddaa-ff76-4611-b56c-726f1fed4455","resolution":{"observed_at":"2026-08-15T22:15:10.772999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.05250","last_updated":"2016-10-11T02:42:36Z","snapshot_observed_at":"2026-08-15T14:23:50.348670Z","submitted_at":"2016-06-16T16:36:00Z","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.05250","snapshot_observed_at":"2026-08-15T22:15:10.614023Z","title":"Squad: 100,000+ questions for machine comprehension of text,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.614023Z"},"links":{"cited_paper":"/paper/1606.05250","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:cfd00930a83728335acf77b5d27001dfb2720262a35e00a669a785464ebb57a5","observation_id":"6073d17a-f7a1-4149-af05-235cbaac1d54","resolution":{"observed_at":"2026-08-15T22:15:10.614023Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.759662Z","title":"FusionBench: A Unified Library and Comprehensive Benchmark for Deep Model Fusion,","venue":null,"work_id":"6b7983f9-8f3f-4c45-ad86-3ee929342524","year":2025},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.617230Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:484536b8e515af8ac421d9e85352a44d144c53dc174199ae06b5d78f7b1fb72b","observation_id":"2a85a1e8-74f5-4430-932d-0173c201d876","resolution":{"observed_at":"2026-08-15T22:15:10.763697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:10.748636Z","title":"raids-lab/crater,","venue":null,"work_id":"e69c5b93-52cc-42c5-ab76-7ddf73b6e848","year":2026},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.620025Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:a1b6b8f6906907f680e3c7f47e7cddf52c285940bf7edcb4cf7c15686b30d812","observation_id":"277cd47c-cfc3-4aab-b5e1-b859e7e04648","resolution":{"observed_at":"2026-08-15T22:15:10.753732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16139","last_updated":"2024-11-25T06:59:16Z","snapshot_observed_at":"2026-08-12T20:16:32.856463Z","submitted_at":"2024-11-25T06:59:16Z","title":"Beyond Task Vectors: Selective Task Arithmetic Based on Importance Metrics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16139","snapshot_observed_at":"2026-08-15T22:15:10.622938Z","title":"Beyond task vectors: Selective task arithmetic based on importance metrics,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.622938Z"},"links":{"cited_paper":"/paper/2411.16139","citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:0eb1afbe4e8fdbf2646e89d6c5961c7a0e5a08ddb3961a2e9f3aa61892bb7d94","observation_id":"b82bc893-8092-410d-b2c9-1e461c81420d","resolution":{"observed_at":"2026-08-15T22:15:10.622938Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:11.005596Z","title":null,"venue":null,"work_id":"00a7b53d-0ac8-4066-b9b2-40c7adb17a47","year":2018},"citing_paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:10.481032Z"},"links":{"citing_paper":"/paper/2608.12842"},"observation_digest":"sha256:22db873669becd24daad8c6f26c8a6a0fb228c161efb97d28d8561d296a9b06e","observation_id":"afade97b-e1f6-4daf-b251-2769d61c251b","resolution":{"observed_at":"2026-08-15T22:15:11.008474Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.12842","last_updated":"2026-08-13T05:26:37Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T11:10:55.357762Z","submitted_at":"2026-08-13T05:26:37Z","title":"CABS+: Efficient and Scalable Model Merging via Conflict-Aware Sparsification and Adaptive Weight Allocation"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":43},"total_outbound_references":65},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2608.12842."}