{"as_of":"2026-08-14T20:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7ee238780fee8ee5f6bfed32fbc536d6a7d9b82ee6951023b25bf41192d7a875","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:19:29.096334Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T10:34:07.226471Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.01365","last_updated":"2024-08-11T19:43:36Z","snapshot_observed_at":"2026-08-13T00:39:55.818482Z","submitted_at":"2024-04-01T17:56:06Z","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01365","snapshot_observed_at":"2026-08-10T22:19:29.096334Z","title":"Prompt-prompted mixture of experts for efficient llm generation.arXiv preprint arXiv:2404.01365,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02086","last_updated":"2025-06-02T21:33:43Z","snapshot_observed_at":"2026-08-13T16:31:52.002293Z","submitted_at":"2025-01-03T20:19:14Z","title":"Instruction-Following Pruning for Large Language Models","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:19:29.096334Z"},"links":{"cited_paper":"/paper/2404.01365","citing_paper":"/paper/2501.02086"},"observation_digest":"sha256:a9cfe40c00c24180fe84442309abd875923f67313fbf77cc09fe639fb43b1ee3","observation_id":"6c66b875-2d13-408a-833d-bbbbcfb3d03b","resolution":{"observed_at":"2026-08-10T22:19:29.096334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01365","last_updated":"2024-08-11T19:43:36Z","snapshot_observed_at":"2026-08-13T00:39:55.818482Z","submitted_at":"2024-04-01T17:56:06Z","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01365","snapshot_observed_at":"2026-08-10T21:39:45.766818Z","title":"S1 Machine Learning and statistical classification of CRISPR-Cas12a diagnostic assays Nathan Khosla1#, Jake M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.04413","last_updated":"2025-01-08T10:59:36Z","snapshot_observed_at":"2026-08-13T21:01:43.965012Z","submitted_at":"2025-01-08T10:59:36Z","title":"Machine Learning and statistical classification of CRISPR-Cas12a diagnostic assays","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:39:45.766818Z"},"links":{"cited_paper":"/paper/2404.01365","citing_paper":"/paper/2501.04413"},"observation_digest":"sha256:3f21d7205d1ac2bc880ddf0817877e565ce6d0536972880c47b1f46ea4889a9f","observation_id":"cff3ff74-b5bd-43bc-974c-a6590da3ef47","resolution":{"observed_at":"2026-08-10T21:39:45.766818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01365","last_updated":"2024-08-11T19:43:36Z","snapshot_observed_at":"2026-08-13T00:39:55.818482Z","submitted_at":"2024-04-01T17:56:06Z","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01365","snapshot_observed_at":"2026-08-06T18:17:29.862879Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.14179","last_updated":"2025-07-11T19:07:29Z","snapshot_observed_at":"2026-08-14T20:04:36.309382Z","submitted_at":"2025-07-11T19:07:29Z","title":"A Sparsity Predicting Approach for Large Language Models via Activation Pattern Clustering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:17:29.862879Z"},"links":{"cited_paper":"/paper/2404.01365","citing_paper":"/paper/2507.14179"},"observation_digest":"sha256:d7cbb6bf5d6f8887b7275b782af4b595592c8ab143555adad7e89993f8d6ebb6","observation_id":"9b133cfa-df0e-4ec1-ba82-26bf5538d5ac","resolution":{"observed_at":"2026-08-06T18:17:29.862879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01365","last_updated":"2024-08-11T19:43:36Z","snapshot_observed_at":"2026-08-13T00:39:55.818482Z","submitted_at":"2024-04-01T17:56:06Z","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation","version":3},"cited_work":{"arxiv_id":"2404.01365","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.01365","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prompt-prompted adaptive structured pruning for efficient llm generation","venue":null,"work_id":"7d1acd2e-a59c-4676-a4b3-751cdb9d2a07","year":2024},"citing_paper":{"arxiv_id":"2603.16284","last_updated":"2026-05-19T06:59:25Z","snapshot_observed_at":"2026-08-02T16:28:10.304219Z","submitted_at":"2026-03-17T09:16:50Z","title":"Locate-then-Sparsify: Attribution Guided Sparse Strategy for Visual Hallucination Mitigation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T10:32:41.447253Z"},"links":{"cited_paper":"/paper/2404.01365","citing_paper":"/paper/2603.16284"},"observation_digest":"sha256:7df6f5c80638f08649f022c1eeb2bbce98949b427acdfb8dc76f43ce8470440c","observation_id":"c1124b42-480f-4e7b-8827-72984b145f27","resolution":{"observed_at":"2026-05-21T10:34:07.228297Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.01365/citation-record","integrity":"/paper/2404.01365/integrity","json":"/paper/2404.01365/citation-record.json","paper":"/paper/2404.01365"},"outbound":[],"paper":{"arxiv_id":"2404.01365","last_updated":"2024-08-11T19:43:36Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T00:39:55.818482Z","submitted_at":"2024-04-01T17:56:06Z","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2404.01365."}