{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WF2Q2CRDC34KIMOQGOP545BE2C","short_pith_number":"pith:WF2Q2CRD","schema_version":"1.0","canonical_sha256":"b1750d0a2316f8a431d0339fde7424d0a41b3093dd2721e9d7348a494a2698f1","source":{"kind":"arxiv","id":"1904.04971","version":3},"attestation_state":"computed","paper":{"title":"CondConv: Conditionally Parameterized Convolutions for Efficient Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Brandon Yang, Gabriel Bender, Jiquan Ngiam, Quoc V. Le","submitted_at":"2019-04-10T01:46:48Z","abstract_excerpt":"Convolutional layers are one of the basic building blocks of modern deep neural networks. One fundamental assumption is that convolutional kernels should be shared for all examples in a dataset. We propose conditionally parameterized convolutions (CondConv), which learn specialized convolutional kernels for each example. Replacing normal convolutions with CondConv enables us to increase the size and capacity of a network, while maintaining efficient inference. We demonstrate that scaling networks with CondConv improves the performance and inference cost trade-off of several existing convolutio"},"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":"1904.04971","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-10T01:46:48Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d741211e7e69efb0de256f8637399b89fdaefd709c72ea93257b16a556f2353c","abstract_canon_sha256":"6012c78a932e016f3fdc1f6c1e16862311410dca0a956a5361a9d59afdd6c47a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:32:55.930280Z","signature_b64":"B5kwQqm70t8W+SjuQsRL8hnIIZEziyrLLTCS6o9FulfLhAwx58gSkciQ5rdg4q+FS8bybws9J9nSxSVJtuX/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1750d0a2316f8a431d0339fde7424d0a41b3093dd2721e9d7348a494a2698f1","last_reissued_at":"2026-07-05T01:32:55.929873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:32:55.929873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CondConv: Conditionally Parameterized Convolutions for Efficient Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Brandon Yang, Gabriel Bender, Jiquan Ngiam, Quoc V. Le","submitted_at":"2019-04-10T01:46:48Z","abstract_excerpt":"Convolutional layers are one of the basic building blocks of modern deep neural networks. One fundamental assumption is that convolutional kernels should be shared for all examples in a dataset. We propose conditionally parameterized convolutions (CondConv), which learn specialized convolutional kernels for each example. Replacing normal convolutions with CondConv enables us to increase the size and capacity of a network, while maintaining efficient inference. We demonstrate that scaling networks with CondConv improves the performance and inference cost trade-off of several existing convolutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04971","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/1904.04971/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":"1904.04971","created_at":"2026-07-05T01:32:55.929934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04971v3","created_at":"2026-07-05T01:32:55.929934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04971","created_at":"2026-07-05T01:32:55.929934+00:00"},{"alias_kind":"pith_short_12","alias_value":"WF2Q2CRDC34K","created_at":"2026-07-05T01:32:55.929934+00:00"},{"alias_kind":"pith_short_16","alias_value":"WF2Q2CRDC34KIMOQ","created_at":"2026-07-05T01:32:55.929934+00:00"},{"alias_kind":"pith_short_8","alias_value":"WF2Q2CRD","created_at":"2026-07-05T01:32:55.929934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14846","citing_title":"Finding Optimal Kernel Size and Dimension in Convolutional Neural Networks An Architecture Optimization Approach","ref_index":2019,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C","json":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C.json","graph_json":"https://pith.science/api/pith-number/WF2Q2CRDC34KIMOQGOP545BE2C/graph.json","events_json":"https://pith.science/api/pith-number/WF2Q2CRDC34KIMOQGOP545BE2C/events.json","paper":"https://pith.science/paper/WF2Q2CRD"},"agent_actions":{"view_html":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C","download_json":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C.json","view_paper":"https://pith.science/paper/WF2Q2CRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04971&json=true","fetch_graph":"https://pith.science/api/pith-number/WF2Q2CRDC34KIMOQGOP545BE2C/graph.json","fetch_events":"https://pith.science/api/pith-number/WF2Q2CRDC34KIMOQGOP545BE2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C/action/storage_attestation","attest_author":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C/action/author_attestation","sign_citation":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C/action/citation_signature","submit_replication":"https://pith.science/pith/WF2Q2CRDC34KIMOQGOP545BE2C/action/replication_record"}},"created_at":"2026-07-05T01:32:55.929934+00:00","updated_at":"2026-07-05T01:32:55.929934+00:00"}