{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q2O7S3HNW3HZ5VXMJDIHD3WPFE","short_pith_number":"pith:Q2O7S3HN","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"},"canonical_sha256":"869df96cedb6cf9ed6ec48d071eecf291788ba636184c5c9be9fe4ba6479d615","source":{"kind":"arxiv","id":"1901.00296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00296","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00296v1","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00296","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"Q2O7S3HNW3HZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q2O7S3HNW3HZ5VXM","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q2O7S3HN","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q2O7S3HNW3HZ5VXMJDIHD3WPFE","target":"record","payload":{"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"},"canonical_sha256":"869df96cedb6cf9ed6ec48d071eecf291788ba636184c5c9be9fe4ba6479d615","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"},"source_kind":"arxiv","source_id":"1901.00296","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nrR5EbAhKadqJzxreS3RiXRNVTt8k9Pnlc6rIrUeq1crkQTOZiyJv9MjfHe20XvcVdPAtkeLkoSx/gcjflIUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:56:11.929798Z"},"content_sha256":"683f12814d04aed8fd1a7cd84e97ac68a4b73ce594572d9e2f8877aca4d55737","schema_version":"1.0","event_id":"sha256:683f12814d04aed8fd1a7cd84e97ac68a4b73ce594572d9e2f8877aca4d55737"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q2O7S3HNW3HZ5VXMJDIHD3WPFE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axO6z0wbGDTOxMhPB7ADbCkaGKWxy47ANjLntI7ik5m3vIj0DhI3FFY8q1WDgyMe0iXvs7IQnxv897PMFJAmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:56:11.930461Z"},"content_sha256":"ea7ebad43d6f3a30af0e5fd352831b5e6b39eb5954490060f11aeaa50484e66b","schema_version":"1.0","event_id":"sha256:ea7ebad43d6f3a30af0e5fd352831b5e6b39eb5954490060f11aeaa50484e66b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/bundle.json","state_url":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T16:56:11Z","links":{"resolver":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE","bundle":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/bundle.json","state":"https://pith.science/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2O7S3HNW3HZ5VXMJDIHD3WPFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q2O7S3HNW3HZ5VXMJDIHD3WPFE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e8218c1432f90299000eb36561316ea5b44b316a6479e2312e4d822ced6ba23a","cross_cats_sorted":["astro-ph.IM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.CO","submitted_at":"2019-01-02T08:43:23Z","title_canon_sha256":"a57d2fa4cc7cd3c25679c7a9002529b26c6e7f6297bc4affad392e0fb00a693f"},"schema_version":"1.0","source":{"id":"1901.00296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00296","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00296v1","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00296","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"Q2O7S3HNW3HZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q2O7S3HNW3HZ5VXM","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q2O7S3HN","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:ea7ebad43d6f3a30af0e5fd352831b5e6b39eb5954490060f11aeaa50484e66b","target":"graph","created_at":"2026-05-17T23:43:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ben Hoyle, Cristiano G. Sabiu, Juhan Kim, Xiao-Dong Li","cross_cats":["astro-ph.IM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.CO","submitted_at":"2019-01-02T08:43:23Z","title":"Graph Database Solution for Higher Order Spatial Statistics in the Era of Big Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00296","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:683f12814d04aed8fd1a7cd84e97ac68a4b73ce594572d9e2f8877aca4d55737","target":"record","created_at":"2026-05-17T23:43:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e8218c1432f90299000eb36561316ea5b44b316a6479e2312e4d822ced6ba23a","cross_cats_sorted":["astro-ph.IM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.CO","submitted_at":"2019-01-02T08:43:23Z","title_canon_sha256":"a57d2fa4cc7cd3c25679c7a9002529b26c6e7f6297bc4affad392e0fb00a693f"},"schema_version":"1.0","source":{"id":"1901.00296","kind":"arxiv","version":1}},"canonical_sha256":"869df96cedb6cf9ed6ec48d071eecf291788ba636184c5c9be9fe4ba6479d615","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"869df96cedb6cf9ed6ec48d071eecf291788ba636184c5c9be9fe4ba6479d615","first_computed_at":"2026-05-17T23:43:09.179327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:09.179327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bpwNBzsZra5QOdCR19+4qZM5m9J4KSSUwORn48QwOUGio2GjWjrCGYFi8Vb+tEkIpmwJx23Pqjj5/O+EU+ZLBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:09.180159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:683f12814d04aed8fd1a7cd84e97ac68a4b73ce594572d9e2f8877aca4d55737","sha256:ea7ebad43d6f3a30af0e5fd352831b5e6b39eb5954490060f11aeaa50484e66b"],"state_sha256":"c8b21b235ec389bc287ce042661ed55d998788890b77cefbf623c6452b7ae34e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ej8dV5jOJsmu4mtuk77K9CpO7acYvFrW/sqXy5vfgpnLpK7CFrRQ93R87KsEZ+zLYsFvzkNMKswujNqYCzsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:56:11.934009Z","bundle_sha256":"a6b0f159b9a11c8606d8f2f765af6b5da1e976c5855f15ef5e11498a3ab426e0"}}