{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BUH44TQYBRXJPKEF3CTUHG5YLU","short_pith_number":"pith:BUH44TQY","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"},"canonical_sha256":"0d0fce4e180c6e97a885d8a7439bb85d246d673837ecafda2ca9afb3b2ab0dc0","source":{"kind":"arxiv","id":"1108.3860","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3860","created_at":"2026-05-18T01:37:29Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3860v3","created_at":"2026-05-18T01:37:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3860","created_at":"2026-05-18T01:37:29Z"},{"alias_kind":"pith_short_12","alias_value":"BUH44TQYBRXJ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BUH44TQYBRXJPKEF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BUH44TQY","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BUH44TQYBRXJPKEF3CTUHG5YLU","target":"record","payload":{"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"},"canonical_sha256":"0d0fce4e180c6e97a885d8a7439bb85d246d673837ecafda2ca9afb3b2ab0dc0","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"},"source_kind":"arxiv","source_id":"1108.3860","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yb+eG7hxHpSmNJA1r7WcE46IIFafY1N2we01WXrKvNFZP89d/EYboZj9CfYTEky6HBhG0hcyTbewh54Rz5RODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T03:30:19.371925Z"},"content_sha256":"37a4308534fad078d3bd534a282eded459a88997203bc870a699c56e249a804d","schema_version":"1.0","event_id":"sha256:37a4308534fad078d3bd534a282eded459a88997203bc870a699c56e249a804d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BUH44TQYBRXJPKEF3CTUHG5YLU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IqUWHMvKFuPCxpW6tHoiz4fr5itDkM1NxGb8MFsfvqRongotfzAdSrXtTTPVhBLIP/ewmA82/L6z0oNcnlXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T03:30:19.372256Z"},"content_sha256":"17321a5b6ca6fcdd13b1ff6f786c6f98791ad53c60fc46e0f746d77e64a9fc84","schema_version":"1.0","event_id":"sha256:17321a5b6ca6fcdd13b1ff6f786c6f98791ad53c60fc46e0f746d77e64a9fc84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/bundle.json","state_url":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T03:30:19Z","links":{"resolver":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU","bundle":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/bundle.json","state":"https://pith.science/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUH44TQYBRXJPKEF3CTUHG5YLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BUH44TQYBRXJPKEF3CTUHG5YLU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"efc1647bc553b92da6a642fe2b219decea676560754254e297233941bfd32036","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-18T21:39:20Z","title_canon_sha256":"5864f02b2665308e776a14a373119bb617015dd4357c03e27748de957c376d87"},"schema_version":"1.0","source":{"id":"1108.3860","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3860","created_at":"2026-05-18T01:37:29Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3860v3","created_at":"2026-05-18T01:37:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3860","created_at":"2026-05-18T01:37:29Z"},{"alias_kind":"pith_short_12","alias_value":"BUH44TQYBRXJ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BUH44TQYBRXJPKEF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BUH44TQY","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:17321a5b6ca6fcdd13b1ff6f786c6f98791ad53c60fc46e0f746d77e64a9fc84","target":"graph","created_at":"2026-05-18T01:37:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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))$.","authors_text":"Holger Petersen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-18T21:39:20Z","title":"A SWAR Approach to Counting Ones"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3860","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:37a4308534fad078d3bd534a282eded459a88997203bc870a699c56e249a804d","target":"record","created_at":"2026-05-18T01:37:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"efc1647bc553b92da6a642fe2b219decea676560754254e297233941bfd32036","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-18T21:39:20Z","title_canon_sha256":"5864f02b2665308e776a14a373119bb617015dd4357c03e27748de957c376d87"},"schema_version":"1.0","source":{"id":"1108.3860","kind":"arxiv","version":3}},"canonical_sha256":"0d0fce4e180c6e97a885d8a7439bb85d246d673837ecafda2ca9afb3b2ab0dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d0fce4e180c6e97a885d8a7439bb85d246d673837ecafda2ca9afb3b2ab0dc0","first_computed_at":"2026-05-18T01:37:29.091862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:29.091862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cTOZhUjAHCiDcpoaf2QEnrCw9T6OU1cD4gRr0+HOqF09HU7MUUSz+Lxx9x3EwKlxf6R8rjn2Rum5SMnIg4j4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:29.092504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3860","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37a4308534fad078d3bd534a282eded459a88997203bc870a699c56e249a804d","sha256:17321a5b6ca6fcdd13b1ff6f786c6f98791ad53c60fc46e0f746d77e64a9fc84"],"state_sha256":"c2bcc724bd3661976c0a5af9772fc47742ceb65d01b7e857ae53705490916f5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgYaJ9aGRblXLR/CbjIzHOurX+Nwak6r/+K4FcU9bfnOTKrGlNZ9flxS/tBtb8t7eYjZUWympBgsRXn7r+l8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T03:30:19.374085Z","bundle_sha256":"0f3bf9adcdd0ad8967eb18985128955e2d52d782ff6f319901b84816b8ab7dc1"}}