{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:M545LUOQQD6HYTVFW5L72DDWBJ","short_pith_number":"pith:M545LUOQ","schema_version":"1.0","canonical_sha256":"6779d5d1d080fc7c4ea5b757fd0c760a5ef36a51291df7e8552dc39e25f1fe08","source":{"kind":"arxiv","id":"2106.10278","version":2},"attestation_state":"computed","paper":{"title":"Efficient Computation of $N$-point Correlation Functions in $D$ Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.app-ph","physics.comp-ph","physics.data-an"],"primary_cat":"astro-ph.IM","authors_text":"Oliver H. E. Philcox, Zachary Slepian","submitted_at":"2021-06-18T18:00:00Z","abstract_excerpt":"We present efficient algorithms for computing the $N$-point correlation functions (NPCFs) of random fields in arbitrary $D$-dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences, and provide a natural tool to describe stochastic processes. algorithms for computing the NPCF components have $\\mathcal{O}(n^N)$ complexity (for a data set containing $n$ particles); their application is thus computationally infeasible unless $N$ is small. By projecting the statistic onto a suitably-defined angular basis, we show that the estimators can be written in a "},"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":"2106.10278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2021-06-18T18:00:00Z","cross_cats_sorted":["physics.app-ph","physics.comp-ph","physics.data-an"],"title_canon_sha256":"52e65111f46778fb7f54a05cd114c0c14fdbeca0531b87721e2595658f83789f","abstract_canon_sha256":"485a936c4a5cd12908bc03a93d8279b1129fa0b2fc54d27b791ecdb89e1f3cf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:59.114182Z","signature_b64":"u1H5RCB8/zTry3nkN53G8XtQ8BGk1C/oPLjw/+rfQ4Vt2ZeKMuMuwz5DFxFoX2/nll7AKXV+GNKuLHEYHx3KBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6779d5d1d080fc7c4ea5b757fd0c760a5ef36a51291df7e8552dc39e25f1fe08","last_reissued_at":"2026-07-05T04:56:59.113768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:59.113768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Computation of $N$-point Correlation Functions in $D$ Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.app-ph","physics.comp-ph","physics.data-an"],"primary_cat":"astro-ph.IM","authors_text":"Oliver H. E. Philcox, Zachary Slepian","submitted_at":"2021-06-18T18:00:00Z","abstract_excerpt":"We present efficient algorithms for computing the $N$-point correlation functions (NPCFs) of random fields in arbitrary $D$-dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences, and provide a natural tool to describe stochastic processes. algorithms for computing the NPCF components have $\\mathcal{O}(n^N)$ complexity (for a data set containing $n$ particles); their application is thus computationally infeasible unless $N$ is small. By projecting the statistic onto a suitably-defined angular basis, we show that the estimators can be written in a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.10278","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/2106.10278/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":"2106.10278","created_at":"2026-07-05T04:56:59.113824+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.10278v2","created_at":"2026-07-05T04:56:59.113824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.10278","created_at":"2026-07-05T04:56:59.113824+00:00"},{"alias_kind":"pith_short_12","alias_value":"M545LUOQQD6H","created_at":"2026-07-05T04:56:59.113824+00:00"},{"alias_kind":"pith_short_16","alias_value":"M545LUOQQD6HYTVF","created_at":"2026-07-05T04:56:59.113824+00:00"},{"alias_kind":"pith_short_8","alias_value":"M545LUOQ","created_at":"2026-07-05T04:56:59.113824+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2209.07472","citing_title":"A $(D_\\tau,D_x)$-manifold with $N$-correlators of $N_t$-objects","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21171","citing_title":"Advanced manifold-metric pairs","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ","json":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ.json","graph_json":"https://pith.science/api/pith-number/M545LUOQQD6HYTVFW5L72DDWBJ/graph.json","events_json":"https://pith.science/api/pith-number/M545LUOQQD6HYTVFW5L72DDWBJ/events.json","paper":"https://pith.science/paper/M545LUOQ"},"agent_actions":{"view_html":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ","download_json":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ.json","view_paper":"https://pith.science/paper/M545LUOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.10278&json=true","fetch_graph":"https://pith.science/api/pith-number/M545LUOQQD6HYTVFW5L72DDWBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/M545LUOQQD6HYTVFW5L72DDWBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ/action/storage_attestation","attest_author":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ/action/author_attestation","sign_citation":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ/action/citation_signature","submit_replication":"https://pith.science/pith/M545LUOQQD6HYTVFW5L72DDWBJ/action/replication_record"}},"created_at":"2026-07-05T04:56:59.113824+00:00","updated_at":"2026-07-05T04:56:59.113824+00:00"}