{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KNP5QAMWVSWLCKYCZCDRQOMYUY","short_pith_number":"pith:KNP5QAMW","schema_version":"1.0","canonical_sha256":"535fd80196acacb12b02c887183998a627cd1c3033c23800ae0206fd0d05830b","source":{"kind":"arxiv","id":"1607.03224","version":2},"attestation_state":"computed","paper":{"title":"A fast algorithm for identifying Friends-of-Friends halos","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"astro-ph.IM","authors_text":"Chirag Modi, Yu Feng","submitted_at":"2016-07-12T03:24:53Z","abstract_excerpt":"We describe a simple and fast algorithm for identifying friends-of-friends features and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high over-density regions. We define our algorithm formally based on pair enumeration, a problem that has been heavily studied in fast 2-point correlation codes and our reference implementation employs a dual KD-tree correlation function code. We construct features in a hierarchical tree structure, and use a splay operation to reduce the average cost of identifying the ro"},"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":"1607.03224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2016-07-12T03:24:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ae96aaa8f86aa0762fb4b5cf4e9952ea5959a3edaef13dfa9db9c55cd4f5cbe2","abstract_canon_sha256":"33148c280e0162da5c79625d1635841ce086d12169814f804b1c69920907058d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:18.470779Z","signature_b64":"1n8hjcx/X6Bj0nWvgpnULD7cl/8ENK8pumBv0MbfiJsnQGjWLYtoC8YGfwJAgeyglOP0k0OU8YKZz8xeUlu0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"535fd80196acacb12b02c887183998a627cd1c3033c23800ae0206fd0d05830b","last_reissued_at":"2026-05-18T00:43:18.470028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:18.470028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast algorithm for identifying Friends-of-Friends halos","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"astro-ph.IM","authors_text":"Chirag Modi, Yu Feng","submitted_at":"2016-07-12T03:24:53Z","abstract_excerpt":"We describe a simple and fast algorithm for identifying friends-of-friends features and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high over-density regions. We define our algorithm formally based on pair enumeration, a problem that has been heavily studied in fast 2-point correlation codes and our reference implementation employs a dual KD-tree correlation function code. We construct features in a hierarchical tree structure, and use a splay operation to reduce the average cost of identifying the ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03224","kind":"arxiv","version":2},"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":"1607.03224","created_at":"2026-05-18T00:43:18.470126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03224v2","created_at":"2026-05-18T00:43:18.470126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03224","created_at":"2026-05-18T00:43:18.470126+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNP5QAMWVSWL","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNP5QAMWVSWLCKYC","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNP5QAMW","created_at":"2026-05-18T12:30:25.849896+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/KNP5QAMWVSWLCKYCZCDRQOMYUY","json":"https://pith.science/pith/KNP5QAMWVSWLCKYCZCDRQOMYUY.json","graph_json":"https://pith.science/api/pith-number/KNP5QAMWVSWLCKYCZCDRQOMYUY/graph.json","events_json":"https://pith.science/api/pith-number/KNP5QAMWVSWLCKYCZCDRQOMYUY/events.json","paper":"https://pith.science/paper/KNP5QAMW"},"agent_actions":{"view_html":"https://pith.science/pith/KNP5QAMWVSWLCKYCZCDRQOMYUY","download_json":"https://pith.science/pith/KNP5QAMWVSWLCKYCZCDRQOMYUY.json","view_paper":"https://pith.science/paper/KNP5QAMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03224&json=true","fetch_graph":"https://pith.science/api/pith-number/KNP5QAMWVSWLCKYCZCDRQOMYUY/graph.json","fetch_events":"https://pith.science/api/pith-number/KNP5QAMWVSWLCKYCZCDRQOMYUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNP5QAMWVSWLCKYCZCDRQOMYUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNP5QAMWVSWLCKYCZCDRQOMYUY/action/storage_attestation","attest_author":"https://pith.science/pith/KNP5QAMWVSWLCKYCZCDRQOMYUY/action/author_attestation","sign_citation":"https://pith.science/pith/KNP5QAMWVSWLCKYCZCDRQOMYUY/action/citation_signature","submit_replication":"https://pith.science/pith/KNP5QAMWVSWLCKYCZCDRQOMYUY/action/replication_record"}},"created_at":"2026-05-18T00:43:18.470126+00:00","updated_at":"2026-05-18T00:43:18.470126+00:00"}