{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7AXUVGSN2LWV6K642PTFMIGAWV","short_pith_number":"pith:7AXUVGSN","schema_version":"1.0","canonical_sha256":"f82f4a9a4dd2ed5f2bdcd3e65620c0b57cdba90963e3dd2ee714abc403aeeccc","source":{"kind":"arxiv","id":"1301.5468","version":2},"attestation_state":"computed","paper":{"title":"Broadword Implementation of Parenthesis Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastiano Vigna","submitted_at":"2013-01-23T11:15:11Z","abstract_excerpt":"We continue the line of research started in \"Broadword Implementation of Rank/Select Queries\" proposing broadword (a.k.a. SWAR, \"SIMD Within A Register\") algorithms for finding matching closed parentheses and the k-th far closed parenthesis. Our algorithms work in time O(log w) on a word of w bits, and contain no branch and no test instruction. On 64-bit (and wider) architectures, these algorithms make it possible to avoid costly tabulations, while providing a very significant speedup with respect to for-loop implementations."},"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":"1301.5468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-23T11:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"5f91ce0d21a61506cacde3dfedcf493f8af592cc15fd8a48318f5f10040fab36","abstract_canon_sha256":"206b4ba263c856864467109be750cf81b89d9a7cc03d3492f87530ea1398109f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:37.839806Z","signature_b64":"46SK0XBzXQPJ3f5+S76a0C0xSVKuIJZ9JNJ4FISMCtkG0lydq8PpcxZKa32ffABBf5qpsKs8rIMfD4AaUGvIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f82f4a9a4dd2ed5f2bdcd3e65620c0b57cdba90963e3dd2ee714abc403aeeccc","last_reissued_at":"2026-05-18T03:35:37.838963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:37.838963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Broadword Implementation of Parenthesis Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastiano Vigna","submitted_at":"2013-01-23T11:15:11Z","abstract_excerpt":"We continue the line of research started in \"Broadword Implementation of Rank/Select Queries\" proposing broadword (a.k.a. SWAR, \"SIMD Within A Register\") algorithms for finding matching closed parentheses and the k-th far closed parenthesis. Our algorithms work in time O(log w) on a word of w bits, and contain no branch and no test instruction. On 64-bit (and wider) architectures, these algorithms make it possible to avoid costly tabulations, while providing a very significant speedup with respect to for-loop implementations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5468","kind":"arxiv","version":2},"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":"1301.5468","created_at":"2026-05-18T03:35:37.839098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5468v2","created_at":"2026-05-18T03:35:37.839098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5468","created_at":"2026-05-18T03:35:37.839098+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AXUVGSN2LWV","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AXUVGSN2LWV6K64","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AXUVGSN","created_at":"2026-05-18T12:27:36.564083+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/7AXUVGSN2LWV6K642PTFMIGAWV","json":"https://pith.science/pith/7AXUVGSN2LWV6K642PTFMIGAWV.json","graph_json":"https://pith.science/api/pith-number/7AXUVGSN2LWV6K642PTFMIGAWV/graph.json","events_json":"https://pith.science/api/pith-number/7AXUVGSN2LWV6K642PTFMIGAWV/events.json","paper":"https://pith.science/paper/7AXUVGSN"},"agent_actions":{"view_html":"https://pith.science/pith/7AXUVGSN2LWV6K642PTFMIGAWV","download_json":"https://pith.science/pith/7AXUVGSN2LWV6K642PTFMIGAWV.json","view_paper":"https://pith.science/paper/7AXUVGSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5468&json=true","fetch_graph":"https://pith.science/api/pith-number/7AXUVGSN2LWV6K642PTFMIGAWV/graph.json","fetch_events":"https://pith.science/api/pith-number/7AXUVGSN2LWV6K642PTFMIGAWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AXUVGSN2LWV6K642PTFMIGAWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AXUVGSN2LWV6K642PTFMIGAWV/action/storage_attestation","attest_author":"https://pith.science/pith/7AXUVGSN2LWV6K642PTFMIGAWV/action/author_attestation","sign_citation":"https://pith.science/pith/7AXUVGSN2LWV6K642PTFMIGAWV/action/citation_signature","submit_replication":"https://pith.science/pith/7AXUVGSN2LWV6K642PTFMIGAWV/action/replication_record"}},"created_at":"2026-05-18T03:35:37.839098+00:00","updated_at":"2026-05-18T03:35:37.839098+00:00"}