{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SI4X4UNY33AF6OI4TLFXOA7QVK","short_pith_number":"pith:SI4X4UNY","canonical_record":{"source":{"id":"1904.08914","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-18T17:49:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"03708d62561aad51149cee796440f5c13202090a3fc7b48ee3ff887ed1fbba0d","abstract_canon_sha256":"7b46609714a5f1296fc78b6ddd46a7a743cca1d47697a003c7e3270415293af8"},"schema_version":"1.0"},"canonical_sha256":"92397e51b8dec05f391c9acb7703f0aab9a5e4988deb15de7fa43c221d654190","source":{"kind":"arxiv","id":"1904.08914","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08914","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08914v3","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08914","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"SI4X4UNY33AF","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"pith_short_16","alias_value":"SI4X4UNY33AF6OI4","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"pith_short_8","alias_value":"SI4X4UNY","created_at":"2026-07-05T02:23:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SI4X4UNY33AF6OI4TLFXOA7QVK","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08914","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-18T17:49:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"03708d62561aad51149cee796440f5c13202090a3fc7b48ee3ff887ed1fbba0d","abstract_canon_sha256":"7b46609714a5f1296fc78b6ddd46a7a743cca1d47697a003c7e3270415293af8"},"schema_version":"1.0"},"canonical_sha256":"92397e51b8dec05f391c9acb7703f0aab9a5e4988deb15de7fa43c221d654190","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:23:55.603255Z","signature_b64":"3VdD1LuQqPRt3oMdRHSqqywgODDof0/ZI3MT7bm7nNcoAeqcDgpyQF3q+reYcDW5RWh6R50zWbn5DaIaXGmwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92397e51b8dec05f391c9acb7703f0aab9a5e4988deb15de7fa43c221d654190","last_reissued_at":"2026-07-05T02:23:55.602834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:23:55.602834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08914","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-07-05T02:23:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/eyWXtxPtg/x/g7Bd/piciHrh/O8AwhRtNxm2O0b/FtrTc4t9Rhbi3PKyaQPg12G/ulQXGZjGphsl5/hK3DnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:01:49.600031Z"},"content_sha256":"129e41b5a50051c573330ea357eeaa1ff4e3a66b46dabe77ea7946e0296239ef","schema_version":"1.0","event_id":"sha256:129e41b5a50051c573330ea357eeaa1ff4e3a66b46dabe77ea7946e0296239ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SI4X4UNY33AF6OI4TLFXOA7QVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Lower Bounds for Approximate Counting via Laurent Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Justin Thaler, Robin Kothari, Scott Aaronson, William Kretschmer","submitted_at":"2019-04-18T17:49:22Z","abstract_excerpt":"We study quantum algorithms that are given access to trusted and untrusted quantum witnesses. We establish strong limitations of such algorithms, via new techniques based on Laurent polynomials (i.e., polynomials with positive and negative integer exponents). Specifically, we resolve the complexity of approximate counting, the problem of multiplicatively estimating the size of a nonempty set $S \\subseteq [N]$, in two natural generalizations of quantum query complexity.\n  Our first result holds in the standard Quantum Merlin--Arthur ($\\mathsf{QMA}$) setting, in which a quantum algorithm receive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08914","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.08914/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:23:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7L1Fqv8iZ5zkMI9ji7D70nUZ6BBOi9Wf3LTIXo8mVo+2d/oBZVgbbAOM1ClsRd3oH8CxVBADYPPNZiyrgnb5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:01:49.600421Z"},"content_sha256":"6f4ea3fc24c86c2d30d7d22c9b9f12ef5171e7d92143791afcf2ec137c2ebbca","schema_version":"1.0","event_id":"sha256:6f4ea3fc24c86c2d30d7d22c9b9f12ef5171e7d92143791afcf2ec137c2ebbca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SI4X4UNY33AF6OI4TLFXOA7QVK/bundle.json","state_url":"https://pith.science/pith/SI4X4UNY33AF6OI4TLFXOA7QVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SI4X4UNY33AF6OI4TLFXOA7QVK/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-07-05T11:01:49Z","links":{"resolver":"https://pith.science/pith/SI4X4UNY33AF6OI4TLFXOA7QVK","bundle":"https://pith.science/pith/SI4X4UNY33AF6OI4TLFXOA7QVK/bundle.json","state":"https://pith.science/pith/SI4X4UNY33AF6OI4TLFXOA7QVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SI4X4UNY33AF6OI4TLFXOA7QVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SI4X4UNY33AF6OI4TLFXOA7QVK","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":"7b46609714a5f1296fc78b6ddd46a7a743cca1d47697a003c7e3270415293af8","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-18T17:49:22Z","title_canon_sha256":"03708d62561aad51149cee796440f5c13202090a3fc7b48ee3ff887ed1fbba0d"},"schema_version":"1.0","source":{"id":"1904.08914","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08914","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08914v3","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08914","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"SI4X4UNY33AF","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"pith_short_16","alias_value":"SI4X4UNY33AF6OI4","created_at":"2026-07-05T02:23:55Z"},{"alias_kind":"pith_short_8","alias_value":"SI4X4UNY","created_at":"2026-07-05T02:23:55Z"}],"graph_snapshots":[{"event_id":"sha256:6f4ea3fc24c86c2d30d7d22c9b9f12ef5171e7d92143791afcf2ec137c2ebbca","target":"graph","created_at":"2026-07-05T02:23:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1904.08914/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study quantum algorithms that are given access to trusted and untrusted quantum witnesses. We establish strong limitations of such algorithms, via new techniques based on Laurent polynomials (i.e., polynomials with positive and negative integer exponents). Specifically, we resolve the complexity of approximate counting, the problem of multiplicatively estimating the size of a nonempty set $S \\subseteq [N]$, in two natural generalizations of quantum query complexity.\n  Our first result holds in the standard Quantum Merlin--Arthur ($\\mathsf{QMA}$) setting, in which a quantum algorithm receive","authors_text":"Justin Thaler, Robin Kothari, Scott Aaronson, William Kretschmer","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-18T17:49:22Z","title":"Quantum Lower Bounds for Approximate Counting via Laurent Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08914","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:129e41b5a50051c573330ea357eeaa1ff4e3a66b46dabe77ea7946e0296239ef","target":"record","created_at":"2026-07-05T02:23:55Z","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":"7b46609714a5f1296fc78b6ddd46a7a743cca1d47697a003c7e3270415293af8","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-18T17:49:22Z","title_canon_sha256":"03708d62561aad51149cee796440f5c13202090a3fc7b48ee3ff887ed1fbba0d"},"schema_version":"1.0","source":{"id":"1904.08914","kind":"arxiv","version":3}},"canonical_sha256":"92397e51b8dec05f391c9acb7703f0aab9a5e4988deb15de7fa43c221d654190","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92397e51b8dec05f391c9acb7703f0aab9a5e4988deb15de7fa43c221d654190","first_computed_at":"2026-07-05T02:23:55.602834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:23:55.602834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3VdD1LuQqPRt3oMdRHSqqywgODDof0/ZI3MT7bm7nNcoAeqcDgpyQF3q+reYcDW5RWh6R50zWbn5DaIaXGmwCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:23:55.603255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08914","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:129e41b5a50051c573330ea357eeaa1ff4e3a66b46dabe77ea7946e0296239ef","sha256:6f4ea3fc24c86c2d30d7d22c9b9f12ef5171e7d92143791afcf2ec137c2ebbca"],"state_sha256":"f1e3cd1bf5c8bf5daaf9464fd97431b749c8308b4bf2087e82c2690e164c78e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrS7ZrGQqfpPUIhAEPVAKFsDCmdnLfDSRKIfIZgHW/l7W8ZFNn5zvjfWdvS6vPPtwQyfZqMe4qo+Jyi/+VfnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:01:49.602955Z","bundle_sha256":"0e2a4cb9dead1edc1d78f279b501a159dd0e4114b1107b69eaace5b4cc8efafc"}}