{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:737LMSJQYZMF3TD4PGAP2AYASY","short_pith_number":"pith:737LMSJQ","canonical_record":{"source":{"id":"1202.5281","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.soft","submitted_at":"2012-02-23T20:11:07Z","cross_cats_sorted":[],"title_canon_sha256":"9cead10fa2f25e8852498c57c3a597b9b1ae36a5a647e69762aa1c00dbb826a5","abstract_canon_sha256":"3660163f8f308869340148a181b92c78c6c7f32760ad13753b9fe515b1aa0f40"},"schema_version":"1.0"},"canonical_sha256":"fefeb64930c6585dcc7c7980fd03009602c97261c0b496f7924102468780e5c6","source":{"kind":"arxiv","id":"1202.5281","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5281","created_at":"2026-05-18T01:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5281v3","created_at":"2026-05-18T01:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5281","created_at":"2026-05-18T01:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"737LMSJQYZMF","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"737LMSJQYZMF3TD4","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"737LMSJQ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:737LMSJQYZMF3TD4PGAP2AYASY","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5281","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.soft","submitted_at":"2012-02-23T20:11:07Z","cross_cats_sorted":[],"title_canon_sha256":"9cead10fa2f25e8852498c57c3a597b9b1ae36a5a647e69762aa1c00dbb826a5","abstract_canon_sha256":"3660163f8f308869340148a181b92c78c6c7f32760ad13753b9fe515b1aa0f40"},"schema_version":"1.0"},"canonical_sha256":"fefeb64930c6585dcc7c7980fd03009602c97261c0b496f7924102468780e5c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:20.226893Z","signature_b64":"YDckjvl2icuWQErFFf1NySSZJ8/+zfDyMXEjW0SvP/BHpllk88dxspBC12/4A+FLuc124jdp+IDZExRP9xhqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fefeb64930c6585dcc7c7980fd03009602c97261c0b496f7924102468780e5c6","last_reissued_at":"2026-05-18T01:58:20.226420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:20.226420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5281","source_version":3,"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-18T01:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otZxq8zcjCWMwFCl3M9iVxLna9suRZ9Eus1tPkaQsgceCQqG89h6GYmYojKa0cXd9d3vImchWALVFIJ0ZRczBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:34:39.024475Z"},"content_sha256":"d88c772c794e307fca3a10eb1dd48425f31d19157f82f165d423f6e8e69f1e12","schema_version":"1.0","event_id":"sha256:d88c772c794e307fca3a10eb1dd48425f31d19157f82f165d423f6e8e69f1e12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:737LMSJQYZMF3TD4PGAP2AYASY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A parameter-free, solid-angle based, nearest-neighbor algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.soft","authors_text":"Chantal Valeriani, Daan Frenkel, Jacobus A. van Meel, Laura Filion","submitted_at":"2012-02-23T20:11:07Z","abstract_excerpt":"We propose a parameter-free algorithm for the identification of nearest neighbors. The algorithm is very easy to use and has a number of advantages over existing algorithms to identify nearest- neighbors. This solid-angle based nearest-neighbor algorithm (SANN) attributes to each possible neighbor a solid angle and determines the cutoff radius by the requirement that the sum of the solid angles is 4{\\pi}. The algorithm can be used to analyze 3D images, both from experiments as well as theory, and as the algorithm has a low computational cost, it can also be used \"on the fly\" in simulations. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5281","kind":"arxiv","version":3},"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-18T01:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gGC25IGGc9RgGzH0HnZy7wMXVfc9QZ0bnvDo7X/sa9pA+T8F3mzBHzpfE3r+kpgkjhkGhLClczugH/aBBleYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:34:39.024821Z"},"content_sha256":"ba22871aac6a3b0972bb3a691cac0b1f01d43a95f2ab7e920467b68b6305d87c","schema_version":"1.0","event_id":"sha256:ba22871aac6a3b0972bb3a691cac0b1f01d43a95f2ab7e920467b68b6305d87c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/bundle.json","state_url":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/737LMSJQYZMF3TD4PGAP2AYASY/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-06-02T03:34:39Z","links":{"resolver":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY","bundle":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/bundle.json","state":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/737LMSJQYZMF3TD4PGAP2AYASY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:737LMSJQYZMF3TD4PGAP2AYASY","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":"3660163f8f308869340148a181b92c78c6c7f32760ad13753b9fe515b1aa0f40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.soft","submitted_at":"2012-02-23T20:11:07Z","title_canon_sha256":"9cead10fa2f25e8852498c57c3a597b9b1ae36a5a647e69762aa1c00dbb826a5"},"schema_version":"1.0","source":{"id":"1202.5281","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5281","created_at":"2026-05-18T01:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5281v3","created_at":"2026-05-18T01:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5281","created_at":"2026-05-18T01:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"737LMSJQYZMF","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"737LMSJQYZMF3TD4","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"737LMSJQ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ba22871aac6a3b0972bb3a691cac0b1f01d43a95f2ab7e920467b68b6305d87c","target":"graph","created_at":"2026-05-18T01:58:20Z","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 propose a parameter-free algorithm for the identification of nearest neighbors. The algorithm is very easy to use and has a number of advantages over existing algorithms to identify nearest- neighbors. This solid-angle based nearest-neighbor algorithm (SANN) attributes to each possible neighbor a solid angle and determines the cutoff radius by the requirement that the sum of the solid angles is 4{\\pi}. The algorithm can be used to analyze 3D images, both from experiments as well as theory, and as the algorithm has a low computational cost, it can also be used \"on the fly\" in simulations. In","authors_text":"Chantal Valeriani, Daan Frenkel, Jacobus A. van Meel, Laura Filion","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.soft","submitted_at":"2012-02-23T20:11:07Z","title":"A parameter-free, solid-angle based, nearest-neighbor algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5281","kind":"arxiv","version":3},"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:d88c772c794e307fca3a10eb1dd48425f31d19157f82f165d423f6e8e69f1e12","target":"record","created_at":"2026-05-18T01:58:20Z","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":"3660163f8f308869340148a181b92c78c6c7f32760ad13753b9fe515b1aa0f40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.soft","submitted_at":"2012-02-23T20:11:07Z","title_canon_sha256":"9cead10fa2f25e8852498c57c3a597b9b1ae36a5a647e69762aa1c00dbb826a5"},"schema_version":"1.0","source":{"id":"1202.5281","kind":"arxiv","version":3}},"canonical_sha256":"fefeb64930c6585dcc7c7980fd03009602c97261c0b496f7924102468780e5c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fefeb64930c6585dcc7c7980fd03009602c97261c0b496f7924102468780e5c6","first_computed_at":"2026-05-18T01:58:20.226420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:20.226420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YDckjvl2icuWQErFFf1NySSZJ8/+zfDyMXEjW0SvP/BHpllk88dxspBC12/4A+FLuc124jdp+IDZExRP9xhqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:20.226893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5281","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d88c772c794e307fca3a10eb1dd48425f31d19157f82f165d423f6e8e69f1e12","sha256:ba22871aac6a3b0972bb3a691cac0b1f01d43a95f2ab7e920467b68b6305d87c"],"state_sha256":"5d3a79bae91cc457ae66f59ecd3df8e60ec8fd87e760cf392e99336f4c88edb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgzbbcqocMe0TJimw9qQ7DSAxWQz1JkK4rEUMpoAIF+YGszX6+ek1/9/DYysQtKvhWXXr3dGU/udvhTcf1I0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:34:39.026826Z","bundle_sha256":"87ed2ecb582e65cbc354ac7abc0eee5aaf1fd4806fa4a1793632adf6a8a44233"}}