{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FVHTCMADII33OLZC74ZBIEU4PT","short_pith_number":"pith:FVHTCMAD","schema_version":"1.0","canonical_sha256":"2d4f3130034237b72f22ff3214129c7ce476b289e689da70cadb5ac5b8f4c164","source":{"kind":"arxiv","id":"1201.3986","version":2},"attestation_state":"computed","paper":{"title":"Convolutive decomposition and fast summation methods for discrete-velocity approximations of the Boltzmann equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.NA","authors_text":"Cl\\'ement Mouhot, Lorenzo Pareschi (DPT OF MATH., Thomas Rey (ICJ), Univ. of Ferrara)","submitted_at":"2012-01-19T07:44:48Z","abstract_excerpt":"Discrete-velocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically $O(N^{2d+1})$ where $d$ is the dimension of the velocity space. In this paper, following the ideas introduced in [27,28], we derive fast summation techniques for the evaluation of discrete-velocity schemes which permits to reduce the computational cost from $O(N^{2d+1})$ to $O(\\bar{N}^d N^d\\log_2 N)$, $\\bar{N} << N$, with almost no loss of accuracy."},"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":"1201.3986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-01-19T07:44:48Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"33ba1cf49972dce2f7265c6d9ac238c5bf169e9e747bc18b32881a0b0e9cbb6a","abstract_canon_sha256":"a6ef8ac43b72b14104812bddef36cb3af39b4750dd87e0159b0bbb31b0ec60c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:21.467529Z","signature_b64":"+sbUFwTFem/XW7B47rvrjH2uPzrv+jPen8t7lO7dg4oEsbZV6eS2kbIFU/gSo9DjcFANucoJZxFqVR7UbQGXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4f3130034237b72f22ff3214129c7ce476b289e689da70cadb5ac5b8f4c164","last_reissued_at":"2026-05-18T03:02:21.466896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:21.466896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convolutive decomposition and fast summation methods for discrete-velocity approximations of the Boltzmann equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.NA","authors_text":"Cl\\'ement Mouhot, Lorenzo Pareschi (DPT OF MATH., Thomas Rey (ICJ), Univ. of Ferrara)","submitted_at":"2012-01-19T07:44:48Z","abstract_excerpt":"Discrete-velocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically $O(N^{2d+1})$ where $d$ is the dimension of the velocity space. In this paper, following the ideas introduced in [27,28], we derive fast summation techniques for the evaluation of discrete-velocity schemes which permits to reduce the computational cost from $O(N^{2d+1})$ to $O(\\bar{N}^d N^d\\log_2 N)$, $\\bar{N} << N$, with almost no loss of accuracy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3986","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":"1201.3986","created_at":"2026-05-18T03:02:21.466989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3986v2","created_at":"2026-05-18T03:02:21.466989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3986","created_at":"2026-05-18T03:02:21.466989+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVHTCMADII33","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVHTCMADII33OLZC","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVHTCMAD","created_at":"2026-05-18T12:27:06.952714+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/FVHTCMADII33OLZC74ZBIEU4PT","json":"https://pith.science/pith/FVHTCMADII33OLZC74ZBIEU4PT.json","graph_json":"https://pith.science/api/pith-number/FVHTCMADII33OLZC74ZBIEU4PT/graph.json","events_json":"https://pith.science/api/pith-number/FVHTCMADII33OLZC74ZBIEU4PT/events.json","paper":"https://pith.science/paper/FVHTCMAD"},"agent_actions":{"view_html":"https://pith.science/pith/FVHTCMADII33OLZC74ZBIEU4PT","download_json":"https://pith.science/pith/FVHTCMADII33OLZC74ZBIEU4PT.json","view_paper":"https://pith.science/paper/FVHTCMAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3986&json=true","fetch_graph":"https://pith.science/api/pith-number/FVHTCMADII33OLZC74ZBIEU4PT/graph.json","fetch_events":"https://pith.science/api/pith-number/FVHTCMADII33OLZC74ZBIEU4PT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVHTCMADII33OLZC74ZBIEU4PT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVHTCMADII33OLZC74ZBIEU4PT/action/storage_attestation","attest_author":"https://pith.science/pith/FVHTCMADII33OLZC74ZBIEU4PT/action/author_attestation","sign_citation":"https://pith.science/pith/FVHTCMADII33OLZC74ZBIEU4PT/action/citation_signature","submit_replication":"https://pith.science/pith/FVHTCMADII33OLZC74ZBIEU4PT/action/replication_record"}},"created_at":"2026-05-18T03:02:21.466989+00:00","updated_at":"2026-05-18T03:02:21.466989+00:00"}