{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4QVZZSKBEYQ5AYKTCZCBDZIMJA","short_pith_number":"pith:4QVZZSKB","schema_version":"1.0","canonical_sha256":"e42b9cc9412621d06153164411e50c480182431b7a95b7720f954f3110892dc6","source":{"kind":"arxiv","id":"1711.07877","version":1},"attestation_state":"computed","paper":{"title":"Fast discrete convolution in $\\mathbb{R}^2$ using Sparse Bessel Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Martin Averseng","submitted_at":"2017-11-21T16:22:30Z","abstract_excerpt":"We describe an efficient algorithm for computing the matrix vector products that appear in the numerical resolution of boundary integral equations in 2 space dimension. This work is an extension of the so-called Sparse Cardinal Sine Decomposition algorithm by Alouges et al., which is restricted to three-dimensional setups. Although the approach is similar, significant differences appear throughout the analysis of the method. Bessel decomposition, in particular, yield longer series for the same accuracy. We propose a careful study of the method that leads to a precise estimation of the complexi"},"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":"1711.07877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T16:22:30Z","cross_cats_sorted":[],"title_canon_sha256":"a350eb40b644c990047b45b6cef68802a2595f010437f2b9cba61e7c5492e416","abstract_canon_sha256":"6e3ef3321affaf2b7c5d06af8233d78016b4c7b40f17176cd0366d48b1a5c549"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.269122Z","signature_b64":"vwtdslCb+rpk2jcKNWJwtx6+54wCI4K9fWO3GW1IN2DCBVvWDFoCOS22bTPk8PQ+w8eSSHnpbB1Nm+MbwuVRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e42b9cc9412621d06153164411e50c480182431b7a95b7720f954f3110892dc6","last_reissued_at":"2026-05-18T00:29:56.268574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.268574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast discrete convolution in $\\mathbb{R}^2$ using Sparse Bessel Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Martin Averseng","submitted_at":"2017-11-21T16:22:30Z","abstract_excerpt":"We describe an efficient algorithm for computing the matrix vector products that appear in the numerical resolution of boundary integral equations in 2 space dimension. This work is an extension of the so-called Sparse Cardinal Sine Decomposition algorithm by Alouges et al., which is restricted to three-dimensional setups. Although the approach is similar, significant differences appear throughout the analysis of the method. Bessel decomposition, in particular, yield longer series for the same accuracy. We propose a careful study of the method that leads to a precise estimation of the complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07877","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":""},"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":"1711.07877","created_at":"2026-05-18T00:29:56.268646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07877v1","created_at":"2026-05-18T00:29:56.268646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07877","created_at":"2026-05-18T00:29:56.268646+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QVZZSKBEYQ5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QVZZSKBEYQ5AYKT","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QVZZSKB","created_at":"2026-05-18T12:31:00.734936+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/4QVZZSKBEYQ5AYKTCZCBDZIMJA","json":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA.json","graph_json":"https://pith.science/api/pith-number/4QVZZSKBEYQ5AYKTCZCBDZIMJA/graph.json","events_json":"https://pith.science/api/pith-number/4QVZZSKBEYQ5AYKTCZCBDZIMJA/events.json","paper":"https://pith.science/paper/4QVZZSKB"},"agent_actions":{"view_html":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA","download_json":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA.json","view_paper":"https://pith.science/paper/4QVZZSKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07877&json=true","fetch_graph":"https://pith.science/api/pith-number/4QVZZSKBEYQ5AYKTCZCBDZIMJA/graph.json","fetch_events":"https://pith.science/api/pith-number/4QVZZSKBEYQ5AYKTCZCBDZIMJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/action/storage_attestation","attest_author":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/action/author_attestation","sign_citation":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/action/citation_signature","submit_replication":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/action/replication_record"}},"created_at":"2026-05-18T00:29:56.268646+00:00","updated_at":"2026-05-18T00:29:56.268646+00:00"}