{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G26Q2CN3PQNMRSIMP7MGPPVDXG","short_pith_number":"pith:G26Q2CN3","canonical_record":{"source":{"id":"1812.04219","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-11T05:00:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cd3e1915a03542d1f8c9119b03c50dde22ca7704de51df74a1851eeca7fb3aaa","abstract_canon_sha256":"1e819fc4c2f3d19e048115aa477cc5805dbe5c8e5c3b99317164ff18a5549e82"},"schema_version":"1.0"},"canonical_sha256":"36bd0d09bb7c1ac8c90c7fd867bea3b9b5c11b5cf599f48bb1a4bcbfbd2c11af","source":{"kind":"arxiv","id":"1812.04219","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04219","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04219v3","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04219","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"G26Q2CN3PQNM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G26Q2CN3PQNMRSIM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G26Q2CN3","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G26Q2CN3PQNMRSIMP7MGPPVDXG","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04219","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-11T05:00:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cd3e1915a03542d1f8c9119b03c50dde22ca7704de51df74a1851eeca7fb3aaa","abstract_canon_sha256":"1e819fc4c2f3d19e048115aa477cc5805dbe5c8e5c3b99317164ff18a5549e82"},"schema_version":"1.0"},"canonical_sha256":"36bd0d09bb7c1ac8c90c7fd867bea3b9b5c11b5cf599f48bb1a4bcbfbd2c11af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:31.260296Z","signature_b64":"OGz7ZL42pu3se6G2yPd876MNbozrLPRmHL9Af/L1jrsyg4bHn7+lrbjp6bjhwSV3uP+C+oxfHsfzY+OqOLaOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36bd0d09bb7c1ac8c90c7fd867bea3b9b5c11b5cf599f48bb1a4bcbfbd2c11af","last_reissued_at":"2026-05-17T23:48:31.259753Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:31.259753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04219","source_version":3,"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-17T23:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ohk7jo2z6/Gfjc+A/UXlR2hHi0PQRl6WLL8dznwGbblClktp7Lt0FJZimXiau8waOINSZss3Vcgiig7typuOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:45:02.136883Z"},"content_sha256":"31f118512fa2bb4c594ef7591fd28afadc890f6ea4d3f81bbc67079ba3cda57f","schema_version":"1.0","event_id":"sha256:31f118512fa2bb4c594ef7591fd28afadc890f6ea4d3f81bbc67079ba3cda57f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G26Q2CN3PQNMRSIMP7MGPPVDXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quantum Query Complexity Trichotomy for Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Grier, Luke Schaeffer, Scott Aaronson","submitted_at":"2018-12-11T05:00:52Z","abstract_excerpt":"We present a trichotomy theorem for the quantum query complexity of regular languages. Every regular language has quantum query complexity Theta(1), ~Theta(sqrt n), or Theta(n). The extreme uniformity of regular languages prevents them from taking any other asymptotic complexity. This is in contrast to even the context-free languages, which we show can have query complexity Theta(n^c) for all computable c in [1/2,1]. Our result implies an equivalent trichotomy for the approximate degree of regular languages, and a dichotomy---either Theta(1) or Theta(n)---for sensitivity, block sensitivity, ce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04219","kind":"arxiv","version":3},"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-17T23:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sy36O8ZrW7y45kHxdyndUT1YE+e1ZBkH1396kGBVNsPvJJBnVCHT3TySMRwCKXIHFdL9v1VxPEmAAknegBLTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:45:02.137575Z"},"content_sha256":"5dda680b24c476b4f4b45083dbfd8886140b15da40943fa117686406814a2024","schema_version":"1.0","event_id":"sha256:5dda680b24c476b4f4b45083dbfd8886140b15da40943fa117686406814a2024"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G26Q2CN3PQNMRSIMP7MGPPVDXG/bundle.json","state_url":"https://pith.science/pith/G26Q2CN3PQNMRSIMP7MGPPVDXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G26Q2CN3PQNMRSIMP7MGPPVDXG/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-05T01:45:02Z","links":{"resolver":"https://pith.science/pith/G26Q2CN3PQNMRSIMP7MGPPVDXG","bundle":"https://pith.science/pith/G26Q2CN3PQNMRSIMP7MGPPVDXG/bundle.json","state":"https://pith.science/pith/G26Q2CN3PQNMRSIMP7MGPPVDXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G26Q2CN3PQNMRSIMP7MGPPVDXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G26Q2CN3PQNMRSIMP7MGPPVDXG","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":"1e819fc4c2f3d19e048115aa477cc5805dbe5c8e5c3b99317164ff18a5549e82","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-11T05:00:52Z","title_canon_sha256":"cd3e1915a03542d1f8c9119b03c50dde22ca7704de51df74a1851eeca7fb3aaa"},"schema_version":"1.0","source":{"id":"1812.04219","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04219","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04219v3","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04219","created_at":"2026-05-17T23:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"G26Q2CN3PQNM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G26Q2CN3PQNMRSIM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G26Q2CN3","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:5dda680b24c476b4f4b45083dbfd8886140b15da40943fa117686406814a2024","target":"graph","created_at":"2026-05-17T23:48:31Z","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 present a trichotomy theorem for the quantum query complexity of regular languages. Every regular language has quantum query complexity Theta(1), ~Theta(sqrt n), or Theta(n). The extreme uniformity of regular languages prevents them from taking any other asymptotic complexity. This is in contrast to even the context-free languages, which we show can have query complexity Theta(n^c) for all computable c in [1/2,1]. Our result implies an equivalent trichotomy for the approximate degree of regular languages, and a dichotomy---either Theta(1) or Theta(n)---for sensitivity, block sensitivity, ce","authors_text":"Daniel Grier, Luke Schaeffer, Scott Aaronson","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-11T05:00:52Z","title":"A Quantum Query Complexity Trichotomy for Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04219","kind":"arxiv","version":3},"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:31f118512fa2bb4c594ef7591fd28afadc890f6ea4d3f81bbc67079ba3cda57f","target":"record","created_at":"2026-05-17T23:48:31Z","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":"1e819fc4c2f3d19e048115aa477cc5805dbe5c8e5c3b99317164ff18a5549e82","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-11T05:00:52Z","title_canon_sha256":"cd3e1915a03542d1f8c9119b03c50dde22ca7704de51df74a1851eeca7fb3aaa"},"schema_version":"1.0","source":{"id":"1812.04219","kind":"arxiv","version":3}},"canonical_sha256":"36bd0d09bb7c1ac8c90c7fd867bea3b9b5c11b5cf599f48bb1a4bcbfbd2c11af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36bd0d09bb7c1ac8c90c7fd867bea3b9b5c11b5cf599f48bb1a4bcbfbd2c11af","first_computed_at":"2026-05-17T23:48:31.259753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:31.259753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OGz7ZL42pu3se6G2yPd876MNbozrLPRmHL9Af/L1jrsyg4bHn7+lrbjp6bjhwSV3uP+C+oxfHsfzY+OqOLaOCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:31.260296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04219","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31f118512fa2bb4c594ef7591fd28afadc890f6ea4d3f81bbc67079ba3cda57f","sha256:5dda680b24c476b4f4b45083dbfd8886140b15da40943fa117686406814a2024"],"state_sha256":"f03bfc95183a72656bfa13fd6c3a9049a42c1f79b78f12afd364b5c17760c511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZDcaxGpDpKF1wXNKOAG4QswJ7obj46O4cWxHTrGRKboptx1jGnd2KhQOFM27asamJy58muAlrEObsLojZk9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:45:02.143592Z","bundle_sha256":"ec6574118863afb4d135fde471d5f1526b736d2d3f805ac7609b35177be346f7"}}