{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ETGS5G5BQ336Y5A6OGUPMVTPKX","short_pith_number":"pith:ETGS5G5B","schema_version":"1.0","canonical_sha256":"24cd2e9ba186f7ec741e71a8f6566f55e2ddd1e7ef87f382f1e7fc30bb350d2c","source":{"kind":"arxiv","id":"1810.07610","version":3},"attestation_state":"computed","paper":{"title":"Pruning Deep Neural Networks using Partial Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Artur Jordao, Fernando Yamada, Ricardo Kloss, William Robson Schwartz","submitted_at":"2018-10-17T15:24:21Z","abstract_excerpt":"Modern pattern recognition methods are based on convolutional networks since they are able to learn complex patterns that benefit the classification. However, convolutional networks are computationally expensive and require a considerable amount of memory, which limits their deployment on low-power and resource-constrained systems. To handle these problems, recent approaches have proposed pruning strategies that find and remove unimportant neurons (i.e., filters) in these networks. Despite achieving remarkable results, existing pruning approaches are ineffective since the accuracy of the origi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.07610","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-17T15:24:21Z","cross_cats_sorted":[],"title_canon_sha256":"6f127c643a4929a03299ccff43b7159af17fc2f54148876e42a4d5115c8d4986","abstract_canon_sha256":"56dc1c0fdc2afae336e691ba6d2d50be8834d0c600554740c09932a95eebd31d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:05:44.408188Z","signature_b64":"qLSw+6+qYq5SA1FU9U/Z/y1p0T2MLJchzcfsRNRVXmU3iVbcSgcIAHgOMacEB/0beBBVy9LbiY8X6JBXvEwEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24cd2e9ba186f7ec741e71a8f6566f55e2ddd1e7ef87f382f1e7fc30bb350d2c","last_reissued_at":"2026-07-05T00:05:44.407824Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:05:44.407824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pruning Deep Neural Networks using Partial Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Artur Jordao, Fernando Yamada, Ricardo Kloss, William Robson Schwartz","submitted_at":"2018-10-17T15:24:21Z","abstract_excerpt":"Modern pattern recognition methods are based on convolutional networks since they are able to learn complex patterns that benefit the classification. However, convolutional networks are computationally expensive and require a considerable amount of memory, which limits their deployment on low-power and resource-constrained systems. To handle these problems, recent approaches have proposed pruning strategies that find and remove unimportant neurons (i.e., filters) in these networks. Despite achieving remarkable results, existing pruning approaches are ineffective since the accuracy of the origi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07610","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.07610/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.07610","created_at":"2026-07-05T00:05:44.407881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07610v3","created_at":"2026-07-05T00:05:44.407881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07610","created_at":"2026-07-05T00:05:44.407881+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETGS5G5BQ336","created_at":"2026-07-05T00:05:44.407881+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETGS5G5BQ336Y5A6","created_at":"2026-07-05T00:05:44.407881+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETGS5G5B","created_at":"2026-07-05T00:05:44.407881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04951","citing_title":"Robustness as Architecture: Designing IQA Models to Withstand Adversarial Perturbations","ref_index":2019,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX","json":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX.json","graph_json":"https://pith.science/api/pith-number/ETGS5G5BQ336Y5A6OGUPMVTPKX/graph.json","events_json":"https://pith.science/api/pith-number/ETGS5G5BQ336Y5A6OGUPMVTPKX/events.json","paper":"https://pith.science/paper/ETGS5G5B"},"agent_actions":{"view_html":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX","download_json":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX.json","view_paper":"https://pith.science/paper/ETGS5G5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07610&json=true","fetch_graph":"https://pith.science/api/pith-number/ETGS5G5BQ336Y5A6OGUPMVTPKX/graph.json","fetch_events":"https://pith.science/api/pith-number/ETGS5G5BQ336Y5A6OGUPMVTPKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX/action/storage_attestation","attest_author":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX/action/author_attestation","sign_citation":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX/action/citation_signature","submit_replication":"https://pith.science/pith/ETGS5G5BQ336Y5A6OGUPMVTPKX/action/replication_record"}},"created_at":"2026-07-05T00:05:44.407881+00:00","updated_at":"2026-07-05T00:05:44.407881+00:00"}