{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OWIFHACGW5DLSQWZQLG7R5PJDT","short_pith_number":"pith:OWIFHACG","schema_version":"1.0","canonical_sha256":"7590538046b746b942d982cdf8f5e91cf861bfb7229f60b12aa7d78d84c0d9f7","source":{"kind":"arxiv","id":"1611.07612","version":9},"attestation_state":"computed","paper":{"title":"Faster Population Counts Using AVX2 Instructions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lemire, Nathan Kurz, Wojciech Mu{\\l}a","submitted_at":"2016-11-23T02:47:50Z","abstract_excerpt":"Counting the number of ones in a binary stream is a common operation in database, information-retrieval, cryptographic and machine-learning applications. Most processors have dedicated instructions to count the number of ones in a word (e.g., popcnt on x64 processors). Maybe surprisingly, we show that a vectorized approach using SIMD instructions can be twice as fast as using the dedicated instructions on recent Intel processors. The benefits can be even greater for applications such as similarity measures (e.g., the Jaccard index) that require additional Boolean operations. Our approach has b"},"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":"1611.07612","kind":"arxiv","version":9},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-11-23T02:47:50Z","cross_cats_sorted":[],"title_canon_sha256":"4e9240613c0ac9736c0439bb920b5a17bc4274fe1692433d0418a5c8c4f89cd7","abstract_canon_sha256":"be43c456f8af6fcf1b9ea1917e0a6a1ffcf191ebeb3fcc6dfcdb2d35631e1733"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:26.680586Z","signature_b64":"V4GGWq+2ODpoDjvYmReV4mjCG4PUiOtmNO0kaBmtW2Lg/mlmkk7Aa50CogI5mw8/3zYngKKi9grS/8nzYotaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7590538046b746b942d982cdf8f5e91cf861bfb7229f60b12aa7d78d84c0d9f7","last_reissued_at":"2026-05-18T00:06:26.679802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:26.679802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Population Counts Using AVX2 Instructions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lemire, Nathan Kurz, Wojciech Mu{\\l}a","submitted_at":"2016-11-23T02:47:50Z","abstract_excerpt":"Counting the number of ones in a binary stream is a common operation in database, information-retrieval, cryptographic and machine-learning applications. Most processors have dedicated instructions to count the number of ones in a word (e.g., popcnt on x64 processors). Maybe surprisingly, we show that a vectorized approach using SIMD instructions can be twice as fast as using the dedicated instructions on recent Intel processors. The benefits can be even greater for applications such as similarity measures (e.g., the Jaccard index) that require additional Boolean operations. Our approach has b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07612","kind":"arxiv","version":9},"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":"1611.07612","created_at":"2026-05-18T00:06:26.679941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07612v9","created_at":"2026-05-18T00:06:26.679941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07612","created_at":"2026-05-18T00:06:26.679941+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWIFHACGW5DL","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWIFHACGW5DLSQWZ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWIFHACG","created_at":"2026-05-18T12:30:36.002864+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/OWIFHACGW5DLSQWZQLG7R5PJDT","json":"https://pith.science/pith/OWIFHACGW5DLSQWZQLG7R5PJDT.json","graph_json":"https://pith.science/api/pith-number/OWIFHACGW5DLSQWZQLG7R5PJDT/graph.json","events_json":"https://pith.science/api/pith-number/OWIFHACGW5DLSQWZQLG7R5PJDT/events.json","paper":"https://pith.science/paper/OWIFHACG"},"agent_actions":{"view_html":"https://pith.science/pith/OWIFHACGW5DLSQWZQLG7R5PJDT","download_json":"https://pith.science/pith/OWIFHACGW5DLSQWZQLG7R5PJDT.json","view_paper":"https://pith.science/paper/OWIFHACG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07612&json=true","fetch_graph":"https://pith.science/api/pith-number/OWIFHACGW5DLSQWZQLG7R5PJDT/graph.json","fetch_events":"https://pith.science/api/pith-number/OWIFHACGW5DLSQWZQLG7R5PJDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWIFHACGW5DLSQWZQLG7R5PJDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWIFHACGW5DLSQWZQLG7R5PJDT/action/storage_attestation","attest_author":"https://pith.science/pith/OWIFHACGW5DLSQWZQLG7R5PJDT/action/author_attestation","sign_citation":"https://pith.science/pith/OWIFHACGW5DLSQWZQLG7R5PJDT/action/citation_signature","submit_replication":"https://pith.science/pith/OWIFHACGW5DLSQWZQLG7R5PJDT/action/replication_record"}},"created_at":"2026-05-18T00:06:26.679941+00:00","updated_at":"2026-05-18T00:06:26.679941+00:00"}