{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Q2O7S3HNW3HZ5VXMJDIHD3WPFE","short_pith_number":"pith:Q2O7S3HN","schema_version":"1.0","canonical_sha256":"869df96cedb6cf9ed6ec48d071eecf291788ba636184c5c9be9fe4ba6479d615","source":{"kind":"arxiv","id":"1901.00296","version":1},"attestation_state":"computed","paper":{"title":"Graph Database Solution for Higher Order Spatial Statistics in the Era of Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"astro-ph.CO","authors_text":"Ben Hoyle, Cristiano G. Sabiu, Juhan Kim, Xiao-Dong Li","submitted_at":"2019-01-02T08:43:23Z","abstract_excerpt":"We present an algorithm for the fast computation of the general $N$-point spatial correlation functions of any discrete point set embedded within an Euclidean space of $\\mathbb{R}^n$. Utilizing the concepts of kd-trees and graph databases, we describe how to count all possible $N$-tuples in binned configurations within a given length scale, e.g. all pairs of points or all triplets of points with side lengths $<r_{max}$. Through bench-marking we show the computational advantage of our new graph based algorithm over more traditional methods. We show that all 3-point configurations up to and beyo"},"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":"1901.00296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.CO","submitted_at":"2019-01-02T08:43:23Z","cross_cats_sorted":["astro-ph.IM"],"title_canon_sha256":"a57d2fa4cc7cd3c25679c7a9002529b26c6e7f6297bc4affad392e0fb00a693f","abstract_canon_sha256":"e8218c1432f90299000eb36561316ea5b44b316a6479e2312e4d822ced6ba23a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:09.180159Z","signature_b64":"bpwNBzsZra5QOdCR19+4qZM5m9J4KSSUwORn48QwOUGio2GjWjrCGYFi8Vb+tEkIpmwJx23Pqjj5/O+EU+ZLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"869df96cedb6cf9ed6ec48d071eecf291788ba636184c5c9be9fe4ba6479d615","last_reissued_at":"2026-05-17T23:43:09.179327Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:09.179327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Database Solution for Higher Order Spatial Statistics in the Era of Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"astro-ph.CO","authors_text":"Ben Hoyle, Cristiano G. Sabiu, Juhan Kim, Xiao-Dong Li","submitted_at":"2019-01-02T08:43:23Z","abstract_excerpt":"We present an algorithm for the fast computation of the general $N$-point spatial correlation functions of any discrete point set embedded within an Euclidean space of $\\mathbb{R}^n$. Utilizing the concepts of kd-trees and graph databases, we describe how to count all possible $N$-tuples in binned configurations within a given length scale, e.g. all pairs of points or all triplets of points with side lengths $<r_{max}$. Through bench-marking we show the computational advantage of our new graph based algorithm over more traditional methods. We show that all 3-point configurations up to and beyo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00296","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":"1901.00296","created_at":"2026-05-17T23:43:09.179449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00296v1","created_at":"2026-05-17T23:43:09.179449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00296","created_at":"2026-05-17T23:43:09.179449+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2O7S3HNW3HZ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2O7S3HNW3HZ5VXM","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2O7S3HN","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23367","citing_title":"Cosmological constraints from neighbor-density-weighted marked correlation functions","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE","json":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE.json","graph_json":"https://pith.science/api/pith-number/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/graph.json","events_json":"https://pith.science/api/pith-number/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/events.json","paper":"https://pith.science/paper/Q2O7S3HN"},"agent_actions":{"view_html":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE","download_json":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE.json","view_paper":"https://pith.science/paper/Q2O7S3HN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00296&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/action/storage_attestation","attest_author":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/action/author_attestation","sign_citation":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/action/citation_signature","submit_replication":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/action/replication_record"}},"created_at":"2026-05-17T23:43:09.179449+00:00","updated_at":"2026-05-17T23:43:09.179449+00:00"}