{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XWZJSJLNKIVKDJMTB7VACW2TLR","short_pith_number":"pith:XWZJSJLN","canonical_record":{"source":{"id":"1608.00417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-01T13:20:16Z","cross_cats_sorted":["cs.FL","quant-ph"],"title_canon_sha256":"4745ae7a45961a829f32fc2acf1e8f5dea15c7e7115a7255d6757785a36a05bd","abstract_canon_sha256":"331577dfbc360a787225b3017bab005ea864c03eba7c0defa5ca1f1833fed8c2"},"schema_version":"1.0"},"canonical_sha256":"bdb299256d522aa1a5930fea015b535c6c31f7dc8d59085e80a8214718b5e15b","source":{"kind":"arxiv","id":"1608.00417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00417","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00417v1","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00417","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"XWZJSJLNKIVK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XWZJSJLNKIVKDJMT","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XWZJSJLN","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XWZJSJLNKIVKDJMTB7VACW2TLR","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-01T13:20:16Z","cross_cats_sorted":["cs.FL","quant-ph"],"title_canon_sha256":"4745ae7a45961a829f32fc2acf1e8f5dea15c7e7115a7255d6757785a36a05bd","abstract_canon_sha256":"331577dfbc360a787225b3017bab005ea864c03eba7c0defa5ca1f1833fed8c2"},"schema_version":"1.0"},"canonical_sha256":"bdb299256d522aa1a5930fea015b535c6c31f7dc8d59085e80a8214718b5e15b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:11.823774Z","signature_b64":"CmuHQqx413KrhYv1Lf1c9dbRp++VChfHSuS/qoF5GvXXKSY8ZaSesymQPpS1fMm2+6rRlqCAPigNb3Lxirr2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdb299256d522aa1a5930fea015b535c6c31f7dc8d59085e80a8214718b5e15b","last_reissued_at":"2026-05-18T01:10:11.823190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:11.823190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00417","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-18T01:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHF287FMjSqc+ZeAhnYlZVUjQ4Dpkr9uKJF81CwsYwURQcYeuvhwHkzpD58xJujq8DOcsN1bQPPFuMsIAP7UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:03:46.697692Z"},"content_sha256":"5bd5288100c3970e23aa446c053160c13f4f7076a81884672805a589c209d494","schema_version":"1.0","event_id":"sha256:5bd5288100c3970e23aa446c053160c13f4f7076a81884672805a589c209d494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XWZJSJLNKIVKDJMTB7VACW2TLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uncountable classical and quantum complexity classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","quant-ph"],"primary_cat":"cs.CC","authors_text":"Abuzer Yakary{\\i}lmaz, Maksims Dimitrijevs","submitted_at":"2016-08-01T13:20:16Z","abstract_excerpt":"Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakary\\i lmaz 2014, arXiv:1411.7647). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For bina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00417","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-18T01:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lj5QcnI/DaV+37eYuy27BTg9ShFICVPqBGq+/mvcOE6dTMr/vOkTZxgqNlDCREaCXFoXZMpRGEhDm0TlEA8mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:03:46.698042Z"},"content_sha256":"ff676e91c53405bf06b8ae7f92df68abc68c3932639613ab07c95962d83b3f59","schema_version":"1.0","event_id":"sha256:ff676e91c53405bf06b8ae7f92df68abc68c3932639613ab07c95962d83b3f59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWZJSJLNKIVKDJMTB7VACW2TLR/bundle.json","state_url":"https://pith.science/pith/XWZJSJLNKIVKDJMTB7VACW2TLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWZJSJLNKIVKDJMTB7VACW2TLR/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-06-26T15:03:46Z","links":{"resolver":"https://pith.science/pith/XWZJSJLNKIVKDJMTB7VACW2TLR","bundle":"https://pith.science/pith/XWZJSJLNKIVKDJMTB7VACW2TLR/bundle.json","state":"https://pith.science/pith/XWZJSJLNKIVKDJMTB7VACW2TLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWZJSJLNKIVKDJMTB7VACW2TLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XWZJSJLNKIVKDJMTB7VACW2TLR","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":"331577dfbc360a787225b3017bab005ea864c03eba7c0defa5ca1f1833fed8c2","cross_cats_sorted":["cs.FL","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-01T13:20:16Z","title_canon_sha256":"4745ae7a45961a829f32fc2acf1e8f5dea15c7e7115a7255d6757785a36a05bd"},"schema_version":"1.0","source":{"id":"1608.00417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00417","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00417v1","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00417","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"XWZJSJLNKIVK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XWZJSJLNKIVKDJMT","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XWZJSJLN","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ff676e91c53405bf06b8ae7f92df68abc68c3932639613ab07c95962d83b3f59","target":"graph","created_at":"2026-05-18T01:10:11Z","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":"Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakary\\i lmaz 2014, arXiv:1411.7647). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For bina","authors_text":"Abuzer Yakary{\\i}lmaz, Maksims Dimitrijevs","cross_cats":["cs.FL","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-01T13:20:16Z","title":"Uncountable classical and quantum complexity classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00417","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:5bd5288100c3970e23aa446c053160c13f4f7076a81884672805a589c209d494","target":"record","created_at":"2026-05-18T01:10:11Z","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":"331577dfbc360a787225b3017bab005ea864c03eba7c0defa5ca1f1833fed8c2","cross_cats_sorted":["cs.FL","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-01T13:20:16Z","title_canon_sha256":"4745ae7a45961a829f32fc2acf1e8f5dea15c7e7115a7255d6757785a36a05bd"},"schema_version":"1.0","source":{"id":"1608.00417","kind":"arxiv","version":1}},"canonical_sha256":"bdb299256d522aa1a5930fea015b535c6c31f7dc8d59085e80a8214718b5e15b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdb299256d522aa1a5930fea015b535c6c31f7dc8d59085e80a8214718b5e15b","first_computed_at":"2026-05-18T01:10:11.823190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:11.823190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CmuHQqx413KrhYv1Lf1c9dbRp++VChfHSuS/qoF5GvXXKSY8ZaSesymQPpS1fMm2+6rRlqCAPigNb3Lxirr2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:11.823774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bd5288100c3970e23aa446c053160c13f4f7076a81884672805a589c209d494","sha256:ff676e91c53405bf06b8ae7f92df68abc68c3932639613ab07c95962d83b3f59"],"state_sha256":"768e5e39769232d6606a29c68a61fb9174e7fdf326886a8db2ef62326bf7f655"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDq5fLMOBmc4cDibwOBXJEVZUX8g2dE/gut1RkR9XLb6DNxPD4L5oP8qvovOitYeuUPmu+4noiJ9pL1jw2ryBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:03:46.700090Z","bundle_sha256":"15b436e1453d852721843e7dbd3090ab813af2a25046930695adc22d585cc8d0"}}