{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4YAZODSLTDUJLSNGCDQWD3JMGO","short_pith_number":"pith:4YAZODSL","schema_version":"1.0","canonical_sha256":"e601970e4b98e895c9a610e161ed2c33bd452fa0ee864bec434f5ee258f6a423","source":{"kind":"arxiv","id":"1708.01873","version":1},"attestation_state":"computed","paper":{"title":"Practically efficient methods for performing bit-reversed permutation in C++11 on the x86-64 architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Boran Adas, Christian Knauth, Daniel Whitfield, Lydia Ickler, Oliver Serang, Tim Conrad, Xuesong Wang","submitted_at":"2017-08-02T19:12:50Z","abstract_excerpt":"The bit-reversed permutation is a famous task in signal processing and is key to efficient implementation of the fast Fourier transform. This paper presents optimized C++11 implementations of five extant methods for computing the bit-reversed permutation: Stockham auto-sort, naive bitwise swapping, swapping via a table of reversed bytes, local pairwise swapping of bits, and swapping via a cache-localized matrix buffer. Three new strategies for performing the bit-reversed permutation in C++11 are proposed: an inductive method using the bitwise XOR operation, a template-recursive closed form, an"},"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":"1708.01873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-02T19:12:50Z","cross_cats_sorted":[],"title_canon_sha256":"46ed12daeb91810cad7594ba08cd5e1f72592482117e7e23b9addf84b757c4d3","abstract_canon_sha256":"0270ded4e398a11b8b2f6ea779050cf99381666a6d601f0b287fef38c69c3ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:32.897595Z","signature_b64":"CuQAJEOBbiuZ6sYFRasm5WLK1cC1gi2di2CU/p7VQLueUF9mkUBjh3yf42GzUwJ71fJbD64tOOEpTqjBMz/iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e601970e4b98e895c9a610e161ed2c33bd452fa0ee864bec434f5ee258f6a423","last_reissued_at":"2026-05-18T00:38:32.897112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:32.897112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practically efficient methods for performing bit-reversed permutation in C++11 on the x86-64 architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Boran Adas, Christian Knauth, Daniel Whitfield, Lydia Ickler, Oliver Serang, Tim Conrad, Xuesong Wang","submitted_at":"2017-08-02T19:12:50Z","abstract_excerpt":"The bit-reversed permutation is a famous task in signal processing and is key to efficient implementation of the fast Fourier transform. This paper presents optimized C++11 implementations of five extant methods for computing the bit-reversed permutation: Stockham auto-sort, naive bitwise swapping, swapping via a table of reversed bytes, local pairwise swapping of bits, and swapping via a cache-localized matrix buffer. Three new strategies for performing the bit-reversed permutation in C++11 are proposed: an inductive method using the bitwise XOR operation, a template-recursive closed form, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01873","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":"1708.01873","created_at":"2026-05-18T00:38:32.897173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01873v1","created_at":"2026-05-18T00:38:32.897173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01873","created_at":"2026-05-18T00:38:32.897173+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YAZODSLTDUJ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YAZODSLTDUJLSNG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YAZODSL","created_at":"2026-05-18T12:31:00.734936+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/4YAZODSLTDUJLSNGCDQWD3JMGO","json":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO.json","graph_json":"https://pith.science/api/pith-number/4YAZODSLTDUJLSNGCDQWD3JMGO/graph.json","events_json":"https://pith.science/api/pith-number/4YAZODSLTDUJLSNGCDQWD3JMGO/events.json","paper":"https://pith.science/paper/4YAZODSL"},"agent_actions":{"view_html":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO","download_json":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO.json","view_paper":"https://pith.science/paper/4YAZODSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01873&json=true","fetch_graph":"https://pith.science/api/pith-number/4YAZODSLTDUJLSNGCDQWD3JMGO/graph.json","fetch_events":"https://pith.science/api/pith-number/4YAZODSLTDUJLSNGCDQWD3JMGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/action/storage_attestation","attest_author":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/action/author_attestation","sign_citation":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/action/citation_signature","submit_replication":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/action/replication_record"}},"created_at":"2026-05-18T00:38:32.897173+00:00","updated_at":"2026-05-18T00:38:32.897173+00:00"}