{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S5FYN73PZJXFF3BJTKGZULS6SB","short_pith_number":"pith:S5FYN73P","schema_version":"1.0","canonical_sha256":"974b86ff6fca6e52ec299a8d9a2e5e90508a003cd871131fdb6cdeed5aa0495e","source":{"kind":"arxiv","id":"1803.10750","version":2},"attestation_state":"computed","paper":{"title":"Adversarial Network Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Azade Farshad, Fabio Galasso, Vasileios Belagiannis","submitted_at":"2018-03-28T17:38:20Z","abstract_excerpt":"Neural network compression has recently received much attention due to the computational requirements of modern deep models. In this work, our objective is to transfer knowledge from a deep and accurate model to a smaller one. Our contributions are threefold: (i) we propose an adversarial network compression approach to train the small student network to mimic the large teacher, without the need for labels during training; (ii) we introduce a regularization scheme to prevent a trivially-strong discriminator without reducing the network capacity and (iii) our approach generalizes on different t"},"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":"1803.10750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-28T17:38:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8af37c962d32c5384c2be9b092a1bd7ec9799d34d030e235f6c6176dfc38659a","abstract_canon_sha256":"ba2172c94324bf832b039c387da37fa2ea49e5a98d67a8dd28fc2688573d604a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:43.496324Z","signature_b64":"o1DOViNN5k3hUM5Q3QDi1Ii+V1Z5E7pQ6Kbea0uOoskEM0AuqXRhARBppQkJTPq8pV6qanVAheKWNHOvkay+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974b86ff6fca6e52ec299a8d9a2e5e90508a003cd871131fdb6cdeed5aa0495e","last_reissued_at":"2026-05-18T00:00:43.495973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:43.495973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Network Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Azade Farshad, Fabio Galasso, Vasileios Belagiannis","submitted_at":"2018-03-28T17:38:20Z","abstract_excerpt":"Neural network compression has recently received much attention due to the computational requirements of modern deep models. In this work, our objective is to transfer knowledge from a deep and accurate model to a smaller one. Our contributions are threefold: (i) we propose an adversarial network compression approach to train the small student network to mimic the large teacher, without the need for labels during training; (ii) we introduce a regularization scheme to prevent a trivially-strong discriminator without reducing the network capacity and (iii) our approach generalizes on different t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10750","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1803.10750","created_at":"2026-05-18T00:00:43.496029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10750v2","created_at":"2026-05-18T00:00:43.496029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10750","created_at":"2026-05-18T00:00:43.496029+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5FYN73PZJXF","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5FYN73PZJXFF3BJ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5FYN73P","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB","json":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB.json","graph_json":"https://pith.science/api/pith-number/S5FYN73PZJXFF3BJTKGZULS6SB/graph.json","events_json":"https://pith.science/api/pith-number/S5FYN73PZJXFF3BJTKGZULS6SB/events.json","paper":"https://pith.science/paper/S5FYN73P"},"agent_actions":{"view_html":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB","download_json":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB.json","view_paper":"https://pith.science/paper/S5FYN73P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10750&json=true","fetch_graph":"https://pith.science/api/pith-number/S5FYN73PZJXFF3BJTKGZULS6SB/graph.json","fetch_events":"https://pith.science/api/pith-number/S5FYN73PZJXFF3BJTKGZULS6SB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB/action/storage_attestation","attest_author":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB/action/author_attestation","sign_citation":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB/action/citation_signature","submit_replication":"https://pith.science/pith/S5FYN73PZJXFF3BJTKGZULS6SB/action/replication_record"}},"created_at":"2026-05-18T00:00:43.496029+00:00","updated_at":"2026-05-18T00:00:43.496029+00:00"}