{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:WT5HEGEYCPBDCDWQ52Z23NAMYN","short_pith_number":"pith:WT5HEGEY","schema_version":"1.0","canonical_sha256":"b4fa72189813c2310ed0eeb3adb40cc36c96ab4f8b68c28cc0118552bd17fee2","source":{"kind":"arxiv","id":"astro-ph/9712200","version":1},"attestation_state":"computed","paper":{"title":"HOP: A New Group-Finding Algorithm for N-body Simulations","license":"","headline":"","cross_cats":[],"primary_cat":"astro-ph","authors_text":"Daniel J. Eisenstein, Piet Hut (IAS, Princeton)","submitted_at":"1997-12-16T01:53:41Z","abstract_excerpt":"We describe a new method (HOP) for identifying groups of particles in N-body simulations. Having assigned to every particle an estimate of its local density, we associate each particle with the densest of the N_hop particles nearest to it. Repeating this process allows us to trace a path, within the particle set itself, from each particle in the direction of increasing density. The path ends when it reaches a particle that is its own densest neighbor; all particles reaching the same such particle are identified as a group. Combined with an adaptive smoothing kernel for finding the densities, t"},"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":"astro-ph/9712200","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"astro-ph","submitted_at":"1997-12-16T01:53:41Z","cross_cats_sorted":[],"title_canon_sha256":"0b3c2caa638e2fdcc5b16fb9b1a8aebf22e15914e5125163e2395de5767803e8","abstract_canon_sha256":"509e4443c2c32861b858f8ee8a9b31de44915d7c027c9d3d5ad3215375d0f1d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:25:18.521456Z","signature_b64":"ZAns1m0eGWBYywALaEnmLrMFd94s3oIDGbC3G6UtSvsrxFhK9zZ3+IvcAzXw4Fp3bhdw6pIoAoP1vnLnNlnRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4fa72189813c2310ed0eeb3adb40cc36c96ab4f8b68c28cc0118552bd17fee2","last_reissued_at":"2026-07-04T17:25:18.520941Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:25:18.520941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HOP: A New Group-Finding Algorithm for N-body Simulations","license":"","headline":"","cross_cats":[],"primary_cat":"astro-ph","authors_text":"Daniel J. Eisenstein, Piet Hut (IAS, Princeton)","submitted_at":"1997-12-16T01:53:41Z","abstract_excerpt":"We describe a new method (HOP) for identifying groups of particles in N-body simulations. Having assigned to every particle an estimate of its local density, we associate each particle with the densest of the N_hop particles nearest to it. Repeating this process allows us to trace a path, within the particle set itself, from each particle in the direction of increasing density. The path ends when it reaches a particle that is its own densest neighbor; all particles reaching the same such particle are identified as a group. Combined with an adaptive smoothing kernel for finding the densities, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"astro-ph/9712200","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/astro-ph/9712200/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":"astro-ph/9712200","created_at":"2026-07-04T17:25:18.520991+00:00"},{"alias_kind":"arxiv_version","alias_value":"astro-ph/9712200v1","created_at":"2026-07-04T17:25:18.520991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.astro-ph/9712200","created_at":"2026-07-04T17:25:18.520991+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT5HEGEYCPBD","created_at":"2026-07-04T17:25:18.520991+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT5HEGEYCPBDCDWQ","created_at":"2026-07-04T17:25:18.520991+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT5HEGEY","created_at":"2026-07-04T17:25:18.520991+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2606.08494","citing_title":"Virial-based extraction of structures in numerical simulations: The vibes tool","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11368","citing_title":"Non-linear Structure Formation in Planck+DESI Favoured Interacting Dark Energy Cosmologies","ref_index":99,"is_internal_anchor":true},{"citing_arxiv_id":"2606.13666","citing_title":"Centrally concentrated star formation in young clusters II: Jet feedback","ref_index":148,"is_internal_anchor":true},{"citing_arxiv_id":"2606.08494","citing_title":"Virial-based extraction of structures in numerical simulations: The vibes tool","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN","json":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN.json","graph_json":"https://pith.science/api/pith-number/WT5HEGEYCPBDCDWQ52Z23NAMYN/graph.json","events_json":"https://pith.science/api/pith-number/WT5HEGEYCPBDCDWQ52Z23NAMYN/events.json","paper":"https://pith.science/paper/WT5HEGEY"},"agent_actions":{"view_html":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN","download_json":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN.json","view_paper":"https://pith.science/paper/WT5HEGEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=astro-ph/9712200&json=true","fetch_graph":"https://pith.science/api/pith-number/WT5HEGEYCPBDCDWQ52Z23NAMYN/graph.json","fetch_events":"https://pith.science/api/pith-number/WT5HEGEYCPBDCDWQ52Z23NAMYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN/action/storage_attestation","attest_author":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN/action/author_attestation","sign_citation":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN/action/citation_signature","submit_replication":"https://pith.science/pith/WT5HEGEYCPBDCDWQ52Z23NAMYN/action/replication_record"}},"created_at":"2026-07-04T17:25:18.520991+00:00","updated_at":"2026-07-04T17:25:18.520991+00:00"}