{"as_of":"2026-08-13T04:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3bc0995e01e1e2466679439ee02d30281b7747a80f2ed81fd796a5bbbb1bb3c8","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:53:15.778229Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:08:38.614160Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T20:08:12.892267Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00054","snapshot_observed_at":"2026-08-12T13:08:38.614160Z","title":"Less is more: Efficient model merging with binary task switch","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-12T13:00:51.773343Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.614160Z"},"links":{"cited_paper":"/paper/2412.00054","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:f0c4d37b4f75419e64492bc8cc4b0c94f30264af107f4d38b456555214021ebb","observation_id":"f3674d06-30a5-4351-97ee-7d1cc350fdd0","resolution":{"observed_at":"2026-08-12T13:08:38.614160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00054","snapshot_observed_at":"2026-08-07T15:18:15.177560Z","title":"Less is more: Efficient model merging with binary task switch.arXiv preprint arXiv:2412.00054, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15875","last_updated":"2025-05-21T16:34:37Z","snapshot_observed_at":"2026-08-10T10:17:26.701533Z","submitted_at":"2025-05-21T16:34:37Z","title":"Decouple and Orthogonalize: A Data-Free Framework for LoRA Merging","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:15.177560Z"},"links":{"cited_paper":"/paper/2412.00054","citing_paper":"/paper/2505.15875"},"observation_digest":"sha256:1517b1975c723d91665c9f7d7a98168f0b95ab2c963ef97f92f2d789f0fb2c5b","observation_id":"4b89969d-936b-4c77-937a-651b5a03df50","resolution":{"observed_at":"2026-08-07T15:18:15.177560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"cited_work":{"arxiv_id":"2412.00054","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00054","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0cca35ee-9eb9-4529-bc80-e46f2a997802","year":2024},"citing_paper":{"arxiv_id":"2604.02881","last_updated":"2026-04-03T08:45:26Z","snapshot_observed_at":"2026-07-06T22:52:10.923214Z","submitted_at":"2026-04-03T08:45:26Z","title":"One Model to Translate Them All? A Journey to Mount Doom for Multilingual Model Merging","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-13T20:05:53.769660Z"},"links":{"cited_paper":"/paper/2412.00054","citing_paper":"/paper/2604.02881"},"observation_digest":"sha256:c48f2cdcd470faf805cbf5179899194e358135ad7571816d5e39f09eb7efe8c0","observation_id":"204fdf66-f137-4891-80f2-715421b6e7ec","resolution":{"observed_at":"2026-05-13T20:08:12.894164Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.00054/citation-record","integrity":"/paper/2412.00054/integrity","json":"/paper/2412.00054/citation-record.json","paper":"/paper/2412.00054"},"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-12T13:53:17.942929Z","title":"Ainsworth, Jonathan Hayase, and Siddhartha S","venue":null,"work_id":"0d7f34e8-0fe1-4dfd-8b3a-ce4672ab4b50","year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.187455Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:e7cb2e822da80db335dc2674a788c5d86f90b7136a69752244ff87bf39d0c703","observation_id":"35bad116-55c4-4fa2-ae10-93fe9d87a371","resolution":{"observed_at":"2026-08-12T13:53:17.949046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-08-09T21:25:20.369782Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-12T13:53:15.195536Z","title":"Qwen technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.195536Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:1735b570d0d1e2fcb638991b304211fe3dc6716fc4231526e5c59762cd7ef1bd","observation_id":"47f5c0db-fe01-4b82-abce-99bb80185b20","resolution":{"observed_at":"2026-08-12T13:53:15.195536Z","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-12T13:53:17.866794Z","title":"Xnor-net++: Im- proved binary neural networks","venue":null,"work_id":"653291aa-ef1f-439f-a0ad-f908e8cec8f4","year":2019},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.202562Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:29390837f109f068f7975528fa56e95f2944f5abbf0a889be1bdbc792ddf3e49","observation_id":"09cdea78-9c0a-4a9c-a8ab-90e793d85efd","resolution":{"observed_at":"2026-08-12T13:53:17.913864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.835887Z","title":"Cer, Mona T","venue":null,"work_id":"76718a93-5154-4dab-868b-88c9b755e1c2","year":2017},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.209603Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:dbe7c0009b01a337a58e10145d60fbcef5d19b364c61d79d5bb86565b9afb76b","observation_id":"a8b4ca0e-b275-43c7-ad30-ddb7b90198a7","resolution":{"observed_at":"2026-08-12T13:53:17.843014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.07155","last_updated":"2019-06-17T17:58:12Z","snapshot_observed_at":"2026-08-03T13:01:27.142233Z","submitted_at":"2019-06-17T17:58:12Z","title":"MMDetection: Open MMLab Detection Toolbox and Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.07155","snapshot_observed_at":"2026-08-12T13:53:15.216347Z","title":"Mmdetection: Open mmlab detection tool- box and benchmark","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.216347Z"},"links":{"cited_paper":"/paper/1906.07155","citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:22e73a7405b919dc95ea3a54ed91f8fee238ef522a406cbb988db8826fac1931","observation_id":"84e1a766-8ea6-4786-9cb5-5c930dcf0379","resolution":{"observed_at":"2026-08-12T13:53:15.216347Z","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-12T13:53:17.817994Z","title":"Remote sens- ing image scene classification: Benchmark and state of the art","venue":null,"work_id":"a76c5a76-c7c4-4809-b66e-3704342101b6","year":2017},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.223831Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:baad107092ab8f6d6043620c8ddb51c3990cfd3df1fbaaa16449e5eaea0441af","observation_id":"96a0c639-ffbe-4e5d-a382-40f027e96221","resolution":{"observed_at":"2026-08-12T13:53:17.823340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.779655Z","title":"Describing textures in the wild","venue":null,"work_id":"5a337fbc-ebee-4809-83b3-c1ffa6276a88","year":2014},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.232084Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:f93c2123ae2556dc836726b71b6de85602fa627d005c407edcfdaf0574ad68b7","observation_id":"6d3e2e74-3d94-4571-8db0-30ded23dc756","resolution":{"observed_at":"2026-08-12T13:53:17.788664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.736831Z","title":"Binaryconnect: Training deep neural networks with binary weights during propagations","venue":null,"work_id":"1c2dc3e7-acb8-4c54-b512-848ed834bad0","year":2015},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.238764Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:838c72c876881443c42f7a65ae42307d96d74d816ecdc020b1d880ba5bd78374","observation_id":"450b34a9-0256-495e-be6d-673c723791bf","resolution":{"observed_at":"2026-08-12T13:53:17.747268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.677780Z","title":"Dolan and Chris Brockett","venue":null,"work_id":"a6532804-2e42-44b7-9be3-e061a0426e36","year":2005},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.252488Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:6e4d78104e7bf48fa9f8b2ff289f1eb56f08e1bbab2f63b716c29d50ea2e0bd5","observation_id":"ba5c5317-7976-4a10-93ee-d6d6ec0a2ff6","resolution":{"observed_at":"2026-08-12T13:53:17.689164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.649434Z","title":"1-bit wavenet: compressing a generative neural network in speech recognition with two binarized methods","venue":null,"work_id":"c24ed336-f7b9-478a-8c41-7cbff4a30eb4","year":2021},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.258498Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:e0821658c34ff7a6b98e804b98d2e9cc52bf7cf3ea1144724f49014871a6270c","observation_id":"1aeeb19a-7b35-4d3a-b6c1-ed12f43d30b4","resolution":{"observed_at":"2026-08-12T13:53:17.656112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.615944Z","title":"The third PASCAL recognizing textual entailment challenge","venue":null,"work_id":"c2d731ff-c7b9-49bb-b86c-a13fb6bc4006","year":2007},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.264923Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:8fd73ad1238d04eba7651967dc95fd1d0c7d35aa253d6fdf9f35e65890715347","observation_id":"fb971d54-6570-4514-9fa7-3aa2314dadf7","resolution":{"observed_at":"2026-08-12T13:53:17.622239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.587341Z","title":"Differen- tiable soft quantization: Bridging full-precision and low-bit neural networks","venue":null,"work_id":"ef587b11-56f8-4491-a430-e0d3feda9344","year":2019},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.273562Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:b08ddbf2ea72cf887072208d2f82672ae91dc24e27fff59f98468c695a11c15f","observation_id":"007f1b76-f637-4111-ae41-c08ac8f0d81c","resolution":{"observed_at":"2026-08-12T13:53:17.600246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.555182Z","title":"Gradient reweighting: Towards imbalanced class-incremental learning","venue":null,"work_id":"f780abf2-ec9e-4d1b-a216-fdb7ad6a60cc","year":2024},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.286862Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:e34f79b23bdc496f83f36b91689658fc10fe5a5b12659b2b207017d25f500f4d","observation_id":"437f1550-8d22-4257-b260-7f8fd59b7b6a","resolution":{"observed_at":"2026-08-12T13:53:17.561929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.515530Z","title":"Eurosat: A novel dataset and deep learning benchmark for land use and land cover classification","venue":null,"work_id":"da47deee-67fb-41bc-8daf-e14bbde4d31b","year":2019},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.293611Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:3faff49eb63150128e8cfed7c44263b2770dd6b7652a28065d09df25ab6a11f0","observation_id":"09917090-ec3f-44ff-bac7-679424b84704","resolution":{"observed_at":"2026-08-12T13:53:17.525254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.462204Z","title":"Emr-merging: Tuning-free high- performance model merging","venue":null,"work_id":"59e82ee0-112f-4183-9adc-791f0bfa826a","year":2024},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.303551Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:b1e7989610a73e51be558a35b529924f47fa48c51838e40a1097548939768864","observation_id":"e5eaacff-cf0c-40d8-913b-fca3d80373a0","resolution":{"observed_at":"2026-08-12T13:53:17.475808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.415591Z","title":"Editing models with task arithmetic","venue":null,"work_id":"f3de832a-ba33-4fae-b121-2e5f7c5631ae","year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.310441Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:00a832e3ccd8b38af969bfb13405efab37c46076de0da1ace0d380f15d7246eb","observation_id":"57d5d1f1-990d-4d03-8657-08912c246bb8","resolution":{"observed_at":"2026-08-12T13:53:17.428184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.373752Z","title":"CLAP4CLIP: contin- ual learning with probabilistic finetuning for vision-language models","venue":null,"work_id":"47738b65-0c3f-4dd9-83d7-8c01aeb495b7","year":2024},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.320727Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:6d7f88439822630b2fa300e4b477ce5595ece4377d7d6c451718d17e27e160ae","observation_id":"917425a6-6e4a-4682-a4a4-9606ecd88cff","resolution":{"observed_at":"2026-08-12T13:53:17.385282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.346087Z","title":"Dataless knowledge fusion by merging weights of language models","venue":null,"work_id":"19495b1f-afe4-441e-ba34-c9b7de21554a","year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.332860Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:34612fac3e227ec4858e81cb12e0d9e0af7b48eb59d136909b87f70f4cbe2f24","observation_id":"e467d3ba-59b3-4599-9886-72b4898e5214","resolution":{"observed_at":"2026-08-12T13:53:17.356781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.318912Z","title":"REPAIR: renormalizing permuted activations for interpolation repair","venue":null,"work_id":"d747431e-4a14-49d2-91e5-9abf618b5d70","year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.347760Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:7419e2e7b5dd89495f0b6da63c70bd5699e80ea784dddea6da6dacb50bced842","observation_id":"43705e36-01ea-428b-a800-272883ec70fd","resolution":{"observed_at":"2026-08-12T13:53:17.328738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.288803Z","title":"Warping the space: Weight space rotation for class- incremental few-shot learning","venue":null,"work_id":"ea0d07fd-5ed7-46c4-925c-a6240bd91390","year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.358428Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:e016835f3b8d74b2e2711e371b59d2d2f68c0a16811fa8e02483d259ef6a16f4","observation_id":"d004b4cd-23fb-4cf1-a3bb-06d0e1c8a6a0","resolution":{"observed_at":"2026-08-12T13:53:17.295094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.250096Z","title":"3d object representations for fine-grained categorization","venue":null,"work_id":"0ccb4769-659f-43f4-ab83-627ea539c0f7","year":2013},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.374954Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:b9e4394cea7e3b455041fa4d01c309a7ad2efd770a518116ff0d7233c565e5b4","observation_id":"f5d89ed8-0278-4ba6-9054-87efa284fa4a","resolution":{"observed_at":"2026-08-12T13:53:17.258341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:15.383057Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.383057Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:ffa4b56354a170c16d39a22b25edfd31eace15337f1b2d3424b812554f869281","observation_id":"997fb751-f852-40ac-808c-04e970a76ddc","resolution":{"observed_at":"2026-08-12T13:53:15.383057Z","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-12T13:53:17.161344Z","title":null,"venue":null,"work_id":"10b6a6a1-c158-4854-860a-601b9aa2fd7c","year":1998},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.400331Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:fda802790ac84c4386caf8e5d6e89c6a873ad62b5f95b333e5675bbe51818a0f","observation_id":"74b2bc58-6a8f-49e5-8fe7-9abc12ce9572","resolution":{"observed_at":"2026-08-12T13:53:17.170298Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.125274Z","title":"Fully quantized network for object detec- tion","venue":null,"work_id":"96500ee4-2197-4b7e-9d73-64df912eea09","year":2019},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.410167Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:0e305b5287bb3a4622215f9a4d7ba8bddc3cf9d82e0de352cf6e248bb03d1207","observation_id":"56f4cf15-f416-46e0-9e92-0b36e9a55b50","resolution":{"observed_at":"2026-08-12T13:53:17.134811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.099760Z","title":"Roberta: A robustly optimized BERT pretraining approach","venue":null,"work_id":"22d8f98b-bcce-45f8-9b81-06471657670d","year":2019},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.424266Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:9c0b4d512f2c00eb7a47e615362575ba2be029ff795fb1e936b64532260428ee","observation_id":"cb933e3e-a601-4c60-aba2-b1fca2bc4b60","resolution":{"observed_at":"2026-08-12T13:53:17.109939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.073289Z","title":"Bi-real net: Enhancing the perfor- mance of 1-bit cnns with improved representational capabil- ity and advanced training algorithm","venue":null,"work_id":"cc33b071-2583-4139-b664-36c90d320aad","year":2018},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.445877Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:58554c084ed92e637d19b2614685b5d7da26dd879f7f651a2813ce3c69f71efb","observation_id":"46bf2c86-5330-46ca-81d0-5739097c3521","resolution":{"observed_at":"2026-08-12T13:53:17.080946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:17.037279Z","title":"Twin-merging: Dynamic integration of modular expertise in model merging","venue":null,"work_id":"ef0f8971-b829-436e-87a2-9485fe23b1c9","year":2024},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.453846Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:d2fa979a4368138796102883155017e03626c61e4f5109c6fe2bab2445b844b5","observation_id":"a761eae4-1795-4236-980d-ae1dea765870","resolution":{"observed_at":"2026-08-12T13:53:17.048019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.999843Z","title":"A&b bnn: Add&bit- operation-only hardware-friendly binary neural network","venue":null,"work_id":"71e24b90-19be-4955-bc4b-4e2233e01d30","year":null},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.467796Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:e4e0364e25e3cbfd8f29ffd2dc360a26509a71d59b723e4ec4e436b13f86b199","observation_id":"83f2d20f-c090-46e0-b7cb-901bb856ca64","resolution":{"observed_at":"2026-08-12T13:53:17.006228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.950128Z","title":"Bagdanov","venue":null,"work_id":"6441650b-238b-43f7-8e0f-90162fe4cd20","year":2024},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.476582Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:ec89ebd6e7e0f781cb0f2ee8ecd3189c9f672081a234495c8a879e8b44ac7da8","observation_id":"1d157156-5088-4728-91f1-55184c50e577","resolution":{"observed_at":"2026-08-12T13:53:16.970627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.906448Z","title":"Merging models with fisher-weighted averaging","venue":null,"work_id":"0901f7ea-6165-4b53-9246-e52079ce4f91","year":2022},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.493285Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:d8752c9175a2bbcfa396c4ad9edec5a0135cbbafff8dd181f7837dff1006f016","observation_id":"cf812b3e-f879-4e74-a799-d59d1050fc75","resolution":{"observed_at":"2026-08-12T13:53:16.912804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.866816Z","title":"Reading digits in natural images with unsupervised feature learning","venue":null,"work_id":"85545926-b5c4-47cd-b0e0-beec06ecb4d5","year":2011},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.502600Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:c2130a454a77631d77e035e1922f16e306cd6fa0cbefe08db2fff2c0d562331d","observation_id":"33fe7580-2ea4-4a50-8a8c-48b2ff11dfc8","resolution":{"observed_at":"2026-08-12T13:53:16.874761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.831235Z","title":"Binary neural networks for speech recognition","venue":null,"work_id":"975e0947-6955-438e-8eb3-a5bc818f4c4d","year":2019},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.508178Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:05f23c2b03bd114e3eca4e2bae2c906251d22d092eaf8d479fdeb565269fb8c2","observation_id":"facb42b3-9cc4-4102-82b0-0e7cd0c966df","resolution":{"observed_at":"2026-08-12T13:53:16.840643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.796857Z","title":null,"venue":null,"work_id":"56f05c87-a5d3-48d4-bbe9-87aff631db55","year":2020},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.520697Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:231d2a1a55aa235f508d557dec108ac1a9449679c8d050ebbbddb269751495d5","observation_id":"9da7d10b-549c-41c9-b044-12a79b558b62","resolution":{"observed_at":"2026-08-12T13:53:16.807228Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.765231Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":"9d89e8c3-789d-4487-a129-47d5e1c83ca9","year":2021},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.530278Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:4313bee2a4d85841d1b6fc2f4e523b93d273d4a49429835bc81497e002bffa02","observation_id":"029a373a-4851-4de5-8ed7-095408886f9a","resolution":{"observed_at":"2026-08-12T13:53:16.774693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.721368Z","title":"Squad: 100, 000+ questions for machine com- prehension of text","venue":null,"work_id":"4a0bf4d5-e0b7-48f4-b345-27a5df0005cd","year":2016},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.541967Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:cc5e72c757ef1d62c32e47d941272d8bf82b1579e7f25bc7c16e128a773df8ae","observation_id":"5e0f6897-d12b-44ba-8c31-172bd84893e5","resolution":{"observed_at":"2026-08-12T13:53:16.730882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.688679Z","title":"Xnor-net: Imagenet classification using bi- nary convolutional neural networks","venue":null,"work_id":"7b453a4a-0843-46e3-a6be-512aea9299ed","year":2016},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.556738Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:2a5ef8b03afb08f133c0e4b1d2d92b03ecafdc7ec1328f2dc16b65a3c229709d","observation_id":"6d5c9d66-ed77-417f-82ef-5799fdc073b9","resolution":{"observed_at":"2026-08-12T13:53:16.705912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.650431Z","title":"Dandekar S","venue":null,"work_id":"3c591324-d8da-4e38-86d5-b5f50a9ea224","year":2017},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.580465Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:10a73a041704202e5aeda606ad8b3e6c7f780fa2b24a15240c309c6e492a0890","observation_id":"7cc4497a-4205-4a20-ba26-2d3b27059b6b","resolution":{"observed_at":"2026-08-12T13:53:16.659100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.607808Z","title":"Manning, Andrew Y","venue":null,"work_id":"160e038f-b4dd-4951-8b48-e5df7ed4604d","year":2013},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.588559Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:fa40a819ca96a4229e7e96e05c4f2c49173d81a0efe6d3ca6016c4ee66f79199","observation_id":"c7376d35-9d3d-4d10-a34c-9997e2764743","resolution":{"observed_at":"2026-08-12T13:53:16.621153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.569803Z","title":"The german traffic sign recognition bench- mark: A multi-class classification competition","venue":null,"work_id":"08436c28-537f-4d9d-823e-433958da70f3","year":null},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.601059Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:c9c13e4e720758f6d3438c389a32c76f562a9cfeef4e17c5c2cbc0443059bec2","observation_id":"bbcc7cc3-5e65-47ec-9af5-3a37d3f32d12","resolution":{"observed_at":"2026-08-12T13:53:16.578054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.522801Z","title":"Fast object detection based on binary deep convolution neural networks","venue":null,"work_id":"7d2b8a58-a42f-403d-9671-806b5a25088b","year":2018},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.608288Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:c3928bcfc331192d59d0cf487e38885106daa0892d5c964cbbfb89d4382d3b4a","observation_id":"37950f84-d8cd-482d-bb8f-0c5f04f1bce1","resolution":{"observed_at":"2026-08-12T13:53:16.534840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-12T13:53:15.615857Z","title":"Llama 2: Open foundation and fine-tuned chat models.arXiv preprint arXiv:2307.09288, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.615857Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:f1a11a34444cb5a135e4e9f97202be86b9d254fb6aa34af8db99606f641a2cbb","observation_id":"d3c0529c-ba53-4e11-ba41-e77795c2caa8","resolution":{"observed_at":"2026-08-12T13:53:15.615857Z","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-12T13:53:16.490278Z","title":"Correa, Carlos Hinojosa, and Henry Arguello","venue":null,"work_id":"a0e8e439-afa4-4673-aea8-3e29549e9219","year":2024},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.623165Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:a952c763ba9dc875abd2d24ff69b02c9a7d4da303a6edaef507adbd15b2a243a","observation_id":"61072640-68a3-4786-beca-5c12f020d65a","resolution":{"observed_at":"2026-08-12T13:53:16.502378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.438247Z","title":null,"venue":null,"work_id":"62c3bd5c-4ba1-4557-bbcf-0a8c15d09f89","year":2019},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.631901Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:cdd235d79f809cbff17292ae58c3faa05f929ef6d67e2db264371dae88f271ea","observation_id":"444b0b55-c439-429d-a64f-8c10f6c3e310","resolution":{"observed_at":"2026-08-12T13:53:16.452561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.408805Z","title":null,"venue":null,"work_id":"8c1581f4-bc08-4f6c-bcff-771f8f654666","year":2019},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.644966Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:5e9da67febef76bd00ea7e0073c3d4dfcb919c17e4253c4a8fe1c7a33fb88c23","observation_id":"efa23abf-84d2-42ad-98a2-c750637bb3a5","resolution":{"observed_at":"2026-08-12T13:53:16.416127Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.381808Z","title":null,"venue":null,"work_id":"3e69dcb1-b534-4534-a692-99b5b636ea45","year":2018},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.656741Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:cba1e44380545d27b517e3bcf7df75b2797034b1e67343b68384a2d843e991a2","observation_id":"384d6dbd-9f28-47be-a114-5b07b07da930","resolution":{"observed_at":"2026-08-12T13:53:16.390773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-12T13:53:15.667466Z","title":"Hug- gingface’s transformers: State-of-the-art natural language processing","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.667466Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:08f32700aa948f5eeb7d49ded1b4495131325abcb05d5b35b9bd2b044aeeb67b","observation_id":"7e89f990-8b23-44c2-94ff-fd8fdbdc02c1","resolution":{"observed_at":"2026-08-12T13:53:15.667466Z","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-12T13:53:16.341091Z","title":"Morcos, Hongseok Namkoong, Ali Farhadi, Yair Carmon, Simon Kornblith, and Ludwig Schmidt","venue":null,"work_id":"27662c38-f2a2-486b-8a8a-3536d2fa4e7f","year":2022},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.674227Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:f10fc8bc4d1cf88d99af4140c2519e17e05e9c66131559d302e80d10fa1a0e8e","observation_id":"189f7c95-fd39-4229-9f53-9896df995850","resolution":{"observed_at":"2026-08-12T13:53:16.358694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.313157Z","title":"Binary deep neural networks for speech recognition","venue":null,"work_id":"3b36e050-b726-42eb-900d-f878c7307ab1","year":2017},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.683289Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:d217bad7571a509a42727e6f5ded9e245029f4afde9b31e39896011219de2e2a","observation_id":"4fd15fc6-5211-4075-8e11-cba626335c5e","resolution":{"observed_at":"2026-08-12T13:53:16.323753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.274363Z","title":"Ehinger, Aude Oliva, and Antonio Torralba","venue":null,"work_id":"ed425fe5-3bbe-4f42-9f42-413b81f03f52","year":2010},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.691891Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:e17e0f5e0eb412b4390524e301dd6d97d49602edaecd63eb789a83308f89baec","observation_id":"075c17bc-51aa-4df3-9499-86c506794056","resolution":{"observed_at":"2026-08-12T13:53:16.288503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.243269Z","title":"Raf- fel, and Mohit Bansal","venue":null,"work_id":"7153a855-c840-4a67-8f0d-4f5255f96f1a","year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.699839Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:b0d0e47ec38dadbbec885a3162b6472408c7241b61774d33a8097261e853c7a9","observation_id":"002e047b-0e87-42bd-abb6-acec313c90bb","resolution":{"observed_at":"2026-08-12T13:53:16.253253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.204977Z","title":"Adamerging: Adap- tive model merging for multi-task learning","venue":null,"work_id":"b4969746-96cc-43f2-9dc8-15c82a78467b","year":2024},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.707306Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:ae4fd825680a9b592b19fa61806df23b9c17d3ca7e351c2a69f4239929206121","observation_id":"9d92dca9-2bed-478b-a46f-ed5cf19963fc","resolution":{"observed_at":"2026-08-12T13:53:16.216567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.168879Z","title":"Language models are super mario: Absorbing abilities from homologous models as a free lunch","venue":null,"work_id":"f080d197-173d-4d9f-b279-6b5297a7f6c8","year":2024},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.718083Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:52f42bca1c673070488dc084f42d5f59fab8d8884e12ecb9890b2d058672a0d2","observation_id":"acc308c2-816a-494e-99a3-c7f53f29bb14","resolution":{"observed_at":"2026-08-12T13:53:16.187140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.120810Z","title":"Lq-nets: Learned quantization for highly accurate and compact deep neural networks","venue":null,"work_id":"742ebc1e-ebd8-4687-bed5-ce58e4a0616a","year":2018},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.729900Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:cedc3fb96546339d85163dee4b5af140f9c3a74b49452556337f57e30e9902e6","observation_id":"e2147416-9837-4fc6-963b-85f42e75f60a","resolution":{"observed_at":"2026-08-12T13:53:16.132736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.096229Z","title":"Preventing zero-shot transfer degradation in continual learning of vision-language models","venue":null,"work_id":"f28a6a5e-5590-43c8-9d35-befae79b3c23","year":2023},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.743676Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:792d12aeb8217005f80014e93bf4d0065d4656e60ed7449f5e692a79d1f82f47","observation_id":"0c033bc8-05fa-4bfc-84b7-459b70304009","resolution":{"observed_at":"2026-08-12T13:53:16.103772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.072713Z","title":"Dorefa-net: Training low bitwidth convo- lutional neural networks with low bitwidth gradients","venue":null,"work_id":"a3fe9b72-129a-4531-8e47-fd1d433631af","year":null},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.751172Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:3c52cd6cb190609f2abe0d9358c49ed4e9c40b26cc7941763839ddd4480cad59","observation_id":"faca9394-f72e-44f2-83ad-c5a5c496b910","resolution":{"observed_at":"2026-08-12T13:53:16.081685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.019102Z","title":null,"venue":null,"work_id":"a59c1833-765c-4c84-9470-152cd8ebce2d","year":null},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.770736Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:a05f07e288d6d357cd34cb6cbc48b94df4d08ed48e8c6d2f874adbbc6d704c88","observation_id":"9ddd961c-0599-44bc-a36a-7cb554964876","resolution":{"observed_at":"2026-08-12T13:53:16.025252Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:15.983658Z","title":"To evaluate the effectiveness of our method in merging larger mod- els, we conducted experiments on eight visual tasks using the ViT-L/14 model","venue":null,"work_id":"8a56a257-36ea-4089-9cef-b6230a2e8886","year":null},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.778229Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:97f4b806bf9c895bdb07d78dc0a4dcbcd1b2441bc633f53a4717c5c978953b66","observation_id":"c0a52402-3e95-4bf9-a4bb-9296f79d183a","resolution":{"observed_at":"2026-08-12T13:53:15.995336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T13:53:16.046047Z","title":null,"venue":null,"work_id":"1b414d6b-1a82-4358-b186-83ca58001815","year":null},"citing_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-12T13:53:15.757408Z"},"links":{"citing_paper":"/paper/2412.00054"},"observation_digest":"sha256:8aa00eabb99176e8889064a499ff078c268e6787348f2c962e1950c333d6d527","observation_id":"452fc905-036f-4fa8-a7ad-8aed60e15550","resolution":{"observed_at":"2026-08-12T13:53:16.055541Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T13:46:24.996875Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":46},"total_outbound_references":58},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 3 inbound Pith citation observations for arXiv:2412.00054."}