{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BUH44TQYBRXJPKEF3CTUHG5YLU","short_pith_number":"pith:BUH44TQY","schema_version":"1.0","canonical_sha256":"0d0fce4e180c6e97a885d8a7439bb85d246d673837ecafda2ca9afb3b2ab0dc0","source":{"kind":"arxiv","id":"1108.3860","version":3},"attestation_state":"computed","paper":{"title":"A SWAR Approach to Counting Ones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holger Petersen","submitted_at":"2011-08-18T21:39:20Z","abstract_excerpt":"We investigate the complexity of algorithms counting ones in different sets of operations. With addition and logical operations (but no shift) $O(\\log^2(n))$ steps suffice to count ones. Parity can be computed with complexity $O(\\log(n))$, which is the same bound as for methods using shift-operations. If multiplication is available, a solution of time complexity $O(\\log^*(n))$ is possible improving the known bound $O(\\log\\log(n))$."},"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":"1108.3860","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-18T21:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"5864f02b2665308e776a14a373119bb617015dd4357c03e27748de957c376d87","abstract_canon_sha256":"efc1647bc553b92da6a642fe2b219decea676560754254e297233941bfd32036"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:29.092504Z","signature_b64":"cTOZhUjAHCiDcpoaf2QEnrCw9T6OU1cD4gRr0+HOqF09HU7MUUSz+Lxx9x3EwKlxf6R8rjn2Rum5SMnIg4j4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d0fce4e180c6e97a885d8a7439bb85d246d673837ecafda2ca9afb3b2ab0dc0","last_reissued_at":"2026-05-18T01:37:29.091862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:29.091862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A SWAR Approach to Counting Ones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holger Petersen","submitted_at":"2011-08-18T21:39:20Z","abstract_excerpt":"We investigate the complexity of algorithms counting ones in different sets of operations. With addition and logical operations (but no shift) $O(\\log^2(n))$ steps suffice to count ones. Parity can be computed with complexity $O(\\log(n))$, which is the same bound as for methods using shift-operations. If multiplication is available, a solution of time complexity $O(\\log^*(n))$ is possible improving the known bound $O(\\log\\log(n))$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3860","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":"1108.3860","created_at":"2026-05-18T01:37:29.091960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3860v3","created_at":"2026-05-18T01:37:29.091960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3860","created_at":"2026-05-18T01:37:29.091960+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUH44TQYBRXJ","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUH44TQYBRXJPKEF","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUH44TQY","created_at":"2026-05-18T12:26:24.575870+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/BUH44TQYBRXJPKEF3CTUHG5YLU","json":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU.json","graph_json":"https://pith.science/api/pith-number/BUH44TQYBRXJPKEF3CTUHG5YLU/graph.json","events_json":"https://pith.science/api/pith-number/BUH44TQYBRXJPKEF3CTUHG5YLU/events.json","paper":"https://pith.science/paper/BUH44TQY"},"agent_actions":{"view_html":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU","download_json":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU.json","view_paper":"https://pith.science/paper/BUH44TQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3860&json=true","fetch_graph":"https://pith.science/api/pith-number/BUH44TQYBRXJPKEF3CTUHG5YLU/graph.json","fetch_events":"https://pith.science/api/pith-number/BUH44TQYBRXJPKEF3CTUHG5YLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/action/storage_attestation","attest_author":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/action/author_attestation","sign_citation":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/action/citation_signature","submit_replication":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/action/replication_record"}},"created_at":"2026-05-18T01:37:29.091960+00:00","updated_at":"2026-05-18T01:37:29.091960+00:00"}