{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:737LMSJQYZMF3TD4PGAP2AYASY","short_pith_number":"pith:737LMSJQ","schema_version":"1.0","canonical_sha256":"fefeb64930c6585dcc7c7980fd03009602c97261c0b496f7924102468780e5c6","source":{"kind":"arxiv","id":"1202.5281","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.5281","created_at":"2026-05-18T01:58:20.226490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5281v3","created_at":"2026-05-18T01:58:20.226490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5281","created_at":"2026-05-18T01:58:20.226490+00:00"},{"alias_kind":"pith_short_12","alias_value":"737LMSJQYZMF","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"737LMSJQYZMF3TD4","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"737LMSJQ","created_at":"2026-05-18T12:26:56.085431+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/737LMSJQYZMF3TD4PGAP2AYASY","json":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY.json","graph_json":"https://pith.science/api/pith-number/737LMSJQYZMF3TD4PGAP2AYASY/graph.json","events_json":"https://pith.science/api/pith-number/737LMSJQYZMF3TD4PGAP2AYASY/events.json","paper":"https://pith.science/paper/737LMSJQ"},"agent_actions":{"view_html":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY","download_json":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY.json","view_paper":"https://pith.science/paper/737LMSJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5281&json=true","fetch_graph":"https://pith.science/api/pith-number/737LMSJQYZMF3TD4PGAP2AYASY/graph.json","fetch_events":"https://pith.science/api/pith-number/737LMSJQYZMF3TD4PGAP2AYASY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/action/storage_attestation","attest_author":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/action/author_attestation","sign_citation":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/action/citation_signature","submit_replication":"https://pith.science/pith/737LMSJQYZMF3TD4PGAP2AYASY/action/replication_record"}},"created_at":"2026-05-18T01:58:20.226490+00:00","updated_at":"2026-05-18T01:58:20.226490+00:00"}