{"as_of":"2026-08-08T22:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdfd0acafc24a74844c2efc013bf96e66766be38e35e119eee14b0a085cee2f9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:30:20.434754Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T22:16:16.844716Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-07T13:30:20.434754Z","title":"Sleb: Streamlining llms through redundancy verification and elimination of transformer blocks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.434754Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:89f0e010661fb6f74ffeccc369559fbc2a9ec9ce191f47ef1eee43ef3f67be99","observation_id":"1c7748c0-9aa1-4f27-b552-43f5c056fbe4","resolution":{"observed_at":"2026-08-07T13:30:20.434754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-07T11:20:43.592215Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02818","last_updated":"2025-06-03T12:47:23Z","snapshot_observed_at":"2026-08-07T11:12:49.745940Z","submitted_at":"2025-06-03T12:47:23Z","title":"ProcrustesGPT: Compressing LLMs with Structured Matrices and Orthogonal Transformations","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T11:20:43.592215Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2506.02818"},"observation_digest":"sha256:6909ee04561ce736413bc83a43f74909988baa4b910c0bfc609fe17a6e5644fe","observation_id":"b3007589-1249-4ed5-8778-84e7a8302faf","resolution":{"observed_at":"2026-08-07T11:20:43.592215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-07T10:51:51.611505Z","title":"Sleb: Streamlining llms through redundancy verification and elimination of transformer blocks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04179","last_updated":"2025-06-04T17:26:31Z","snapshot_observed_at":"2026-08-08T19:35:37.122227Z","submitted_at":"2025-06-04T17:26:31Z","title":"SkipGPT: Dynamic Layer Pruning Reinvented with Token Awareness and Module Decoupling","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:51:51.611505Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2506.04179"},"observation_digest":"sha256:89d03d36ca65f0637c074c34e9eb7921d4f3e7d0c3de6d739c54b78d61341015","observation_id":"5b973fc4-827a-4292-85b3-0f0987a2249b","resolution":{"observed_at":"2026-08-07T10:51:51.611505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-06T22:58:09.407929Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-07T23:12:17.952101Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.407929Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:8901db6ceb63dfa502f0289ecf63b8a64bc19cd292ba216a633a0c89ffa6d95b","observation_id":"a9097cef-a1d4-41e4-be55-c8db94e02f57","resolution":{"observed_at":"2026-08-06T22:58:09.407929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-06T14:48:30.383090Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18212","last_updated":"2025-07-24T09:07:20Z","snapshot_observed_at":"2026-08-07T12:19:27.360013Z","submitted_at":"2025-07-24T09:07:20Z","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:30.383090Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2507.18212"},"observation_digest":"sha256:b15390937221540760fcb425953b3351939707a8c71132e6f313a199a0b10f63","observation_id":"e6567f3c-3e5f-4d7b-ba81-7140ec8adb65","resolution":{"observed_at":"2026-08-06T14:48:30.383090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-06T10:55:18.296382Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23362","last_updated":"2025-07-31T09:17:53Z","snapshot_observed_at":"2026-08-08T14:50:30.917971Z","submitted_at":"2025-07-31T09:17:53Z","title":"Short-LVLM: Compressing and Accelerating Large Vision-Language Models by Pruning Redundant Layers","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T10:55:18.296382Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2507.23362"},"observation_digest":"sha256:f72c2343a715334879179ea42a590c9dbf23e0006d40730a60b8b7c4196a1f2d","observation_id":"ec0219c8-ea7a-437e-b6a6-643da53ca0c8","resolution":{"observed_at":"2026-08-06T10:55:18.296382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-08-05T20:23:27.311851Z","title":"Sun, M.; Liu, Z.; Bair, A.; and Kolter, Z","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.18221","last_updated":"2025-08-14T11:57:49Z","snapshot_observed_at":"2026-08-05T20:23:18.555186Z","submitted_at":"2025-08-14T11:57:49Z","title":"Numerical Simulation for General Relativistic Magnetohydrodynamics in Dynamic Spacetimes","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T20:23:27.311851Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2508.18221"},"observation_digest":"sha256:7b5c7ac773cc0983e076ab3c8e7b9360c9a1257eac7386f450f8ebab1465cfff","observation_id":"e3204733-27a3-425a-ace5-15b4671b5ec8","resolution":{"observed_at":"2026-08-05T20:23:27.311851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":"2402.09025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-07-01T22:16:16.844716Z","title":"arXiv preprint arXiv:2402.09025 , year=","venue":null,"work_id":"4f23612a-167d-46cf-9222-949eaae717a4","year":null},"citing_paper":{"arxiv_id":"2602.01997","last_updated":"2026-08-06T07:02:58Z","snapshot_observed_at":"2026-08-08T21:14:58.442403Z","submitted_at":"2026-02-02T11:57:22Z","title":"On the Limits of Layer Pruning for Generative Reasoning in Large Language Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-16T08:40:24.822863Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2602.01997"},"observation_digest":"sha256:8dc5f2f3035b61a228a4224465616e87d2f86436448fc4d1e97243eedd1c45bc","observation_id":"4907db18-a43a-4d6d-bcc8-7e140a468017","resolution":{"observed_at":"2026-05-16T08:40:46.132071Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":"2402.09025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-07-01T22:16:16.844716Z","title":"arXiv preprint arXiv:2402.09025 , year=","venue":null,"work_id":"4f23612a-167d-46cf-9222-949eaae717a4","year":null},"citing_paper":{"arxiv_id":"2605.07271","last_updated":"2026-05-08T05:35:32Z","snapshot_observed_at":"2026-07-06T23:19:41.053744Z","submitted_at":"2026-05-08T05:35:32Z","title":"Understanding Performance Collapse in Layer-Pruned Large Language Models via Decision Representation Transitions","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-11T02:23:52.589354Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2605.07271"},"observation_digest":"sha256:ae3a0ac1fa0dcc58b91f1e341f33e90a690571e466ac0b0d29fcf3c5fe274ca7","observation_id":"038d7afa-0ff8-4214-83fd-66a97b849786","resolution":{"observed_at":"2026-05-11T02:25:53.867897Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":"2402.09025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-07-01T22:16:16.844716Z","title":"arXiv preprint arXiv:2402.09025 , year=","venue":null,"work_id":"4f23612a-167d-46cf-9222-949eaae717a4","year":null},"citing_paper":{"arxiv_id":"2605.14738","last_updated":"2026-06-10T08:53:16Z","snapshot_observed_at":"2026-08-04T03:58:08.508076Z","submitted_at":"2026-05-14T12:01:05Z","title":"TAPIOCA: Why Task- Aware Pruning Improves OOD model Capability","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-05-22T10:09:46.259358Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2605.14738"},"observation_digest":"sha256:19e0e5cf25fa36bb696a23da9b0be31f665bfb20cd94094d41b1e41904b63b9b","observation_id":"79b74e79-8a38-4aae-9d17-4e830e76c8b0","resolution":{"observed_at":"2026-05-22T10:11:23.065258Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":"2402.09025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-07-01T22:16:16.844716Z","title":"arXiv preprint arXiv:2402.09025 , year=","venue":null,"work_id":"4f23612a-167d-46cf-9222-949eaae717a4","year":null},"citing_paper":{"arxiv_id":"2605.16234","last_updated":"2026-05-18T08:12:08Z","snapshot_observed_at":"2026-08-03T20:48:07.293234Z","submitted_at":"2026-05-15T17:43:16Z","title":"No Free Swap: Protocol-Dependent Layer Redundancy in Transformers","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-20T20:29:38.004776Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2605.16234"},"observation_digest":"sha256:0c0f84057622af7c938b8dee5da8572762a621cf393f61c7646c8e5427712c56","observation_id":"4077d087-7a4f-422a-9bb8-e93db051816a","resolution":{"observed_at":"2026-05-20T20:33:43.492621Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","version":6},"cited_work":{"arxiv_id":"2402.09025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09025","snapshot_observed_at":"2026-07-01T22:16:16.844716Z","title":"arXiv preprint arXiv:2402.09025 , year=","venue":null,"work_id":"4f23612a-167d-46cf-9222-949eaae717a4","year":null},"citing_paper":{"arxiv_id":"2606.01666","last_updated":"2026-06-01T04:19:16Z","snapshot_observed_at":"2026-07-06T23:42:12.125247Z","submitted_at":"2026-06-01T04:19:16Z","title":"DOT-MoE: Differentiable Optimal Transport for MoEfication","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-28T15:30:34.142428Z"},"links":{"cited_paper":"/paper/2402.09025","citing_paper":"/paper/2606.01666"},"observation_digest":"sha256:71ab4e290ca8e55a7141a7392ae0a0942af9242164db308465c12dc1424531b3","observation_id":"f066fd47-9d56-42ae-a50b-9c90e16842ba","resolution":{"observed_at":"2026-07-01T22:16:16.846434Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.09025/citation-record","integrity":"/paper/2402.09025/integrity","json":"/paper/2402.09025/citation-record.json","paper":"/paper/2402.09025"},"outbound":[],"paper":{"arxiv_id":"2402.09025","last_updated":"2024-12-13T02:44:34Z","latest_version":6,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T17:29:56.393307Z","submitted_at":"2024-02-14T09:01:13Z","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2402.09025."}