{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HAZXAN6FROHU7622KRP6BO6A23","short_pith_number":"pith:HAZXAN6F","schema_version":"1.0","canonical_sha256":"38337037c58b8f4ffb5a545fe0bbc0d6d59da116a71137228ab2b9749df2155e","source":{"kind":"arxiv","id":"1811.12498","version":2},"attestation_state":"computed","paper":{"title":"A Treecode Algorithm for 3D Stokeslets and Stresslets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.flu-dyn"],"primary_cat":"math.NA","authors_text":"Lei Wang, Robert Krasny, Svetlana Tlupova","submitted_at":"2018-11-29T21:37:34Z","abstract_excerpt":"The Stokeslet and stresslet kernels are commonly used in boundary element simulations and singularity methods for slow viscous flow. Evaluating the velocity induced by a collection of Stokeslets and stresslets by direct summation requires $O(N^2)$ operations, where $N$ is the system size. The present work develops a treecode algorithm for 3D Stokeslets and stresslets that reduces the cost to $O(N\\log N)$. The particles are divided into a hierarchy of clusters, and well-separated particle-cluster interactions are computed by a far-field Cartesian Taylor approximation. The terms in the approxima"},"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":"1811.12498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-29T21:37:34Z","cross_cats_sorted":["cs.NA","physics.flu-dyn"],"title_canon_sha256":"94064a54bcfb84cf2f2272b386c8223ee9a4bf06a0eeee92412280c71aecc8d3","abstract_canon_sha256":"4ac31472b4ccdfda2d19dbf9b320e7e04f47ffaaa2782583bba9f941676a2692"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:23.884751Z","signature_b64":"Ru6G5s46pUiJqn3oonc2O6Je9k+H4arwXz9FoNdk0HfjhPU7IGtKvYpMRzHmRx3SrcVsGkWd9t0/jUtkTro+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38337037c58b8f4ffb5a545fe0bbc0d6d59da116a71137228ab2b9749df2155e","last_reissued_at":"2026-07-05T00:00:23.884272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:23.884272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Treecode Algorithm for 3D Stokeslets and Stresslets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.flu-dyn"],"primary_cat":"math.NA","authors_text":"Lei Wang, Robert Krasny, Svetlana Tlupova","submitted_at":"2018-11-29T21:37:34Z","abstract_excerpt":"The Stokeslet and stresslet kernels are commonly used in boundary element simulations and singularity methods for slow viscous flow. Evaluating the velocity induced by a collection of Stokeslets and stresslets by direct summation requires $O(N^2)$ operations, where $N$ is the system size. The present work develops a treecode algorithm for 3D Stokeslets and stresslets that reduces the cost to $O(N\\log N)$. The particles are divided into a hierarchy of clusters, and well-separated particle-cluster interactions are computed by a far-field Cartesian Taylor approximation. The terms in the approxima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12498","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.12498/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":"1811.12498","created_at":"2026-07-05T00:00:23.884333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12498v2","created_at":"2026-07-05T00:00:23.884333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12498","created_at":"2026-07-05T00:00:23.884333+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAZXAN6FROHU","created_at":"2026-07-05T00:00:23.884333+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAZXAN6FROHU7622","created_at":"2026-07-05T00:00:23.884333+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAZXAN6F","created_at":"2026-07-05T00:00:23.884333+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.00049","citing_title":"Solution of Stokes flow in complex nonsmooth 2D geometries via a linear-scaling high-order adaptive integral equation scheme","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23","json":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23.json","graph_json":"https://pith.science/api/pith-number/HAZXAN6FROHU7622KRP6BO6A23/graph.json","events_json":"https://pith.science/api/pith-number/HAZXAN6FROHU7622KRP6BO6A23/events.json","paper":"https://pith.science/paper/HAZXAN6F"},"agent_actions":{"view_html":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23","download_json":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23.json","view_paper":"https://pith.science/paper/HAZXAN6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12498&json=true","fetch_graph":"https://pith.science/api/pith-number/HAZXAN6FROHU7622KRP6BO6A23/graph.json","fetch_events":"https://pith.science/api/pith-number/HAZXAN6FROHU7622KRP6BO6A23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23/action/storage_attestation","attest_author":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23/action/author_attestation","sign_citation":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23/action/citation_signature","submit_replication":"https://pith.science/pith/HAZXAN6FROHU7622KRP6BO6A23/action/replication_record"}},"created_at":"2026-07-05T00:00:23.884333+00:00","updated_at":"2026-07-05T00:00:23.884333+00:00"}