{"as_of":"2026-08-05T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d65bc04519e3021ee6b4c72d77cde34ce5b452a0added5b95cc74b4fb4178162","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T02:00:55.378631Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.03794","last_updated":"2025-04-04T03:42:34Z","snapshot_observed_at":"2026-07-06T21:04:33.350927Z","submitted_at":"2025-04-04T03:42:34Z","title":"Entropy-Based Block Pruning for Efficient Large Language Models","version":1},"cited_work":{"arxiv_id":"2504.03794","doi":"10.48550/arxiv.2504.03794","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.03794","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ArXiv.org","work_id":"1bdc013e-4eb2-4871-b825-7aebd8629ab0","year":2025},"citing_paper":{"arxiv_id":"2604.19520","last_updated":"2026-04-21T14:43:21Z","snapshot_observed_at":"2026-07-29T20:23:23.587173Z","submitted_at":"2026-04-21T14:43:21Z","title":"SimDiff: Depth Pruning via Similarity and Difference","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T02:00:55.378631Z"},"links":{"cited_paper":"/paper/2504.03794","citing_paper":"/paper/2604.19520"},"observation_digest":"sha256:80f1e3d96781cc245c46cf6c0537b0ad2662d3e7ad4ab1f6b0f3fc3506c8873b","observation_id":"37895733-26a7-4e85-be75-ddf5f9e09a69","resolution":{"observed_at":"2026-05-10T02:01:28.590903Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.03794/citation-record","integrity":"/paper/2504.03794/integrity","json":"/paper/2504.03794/citation-record.json","paper":"/paper/2504.03794"},"outbound":[],"paper":{"arxiv_id":"2504.03794","last_updated":"2025-04-04T03:42:34Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T21:04:33.350927Z","submitted_at":"2025-04-04T03:42:34Z","title":"Entropy-Based Block Pruning for Efficient Large Language Models"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2504.03794."}