{"as_of":"2026-08-11T10:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f78511f374be4f1ba1fa8aad1faab686cccbc7de7b6d003d462ca0ee20176610","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:08:24.661127Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.11469/citation-record","integrity":"/paper/2506.11469/integrity","json":"/paper/2506.11469/citation-record.json","paper":"/paper/2506.11469"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:08:20.732806Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:20.732806Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:3f6e92f4aad53cb5f40e709da13d2076576ccd77c0ac63cdedef9588e54e4566","observation_id":"a24cdab1-b5d1-42bf-b246-6932cbdc5389","resolution":{"observed_at":"2026-08-07T04:08:20.732806Z","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-07T04:08:31.820946Z","title":"Spiking-yolo: spiking neural network for energy-efficient object detection","venue":null,"work_id":"812b1b0e-3049-45b9-a510-cace6b0ac01b","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:20.787943Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:f20aa5521a388707a939c6bd623f207a5dda1af1a405f19fdaa01b85f434379e","observation_id":"28427626-e53c-4460-99b3-5f1f6fcbfc6e","resolution":{"observed_at":"2026-08-07T04:08:31.966553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:31.515476Z","title":"Scribblesup: Scribble-supervised convolutional networks for semantic segmentation","venue":null,"work_id":"2ba19f57-678c-4b5e-9d97-2fa7f804da61","year":2016},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:20.852828Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:b5080479a6819fbfd27c138892dcc9d5d6a1b4a73f6b856f08280c82d34bdffe","observation_id":"36e63581-1198-447d-ae51-1b90bb4c4850","resolution":{"observed_at":"2026-08-07T04:08:31.643777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:31.262077Z","title":"Structadmm: Achieving ultrahigh efficiency in structured pruning for dnns.IEEE transactions on neural networks and learning systems, 33(5):2259–2273, 2021","venue":null,"work_id":"8ba08f85-751c-4ef4-b5a2-7855d3b4bb68","year":2021},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:20.953393Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:42da01d86f9836e582d51f18df18a758a9db2a2299f1fd8719a3da8825b2a6fd","observation_id":"142aa8b4-9b3b-4952-b1fc-41e8eb9f4f47","resolution":{"observed_at":"2026-08-07T04:08:31.406388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:30.941269Z","title":"Convolutional neural network pruning with structural redundancy reduction","venue":null,"work_id":"ea915c45-bbd2-4921-800d-9b9aa35f67db","year":2021},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.060517Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:7ca8c35e0b12badb817cadd641d03593c315b47e911dd1658e27f1bcaf421759","observation_id":"e6a04cda-4f3c-42db-9826-3129f6c5392a","resolution":{"observed_at":"2026-08-07T04:08:31.052639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.14356","last_updated":"2020-11-29T12:51:16Z","snapshot_observed_at":"2026-08-11T03:16:15.726855Z","submitted_at":"2020-11-29T12:51:16Z","title":"Layer Pruning via Fusible Residual Convolutional Block for Deep Neural Networks","version":1},"cited_work":{"arxiv_id":"2011.14356","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.14356","snapshot_observed_at":"2026-08-07T04:08:25.163129Z","title":"Layer Pruning via Fusible Residual Convolutional Block for Deep Neural Networks","venue":"cs.CV","work_id":"817e259a-727f-4c7d-8876-e54d17fa97fe","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.150045Z"},"links":{"cited_paper":"/paper/2011.14356","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:5de0d68cb944d401615d7aafa25da42be5b6159ceb6de4f9231839c5abdeac9b","observation_id":"5af732c4-0d0f-45ad-b6b2-3cf6bee67a00","resolution":{"observed_at":"2026-08-07T04:08:25.222385Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:30.668546Z","title":"Autocompress: An automatic dnn structured pruning framework for ultra-high compression rates","venue":null,"work_id":"fcbfe529-6bfa-4087-8399-c234ac3514e1","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.250947Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:5f7947ad2cac260935d98db8376574020f8135745d85cc473a68b914ae218f98","observation_id":"00d4f95f-d745-4379-b6ef-a33a36338cae","resolution":{"observed_at":"2026-08-07T04:08:30.798205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:30.417959Z","title":"Hawq: Hessian aware quantization of neural networks with mixed-precision","venue":null,"work_id":"40d9bbc2-c8ca-4e6f-96d4-4ff25c1fa3b6","year":2019},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.372170Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:1e504e377219d1cc1c24ae2f376206dd68a0bb54d212cde19709f5933ff41b3d","observation_id":"a7b9e681-c66c-4d1b-b119-3a7a6e3e96fe","resolution":{"observed_at":"2026-08-07T04:08:30.545904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:30.122379Z","title":"Emq: Evolving training-free proxies for automated mixed precision quantization","venue":null,"work_id":"97bff52f-c943-41e8-a88e-8e30d1d160ac","year":2023},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.479450Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:cdf60aee7c054dc2335b84818e1ee82bce92ea77c5eeeab08827ded2b9e19886","observation_id":"db61e060-1886-45c7-9430-0373289c97be","resolution":{"observed_at":"2026-08-07T04:08:30.244892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:29.843218Z","title":"Towards unified int8 training for convolutional neural network","venue":null,"work_id":"370a0010-7561-4ba7-bf01-7877c461b207","year":1969},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.553022Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:6315727c95ff5160a0e1a7062154aa8cbfe391a60ad68c3fb2009bb8b27df1ef","observation_id":"25a3e048-d2a6-4127-aed6-aa4620e3df89","resolution":{"observed_at":"2026-08-07T04:08:29.960623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:29.625476Z","title":"Haq: Hardware-aware automated quantization with mixed precision","venue":null,"work_id":"0225196b-c211-479a-8975-f9488c2d7809","year":2019},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.656720Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:bc5763484d9e295944303e7e08260eea3505310219d165c9583567f2751ceaae","observation_id":"4d852df5-85b1-47a6-97ed-2bb888a4e506","resolution":{"observed_at":"2026-08-07T04:08:29.731091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:29.373484Z","title":"Teachers do more than teach: Compressing image-to-image models","venue":null,"work_id":"62ff4c9b-d697-40fb-9ba3-e0e63cb038d5","year":2021},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.721744Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:d0b882ed0b4a1e093276e4006a8a67538798dd08cc51b768f2dcbcccf03094a9","observation_id":"51fbffa3-9255-4305-b39e-246d57d39295","resolution":{"observed_at":"2026-08-07T04:08:29.471080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:29.121176Z","title":"Relational knowledge distillation","venue":null,"work_id":"6c5ddf64-3c00-49f9-897c-7fcb7be9b5b9","year":2019},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.827916Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:282edca8ed48e71756c30cdfd490afdd5f73ccdfd50f860797e58332663e161c","observation_id":"3b2ce4cf-0164-487f-b0bd-187b18cb4971","resolution":{"observed_at":"2026-08-07T04:08:29.177324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:28.871917Z","title":"Knowledge distillation: A survey.Interna- tional journal of computer vision, 129(6):1789–1819, 2021","venue":null,"work_id":"87b080e4-7a91-4dab-9ae7-13699bc7086b","year":2021},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.911382Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:ec5a4c482d13e1a86bea6f5afdb37a426dbd638665f55c0da957b2d69ddc8863","observation_id":"fba49aa4-6d60-4a6f-b765-283b1c382643","resolution":{"observed_at":"2026-08-07T04:08:28.968597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:28.631433Z","title":"Channel pruning for accelerating very deep neural networks","venue":null,"work_id":"fa07d8d3-b18d-4796-b30b-8d2ea4801f83","year":2017},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:21.982528Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:8fb4c00b2cb89cb8d5899efa8aa4386f70c1737df41ef8f4d6870a8bd57e1adf","observation_id":"6fac9336-fe9e-4d8f-bb08-8c6a0f5b2af8","resolution":{"observed_at":"2026-08-07T04:08:28.726703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:28.420295Z","title":"Thinet: A filter level pruning method for deep neural network compression","venue":null,"work_id":"bf654d32-ef2b-4f65-a215-3bdfe588c9f4","year":2017},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.050594Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:1edb8cc6dd16fe6520fef9205be1592ce6148f225f614b61d394ced1271bcb8d","observation_id":"21b0c78f-fe0c-4a67-9814-99c312f6512c","resolution":{"observed_at":"2026-08-07T04:08:28.537986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08565","last_updated":"2020-06-29T01:52:28Z","snapshot_observed_at":"2026-08-04T14:16:18.844734Z","submitted_at":"2020-01-23T14:51:19Z","title":"Channel Pruning via Automatic Structure Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08565","snapshot_observed_at":"2026-08-07T04:08:22.127259Z","title":"Channel pruning via automatic structure search.ArXiv preprint arXiv:2001.08565, 2020","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.127259Z"},"links":{"cited_paper":"/paper/2001.08565","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:eb0ba6dea0d15b776e81e9b1878278b4afad27e1450e3c7abe7ff6835c2a2ed0","observation_id":"51410e21-9bb7-490b-8c8d-f5e2cf3e8853","resolution":{"observed_at":"2026-08-07T04:08:22.127259Z","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-07T04:08:28.164914Z","title":"Amc: Automl for model compression and acceleration on mobile devices","venue":null,"work_id":"c266061e-9bb1-4c47-be8e-01cdc6a4e8ae","year":2018},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.191211Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:1b21db47240cfa140fef60ebd470e020618aa50925b0fb537ee333e99cb867a1","observation_id":"2f04d9ad-7f24-48f3-86e9-fb3f64af5d60","resolution":{"observed_at":"2026-08-07T04:08:28.309218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:27.909235Z","title":"Filter pruning via automatic pruning rate search","venue":null,"work_id":"8233b4b8-5fae-4d75-8a46-b43b55ac2991","year":2022},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.257276Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:76fafbcbf829f13c2f3e7ecff149b938360d7607ec4cc7c23a3666cd2a6c5fd4","observation_id":"93367e43-c46b-4403-a06c-0d783ff25a80","resolution":{"observed_at":"2026-08-07T04:08:28.042460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:08:22.481427Z","title":"Shufflenet: An extremely efficient convolutional neural network for mobile devices","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.481427Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:e9cfb2d9c4e8d4036d374d106b881943f70e0ea202b711c0521dc285782a7634","observation_id":"aace709f-2a31-4de8-9f63-5bc0e0c8a9f9","resolution":{"observed_at":"2026-08-07T04:08:22.481427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04861","last_updated":"2017-04-17T03:57:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-04-17T03:57:34Z","title":"MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04861","snapshot_observed_at":"2026-08-07T04:08:22.609705Z","title":"Mobilenets: Efficient convolutional neural networks for mobile vision applications","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.609705Z"},"links":{"cited_paper":"/paper/1704.04861","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:dd276d2513d4413b93244e5c5b62f8596d9f058ce9c848a931258907a3406b2a","observation_id":"16ea976e-d288-4f61-8823-4f26dff5031f","resolution":{"observed_at":"2026-08-07T04:08:22.609705Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:08:22.681304Z","title":"Mobilenetv2: Inverted residuals and linear bottlenecks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.681304Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:de40c2bdb86d2d362e0eafcf7e2b0c6559a02a1ead1bd0e9ce6611888f459cc6","observation_id":"a5ce5c5a-8aef-4181-916b-3d5060e57aa8","resolution":{"observed_at":"2026-08-07T04:08:22.681304Z","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-07T04:08:27.497660Z","title":"Q-bert: Hessian based ultra low precision quantization of bert","venue":null,"work_id":"9a475245-2469-40c5-8fef-8563e03ed784","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.744343Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:ad42350ce8fb00fc6cdfd9b208851f3c137e932c98d104d03143c627b8946ac2","observation_id":"daf6c1f3-b2b3-4249-a471-ff47f0dd77f8","resolution":{"observed_at":"2026-08-07T04:08:27.660888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:27.232029Z","title":"Post-training quantization for vision transformer.Advances in neural information processing systems, 34:28092–28103, 2021","venue":null,"work_id":"9fb5882e-8bf0-462e-a6c8-35636913e952","year":2021},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.823172Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:857e7c87c646f311cfa9d15b8a197bde9db1a42508bbf0e5569eccc483a0bbad","observation_id":"8d476a7e-ab72-404a-b082-25f3b8974d35","resolution":{"observed_at":"2026-08-07T04:08:27.356088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:26.969853Z","title":"Zeroq: A novel zero shot quantization framework","venue":null,"work_id":"724672af-a235-405e-9ada-9832b3b43319","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:22.959374Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:1f585c07ba3161946753828be6f0769e5f74fd51925a52f8e718d85cb82d5136","observation_id":"537139c8-8972-41fe-a937-352b0bd4de9d","resolution":{"observed_at":"2026-08-07T04:08:27.107060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-07T04:08:23.121370Z","title":"Distilling the knowledge in a neural network.ArXiv preprint arXiv:1503.02531, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.121370Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:e490747a6c4eaa19759e6734d8ce65a79c4168daa6306b19aac181087d589c1f","observation_id":"d80d2657-2d6f-472c-ad31-d7fd496e0a08","resolution":{"observed_at":"2026-08-07T04:08:23.121370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.14167","last_updated":"2020-09-29T17:31:43Z","snapshot_observed_at":"2026-08-05T01:19:08.965424Z","submitted_at":"2020-09-29T17:31:43Z","title":"Contrastive Distillation on Intermediate Representations for Language Model Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.14167","snapshot_observed_at":"2026-08-07T04:08:23.312211Z","title":"Contrastive distillation on intermediate representations for language model compression.ArXiv preprint arXiv:2009.14167, 2020","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.312211Z"},"links":{"cited_paper":"/paper/2009.14167","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:ab9524327d8492a33c6964866b50804c634ac35c993350e8bc71648e2d361273","observation_id":"de03154e-e727-4d30-ab35-86d4ec0ff252","resolution":{"observed_at":"2026-08-07T04:08:23.312211Z","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-07T04:08:26.732332Z","title":"Class attention transfer based knowledge distillation","venue":null,"work_id":"c0d9b917-3857-4128-bb80-638dbd81f95e","year":2023},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.444790Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:9affe6863c1804ed2f4f0c7d2341a8966607913e292d678fa54957d4445dde83","observation_id":"22a193e8-582a-4cf6-a482-c07bc1dc3252","resolution":{"observed_at":"2026-08-07T04:08:26.857111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:26.571246Z","title":"Exploiting linear structure within convolutional networks for efficient evaluation.Advances in neural information processing systems, 27, 2014","venue":null,"work_id":"ce476513-62aa-4965-b922-2140bf9d9ad9","year":2014},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.530825Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:89b72b5c3b08d732f425faa2bef20bf478f4738e9d09f2778bbac0a0ae9fb20b","observation_id":"c5fa0439-b385-4f21-b844-e6742715db73","resolution":{"observed_at":"2026-08-07T04:08:26.651700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.3866","last_updated":"2014-05-15T14:41:06Z","snapshot_observed_at":"2026-08-02T11:57:23.843985Z","submitted_at":"2014-05-15T14:41:06Z","title":"Speeding up Convolutional Neural Networks with Low Rank Expansions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.3866","snapshot_observed_at":"2026-08-07T04:08:23.609274Z","title":"Speeding up convolutional neural networks with low rank expansions.ArXiv preprint arXiv:1405.3866, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.609274Z"},"links":{"cited_paper":"/paper/1405.3866","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:0c676f1d9ac26aaf3bbd38b72eed1de4ac63d11b956745f9f5e9c489114739ab","observation_id":"c48aa84c-725a-4492-ae1a-694c00d81eaa","resolution":{"observed_at":"2026-08-07T04:08:23.609274Z","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-07T04:08:26.467960Z","title":"Low-rank matrix factorization for deep neural network training with high-dimensional output targets","venue":null,"work_id":"b93c04ef-3b01-4f72-95e5-fbb081ef82f3","year":2013},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.659736Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:0aeaeca21b584224b32d9fbfd75d611e52a5e303982afc3e73c6a560621da21d","observation_id":"7d567ed1-bebf-4d85-9d3c-f7077e6b0282","resolution":{"observed_at":"2026-08-07T04:08:26.524466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:26.356356Z","title":"Pruning filters for efficient convnets","venue":null,"work_id":"2f4c2627-cfcf-4402-b919-d27bfa5e4dbf","year":2016},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.718032Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:c86158a39de6bf2db3676a913e9c183bb6c68ba3c5c1cb5a9e3f27d8ac5f124d","observation_id":"0dd190ba-03c3-4ad7-a8e6-2a2fd6285069","resolution":{"observed_at":"2026-08-07T04:08:26.398868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:26.262902Z","title":"Hrank: Filter pruning using high-rank feature map","venue":null,"work_id":"89e1d0e3-16d1-4726-8ad6-73a6d1f4af80","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.774050Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:08517939f5d4cc6f160000615d9c0c3df9e0006101cd0885050b85676dc27d9e","observation_id":"fd3c3310-7379-4af1-a136-d45904e0f7ea","resolution":{"observed_at":"2026-08-07T04:08:26.301799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:26.175829Z","title":"Learning efficient convolutional networks through network slimming","venue":null,"work_id":"7a4a5df0-63e1-4faf-bd9c-658ab06c4864","year":2017},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.818271Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:c1e447f1a9579cdbd0ab24496fc0fdd47a92a0e2b813018ab4c68a81d498283e","observation_id":"d50d9810-d226-44bb-9365-8b5c8fed137e","resolution":{"observed_at":"2026-08-07T04:08:26.204090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:26.128715Z","title":"Metaprun- ing: Meta learning for automatic neural network channel pruning","venue":null,"work_id":"e942ac24-b8fe-46bf-8512-2898d0362ecc","year":2019},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.857463Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:e22c75cf13a51c471de31708b0640ee54ab5cf73cc15a42aba31dfbb02880d27","observation_id":"0347cd0a-8e14-4710-ba2b-c837110c8e77","resolution":{"observed_at":"2026-08-07T04:08:26.143530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:26.009852Z","title":"Auto graph encoder-decoder for neural network pruning","venue":null,"work_id":"ec7b0622-8fbd-4b11-9691-f10f2f646f0b","year":2021},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.929163Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:861812c424ac558fad29146fe1269b958d53a34f659c1dfb692e01c760344a6c","observation_id":"f1648fb9-3c08-489d-948c-03fa9a2e73b7","resolution":{"observed_at":"2026-08-07T04:08:26.101986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:25.884822Z","title":"Automatic network pruning via hilbert-schmidt independence criterion lasso under information bottleneck principle","venue":null,"work_id":"89d34c8c-c130-49e8-973e-98c7059d4b05","year":2023},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:23.989661Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:d42eae50fea8921d18311559585070d62dad93a35d3e7ae83f2e77a1e1c1a0b8","observation_id":"67d3db66-2ac1-4aca-a89e-3e13e2bd8322","resolution":{"observed_at":"2026-08-07T04:08:25.934861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-07T04:08:24.055004Z","title":"Semi-supervised classification with graph convolutional networks.ArXiv preprint arXiv:1609.02907, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.055004Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:fae641be116758b932aec250083e49a3b6f6773a493e9501d4da088de732ab25","observation_id":"411807dd-0f29-40ce-8b05-aa47fb1f83fd","resolution":{"observed_at":"2026-08-07T04:08:24.055004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-07T04:08:24.160079Z","title":"Graph attention networks.ArXiv preprint arXiv:1710.10903, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.160079Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:bcd2027ad6b07fc588267067a8cd050ab5e9eea84f64ce473da19b57a644c867","observation_id":"241f12e3-494e-408e-8bab-4d58eb059c39","resolution":{"observed_at":"2026-08-07T04:08:24.160079Z","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-07T04:08:25.755217Z","title":"Graph structure of neural networks","venue":null,"work_id":"44e1c59b-d612-4d94-8b29-67b1bbc28141","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.230220Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:7a74643baa97515fbec8092d856d52c3c15c2173e5730be28e9d60b39fdb1a15","observation_id":"eaff2616-1cfe-41bc-b129-f607972fba73","resolution":{"observed_at":"2026-08-07T04:08:25.822856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.00332","last_updated":"2019-02-23T01:36:47Z","snapshot_observed_at":"2026-08-10T08:54:59.663457Z","submitted_at":"2018-12-02T05:29:53Z","title":"ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardware","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.00332","snapshot_observed_at":"2026-08-07T04:08:24.275727Z","title":"Proxylessnas: Direct neural architecture search on target task and hardware","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.275727Z"},"links":{"cited_paper":"/paper/1812.00332","citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:fa385c0224eb4840ad1394e4767b00baa4d3057ebbb5a19f16f815caa873940d","observation_id":"9113b8fb-26f0-4af0-a911-c08688e245ec","resolution":{"observed_at":"2026-08-07T04:08:24.275727Z","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-07T04:08:25.652246Z","title":"Progressive neural architecture search","venue":null,"work_id":"99364b58-dd3e-41ed-acc5-91043b44560f","year":2018},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.373624Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:200ec1c22f50f350c09a9452a3ca2536626756b8fcf18280964189e6fca62c4f","observation_id":"31092b71-827b-4f06-8c35-1a4827d457ca","resolution":{"observed_at":"2026-08-07T04:08:25.676837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:08:24.455375Z","title":"Automl: A survey of the state-of-the-art.Knowledge-based systems, 212:106622, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.455375Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:451d09dc964b30d5143f34732ebb1515a10caaf30e3551f671d7dcd261eaf8c9","observation_id":"e9a5e615-fb44-4b96-9b7d-7babe3a3bdc2","resolution":{"observed_at":"2026-08-07T04:08:24.455375Z","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-07T04:08:25.513172Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":"814ea579-8083-4d5a-ba7b-550d5954ef79","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.542323Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:62a2e3bcea9dddd59aa41b8a14cab894141c1ffcbd32b801adbdf6b17afc2ad8","observation_id":"37c116b6-1538-461c-a479-518cc05a6808","resolution":{"observed_at":"2026-08-07T04:08:25.567173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:25.398996Z","title":"Momentum contrast for unsupervised visual representation learning","venue":null,"work_id":"91700b95-f7c8-4ac1-aa1c-ff4168c45749","year":2020},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.593112Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:90ad759c5003c9d56b6839b3cc4e2a748a817de4510353da36feaf402f216707","observation_id":"100400db-b84a-40c4-9134-5226b707a8ee","resolution":{"observed_at":"2026-08-07T04:08:25.477535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T04:08:25.296016Z","title":"Inductive representation learning on large graphs.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":"5956e8a2-0778-4820-b470-9ac628afb4af","year":2017},"citing_paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:08:24.661127Z"},"links":{"citing_paper":"/paper/2506.11469"},"observation_digest":"sha256:96af327e599f07d169a0c6f89d39a6fa401acda3ca6482a3a5f839c67cbf6e9b","observation_id":"8efd827c-6ab4-409c-8b57-ae6cb026045d","resolution":{"observed_at":"2026-08-07T04:08:25.337248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.11469","last_updated":"2025-06-13T05:05:35Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-10T07:23:53.762890Z","submitted_at":"2025-06-13T05:05:35Z","title":"Structure-Aware Automatic Channel Pruning by Searching with Graph Embedding"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":33},"total_outbound_references":46},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2506.11469."}