{"as_of":"2026-08-20T01:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b33a63eb4681dadd7c7187fe4d914c16dce02c0426d5e06387784b1c9e5ec8e","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:56:19.032603Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T00:15:00.872479Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1606.09274","last_updated":"2016-06-29T20:36:23Z","snapshot_observed_at":"2026-08-14T21:50:32.846331Z","submitted_at":"2016-06-29T20:36:23Z","title":"Compression of Neural Machine Translation Models via Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.09274","snapshot_observed_at":"2026-08-14T12:56:19.032603Z","title":"See, M.-T","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.06315","last_updated":"2020-08-06T22:10:43Z","snapshot_observed_at":"2026-08-17T18:15:56.012475Z","submitted_at":"2019-08-17T15:36:37Z","title":"Implicit Deep Learning","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T12:56:19.032603Z"},"links":{"cited_paper":"/paper/1606.09274","citing_paper":"/paper/1908.06315"},"observation_digest":"sha256:aa8e51e9594e17fd228832e8b1a3f3b2446e0a478ae3751556625036be18ccba","observation_id":"3a51ec5e-ebf9-45d9-a28d-ab1019eb4ae5","resolution":{"observed_at":"2026-08-14T12:56:19.032603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.09274","last_updated":"2016-06-29T20:36:23Z","snapshot_observed_at":"2026-08-14T21:50:32.846331Z","submitted_at":"2016-06-29T20:36:23Z","title":"Compression of Neural Machine Translation Models via Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.09274","snapshot_observed_at":"2026-08-10T17:30:29.592524Z","title":"Efficient processing of deep neural networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.14823","last_updated":"2025-01-29T13:51:39Z","snapshot_observed_at":"2026-08-19T17:06:38.066904Z","submitted_at":"2025-01-21T15:26:43Z","title":"Quantifying Energy and Cost Benefits of Hybrid Edge Cloud: Analysis of Traditional and Agentic Workloads","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T17:30:29.592524Z"},"links":{"cited_paper":"/paper/1606.09274","citing_paper":"/paper/2501.14823"},"observation_digest":"sha256:5e327a45475c39ba6cbf650bffe9ad2491dbf5415f2e51c2fa9dc32951f9168b","observation_id":"0edde89a-3d42-4a8e-a9a0-a985f170644d","resolution":{"observed_at":"2026-08-10T17:30:29.592524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.09274","last_updated":"2016-06-29T20:36:23Z","snapshot_observed_at":"2026-08-14T21:50:32.846331Z","submitted_at":"2016-06-29T20:36:23Z","title":"Compression of Neural Machine Translation Models via Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.09274","snapshot_observed_at":"2026-08-10T01:13:15.258005Z","title":"See, M.-T","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.18012","last_updated":"2025-07-25T20:18:00Z","snapshot_observed_at":"2026-08-16T10:43:04.671872Z","submitted_at":"2025-01-29T21:56:38Z","title":"Growing Neural Networks: Dynamic Evolution through Gradient Descent","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T01:13:15.258005Z"},"links":{"cited_paper":"/paper/1606.09274","citing_paper":"/paper/2501.18012"},"observation_digest":"sha256:edc684b4282e509c70a6dae99d4c654fbe66eda53d7f65a858eac499d31e7568","observation_id":"ab07f22f-8929-4368-8702-a9837140da90","resolution":{"observed_at":"2026-08-10T01:13:15.258005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.09274","last_updated":"2016-06-29T20:36:23Z","snapshot_observed_at":"2026-08-14T21:50:32.846331Z","submitted_at":"2016-06-29T20:36:23Z","title":"Compression of Neural Machine Translation Models via Pruning","version":1},"cited_work":{"arxiv_id":"1606.09274","doi":"10.1145/3452469","metadata_source":"pith","pith_arxiv_id":"1606.09274","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Compression of Neural Machine Translation Models via Pruning","venue":"cs.AI","work_id":"19b6e06f-7336-4bf6-8aaa-8ab5632bb142","year":2016},"citing_paper":{"arxiv_id":"2510.22767","last_updated":"2026-05-10T13:04:53Z","snapshot_observed_at":"2026-08-11T08:27:09.031111Z","submitted_at":"2025-10-26T17:34:40Z","title":"TELL-TALE: Task Efficient LLMs with Task Aware Layer Elimination","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/1606.09274","citing_paper":"/paper/2510.22767"},"observation_digest":"sha256:4651f680dd14c014ddf9fe6494b86d468587b5d6c2544c11b1498c2db7076da1","observation_id":"620f3a9a-e8a7-4487-8596-2dd3cba85de5","resolution":{"observed_at":"2026-05-18T04:15:51.327259Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.09274","last_updated":"2016-06-29T20:36:23Z","snapshot_observed_at":"2026-08-14T21:50:32.846331Z","submitted_at":"2016-06-29T20:36:23Z","title":"Compression of Neural Machine Translation Models via Pruning","version":1},"cited_work":{"arxiv_id":"1606.09274","doi":"10.1145/3452469","metadata_source":"pith","pith_arxiv_id":"1606.09274","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Compression of Neural Machine Translation Models via Pruning","venue":"cs.AI","work_id":"19b6e06f-7336-4bf6-8aaa-8ab5632bb142","year":2016},"citing_paper":{"arxiv_id":"2605.14738","last_updated":"2026-06-10T08:53:16Z","snapshot_observed_at":"2026-08-12T21:07:08.281089Z","submitted_at":"2026-05-14T12:01:05Z","title":"TAPIOCA: Why Task- Aware Pruning Improves OOD model Capability","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-22T10:09:46.259358Z"},"links":{"cited_paper":"/paper/1606.09274","citing_paper":"/paper/2605.14738"},"observation_digest":"sha256:62aa183e327c18565d7898bf95a075dce218b064d169000a4f1e0c641dc71c73","observation_id":"61dc2da5-a52f-4f05-8315-2305e5a2d0d4","resolution":{"observed_at":"2026-05-22T10:11:23.168880Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.09274","last_updated":"2016-06-29T20:36:23Z","snapshot_observed_at":"2026-08-14T21:50:32.846331Z","submitted_at":"2016-06-29T20:36:23Z","title":"Compression of Neural Machine Translation Models via Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.09274","snapshot_observed_at":"2026-08-01T02:17:12.127232Z","title":"Compression of neural machine translation models via pruning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.25529","last_updated":"2026-07-28T10:14:35Z","snapshot_observed_at":"2026-08-16T03:00:27.761061Z","submitted_at":"2026-07-28T10:14:35Z","title":"Are the High-weight Neurons the Important Ones in Image Classification Neural Networks?","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T02:17:12.127232Z"},"links":{"cited_paper":"/paper/1606.09274","citing_paper":"/paper/2607.25529"},"observation_digest":"sha256:0c8067bfff26e9446f204a5911219685a13d54e53a2ac155933bbee02b188875","observation_id":"7b5f9550-cdda-4a21-8272-6ba26bccbef2","resolution":{"observed_at":"2026-08-01T02:17:12.127232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1606.09274/citation-record","integrity":"/paper/1606.09274/integrity","json":"/paper/1606.09274/citation-record.json","paper":"/paper/1606.09274"},"outbound":[],"paper":{"arxiv_id":"1606.09274","last_updated":"2016-06-29T20:36:23Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T21:50:32.846331Z","submitted_at":"2016-06-29T20:36:23Z","title":"Compression of Neural Machine Translation Models via Pruning"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1606.09274."}