{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MJ7GWI7FWQDDRHRTYB4DFM2N52","short_pith_number":"pith:MJ7GWI7F","schema_version":"1.0","canonical_sha256":"627e6b23e5b406389e33c07832b34dee86bb29fb5818b58141dda474179ed022","source":{"kind":"arxiv","id":"1710.05781","version":1},"attestation_state":"computed","paper":{"title":"A Fast Tree Algorithm for Electric Field Calculation in Electrical Discharge Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Chijie Zhuang, Jinliang He, Lei Liu, Rong Zeng, Xin Zhou, Yong Zhang","submitted_at":"2017-10-16T15:24:12Z","abstract_excerpt":"The simulation of electrical discharges has been attracting a great deal of attention. In such simulations, the electric field computation dominates the computational time. In this paper, we propose a fast tree algorithm that helps to reduce the time complexity from $O(N^2)$ (from using direct summation) to $O(N\\log N)$. The implementation details are discussed and the time complexity is analyzed. A rigorous error estimation shows the error of the tree algorithm decays exponentially with the number of truncation terms and can be controlled adaptively. Numerical examples are presented to valida"},"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":"1710.05781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2017-10-16T15:24:12Z","cross_cats_sorted":[],"title_canon_sha256":"b7ad39759b0471cce1908aa53c76ddf0a3da588c93078dc936bc396a5637430e","abstract_canon_sha256":"680065d30bf003a764e2a7b2775e064af99b4a02cb0061c40fe148cd0822087b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:40.513261Z","signature_b64":"OG5BlLMg2EKmBr0yCqAzB82OiahkaGGZFCtTIJOSTYSAw9j4MdZ1YKUo+oCyTqeB7PxGdAOar3jbFvHfEK3ICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"627e6b23e5b406389e33c07832b34dee86bb29fb5818b58141dda474179ed022","last_reissued_at":"2026-05-18T00:11:40.512555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:40.512555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Tree Algorithm for Electric Field Calculation in Electrical Discharge Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Chijie Zhuang, Jinliang He, Lei Liu, Rong Zeng, Xin Zhou, Yong Zhang","submitted_at":"2017-10-16T15:24:12Z","abstract_excerpt":"The simulation of electrical discharges has been attracting a great deal of attention. In such simulations, the electric field computation dominates the computational time. In this paper, we propose a fast tree algorithm that helps to reduce the time complexity from $O(N^2)$ (from using direct summation) to $O(N\\log N)$. The implementation details are discussed and the time complexity is analyzed. A rigorous error estimation shows the error of the tree algorithm decays exponentially with the number of truncation terms and can be controlled adaptively. Numerical examples are presented to valida"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05781","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":"1710.05781","created_at":"2026-05-18T00:11:40.512673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05781v1","created_at":"2026-05-18T00:11:40.512673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05781","created_at":"2026-05-18T00:11:40.512673+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJ7GWI7FWQDD","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJ7GWI7FWQDDRHRT","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJ7GWI7F","created_at":"2026-05-18T12:31:31.346846+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/MJ7GWI7FWQDDRHRTYB4DFM2N52","json":"https://pith.science/pith/MJ7GWI7FWQDDRHRTYB4DFM2N52.json","graph_json":"https://pith.science/api/pith-number/MJ7GWI7FWQDDRHRTYB4DFM2N52/graph.json","events_json":"https://pith.science/api/pith-number/MJ7GWI7FWQDDRHRTYB4DFM2N52/events.json","paper":"https://pith.science/paper/MJ7GWI7F"},"agent_actions":{"view_html":"https://pith.science/pith/MJ7GWI7FWQDDRHRTYB4DFM2N52","download_json":"https://pith.science/pith/MJ7GWI7FWQDDRHRTYB4DFM2N52.json","view_paper":"https://pith.science/paper/MJ7GWI7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05781&json=true","fetch_graph":"https://pith.science/api/pith-number/MJ7GWI7FWQDDRHRTYB4DFM2N52/graph.json","fetch_events":"https://pith.science/api/pith-number/MJ7GWI7FWQDDRHRTYB4DFM2N52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJ7GWI7FWQDDRHRTYB4DFM2N52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJ7GWI7FWQDDRHRTYB4DFM2N52/action/storage_attestation","attest_author":"https://pith.science/pith/MJ7GWI7FWQDDRHRTYB4DFM2N52/action/author_attestation","sign_citation":"https://pith.science/pith/MJ7GWI7FWQDDRHRTYB4DFM2N52/action/citation_signature","submit_replication":"https://pith.science/pith/MJ7GWI7FWQDDRHRTYB4DFM2N52/action/replication_record"}},"created_at":"2026-05-18T00:11:40.512673+00:00","updated_at":"2026-05-18T00:11:40.512673+00:00"}