{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4QVZZSKBEYQ5AYKTCZCBDZIMJA","short_pith_number":"pith:4QVZZSKB","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"},"canonical_sha256":"e42b9cc9412621d06153164411e50c480182431b7a95b7720f954f3110892dc6","source":{"kind":"arxiv","id":"1711.07877","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07877","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07877v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07877","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"4QVZZSKBEYQ5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QVZZSKBEYQ5AYKT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QVZZSKB","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4QVZZSKBEYQ5AYKTCZCBDZIMJA","target":"record","payload":{"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"},"canonical_sha256":"e42b9cc9412621d06153164411e50c480182431b7a95b7720f954f3110892dc6","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"},"source_kind":"arxiv","source_id":"1711.07877","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0Z3KTl/S2Slnza3/9ZPGUgMQ7ejxzgST3rQ8XGksxqmUGXOrLi5l7GSiyFRJAIG5c4bV24ztsZbGsPGUPrLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:10:55.351092Z"},"content_sha256":"06d0fa2f10f3273523efb082916b5f75ef8a6b7102fe0453df78ceaf9eda193c","schema_version":"1.0","event_id":"sha256:06d0fa2f10f3273523efb082916b5f75ef8a6b7102fe0453df78ceaf9eda193c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4QVZZSKBEYQ5AYKTCZCBDZIMJA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGGU517TYEsAkK/h9ZuVByIdPAcyMt5HyPWjhi6sive0LZ+yr25/LKNaUomkci0NjIdOM9lCjdm4tLqOBMJDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:10:55.351462Z"},"content_sha256":"f023031c33643c2c12b1b89726c64c07005dd02656324945e3811f4c7331dc94","schema_version":"1.0","event_id":"sha256:f023031c33643c2c12b1b89726c64c07005dd02656324945e3811f4c7331dc94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/bundle.json","state_url":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T22:10:55Z","links":{"resolver":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA","bundle":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/bundle.json","state":"https://pith.science/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QVZZSKBEYQ5AYKTCZCBDZIMJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4QVZZSKBEYQ5AYKTCZCBDZIMJA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e3ef3321affaf2b7c5d06af8233d78016b4c7b40f17176cd0366d48b1a5c549","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T16:22:30Z","title_canon_sha256":"a350eb40b644c990047b45b6cef68802a2595f010437f2b9cba61e7c5492e416"},"schema_version":"1.0","source":{"id":"1711.07877","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07877","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07877v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07877","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"4QVZZSKBEYQ5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QVZZSKBEYQ5AYKT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QVZZSKB","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:f023031c33643c2c12b1b89726c64c07005dd02656324945e3811f4c7331dc94","target":"graph","created_at":"2026-05-18T00:29:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Martin Averseng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T16:22:30Z","title":"Fast discrete convolution in $\\mathbb{R}^2$ using Sparse Bessel Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07877","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:06d0fa2f10f3273523efb082916b5f75ef8a6b7102fe0453df78ceaf9eda193c","target":"record","created_at":"2026-05-18T00:29:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6e3ef3321affaf2b7c5d06af8233d78016b4c7b40f17176cd0366d48b1a5c549","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-21T16:22:30Z","title_canon_sha256":"a350eb40b644c990047b45b6cef68802a2595f010437f2b9cba61e7c5492e416"},"schema_version":"1.0","source":{"id":"1711.07877","kind":"arxiv","version":1}},"canonical_sha256":"e42b9cc9412621d06153164411e50c480182431b7a95b7720f954f3110892dc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e42b9cc9412621d06153164411e50c480182431b7a95b7720f954f3110892dc6","first_computed_at":"2026-05-18T00:29:56.268574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:56.268574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vwtdslCb+rpk2jcKNWJwtx6+54wCI4K9fWO3GW1IN2DCBVvWDFoCOS22bTPk8PQ+w8eSSHnpbB1Nm+MbwuVRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:56.269122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07877","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06d0fa2f10f3273523efb082916b5f75ef8a6b7102fe0453df78ceaf9eda193c","sha256:f023031c33643c2c12b1b89726c64c07005dd02656324945e3811f4c7331dc94"],"state_sha256":"3003b7f59742b057a65ca8fdf49c7b328e0a27c9b7e4ccddfab5ff9366a245cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5i5m3JX3r1pBxypO6nY6iJ+omLydd/aAfuqeSMmuusb9LDmYaN4tuqRDwOOdnMb4BTnIzd8XASS6lBJIUKOLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:10:55.353436Z","bundle_sha256":"831e2cd9f1e420cf46d6bc9e9e3b65059e1d557f409502b7dec6ecc3a31bae41"}}