{"as_of":"2026-08-18T17:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f73cb514666a227bd215fc0b068d5d6a91d99b7e20d791061a9141eb3430f40","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:21:05.137400Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:20:35.301750Z","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-01T21:16:13.472439Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.05521","snapshot_observed_at":"2026-08-05T23:20:35.301750Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.05511","last_updated":"2025-08-07T15:46:38Z","snapshot_observed_at":"2026-08-13T19:18:58.247067Z","submitted_at":"2025-08-07T15:46:38Z","title":"Adaptive Parallel Downloader for Large Genomic Datasets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T23:20:35.301750Z"},"links":{"cited_paper":"/paper/2508.05521","citing_paper":"/paper/2508.05511"},"observation_digest":"sha256:fb974ad629f0582dfdea3a0f6c68ac8ff5b7b4c43897ae50fd9a075ec46e62c3","observation_id":"a7ae27e2-0a2e-4ea0-855f-ce6401300412","resolution":{"observed_at":"2026-08-05T23:20:35.301750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"cited_work":{"arxiv_id":"2508.05521","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.05521","snapshot_observed_at":"2026-07-01T21:16:13.472439Z","title":"Optimal brain connection: Towards efficient structural pruning.arXiv preprint arXiv:2508.05521, 2025","venue":null,"work_id":"ec084e6a-b967-4ee9-8f9a-647317a02bce","year":2025},"citing_paper":{"arxiv_id":"2606.01126","last_updated":"2026-05-31T09:59:08Z","snapshot_observed_at":"2026-08-06T06:51:44.742513Z","submitted_at":"2026-05-31T09:59:08Z","title":"STARFISH: faST Accuracy Recovery in pruned networks From Internal State Healing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T17:25:33.595730Z"},"links":{"cited_paper":"/paper/2508.05521","citing_paper":"/paper/2606.01126"},"observation_digest":"sha256:fbcb119cc4b08c7f55234299d533bf8bc87a9344bd67bd24b507b3df714f5d0a","observation_id":"93c668b1-0e5c-47c4-bc8d-1c8c9253ac5d","resolution":{"observed_at":"2026-07-01T21:16:13.474159Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.05521","snapshot_observed_at":"2026-08-01T17:41:43.172076Z","title":"arXiv preprint arXiv:2508.05521 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17568","last_updated":"2026-07-20T05:27:57Z","snapshot_observed_at":"2026-08-06T15:16:32.473439Z","submitted_at":"2026-07-20T05:27:57Z","title":"CoCurve: Cross-Module Co-Pruning Curvature for Training-Free Structured LLM Pruning","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T17:41:43.172076Z"},"links":{"cited_paper":"/paper/2508.05521","citing_paper":"/paper/2607.17568"},"observation_digest":"sha256:fc02a5dc6f15240a797515ad7ec46a90aa1e74ecea81dcbb8ee4fdd8cec27438","observation_id":"9f5bcfc5-a5df-4338-8f7f-cf039e3719ae","resolution":{"observed_at":"2026-08-01T17:41:43.172076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.05521/citation-record","integrity":"/paper/2508.05521/integrity","json":"/paper/2508.05521/citation-record.json","paper":"/paper/2508.05521"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.02328","last_updated":"2024-12-03T09:42:16Z","snapshot_observed_at":"2026-08-15T00:50:40.237475Z","submitted_at":"2024-12-03T09:42:16Z","title":"Efficient Model Compression Techniques with FishLeg","version":1},"cited_work":{"arxiv_id":"2412.02328","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.02328","snapshot_observed_at":"2026-08-05T23:21:05.175013Z","title":"Efficient Model Compression Techniques with FishLeg","venue":"cs.LG","work_id":"6f827641-d174-4bd2-affc-024cb8fdc7a3","year":2024},"citing_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T23:21:05.126260Z"},"links":{"cited_paper":"/paper/2412.02328","citing_paper":"/paper/2508.05521"},"observation_digest":"sha256:e3069c4d8d0170582e198480d1ed152d29fa66b6953b6f2e4add320ce688bf07","observation_id":"57db514d-9935-4616-9fe4-7a4458b388ab","resolution":{"observed_at":"2026-08-05T23:21:05.181004Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T23:21:05.203482Z","title":"In International Conference on Learn- ing Representations (ICLR)","venue":null,"work_id":"72c37929-3540-426f-b588-735e284a54aa","year":null},"citing_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T23:21:05.134060Z"},"links":{"citing_paper":"/paper/2508.05521"},"observation_digest":"sha256:40a8489137486963785ca44a986cf7c6a42a74f3d03c23222f06293a634e55ae","observation_id":"3b103578-7827-48a6-8bfa-0da939c5b09b","resolution":{"observed_at":"2026-08-05T23:21:05.207309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T23:21:05.225977Z","title":"In Interna- tional Conference on Learning Representations (ICLR)","venue":null,"work_id":"c24ceeec-4a86-4ca0-b4c0-040b70ad687e","year":2025},"citing_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T23:21:05.121112Z"},"links":{"citing_paper":"/paper/2508.05521"},"observation_digest":"sha256:a8fb44b35aa586dadabc370ba91d70ce459c461568a6b594cc2876eccb653ea1","observation_id":"c7eed9fa-63ba-4dc1-9b60-0b008f7cad8c","resolution":{"observed_at":"2026-08-05T23:21:05.229516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T23:21:05.213902Z","title":"In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 11264–11272","venue":null,"work_id":"0bbe4811-17f5-4c4f-b00d-738e6ccbd236","year":null},"citing_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T23:21:05.130270Z"},"links":{"citing_paper":"/paper/2508.05521"},"observation_digest":"sha256:ddf645a7fa1b3cb692c9cc3f29fd6546ea08d536295b346b3ab1d2d9dc3b07e7","observation_id":"eecc48b6-65a1-4bca-a5bd-1f63bee20439","resolution":{"observed_at":"2026-08-05T23:21:05.218565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.18091","last_updated":"2026-04-19T16:09:21Z","snapshot_observed_at":"2026-08-02T15:09:56.262134Z","submitted_at":"2024-12-24T02:05:51Z","title":"AutoSculpt: A Pattern-based Model Auto-pruning Framework Using Reinforcement Learning and Graph Learning","version":3},"cited_work":{"arxiv_id":"2412.18091","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.18091","snapshot_observed_at":"2026-08-05T23:21:05.192277Z","title":"AutoSculpt: A Pattern-based Model Auto-pruning Framework Using Reinforcement Learning and Graph Learning","venue":"cs.AI","work_id":"117c4207-8c2b-4132-859e-b603d6a31b39","year":2024},"citing_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T23:21:05.117122Z"},"links":{"cited_paper":"/paper/2412.18091","citing_paper":"/paper/2508.05521"},"observation_digest":"sha256:1c1f55d6f101a4d54813cec6ddc3a1ab1dab270a2d49ae32717727faa8fb04bd","observation_id":"2b0d9e98-3401-4c7d-9e52-0c0bddc13c94","resolution":{"observed_at":"2026-08-05T23:21:05.196468Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.04570","last_updated":"2022-03-09T08:15:14Z","snapshot_observed_at":"2026-08-16T17:15:57.043690Z","submitted_at":"2022-03-09T08:15:14Z","title":"CP-ViT: Cascade Vision Transformer Pruning via Progressive Sparsity Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.04570","snapshot_observed_at":"2026-08-05T23:21:05.137400Z","title":"Conv-BN-CCC-New BN-ReLU-DDD-Conv/Classifier","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T23:21:05.137400Z"},"links":{"cited_paper":"/paper/2203.04570","citing_paper":"/paper/2508.05521"},"observation_digest":"sha256:c4c173a0d8bba3df93f561c268de57c8731409f897a34dfb976c7dc035ca341e","observation_id":"a7005d2b-a469-4688-ae5d-4e9874fbe105","resolution":{"observed_at":"2026-08-05T23:21:05.137400Z","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-05T23:21:05.236497Z","title":"In Proceedings of the IEEE/CVF Confer- ence on Computer Vision and Pattern Recognition (CVPR), 3666–3675","venue":null,"work_id":"6c508471-587c-44ee-a607-40733324ef11","year":2015},"citing_paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T23:21:05.111917Z"},"links":{"citing_paper":"/paper/2508.05521"},"observation_digest":"sha256:1576439d7b6d9a737d5646685f1e57f62855535ab5406125388f9a3c344c9a79","observation_id":"324cb08c-bb94-4c12-9c86-bc032e6082e2","resolution":{"observed_at":"2026-08-05T23:21:05.240145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.05521","last_updated":"2025-08-07T15:51:05Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T19:54:37.477471Z","submitted_at":"2025-08-07T15:51:05Z","title":"Optimal Brain Connection: Towards Efficient Structural Pruning"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":4},"total_outbound_references":7},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 7 of 7 outbound references and 3 inbound Pith citation observations for arXiv:2508.05521."}