{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4YAZODSLTDUJLSNGCDQWD3JMGO","short_pith_number":"pith:4YAZODSL","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"},"canonical_sha256":"e601970e4b98e895c9a610e161ed2c33bd452fa0ee864bec434f5ee258f6a423","source":{"kind":"arxiv","id":"1708.01873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01873","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01873v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01873","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"4YAZODSLTDUJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4YAZODSLTDUJLSNG","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4YAZODSL","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4YAZODSLTDUJLSNGCDQWD3JMGO","target":"record","payload":{"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"},"canonical_sha256":"e601970e4b98e895c9a610e161ed2c33bd452fa0ee864bec434f5ee258f6a423","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"},"source_kind":"arxiv","source_id":"1708.01873","source_version":1,"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-18T00:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J95EnzVcv5fGC/t67a1XknV4NtDVi7aBgfdrFp99VWoMSR+vF0ogfsz6Icgp6oQtJG3pCBfZxJGIG33B80hhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:12:30.455862Z"},"content_sha256":"57b0b750e96179ff7f4c8d36d0e1e409480b2a0d2fb3ea921ac7c900e2e67c3e","schema_version":"1.0","event_id":"sha256:57b0b750e96179ff7f4c8d36d0e1e409480b2a0d2fb3ea921ac7c900e2e67c3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4YAZODSLTDUJLSNGCDQWD3JMGO","target":"graph","payload":{"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"},"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-18T00:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRFx1nV49E9DYiSV5C5uD8CwqPC+P0/8SGD9ZJYwZ/BRqs6SKPQEpmbhhVkoYNpnVVRb1wMqN4w+rDSozbviBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:12:30.456224Z"},"content_sha256":"c85ff6eff016c38e200a9eadab1cf7571f9d34ce3166622a6c211225045c7008","schema_version":"1.0","event_id":"sha256:c85ff6eff016c38e200a9eadab1cf7571f9d34ce3166622a6c211225045c7008"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/bundle.json","state_url":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/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-05-30T16:12:30Z","links":{"resolver":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO","bundle":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/bundle.json","state":"https://pith.science/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YAZODSLTDUJLSNGCDQWD3JMGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4YAZODSLTDUJLSNGCDQWD3JMGO","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":"0270ded4e398a11b8b2f6ea779050cf99381666a6d601f0b287fef38c69c3ee4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-02T19:12:50Z","title_canon_sha256":"46ed12daeb91810cad7594ba08cd5e1f72592482117e7e23b9addf84b757c4d3"},"schema_version":"1.0","source":{"id":"1708.01873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01873","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01873v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01873","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"4YAZODSLTDUJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4YAZODSLTDUJLSNG","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4YAZODSL","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:c85ff6eff016c38e200a9eadab1cf7571f9d34ce3166622a6c211225045c7008","target":"graph","created_at":"2026-05-18T00:38:32Z","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":"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","authors_text":"Boran Adas, Christian Knauth, Daniel Whitfield, Lydia Ickler, Oliver Serang, Tim Conrad, Xuesong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-02T19:12:50Z","title":"Practically efficient methods for performing bit-reversed permutation in C++11 on the x86-64 architecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01873","kind":"arxiv","version":1},"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:57b0b750e96179ff7f4c8d36d0e1e409480b2a0d2fb3ea921ac7c900e2e67c3e","target":"record","created_at":"2026-05-18T00:38:32Z","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":"0270ded4e398a11b8b2f6ea779050cf99381666a6d601f0b287fef38c69c3ee4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-02T19:12:50Z","title_canon_sha256":"46ed12daeb91810cad7594ba08cd5e1f72592482117e7e23b9addf84b757c4d3"},"schema_version":"1.0","source":{"id":"1708.01873","kind":"arxiv","version":1}},"canonical_sha256":"e601970e4b98e895c9a610e161ed2c33bd452fa0ee864bec434f5ee258f6a423","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e601970e4b98e895c9a610e161ed2c33bd452fa0ee864bec434f5ee258f6a423","first_computed_at":"2026-05-18T00:38:32.897112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:32.897112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CuQAJEOBbiuZ6sYFRasm5WLK1cC1gi2di2CU/p7VQLueUF9mkUBjh3yf42GzUwJ71fJbD64tOOEpTqjBMz/iBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:32.897595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57b0b750e96179ff7f4c8d36d0e1e409480b2a0d2fb3ea921ac7c900e2e67c3e","sha256:c85ff6eff016c38e200a9eadab1cf7571f9d34ce3166622a6c211225045c7008"],"state_sha256":"e311cfba19ff9761d08ee2dbba57b3828577658a97d2a29377b70f3f8e719f12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4cC23u31bL9kpaQMEdyAgj/pz7b0H2d4bidkdXbD4JqK6nbKQy1G+/KxmQAzllRbfsRyehWcRRqdMRlj9OxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:12:30.458271Z","bundle_sha256":"c465cb74eaea17e0daaa4e67cc49dc2a1d40e2ee2d421317d48549935f42a1c9"}}