{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IXFY2SI27VUI555L4QK22VLGR4","short_pith_number":"pith:IXFY2SI2","schema_version":"1.0","canonical_sha256":"45cb8d491afd688ef7abe415ad55668f1b3ee4150f192e14db861a5b23681046","source":{"kind":"arxiv","id":"1506.03473","version":1},"attestation_state":"computed","paper":{"title":"A Non-Oblivious Reduction of Counting Ones to Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Holger Petersen","submitted_at":"2015-06-10T20:39:32Z","abstract_excerpt":"An algorithm counting the number of ones in a binary word is presented running in time $O(\\log\\log b)$ where $b$ is the number of ones. The operations available include bit-wise logical operations and multiplication."},"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":"1506.03473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-10T20:39:32Z","cross_cats_sorted":[],"title_canon_sha256":"133a6e14b6f74589ea314ab23ae0cd05eebd3f25ce610ce4e5029cf5ce04d8e9","abstract_canon_sha256":"5806a7982ad41342276ace74e8def402023f7b060cea2a5859c459e34f468638"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:04.031697Z","signature_b64":"n+tmSsjSxCmgibGr3Mbh8L5Mpnp25qOKA6PiqKFjSzSs0nYng+xpFyDwXB0kzoE596fmyU8A60+AgzSlWHxBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45cb8d491afd688ef7abe415ad55668f1b3ee4150f192e14db861a5b23681046","last_reissued_at":"2026-05-18T01:53:04.031245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:04.031245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Non-Oblivious Reduction of Counting Ones to Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Holger Petersen","submitted_at":"2015-06-10T20:39:32Z","abstract_excerpt":"An algorithm counting the number of ones in a binary word is presented running in time $O(\\log\\log b)$ where $b$ is the number of ones. The operations available include bit-wise logical operations and multiplication."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03473","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":""},"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":"1506.03473","created_at":"2026-05-18T01:53:04.031309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03473v1","created_at":"2026-05-18T01:53:04.031309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03473","created_at":"2026-05-18T01:53:04.031309+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXFY2SI27VUI","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXFY2SI27VUI555L","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXFY2SI2","created_at":"2026-05-18T12:29:27.538025+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/IXFY2SI27VUI555L4QK22VLGR4","json":"https://pith.science/pith/IXFY2SI27VUI555L4QK22VLGR4.json","graph_json":"https://pith.science/api/pith-number/IXFY2SI27VUI555L4QK22VLGR4/graph.json","events_json":"https://pith.science/api/pith-number/IXFY2SI27VUI555L4QK22VLGR4/events.json","paper":"https://pith.science/paper/IXFY2SI2"},"agent_actions":{"view_html":"https://pith.science/pith/IXFY2SI27VUI555L4QK22VLGR4","download_json":"https://pith.science/pith/IXFY2SI27VUI555L4QK22VLGR4.json","view_paper":"https://pith.science/paper/IXFY2SI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03473&json=true","fetch_graph":"https://pith.science/api/pith-number/IXFY2SI27VUI555L4QK22VLGR4/graph.json","fetch_events":"https://pith.science/api/pith-number/IXFY2SI27VUI555L4QK22VLGR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXFY2SI27VUI555L4QK22VLGR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXFY2SI27VUI555L4QK22VLGR4/action/storage_attestation","attest_author":"https://pith.science/pith/IXFY2SI27VUI555L4QK22VLGR4/action/author_attestation","sign_citation":"https://pith.science/pith/IXFY2SI27VUI555L4QK22VLGR4/action/citation_signature","submit_replication":"https://pith.science/pith/IXFY2SI27VUI555L4QK22VLGR4/action/replication_record"}},"created_at":"2026-05-18T01:53:04.031309+00:00","updated_at":"2026-05-18T01:53:04.031309+00:00"}