{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KPQ7YFVRXEOZCHKQ23M6XZDHST","short_pith_number":"pith:KPQ7YFVR","schema_version":"1.0","canonical_sha256":"53e1fc16b1b91d911d50d6d9ebe46794f0a86613d60b54015b61165532b9138e","source":{"kind":"arxiv","id":"2505.24527","version":1},"attestation_state":"computed","paper":{"title":"Optimal Density Functions for Weighted Convolution in Learning Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Giuseppe Patan\\`e, Simone Cammarasana","submitted_at":"2025-05-30T12:36:36Z","abstract_excerpt":"The paper introduces the weighted convolution, a novel approach to the convolution for signals defined on regular grids (e.g., 2D images) through the application of an optimal density function to scale the contribution of neighbouring pixels based on their distance from the central pixel. This choice differs from the traditional uniform convolution, which treats all neighbouring pixels equally. Our weighted convolution can be applied to convolutional neural network problems to improve the approximation accuracy. Given a convolutional network, we define a framework to compute the optimal densit"},"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":"2505.24527","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-05-30T12:36:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"36b09dc56ab7609172d749d036b8fb4283d079faff673b58856d6f0b9bf22563","abstract_canon_sha256":"4d6ecded0d24abbe83cb8dae5937545cdb6b8217d1600cc07ae27c37aae90c07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:51.813796Z","signature_b64":"2j5UTlJzMkkRQYtUdQoXZczFouBoE1OXfPTLx6B8PZfkCzX/M0E6oO4xjvMM9MYgxrpSkQ1zNrQJA+mEFXyMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53e1fc16b1b91d911d50d6d9ebe46794f0a86613d60b54015b61165532b9138e","last_reissued_at":"2026-07-05T11:12:51.813208Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:51.813208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Density Functions for Weighted Convolution in Learning Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Giuseppe Patan\\`e, Simone Cammarasana","submitted_at":"2025-05-30T12:36:36Z","abstract_excerpt":"The paper introduces the weighted convolution, a novel approach to the convolution for signals defined on regular grids (e.g., 2D images) through the application of an optimal density function to scale the contribution of neighbouring pixels based on their distance from the central pixel. This choice differs from the traditional uniform convolution, which treats all neighbouring pixels equally. Our weighted convolution can be applied to convolutional neural network problems to improve the approximation accuracy. Given a convolutional network, we define a framework to compute the optimal densit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24527","kind":"arxiv","version":1},"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/2505.24527/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":"2505.24527","created_at":"2026-07-05T11:12:51.813269+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24527v1","created_at":"2026-07-05T11:12:51.813269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24527","created_at":"2026-07-05T11:12:51.813269+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPQ7YFVRXEOZ","created_at":"2026-07-05T11:12:51.813269+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPQ7YFVRXEOZCHKQ","created_at":"2026-07-05T11:12:51.813269+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPQ7YFVR","created_at":"2026-07-05T11:12:51.813269+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/KPQ7YFVRXEOZCHKQ23M6XZDHST","json":"https://pith.science/pith/KPQ7YFVRXEOZCHKQ23M6XZDHST.json","graph_json":"https://pith.science/api/pith-number/KPQ7YFVRXEOZCHKQ23M6XZDHST/graph.json","events_json":"https://pith.science/api/pith-number/KPQ7YFVRXEOZCHKQ23M6XZDHST/events.json","paper":"https://pith.science/paper/KPQ7YFVR"},"agent_actions":{"view_html":"https://pith.science/pith/KPQ7YFVRXEOZCHKQ23M6XZDHST","download_json":"https://pith.science/pith/KPQ7YFVRXEOZCHKQ23M6XZDHST.json","view_paper":"https://pith.science/paper/KPQ7YFVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24527&json=true","fetch_graph":"https://pith.science/api/pith-number/KPQ7YFVRXEOZCHKQ23M6XZDHST/graph.json","fetch_events":"https://pith.science/api/pith-number/KPQ7YFVRXEOZCHKQ23M6XZDHST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPQ7YFVRXEOZCHKQ23M6XZDHST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPQ7YFVRXEOZCHKQ23M6XZDHST/action/storage_attestation","attest_author":"https://pith.science/pith/KPQ7YFVRXEOZCHKQ23M6XZDHST/action/author_attestation","sign_citation":"https://pith.science/pith/KPQ7YFVRXEOZCHKQ23M6XZDHST/action/citation_signature","submit_replication":"https://pith.science/pith/KPQ7YFVRXEOZCHKQ23M6XZDHST/action/replication_record"}},"created_at":"2026-07-05T11:12:51.813269+00:00","updated_at":"2026-07-05T11:12:51.813269+00:00"}