{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YLICLNZBBO4NT764SCCUDHZCXF","short_pith_number":"pith:YLICLNZB","canonical_record":{"source":{"id":"1612.01263","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-05T07:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"617af20fbc5ae37c74f95a90f900224c6d157974d952f86c96ee6bff1566faa2","abstract_canon_sha256":"d4ec9aaab62f818d83e4ae63afbaec1e4bd374c79adc205de1583d6a6773bbda"},"schema_version":"1.0"},"canonical_sha256":"c2d025b7210bb8d9ffdc9085419f22b942927e30c7d2158e31c8754ffded674a","source":{"kind":"arxiv","id":"1612.01263","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01263","created_at":"2026-05-18T00:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01263v4","created_at":"2026-05-18T00:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01263","created_at":"2026-05-18T00:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"YLICLNZBBO4N","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YLICLNZBBO4NT764","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YLICLNZB","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YLICLNZBBO4NT764SCCUDHZCXF","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01263","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-05T07:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"617af20fbc5ae37c74f95a90f900224c6d157974d952f86c96ee6bff1566faa2","abstract_canon_sha256":"d4ec9aaab62f818d83e4ae63afbaec1e4bd374c79adc205de1583d6a6773bbda"},"schema_version":"1.0"},"canonical_sha256":"c2d025b7210bb8d9ffdc9085419f22b942927e30c7d2158e31c8754ffded674a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:02.009108Z","signature_b64":"mZy3yv9w1FO4QVKTQpJcNGd0HcM4lLghWZaItNXqmHTgfCHnSxBuuOSIxwwITqqdyuhykrkq+9iGgDMGQ9qnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2d025b7210bb8d9ffdc9085419f22b942927e30c7d2158e31c8754ffded674a","last_reissued_at":"2026-05-18T00:17:02.008443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:02.008443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01263","source_version":4,"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:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7si4Ok5zWMjk61kdwjW/Qv3+VnmyvA0HJisMQkYoLS22LYg943+YsT1CMiwSQ2wKHULdeHt3mBJujc/5hI0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:56:05.238933Z"},"content_sha256":"b99923be046fc46fa2e79b6f92fdd4d33281485347d5ed0f1f5e778e1fbf47cf","schema_version":"1.0","event_id":"sha256:b99923be046fc46fa2e79b6f92fdd4d33281485347d5ed0f1f5e778e1fbf47cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YLICLNZBBO4NT764SCCUDHZCXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Quantified Bit-Vector Arithmetic with Binary Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jan Strej\\v{c}ek, Martin Jon\\'a\\v{s}","submitted_at":"2016-12-05T07:41:08Z","abstract_excerpt":"We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and to be NEXPTIME-hard. We show that this problem is complete for the complexity class AEXP(poly) -- the class of problems decidable by an alternating Turing machine using exponential time, but only a polynomial number of alternations between existential and universal states."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01263","kind":"arxiv","version":4},"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:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SRSTMThiociLhEHwgVYpK1lH+9PLm/CP8tfoVZAh4hlVF3wLvp+dTdlGsIU3uLKLz0+P0e9OdCn5eOJWkPzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:56:05.239618Z"},"content_sha256":"269cfcecb45ac492f2b3a311d7d1a8a38def58829cb469e3f14c0b7d1df5aa20","schema_version":"1.0","event_id":"sha256:269cfcecb45ac492f2b3a311d7d1a8a38def58829cb469e3f14c0b7d1df5aa20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLICLNZBBO4NT764SCCUDHZCXF/bundle.json","state_url":"https://pith.science/pith/YLICLNZBBO4NT764SCCUDHZCXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLICLNZBBO4NT764SCCUDHZCXF/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-30T03:56:05Z","links":{"resolver":"https://pith.science/pith/YLICLNZBBO4NT764SCCUDHZCXF","bundle":"https://pith.science/pith/YLICLNZBBO4NT764SCCUDHZCXF/bundle.json","state":"https://pith.science/pith/YLICLNZBBO4NT764SCCUDHZCXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLICLNZBBO4NT764SCCUDHZCXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YLICLNZBBO4NT764SCCUDHZCXF","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":"d4ec9aaab62f818d83e4ae63afbaec1e4bd374c79adc205de1583d6a6773bbda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-05T07:41:08Z","title_canon_sha256":"617af20fbc5ae37c74f95a90f900224c6d157974d952f86c96ee6bff1566faa2"},"schema_version":"1.0","source":{"id":"1612.01263","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01263","created_at":"2026-05-18T00:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01263v4","created_at":"2026-05-18T00:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01263","created_at":"2026-05-18T00:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"YLICLNZBBO4N","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YLICLNZBBO4NT764","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YLICLNZB","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:269cfcecb45ac492f2b3a311d7d1a8a38def58829cb469e3f14c0b7d1df5aa20","target":"graph","created_at":"2026-05-18T00:17:02Z","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 study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and to be NEXPTIME-hard. We show that this problem is complete for the complexity class AEXP(poly) -- the class of problems decidable by an alternating Turing machine using exponential time, but only a polynomial number of alternations between existential and universal states.","authors_text":"Jan Strej\\v{c}ek, Martin Jon\\'a\\v{s}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-05T07:41:08Z","title":"On the Complexity of the Quantified Bit-Vector Arithmetic with Binary Encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01263","kind":"arxiv","version":4},"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:b99923be046fc46fa2e79b6f92fdd4d33281485347d5ed0f1f5e778e1fbf47cf","target":"record","created_at":"2026-05-18T00:17:02Z","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":"d4ec9aaab62f818d83e4ae63afbaec1e4bd374c79adc205de1583d6a6773bbda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-05T07:41:08Z","title_canon_sha256":"617af20fbc5ae37c74f95a90f900224c6d157974d952f86c96ee6bff1566faa2"},"schema_version":"1.0","source":{"id":"1612.01263","kind":"arxiv","version":4}},"canonical_sha256":"c2d025b7210bb8d9ffdc9085419f22b942927e30c7d2158e31c8754ffded674a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2d025b7210bb8d9ffdc9085419f22b942927e30c7d2158e31c8754ffded674a","first_computed_at":"2026-05-18T00:17:02.008443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:02.008443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mZy3yv9w1FO4QVKTQpJcNGd0HcM4lLghWZaItNXqmHTgfCHnSxBuuOSIxwwITqqdyuhykrkq+9iGgDMGQ9qnDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:02.009108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01263","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b99923be046fc46fa2e79b6f92fdd4d33281485347d5ed0f1f5e778e1fbf47cf","sha256:269cfcecb45ac492f2b3a311d7d1a8a38def58829cb469e3f14c0b7d1df5aa20"],"state_sha256":"ea208832eab4db73919efcd9115acb41b3643747f5c7b84fa2423546b5e3beca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rNUyNyoE57K5bzIFk3fd3P+iniPzkASbQntl4l8m7CKeA+6visdMGrZlWonQCwSpGC4DUxe9IPgqizHq1V6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:56:05.243086Z","bundle_sha256":"b458a0428b51d525bbc5ca2d755dd5e7136a25a5c130b73988a3e224c6698633"}}