{"as_of":"2026-08-15T18:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:27d5e5cd8b5eef7ff1d0b3b5dea509e5131ae483ac3fe81ebb16a6006562c086","coverage":[{"denominator":133,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T20:40:32.580471Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2411.09475/citation-record","integrity":"/paper/2411.09475/integrity","json":"/paper/2411.09475/citation-record.json","paper":"/paper/2411.09475"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T20:40:32.169375Z","title":"Layer by layer: Uncovering where multi-task learning happens in instruction-tuned large language mod- els","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.169375Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:e3b77b1849f3e0da3df57ee38e91f81dd2b010c7bbf0ae47d44662c87f542663","observation_id":"262943c6-9f7a-42b0-b2c8-7a7dcafc036f","resolution":{"observed_at":"2026-08-12T20:40:32.169375Z","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-12T20:40:32.174121Z","title":"Understanding and improving features learned in deep functional maps","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.174121Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:8af48fca18c0d3c47a55edb0cacafd625f57f5dae5616fd1dbc499a16e9f0b0a","observation_id":"b9b60667-fda0-4fd5-aaf9-5dc15d69d831","resolution":{"observed_at":"2026-08-12T20:40:32.174121Z","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-12T20:40:32.179459Z","title":"Information complexity of stochastic convex optimization: Applications to generaliza- tion, memorization, and tracing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.179459Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:1a384b10897f0a4ec47ab4085ad15960553fd30f28e795f7436ba3bbc4b6eaba","observation_id":"1e660ee1-838f-4ee1-8340-edec0c406baf","resolution":{"observed_at":"2026-08-12T20:40:32.179459Z","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-12T20:40:32.184147Z","title":"Does roberta perform better than bert in continual learning: An attention sink perspective","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.184147Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:cb2bbdae8650ec2ad11a4fac38971c9daf34f8d0d056e1feb00cdfda4cf32b30","observation_id":"d40188de-692a-4af9-b839-bce6d5f4da11","resolution":{"observed_at":"2026-08-12T20:40:32.184147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01335","last_updated":"2025-03-04T18:15:16Z","snapshot_observed_at":"2026-08-14T16:43:21.688290Z","submitted_at":"2024-10-02T08:53:07Z","title":"Layer Swapping for Zero-Shot Cross-Lingual Transfer in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01335","snapshot_observed_at":"2026-08-12T20:40:32.188363Z","title":"Layer swapping for zero-shot cross-lingual transfer in large lan- guage models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.188363Z"},"links":{"cited_paper":"/paper/2410.01335","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:a5e07e346096b5edfe90184d59e81e09ac0b68968da569f21206d6d432344941","observation_id":"3a43e384-f08c-4bd3-b7d2-8f1a5a6953fa","resolution":{"observed_at":"2026-08-12T20:40:32.188363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08315","last_updated":"2024-10-10T19:06:23Z","snapshot_observed_at":"2026-08-12T22:25:58.671044Z","submitted_at":"2024-10-10T19:06:23Z","title":"Avoiding mode collapse in diffusion models fine-tuned with reinforcement learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08315","snapshot_observed_at":"2026-08-12T20:40:32.192997Z","title":"Avoiding mode collapse in diffusion models fine-tuned with reinforcement learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.192997Z"},"links":{"cited_paper":"/paper/2410.08315","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:7c9e803571b65cfd9fe1b6a08264071497a24772deecc4ef259c5628f357d239","observation_id":"0081a7f8-2acc-4de4-a885-da8b63eac5e7","resolution":{"observed_at":"2026-08-12T20:40:32.192997Z","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-12T20:40:32.197280Z","title":"Network dissection: Quantifying inter- pretability of deep visual representations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.197280Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:38adb5117da535b87054a077ac2eb633d78030cb3bacba790df565925c8b2075","observation_id":"bfc4952f-f1d4-4bfc-a3ac-39d1c456aa2f","resolution":{"observed_at":"2026-08-12T20:40:32.197280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10597","last_updated":"2018-12-08T22:56:10Z","snapshot_observed_at":"2026-08-14T17:53:07.332814Z","submitted_at":"2018-11-26T18:59:07Z","title":"GAN Dissection: Visualizing and Understanding Generative Adversarial Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10597","snapshot_observed_at":"2026-08-12T20:40:32.202035Z","title":"Gan dissection: Visualizing and under- standing generative adversarial networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.202035Z"},"links":{"cited_paper":"/paper/1811.10597","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:3355c2d30b829e54ecfd585509506f07d5d8a067f721a6469e63d0456ee624ee","observation_id":"672cbd99-3432-459d-9d08-e9753f17dec6","resolution":{"observed_at":"2026-08-12T20:40:32.202035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03942","last_updated":"2024-06-05T17:44:03Z","snapshot_observed_at":"2026-08-13T04:01:59.508767Z","submitted_at":"2024-03-06T18:50:14Z","title":"The Heuristic Core: Understanding Subnetwork Generalization in Pretrained Language Models","version":2},"cited_work":{"arxiv_id":"2403.03942","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.03942","snapshot_observed_at":"2026-08-12T20:40:33.535896Z","title":"The Heuristic Core: Understanding Subnetwork Generalization in Pretrained Language Models","venue":"cs.CL","work_id":"099f0773-3015-47dd-82bc-d854751f9495","year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.206534Z"},"links":{"cited_paper":"/paper/2403.03942","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:d0c00840ff5c358dfc044a22f66c507f9fa7653f00cb446397e7a2c5a87a02de","observation_id":"b33995b7-9d20-4705-8d79-9976b506a789","resolution":{"observed_at":"2026-08-12T20:40:33.540224Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01109","last_updated":"2024-12-04T20:57:05Z","snapshot_observed_at":"2026-08-12T22:33:01.065733Z","submitted_at":"2024-10-01T22:35:56Z","title":"Mixing It Up: The Cocktail Effect of Multi-Task Fine-Tuning on LLM Performance -- A Case Study in Finance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01109","snapshot_observed_at":"2026-08-12T20:40:32.211478Z","title":"Mixing it up: The cocktail effect of multi-task fine-tuning on llm performance–a case study in finance","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.211478Z"},"links":{"cited_paper":"/paper/2410.01109","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:dc2305b8480fb42381e0daf935b06a06c777401e05862771d58b2a074369e738","observation_id":"6131caba-7c09-42ee-a2b8-42ecb92c94d4","resolution":{"observed_at":"2026-08-12T20:40:32.211478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.12894","last_updated":"2018-10-30T17:44:42Z","snapshot_observed_at":"2026-08-14T18:06:54.993797Z","submitted_at":"2018-10-30T17:44:42Z","title":"Exploration by Random Network Distillation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.12894","snapshot_observed_at":"2026-08-12T20:40:32.215784Z","title":"Exploration by random network distillation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.215784Z"},"links":{"cited_paper":"/paper/1810.12894","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:e432a15233f57051442d2856f97ce0160d2e8bf0144cf7124eb7959e2ccd59f9","observation_id":"9399ff0e-2079-4a67-959d-4b8119ecf00e","resolution":{"observed_at":"2026-08-12T20:40:32.215784Z","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-12T20:40:32.219949Z","title":"Adashift: Learning discriminative self-gated neural feature activation with an adaptive shift factor","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.219949Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:f1ad19b2ea21fc8a7cd3c03a1baa05750eb3e9a75fb7af4d2456eede92f1d862","observation_id":"114a3f33-5e2c-476a-85dc-deab160c6863","resolution":{"observed_at":"2026-08-12T20:40:32.219949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.00055","last_updated":"2025-05-29T04:19:56Z","snapshot_observed_at":"2026-08-15T16:17:09.671442Z","submitted_at":"2024-08-21T04:47:26Z","title":"SORSA: Singular Values and Orthonormal Regularized Singular Vectors Adaptation of Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.00055","snapshot_observed_at":"2026-08-12T20:40:32.224011Z","title":"Sorsa: Singular values and orthonormal regular- ized singular vectors adaptation of large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.224011Z"},"links":{"cited_paper":"/paper/2409.00055","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:9bd9e63c7e7693e00760d50be965fc421aae065605ce4ab1dd35424d51d17f12","observation_id":"214e7ad1-b916-4b6a-b7d9-afb943486e8e","resolution":{"observed_at":"2026-08-12T20:40:32.224011Z","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-12T20:40:32.228291Z","title":"Dsg-kd: Knowledge distillation from domain-specific to general language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.228291Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:cf6a68f786d2e7f39c77564b1c8ab169604daf9d3dfc56ed34e2982b9cff2999","observation_id":"1404346b-e431-498d-9cf1-05439b9bf881","resolution":{"observed_at":"2026-08-12T20:40:32.228291Z","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-12T20:40:32.232148Z","title":"Randaugment: Practical automated data augmen- tation with a reduced search space","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.232148Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:3c0967e01a1ff08a5b72047092d778fba9a010ac9c6b049683b606182bafd5a2","observation_id":"2211fdf7-da9c-46e1-bfa4-1aaff186d18c","resolution":{"observed_at":"2026-08-12T20:40:32.232148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16588","last_updated":"2024-04-12T09:38:33Z","snapshot_observed_at":"2026-08-07T09:40:32.614733Z","submitted_at":"2023-09-28T16:45:46Z","title":"Vision Transformers Need Registers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16588","snapshot_observed_at":"2026-08-12T20:40:32.235985Z","title":"Vision transformers need registers","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.235985Z"},"links":{"cited_paper":"/paper/2309.16588","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:c20be5a6038f1c96d8da2c08e61caad30fe310ff62ec133cadc88a425bfa495e","observation_id":"876ac165-6165-43d3-b245-d0baa8faae10","resolution":{"observed_at":"2026-08-12T20:40:32.235985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01280","last_updated":"2024-10-02T06:51:12Z","snapshot_observed_at":"2026-08-14T15:53:52.724496Z","submitted_at":"2024-10-02T06:51:12Z","title":"Sparse Autoencoders Reveal Temporal Difference Learning in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01280","snapshot_observed_at":"2026-08-12T20:40:32.240122Z","title":"Sparse autoencoders reveal tem- poral difference learning in large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.240122Z"},"links":{"cited_paper":"/paper/2410.01280","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:c33b145a163da68f79f467959a1151781079cab625b74ed63e82559e52f16271","observation_id":"f4ec108e-aa52-4fa3-9256-3bee2df9b2da","resolution":{"observed_at":"2026-08-12T20:40:32.240122Z","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-12T20:40:32.245327Z","title":"Why fine-tuning strug- gles with forgetting in machine unlearning? theoretical in- sights and a remedial approach, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.245327Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:e130c7d9d3b8cfcb3c329c5b99022df284339da011a6b21d3587bbefd3acefd3","observation_id":"640b3bb0-558c-4323-9259-af7ebb366ce3","resolution":{"observed_at":"2026-08-12T20:40:32.245327Z","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-12T20:40:32.249103Z","title":"Decaf: A deep convolutional activation feature for generic visual recog- nition","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.249103Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:7d3c19e50f85088be671abdaae23816fa6df820858b3f96e72b6c4f21a218132","observation_id":"0ba789b3-e649-4170-a7f6-0a1075f88471","resolution":{"observed_at":"2026-08-12T20:40:32.249103Z","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-12T20:40:32.252823Z","title":"Incorporating nesterov momentum into adam","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.252823Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:581ff941573fd638f5e1beba0183aaaf04111d6c1988ed66bb5a45640bccf01b","observation_id":"e6b4e22b-710d-4091-a413-f1fa639e0274","resolution":{"observed_at":"2026-08-12T20:40:32.252823Z","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-12T20:40:32.256189Z","title":"Rosetta neurons: Mining the common units in a model zoo","venue":null,"work_id":null,"year":1934},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.256189Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:f1b6f0c90a48152221223d5f0619b00c552a7b88a4fe3388421ee86d655d85ba","observation_id":"30a82ba2-91a9-4670-80f9-a7eb7839230a","resolution":{"observed_at":"2026-08-12T20:40:32.256189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01103","last_updated":"2024-06-03T23:30:33Z","snapshot_observed_at":"2026-08-15T07:30:36.630757Z","submitted_at":"2024-02-02T02:40:51Z","title":"Compositional Generative Modeling: A Single Model is Not All You Need","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01103","snapshot_observed_at":"2026-08-12T20:40:32.260729Z","title":"Compositional genera- tive modeling: A single model is not all you need","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.260729Z"},"links":{"cited_paper":"/paper/2402.01103","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:48a32f0fe1e0e5d9bfc4ee51a8b917afe631ce47716add1d40e2e78d52335756","observation_id":"977e4b22-dbfc-4947-ac07-2454d47c1019","resolution":{"observed_at":"2026-08-12T20:40:32.260729Z","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-12T20:40:32.264835Z","title":"Content-adaptive non-local convolution for remote sensing pansharpening","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.264835Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:55b613f5b3c4129f898485d3043983408c3de7080039b992f04a12a5fd6e4222","observation_id":"1017ebf1-703f-4d46-a7ca-d741c6be78b1","resolution":{"observed_at":"2026-08-12T20:40:32.264835Z","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-12T20:40:32.268718Z","title":"Roma: Robust dense feature matching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.268718Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:34023dc16376f47dc97cdc4ab9aa8667cea4cd838d8dd953c3cabc58b768d402","observation_id":"42489058-24f5-4dd1-9fbe-ae9611a3c9ad","resolution":{"observed_at":"2026-08-12T20:40:32.268718Z","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-12T20:40:32.272493Z","title":"Scaling rectified flow transformers for high-resolution image synthesis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.272493Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:d9aab8f1712816763608b24c8ee11c5f7d1c3a375431881b3201e9fe7be54d04","observation_id":"1bdbedd3-840e-4b97-b031-0e9d3fcea307","resolution":{"observed_at":"2026-08-12T20:40:32.272493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05200","last_updated":"2025-01-23T12:06:37Z","snapshot_observed_at":"2026-08-13T17:57:08.050938Z","submitted_at":"2024-08-09T17:44:45Z","title":"KIF: Knowledge Identification and Fusion for Language Model Continual Learning","version":4},"cited_work":{"arxiv_id":"2408.05200","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.05200","snapshot_observed_at":"2026-08-12T20:40:33.455706Z","title":"KIF: Knowledge Identification and Fusion for Language Model Continual Learning","venue":"cs.CL","work_id":"1c88b9b2-104d-403f-8f6d-2d76d4a89489","year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.276705Z"},"links":{"cited_paper":"/paper/2408.05200","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:7cdea2aa07a9c82667bbadf9182361f493232b53093a0dfdf3083197551e58c6","observation_id":"6909d368-00b8-4182-ae49-e1862caf9052","resolution":{"observed_at":"2026-08-12T20:40:33.459901Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T20:40:32.281871Z","title":"Sharpness-aware minimization for efficiently improving generalization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.281871Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:0cb520b9219ba7d1babc0b86cce7e3402a0e9908a1c143b7b70ff82be95ff695","observation_id":"84b8f97c-0045-4bcb-83bc-d07c15c3d2d4","resolution":{"observed_at":"2026-08-12T20:40:32.281871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17954","last_updated":"2025-03-12T09:42:19Z","snapshot_observed_at":"2026-08-13T14:48:12.467397Z","submitted_at":"2024-09-26T15:30:54Z","title":"Enhancing elusive clues in knowledge learning by contrasting attention of language models","version":2},"cited_work":{"arxiv_id":"2409.17954","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.17954","snapshot_observed_at":"2026-08-12T20:40:33.440011Z","title":"Enhancing elusive clues in knowledge learning by contrasting attention of language models","venue":"cs.AI","work_id":"72b8f657-3517-47cb-8204-4180c0e8b9a7","year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.285752Z"},"links":{"cited_paper":"/paper/2409.17954","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:0a37b87ad03921dc21c4ce44746013d71cb17d187751b5cb24fe8fbe6802f11e","observation_id":"a4205148-7bcf-4574-92ce-4cd166cb1d26","resolution":{"observed_at":"2026-08-12T20:40:33.444470Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.10445","last_updated":"2023-03-02T09:28:25Z","snapshot_observed_at":"2026-08-14T09:27:02.011038Z","submitted_at":"2022-11-18T14:59:42Z","title":"Building a Subspace of Policies for Scalable Continual Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.10445","snapshot_observed_at":"2026-08-12T20:40:32.290229Z","title":"Build- ing a subspace of policies for scalable continual learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.290229Z"},"links":{"cited_paper":"/paper/2211.10445","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:eb6e764510b9160c3fd3f8cd32027367524a5a41d688a34a4b23c230583bb80e","observation_id":"1fa23ffe-27bf-4d9e-87dc-2e07ef1b1a11","resolution":{"observed_at":"2026-08-12T20:40:32.290229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.06727","last_updated":"2022-12-13T16:55:12Z","snapshot_observed_at":"2026-08-13T13:22:40.427545Z","submitted_at":"2022-12-13T16:55:12Z","title":"What do Vision Transformers Learn? A Visual Exploration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.06727","snapshot_observed_at":"2026-08-12T20:40:32.294790Z","title":"What do vision transformers learn? a visual exploration","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.294790Z"},"links":{"cited_paper":"/paper/2212.06727","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:478455429c8a3ea14d9461b69c6cc9fe61ee5447e8611cb30be32d291693d20d","observation_id":"c538e3c6-04d4-4d8a-9823-7cd63c719167","resolution":{"observed_at":"2026-08-12T20:40:32.294790Z","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-12T20:40:32.298957Z","title":"Dropblock: A regularization method for convolutional networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.298957Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:3444848051688d1bee7caef635235051e9f4647c92a78aaff0e225e957736002","observation_id":"b56c4daf-f814-4e0d-93bf-81297f0dde9c","resolution":{"observed_at":"2026-08-12T20:40:32.298957Z","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-12T20:40:32.302831Z","title":"Task-adaptive pretrained language models via clustered- importance sampling, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.302831Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:2d3e82c76e0d41f8eb2b7c636705e12b3e436b7c5dc3b7f33e0fdaa062275e9b","observation_id":"a703ce3c-4b81-4869-9753-5d6f8495083c","resolution":{"observed_at":"2026-08-12T20:40:32.302831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.06913","last_updated":"2023-07-14T09:17:19Z","snapshot_observed_at":"2026-08-13T10:56:00.236898Z","submitted_at":"2023-07-13T17:21:54Z","title":"Uncovering Unique Concept Vectors through Latent Space Decomposition","version":2},"cited_work":{"arxiv_id":"2307.06913","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.06913","snapshot_observed_at":"2026-08-12T20:40:33.400120Z","title":"Uncovering Unique Concept Vectors through Latent Space Decomposition","venue":"cs.LG","work_id":"08ffe71e-cfea-4a45-978d-a52d641b68a9","year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.306768Z"},"links":{"cited_paper":"/paper/2307.06913","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:73142cc65492aa782c9ce0c077ddf3cff17e5eaa59dd523d1102c3d57c1f76d1","observation_id":"fb8498f5-918a-464b-b78a-1b286b76ed4e","resolution":{"observed_at":"2026-08-12T20:40:33.405019Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T20:40:32.311101Z","title":"Preserving linear separability in continual learning by backward fea- ture projection","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.311101Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:c259cdec8557cbee65298085fbe5221cfbf18d0ea9d09ba3c3ced9b7785a42f5","observation_id":"79cc3571-bd4d-4008-8dcd-f157ab9dcfec","resolution":{"observed_at":"2026-08-12T20:40:32.311101Z","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-12T20:40:32.315029Z","title":"Cpp-net: Embracing multi- scale feature fusion into deep unfolding cp-ppa network for compressive sensing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.315029Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:c15ad1971eb566039edab2cebd4099a24a829463d77bc9aae9388cb0ee927895","observation_id":"e1f7c1d7-ca2f-48cc-bd73-b09df54eb9ef","resolution":{"observed_at":"2026-08-12T20:40:32.315029Z","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-12T20:40:32.318810Z","title":"Slim: Let llm learn more and forget less with soft lora and identity mixture, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.318810Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:69dff8334dc2dfaf915a62045ff4ec4903f7db727fed07a6307f644dc64acbb4","observation_id":"ddfd57df-0f2a-40c5-84b0-6c70f5bba4e2","resolution":{"observed_at":"2026-08-12T20:40:32.318810Z","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-12T20:40:32.323016Z","title":"Upcycling large language models into mixture of experts, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.323016Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:94f2dcafd8e4d953531e0390474bbdcf2093aa0efffcab4c09485cf473927fbc","observation_id":"92a1ebf6-8334-49ed-b550-b0e00a877f62","resolution":{"observed_at":"2026-08-12T20:40:32.323016Z","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-12T20:40:32.326778Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.326778Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:d3e97a22c5e297d0c93599d4e56fee62ae78b5474575a1df9d81385ebafe745f","observation_id":"a4e5943f-20ed-4030-9c47-660ae2cae5e8","resolution":{"observed_at":"2026-08-12T20:40:32.326778Z","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-12T20:40:32.330840Z","title":"Identity mappings in deep residual networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.330840Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:d0f141acc652bbb186a1cf100f08d0a7a00133af324c5373b794a53e33581272","observation_id":"03f6b28c-ecc5-4799-8b2e-f750ca78d19a","resolution":{"observed_at":"2026-08-12T20:40:32.330840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14577","last_updated":"2024-02-22T14:33:23Z","snapshot_observed_at":"2026-08-14T09:21:51.935893Z","submitted_at":"2024-02-22T14:33:23Z","title":"Debiasing Text-to-Image Diffusion Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14577","snapshot_observed_at":"2026-08-12T20:40:32.334833Z","title":"Debi- asing text-to-image diffusion models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.334833Z"},"links":{"cited_paper":"/paper/2402.14577","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:daa2fa560d185bbc3ab9a20df22cab1131e349bb0ac34a6f36c90152e64fb93e","observation_id":"13a24bd6-254d-45ed-8572-62011876a6b1","resolution":{"observed_at":"2026-08-12T20:40:32.334833Z","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-12T20:40:32.338855Z","title":"Bag of tricks for image classifica- tion with convolutional neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.338855Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:91755d26d8cf668ac1a8f05619600020ff6be9dc2631e58756a5578b5383afec","observation_id":"f2f1685b-9721-42a7-b5e5-5ac80e22cdcc","resolution":{"observed_at":"2026-08-12T20:40:32.338855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.08415","last_updated":"2023-06-06T01:53:32Z","snapshot_observed_at":"2026-08-13T19:48:28.322536Z","submitted_at":"2016-06-27T19:20:40Z","title":"Gaussian Error Linear Units (GELUs)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.08415","snapshot_observed_at":"2026-08-12T20:40:32.343013Z","title":"Gaussian error linear units (gelus)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.343013Z"},"links":{"cited_paper":"/paper/1606.08415","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:73d57cf29ecee2b02948debe08c14cc930864207249614e657c13c7fc4c42a0a","observation_id":"e19c15ab-fc8c-4246-ac2c-0202dd385d0e","resolution":{"observed_at":"2026-08-12T20:40:32.343013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.02781","last_updated":"2020-02-17T06:16:13Z","snapshot_observed_at":"2026-08-14T11:38:20.162100Z","submitted_at":"2019-12-05T18:18:10Z","title":"AugMix: A Simple Data Processing Method to Improve Robustness and Uncertainty","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.02781","snapshot_observed_at":"2026-08-12T20:40:32.347208Z","title":"Augmix: A simple data processing method to improve robustness and uncertainty","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.347208Z"},"links":{"cited_paper":"/paper/1912.02781","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:cab49c02f25db069ddae3d21366804b8842e6a35dcd9c72620db9ec127f044bc","observation_id":"2059835e-b2da-4721-8deb-d2ec6a12e5a7","resolution":{"observed_at":"2026-08-12T20:40:32.347208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.04141","last_updated":"2021-01-11T19:06:44Z","snapshot_observed_at":"2026-08-13T12:33:58.704658Z","submitted_at":"2021-01-11T19:06:44Z","title":"From Tinkering to Engineering: Measurements in Tensorflow Playground","version":1},"cited_work":{"arxiv_id":"2101.04141","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.04141","snapshot_observed_at":"2026-08-12T20:40:33.346181Z","title":"From Tinkering to Engineering: Measurements in Tensorflow Playground","venue":"cs.LG","work_id":"98a87ba5-4ac3-4b8e-abf0-0230ea675298","year":2021},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.351598Z"},"links":{"cited_paper":"/paper/2101.04141","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:4e0dce0174dd1cd6d4757f3f1f096979af50b5d93875a9cf7a75e8779d38d826","observation_id":"a6b16bea-aca0-4275-aabf-eedcb00daa57","resolution":{"observed_at":"2026-08-12T20:40:33.350773Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T20:40:32.356522Z","title":"Concept-centric transformers: Enhancing model inter- pretability through object-centric concept learning within a shared global workspace","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.356522Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:7808642bcadff0ecb3aef58110a5ad795ab662265b1717a4ff0c1b82c8e5db00","observation_id":"0a966b85-62de-49a7-9723-e41f701799af","resolution":{"observed_at":"2026-08-12T20:40:32.356522Z","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-12T20:40:32.360186Z","title":"Deep networks with stochastic depth","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.360186Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:eefefed66bcb7d2f7d61778fcb630a973fd730dfd46421ecdb9442d4c64099eb","observation_id":"6023e61a-039a-48f2-8c0e-4e68883d2d18","resolution":{"observed_at":"2026-08-12T20:40:32.360186Z","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-12T20:40:32.364021Z","title":"Densely connected convolutional net- works","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.364021Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:5cbb53ad91c3df92423538dbb700708204556088c6b6bcc5bb3dcaa127b5ed2a","observation_id":"fe44b1e7-18f2-4a2c-954a-40006be1113a","resolution":{"observed_at":"2026-08-12T20:40:32.364021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07987","last_updated":"2024-07-25T09:33:50Z","snapshot_observed_at":"2026-08-06T11:02:06.607024Z","submitted_at":"2024-05-13T17:58:30Z","title":"The Platonic Representation Hypothesis","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.07987","snapshot_observed_at":"2026-08-12T20:40:32.368244Z","title":"The platonic representation hypothesis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.368244Z"},"links":{"cited_paper":"/paper/2405.07987","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:b4c0afea4fc9459071478b165b9ae92742427e4815056f57870477cdabbc4c3b","observation_id":"672a06ae-1aa2-40fd-ade0-7ffdf494944b","resolution":{"observed_at":"2026-08-12T20:40:32.368244Z","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-12T20:40:32.372556Z","title":"Comparing the decision-making mechanisms by transformers and cnns via explanation methods","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.372556Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:c29021fe3bfdb6a301ac151543adef1f192b72dc391b2f9fcd922fa89e730045","observation_id":"345110cd-1880-4ea9-bbbb-7bae5f24a974","resolution":{"observed_at":"2026-08-12T20:40:32.372556Z","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-12T20:40:32.377230Z","title":"No train no gain: Revisiting ef- ficient training algorithms for transformer-based language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.377230Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:9137406834547eee31840fe3d7bf5934c8e2e98c91a83257394bce772593f49b","observation_id":"42937489-2d40-45fb-8fdc-bc303b5286fa","resolution":{"observed_at":"2026-08-12T20:40:32.377230Z","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-12T20:40:32.381557Z","title":"Localized semantic feature mixers for effi- cient pedestrian detection in autonomous driving","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.381557Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:e26db82194691a5e7332bb4efe78eb2c36c624e54fd3bd380117965c43f1851b","observation_id":"80aa70c4-59cb-45a8-8793-5c7c72042506","resolution":{"observed_at":"2026-08-12T20:40:32.381557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15166","last_updated":"2024-04-04T01:53:38Z","snapshot_observed_at":"2026-08-13T04:54:52.394295Z","submitted_at":"2023-12-23T05:11:37Z","title":"SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scaling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.15166","snapshot_observed_at":"2026-08-12T20:40:32.385849Z","title":"Solar 10.7 b: Scaling large language models with simple yet effective depth up-scaling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.385849Z"},"links":{"cited_paper":"/paper/2312.15166","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:55030f681a6649e2df1ccd1fa2bef842000a53fef257ac6fa7499eefd5ad06d2","observation_id":"2fde43ec-adca-4ce4-9dc1-a7d900abe1ff","resolution":{"observed_at":"2026-08-12T20:40:32.385849Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19588","last_updated":"2024-08-07T15:11:01Z","snapshot_observed_at":"2026-08-13T00:42:50.113566Z","submitted_at":"2024-03-28T17:12:39Z","title":"DenseNets Reloaded: Paradigm Shift Beyond ResNets and ViTs","version":2},"cited_work":{"arxiv_id":"2403.19588","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.19588","snapshot_observed_at":"2026-08-12T20:40:33.304892Z","title":"DenseNets Reloaded: Paradigm Shift Beyond ResNets and ViTs","venue":"cs.CV","work_id":"90532aae-5ce3-4052-ba90-27af18fc163c","year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.390736Z"},"links":{"cited_paper":"/paper/2403.19588","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:9bd00b20b78d2c5d5cb91687879649e71bcbc747dbc1be43bc1a85a8cb79afac","observation_id":"7aef824f-4607-4852-a0b5-1e70087911a9","resolution":{"observed_at":"2026-08-12T20:40:33.309004Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08590","last_updated":"2025-06-21T10:50:24Z","snapshot_observed_at":"2026-08-15T09:08:01.883115Z","submitted_at":"2024-08-16T07:47:39Z","title":"Reasoning Circuits in Language Models: A Mechanistic Interpretation of Syllogistic Inference","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08590","snapshot_observed_at":"2026-08-12T20:40:32.395287Z","title":"A mechanistic interpretation of syllogistic reasoning in auto-regressive language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.395287Z"},"links":{"cited_paper":"/paper/2408.08590","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:6eadf834a83a448169a7b676644e1aef65ce7085b97b1ab1600ec00c34da305a","observation_id":"144e9ef4-691c-4981-90de-42b5dc51cd3b","resolution":{"observed_at":"2026-08-12T20:40:32.395287Z","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-12T20:40:32.399652Z","title":"Feature separation and recalibration for adversarial robustness","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.399652Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:1bcd64bb79a48e1fbe38b17621099ba535ceabadff62e851064c1252b9ff045c","observation_id":"8d4c6157-1879-426a-8dfe-0e51fc3b81db","resolution":{"observed_at":"2026-08-12T20:40:32.399652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-12T20:40:32.403541Z","title":"Adam: A method for stochastic opti- mization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.403541Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:8f4d313714b4ae3a6d4a119bde8be392b9c625fadf2f499e466ff7e9dccb5154","observation_id":"7077094f-4935-4e81-aeff-35fc09ffa50a","resolution":{"observed_at":"2026-08-12T20:40:32.403541Z","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-12T20:40:32.407809Z","title":"Mean-shift feature transformer","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.407809Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:18b4cd1fffec0e7cf4556af5469812e33180387a094a5667752a796c342f7bb6","observation_id":"c266adeb-e62f-4e31-bddf-bcacb2fff3ec","resolution":{"observed_at":"2026-08-12T20:40:32.407809Z","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-12T20:40:32.411878Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.411878Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:9aabe8bba88998ef82f63b2d506e2f728279afdf74276f0a04bba4239ee5748f","observation_id":"28f7a801-d199-49e3-89c0-5a937e3524e3","resolution":{"observed_at":"2026-08-12T20:40:32.411878Z","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-12T20:40:32.415892Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.415892Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:be1674e1b5dfd3b81523a096033456922febec038e2fb1f357ea975042074e49","observation_id":"ebf77df9-f65a-4350-b2bf-9c10d50b00e4","resolution":{"observed_at":"2026-08-12T20:40:32.415892Z","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-12T20:40:32.420043Z","title":"Fix the noise: Disen- tangling source feature for controllable domain translation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.420043Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:897ee784b011ee1b3aa6a77df93b9fc103d375e844cde759d801cedb5a27248b","observation_id":"7a7fafad-f5fb-4fa7-b1c4-23d2ade44018","resolution":{"observed_at":"2026-08-12T20:40:32.420043Z","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-12T20:40:32.424030Z","title":"Automated progres- sive learning for efficient training of vision transformers","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.424030Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:3b99a27c58496438390e474402bac57e8551f95e731aa7c2098acfab371efab8","observation_id":"eb532026-debb-46ff-9005-98af1d30a79e","resolution":{"observed_at":"2026-08-12T20:40:32.424030Z","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-12T20:40:32.427796Z","title":"Robustness preserving fine-tuning using neuron importance","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.427796Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:bb57c2d58eed27277d682a24b4e14c77c27a6db86ff9823f3dd2500ff04444e8","observation_id":"74bf4e8f-8b9b-4268-abf2-361f2f37ba37","resolution":{"observed_at":"2026-08-12T20:40:32.427796Z","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-12T20:40:32.431352Z","title":"Formality is favored: Unraveling the learning preferences of large language models on data with conflicting knowl- edge, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.431352Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:7fba935025cfc2903d4c08ad1a6e7dfa749bdddf6ce0c39480641a928b5b4dc8","observation_id":"bd9a0878-4cdc-47ff-9b67-7b68b3ea07f8","resolution":{"observed_at":"2026-08-12T20:40:32.431352Z","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-12T20:40:32.434966Z","title":"Adver- sarial feature hallucination networks for few-shot learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.434966Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:a39edf1cbf598957112d04671bcc9bd24993978ba43d98d6b666b1b0cbf77775","observation_id":"6956a347-ffc5-4625-8a00-3545ff4219dc","resolution":{"observed_at":"2026-08-12T20:40:32.434966Z","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-12T20:40:32.438512Z","title":"Parameter-efficient fine- tuning in spectral domain for point cloud learning, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.438512Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:eb230bbe897107444e5cf99753a669ed78093544d518086e5a4b447a7cacf19c","observation_id":"e1763176-a908-4b89-9cb7-8133c149bee9","resolution":{"observed_at":"2026-08-12T20:40:32.438512Z","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-12T20:40:32.442547Z","title":"Mind the gap: Understanding the modality gap in multi-modal contrastive representation learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.442547Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:245fbe52925a8387cca4c1ffd9befcf355a61655e9023c55c7725fedcf76b708","observation_id":"0e0d7be1-3423-4b62-b00c-c609ae894960","resolution":{"observed_at":"2026-08-12T20:40:32.442547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15048","last_updated":"2024-03-13T14:24:28Z","snapshot_observed_at":"2026-08-13T10:04:34.709902Z","submitted_at":"2023-09-26T16:25:57Z","title":"Class Incremental Learning via Likelihood Ratio Based Task Prediction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15048","snapshot_observed_at":"2026-08-12T20:40:32.446984Z","title":"Class incremental learning via likelihood ratio based task prediction","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.446984Z"},"links":{"cited_paper":"/paper/2309.15048","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:601d2630cd7ed02edfe38c3ba88c30381a80108cf2ed472544807d1063485628","observation_id":"259464c2-58aa-470a-84b3-811f52229890","resolution":{"observed_at":"2026-08-12T20:40:32.446984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12425","last_updated":"2024-09-19T02:59:44Z","snapshot_observed_at":"2026-08-13T19:51:29.009918Z","submitted_at":"2024-09-19T02:59:44Z","title":"Zero-to-Strong Generalization: Eliciting Strong Capabilities of Large Language Models Iteratively without Gold Labels","version":1},"cited_work":{"arxiv_id":"2409.12425","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.12425","snapshot_observed_at":"2026-08-12T20:40:33.257640Z","title":"Zero-to-Strong Generalization: Eliciting Strong Capabilities of Large Language Models Iteratively without Gold Labels","venue":"cs.CL","work_id":"ae59f7cf-1eda-4b51-bd49-e6857073805d","year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.451309Z"},"links":{"cited_paper":"/paper/2409.12425","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:eeb4556df1506162622c61869323d0c7c42680dbc25557cde3bff49a948dd75c","observation_id":"57142313-9e41-477b-857e-834e6af16eaf","resolution":{"observed_at":"2026-08-12T20:40:33.261782Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T20:40:32.455335Z","title":"Soft augmentation for image classification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.455335Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:afb636f77e118e9c039296eac829f05a6d803a71dd454cb77c8fd70e538bdfc2","observation_id":"92a00115-a0b8-41d6-ae0a-9978ddee6a25","resolution":{"observed_at":"2026-08-12T20:40:32.455335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14721","last_updated":"2025-01-25T05:21:44Z","snapshot_observed_at":"2026-08-12T22:56:57.953384Z","submitted_at":"2024-08-27T01:04:14Z","title":"PAT: Pruning-Aware Tuning for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14721","snapshot_observed_at":"2026-08-12T20:40:32.459906Z","title":"Pat: Pruning- aware tuning for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.459906Z"},"links":{"cited_paper":"/paper/2408.14721","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:124cf8fd4865daf0dcc8ac4fb3359614ae10735e52f38c08db9a875f72fec418","observation_id":"c08aafce-40c6-4850-94d3-79a71a7e938b","resolution":{"observed_at":"2026-08-12T20:40:32.459906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04140","last_updated":"2024-08-08T00:53:31Z","snapshot_observed_at":"2026-08-14T07:02:27.700734Z","submitted_at":"2024-08-08T00:53:31Z","title":"UNLEARN Efficient Removal of Knowledge in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.04140","snapshot_observed_at":"2026-08-12T20:40:32.464254Z","title":"Unlearn efficient removal of knowledge in large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.464254Z"},"links":{"cited_paper":"/paper/2408.04140","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:9c8d5a2f01d1b7ae357cb6f7bc9e8831e4f7fe6483a669fa9ed764b9192703f1","observation_id":"0bf18578-27e6-4d7c-a720-e44f3322109b","resolution":{"observed_at":"2026-08-12T20:40:32.464254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-12T20:40:32.468168Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.468168Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:8b9ed3a2aadc7227b09deae8755abd771f771f82cf5d91f43a38a7077f24944c","observation_id":"32b289fb-5e52-4add-b026-acba3cf976c4","resolution":{"observed_at":"2026-08-12T20:40:32.468168Z","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-12T20:40:32.472102Z","title":"Mono-internvl: Pushing the boundaries of monolithic multimodal large language mod- els with endogenous visual pre-training, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.472102Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:d6488fc639515f501a2f5e77119e722c019398f8540befcb70dfc3dd42fb9199","observation_id":"ce497222-1214-4abd-84cd-b0372908f54d","resolution":{"observed_at":"2026-08-12T20:40:32.472102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.09281","last_updated":"2025-02-06T03:31:50Z","snapshot_observed_at":"2026-08-13T20:41:35.044484Z","submitted_at":"2024-09-14T03:11:00Z","title":"Language Models \"Grok\" to Copy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.09281","snapshot_observed_at":"2026-08-12T20:40:32.476689Z","title":"Language models” grok” to copy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.476689Z"},"links":{"cited_paper":"/paper/2409.09281","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:67c22af5f3669f986556953365308701df2c30fb0429ea36b6986f5b3c27377e","observation_id":"1875d522-073c-4895-9403-dce6fa641eb1","resolution":{"observed_at":"2026-08-12T20:40:32.476689Z","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-12T20:40:32.480740Z","title":"Curvature-balanced feature manifold learning for long-tailed classification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.480740Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:5929eb520cd29ed0476e17c0a817561b92528860fe1cc7ebc48472023f588eea","observation_id":"625ccbee-7c5b-466f-8ada-497fb5d72e50","resolution":{"observed_at":"2026-08-12T20:40:32.480740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15505","last_updated":"2023-10-12T07:55:05Z","snapshot_observed_at":"2026-07-06T16:24:17.829828Z","submitted_at":"2023-09-27T09:13:40Z","title":"Finite Scalar Quantization: VQ-VAE Made Simple","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15505","snapshot_observed_at":"2026-08-12T20:40:32.484550Z","title":"Finite scalar quantization: Vq-vae made simple","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.484550Z"},"links":{"cited_paper":"/paper/2309.15505","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:a509ca2dd4299f71c7a5a786a338801bee2d4808002402089f0e764c774f5e75","observation_id":"66a98b2e-8671-435b-a1a1-4deda0e11923","resolution":{"observed_at":"2026-08-12T20:40:32.484550Z","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-12T20:40:32.488915Z","title":"Pace: marrying generalization in parameter-efficient fine-tuning with con- sistency regularization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.488915Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:cc94b151242187117cb93067dc3171cdfe2eaab30902e700b486ccf31bc32ce9","observation_id":"cd91c859-0a32-4d3c-911f-00d179f95460","resolution":{"observed_at":"2026-08-12T20:40:32.488915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01866","last_updated":"2025-02-06T11:54:35Z","snapshot_observed_at":"2026-08-12T22:32:40.261190Z","submitted_at":"2024-10-02T11:54:21Z","title":"House of Cards: Massive Weights in LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01866","snapshot_observed_at":"2026-08-12T20:40:32.492952Z","title":"House of cards: Massive weights in llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.492952Z"},"links":{"cited_paper":"/paper/2410.01866","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:b84be902c2afa5465490db74e8f3a821c60783349d30376779345bb6652b880c","observation_id":"68e32e63-0da0-452f-b9ee-8003a0c8a7d1","resolution":{"observed_at":"2026-08-12T20:40:32.492952Z","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-12T20:40:32.497003Z","title":"Zoom in: An in- troduction to circuits","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.497003Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:cb7c8264c9875938430ee1b2f01baaeb8eb78b8b97afa1c2e5d973ce13b8f703","observation_id":"dc6dfe18-9b7a-497e-b196-515519821620","resolution":{"observed_at":"2026-08-12T20:40:32.497003Z","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-12T20:40:32.501081Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.501081Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:c829c1043d2034b0d646d38879d514af01dfac0f2296d7869593508e26adfece","observation_id":"69ce8d33-93e5-46c7-970a-48a510dfa587","resolution":{"observed_at":"2026-08-12T20:40:32.501081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.07193","last_updated":"2024-02-02T10:24:09Z","snapshot_observed_at":"2026-08-11T10:12:11.384939Z","submitted_at":"2023-04-14T15:12:19Z","title":"DINOv2: Learning Robust Visual Features without Supervision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.07193","snapshot_observed_at":"2026-08-12T20:40:32.505125Z","title":"Dinov2: Learning robust visual features without supervi- sion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.505125Z"},"links":{"cited_paper":"/paper/2304.07193","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:7e0fbe999557c251ee4d7330c2bfc2aa75a8407ad6a2016ac090e45f1fba5420","observation_id":"e17e80e0-446a-4c37-be1f-8d4c64213db9","resolution":{"observed_at":"2026-08-12T20:40:32.505125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19941","last_updated":"2024-03-29T02:49:15Z","snapshot_observed_at":"2026-08-13T19:38:25.927724Z","submitted_at":"2024-03-29T02:49:15Z","title":"Diverse Feature Learning by Self-distillation and Reset","version":1},"cited_work":{"arxiv_id":"2403.19941","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.19941","snapshot_observed_at":"2026-08-12T20:40:33.099547Z","title":"Diverse Feature Learning by Self-distillation and Reset","venue":"cs.AI","work_id":"dc979328-3124-4b9d-872a-c0c5c18c8ace","year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.509130Z"},"links":{"cited_paper":"/paper/2403.19941","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:06e7e5c925b674ae6d201da36c82a6f8b8768e05a78a7ee203ae8d6d2ae31d26","observation_id":"91eb28c6-cb86-4b0a-8550-4af381a55edc","resolution":{"observed_at":"2026-08-12T20:40:33.104055Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11530","last_updated":"2024-05-19T11:55:48Z","snapshot_observed_at":"2026-08-13T00:04:20.628901Z","submitted_at":"2024-05-19T11:55:48Z","title":"Learning More Generalized Experts by Merging Experts in Mixture-of-Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11530","snapshot_observed_at":"2026-08-12T20:40:32.513218Z","title":"Learning more generalized experts by merging experts in mixture-of-experts","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.513218Z"},"links":{"cited_paper":"/paper/2405.11530","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:6c56ad3df8669d98a859e3bb6faa9b36eacc2d439bbed14d43f708dd872b6726","observation_id":"33a98791-f255-49a7-854b-a8fa29a4fd53","resolution":{"observed_at":"2026-08-12T20:40:32.513218Z","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-12T20:40:32.517642Z","title":"Sdxl: Improving latent diffusion models for high-resolution image synthesis, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.517642Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:4b433c0615e2fecc97b94a56ffefc4b89a41c84e28a10c026d4d2681e604e691","observation_id":"f1e216f7-2ddb-4233-9dc7-0c728a4b8941","resolution":{"observed_at":"2026-08-12T20:40:32.517642Z","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-12T20:40:32.521476Z","title":"Enhancing deformable local features by jointly learning to detect and describe keypoints","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.521476Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:4f6b25cc13dd71a303d54464e40ab8a50ba5f3b5e15f0e8cb3bf33ea9737dc89","observation_id":"76d9cadc-cd00-4cfa-9b0b-90d89d4069bd","resolution":{"observed_at":"2026-08-12T20:40:32.521476Z","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-12T20:40:32.525110Z","title":"Cafeboost: Causal feature boost to eliminate task-induced bias for class incremental learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.525110Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:5f7d6b9b8bd929414a4b074c6153ccb33d5a72665bd08936b0cfb0e480d93236","observation_id":"6572b150-c6cd-4eb5-8cd7-7f4a59a616f3","resolution":{"observed_at":"2026-08-12T20:40:32.525110Z","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-12T20:40:32.528820Z","title":"Unlocking emergent modularity in large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.528820Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:f223a9247c8465b9d72e51405a473a6a8d5eb9eea1eb3bf879ed11d929515c4b","observation_id":"29f905da-9efb-437a-82d8-af92c793e604","resolution":{"observed_at":"2026-08-12T20:40:32.528820Z","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-12T20:40:32.532215Z","title":"Berg, and Li Fei-Fei","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.532215Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:86cf02d4b503431926e96e11da2bb43767ea81dbc671c06daab25914dba8ded5","observation_id":"bb570f63-1bf4-40f2-bcec-e88b435db7aa","resolution":{"observed_at":"2026-08-12T20:40:32.532215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12597","last_updated":"2024-09-19T09:21:42Z","snapshot_observed_at":"2026-08-12T22:41:52.871211Z","submitted_at":"2024-09-19T09:21:42Z","title":"LARE: Latent Augmentation using Regional Embedding with Vision-Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12597","snapshot_observed_at":"2026-08-12T20:40:32.535730Z","title":"Lare: Latent augmentation us- ing regional embedding with vision-language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.535730Z"},"links":{"cited_paper":"/paper/2409.12597","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:b29faf512d1a61f464c8d162202e73ae4afc0b33c20aacda344b5d129063abce","observation_id":"36338cff-0af2-4f35-92b2-ff68efbcd535","resolution":{"observed_at":"2026-08-12T20:40:32.535730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12903","last_updated":"2024-09-20T16:22:37Z","snapshot_observed_at":"2026-08-12T22:41:34.868049Z","submitted_at":"2024-09-19T16:50:26Z","title":"Scaling Smart: Accelerating Large Language Model Pre-training with Small Model Initialization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12903","snapshot_observed_at":"2026-08-12T20:40:32.540034Z","title":"Scaling smart: Accelerating large language model pre-training with small model initial- ization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.540034Z"},"links":{"cited_paper":"/paper/2409.12903","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:e428bbd5323ed9d078dff16926fad35dc24d43129cc82e22ab443756ac27d906","observation_id":"360b389d-40b6-447f-a2ff-76778bcc1e9a","resolution":{"observed_at":"2026-08-12T20:40:32.540034Z","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-12T20:40:32.544274Z","title":"Overcoming catastrophic forgetting with hard attention to the task","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.544274Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:652d40490cd73d74f211c543c2a3cd79e1f175b080016bf3caec5e0cb06142fb","observation_id":"ea7b32cf-bcf0-4e96-b727-86f5606cfe25","resolution":{"observed_at":"2026-08-12T20:40:32.544274Z","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-12T20:40:33.834572Z","title":"Adaptive subspaces for few-shot learn- ing","venue":null,"work_id":"39a77216-74da-4021-85f0-cbabb7d6d415","year":2020},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.547951Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:9d6a3d82807a4a2fd5e9cf4fe69e173fc00316e3b6f8be4dc9418950edd11af3","observation_id":"4914e393-4859-4010-b77e-cfc1f17ee81c","resolution":{"observed_at":"2026-08-12T20:40:33.838632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02513","last_updated":"2024-09-04T08:24:53Z","snapshot_observed_at":"2026-08-12T22:51:44.178688Z","submitted_at":"2024-09-04T08:24:53Z","title":"SG-MIM: Structured Knowledge Guided Efficient Pre-training for Dense Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02513","snapshot_observed_at":"2026-08-12T20:40:32.551847Z","title":"Sg- mim: Structured knowledge guided efficient pre-training for dense prediction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.551847Z"},"links":{"cited_paper":"/paper/2409.02513","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:ee9af7f46395803a73faaf14200a2b673a833ed46b0df0c176909527518b58e1","observation_id":"6086a63b-06a1-4ccc-adc5-6760b257f678","resolution":{"observed_at":"2026-08-12T20:40:32.551847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09503","last_updated":"2024-12-28T17:15:28Z","snapshot_observed_at":"2026-08-12T23:01:54.386770Z","submitted_at":"2024-08-18T14:52:25Z","title":"Out-of-distribution generalization via composition: a lens through induction heads in Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09503","snapshot_observed_at":"2026-08-12T20:40:32.556025Z","title":"Out- of-distribution generalization via composition: a lens through induction heads in transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.556025Z"},"links":{"cited_paper":"/paper/2408.09503","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:a2f1b2e5162189fb06dfc36ccc73a61e6cb9c26ea6c11201eecd1a822f4dce5a","observation_id":"55e09cc5-fc8d-4cd6-a81b-74fe98a295ed","resolution":{"observed_at":"2026-08-12T20:40:32.556025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6806","last_updated":"2015-04-13T07:58:17Z","snapshot_observed_at":"2026-08-14T23:06:34.544371Z","submitted_at":"2014-12-21T16:16:37Z","title":"Striving for Simplicity: The All Convolutional Net","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6806","snapshot_observed_at":"2026-08-12T20:40:32.560955Z","title":"Striving for simplicity: The all convolutional net","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.560955Z"},"links":{"cited_paper":"/paper/1412.6806","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:d5f4d29ac5e86fcf232ac03803644658353b2b573c8df8540dd06c03968b3f07","observation_id":"ab5d4894-bf8d-4708-b67f-6c192d26b423","resolution":{"observed_at":"2026-08-12T20:40:32.560955Z","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-12T20:40:33.822465Z","title":"Dropout: a simple way to prevent neural networks from overfitting","venue":null,"work_id":"ecd4f4aa-edb8-42e4-93b8-e5db71c4456d","year":1929},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.565078Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:30803323cc509b4b2d09929a9c676063edf6929c900349c307781acce0c2ff4b","observation_id":"ece05c83-4f0e-44d9-963d-0b3fbe2ff165","resolution":{"observed_at":"2026-08-12T20:40:33.826548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T20:40:32.568905Z","title":"Locat- ing information in large language models via random ma- trix theory","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.568905Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:b90625e422a307b3f0368ceebf894dbd257117923fb8929edf725ef44a07004d","observation_id":"845787ec-fb17-4aa5-8daa-d80df77fef45","resolution":{"observed_at":"2026-08-12T20:40:32.568905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05926","last_updated":"2024-09-09T08:44:53Z","snapshot_observed_at":"2026-08-14T19:37:36.536695Z","submitted_at":"2024-09-09T08:44:53Z","title":"SVFit: Parameter-Efficient Fine-Tuning of Large Pre-Trained Models Using Singular Values","version":1},"cited_work":{"arxiv_id":"2409.05926","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.05926","snapshot_observed_at":"2026-08-12T20:40:32.949365Z","title":"SVFit: Parameter-Efficient Fine-Tuning of Large Pre-Trained Models Using Singular Values","venue":"cs.LG","work_id":"2aac3d2f-1cdb-4186-b42a-7805f14d9c5f","year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.572712Z"},"links":{"cited_paper":"/paper/2409.05926","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:e2baa812da2a25b7abd0aa3bf586ea53a223310056d8d90c1ac85aaa201eeddb","observation_id":"ca1477b1-6c72-4774-8258-d9ab2dd22683","resolution":{"observed_at":"2026-08-12T20:40:32.953829Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10174","last_updated":"2024-08-26T07:34:46Z","snapshot_observed_at":"2026-08-12T23:01:15.677695Z","submitted_at":"2024-08-19T17:32:15Z","title":"SMILE: Zero-Shot Sparse Mixture of Low-Rank Experts Construction From Pre-Trained Foundation Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10174","snapshot_observed_at":"2026-08-12T20:40:32.576545Z","title":"Smile: Zero-shot sparse mixture of low-rank experts construction from pre-trained foundation models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.576545Z"},"links":{"cited_paper":"/paper/2408.10174","citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:5443b24f9a27868bdb722a91af7abf9e3092859f72c81b9d05efdc42f56c892f","observation_id":"1a2045b4-8bbc-41ec-ab96-8e3cbe3613fd","resolution":{"observed_at":"2026-08-12T20:40:32.576545Z","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-12T20:40:33.811108Z","title":"Scaling monosemanticity: Extracting in- terpretable features from claude 3 sonnet","venue":null,"work_id":"469e7c30-5b49-4130-8698-5f607459ae3f","year":2024},"citing_paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-12T20:40:32.580471Z"},"links":{"citing_paper":"/paper/2411.09475"},"observation_digest":"sha256:93103fe7dce77d9dec2d7112ad9b72c3cce84c1fb454a642776466b92b45fe35","observation_id":"53277d80-a6c4-479f-bef9-9e9f9ac136da","resolution":{"observed_at":"2026-08-12T20:40:33.815169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.09475","last_updated":"2024-11-14T14:31:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T07:28:43.643549Z","submitted_at":"2024-11-14T14:31:30Z","title":"ResidualDroppath: Enhancing Feature Reuse over Residual Connections"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":87,"verified_exact":9,"verified_fuzzy":3},"total_outbound_references":133},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 100 of 133 outbound references and 0 inbound Pith citation observations for arXiv:2411.09475."}