{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:UBLJEY4SCS32LJBNFNDQNQKEYT","short_pith_number":"pith:UBLJEY4S","canonical_record":{"source":{"id":"2311.15873","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-27T14:45:19Z","cross_cats_sorted":[],"title_canon_sha256":"563a141675cb9430fbd47fe25a170d1d494a5ce14e81c29c09a95a7b8f2c5261","abstract_canon_sha256":"8b10053c8f9c0a4013a2212b7de25917838171c4f247603c600ac37a0c254af0"},"schema_version":"1.0"},"canonical_sha256":"a05692639214b7a5a42d2b4706c144c4dc4307a867dff9453beb4f94a84a6f72","source":{"kind":"arxiv","id":"2311.15873","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.15873","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"arxiv_version","alias_value":"2311.15873v3","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15873","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"pith_short_12","alias_value":"UBLJEY4SCS32","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"pith_short_16","alias_value":"UBLJEY4SCS32LJBN","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"pith_short_8","alias_value":"UBLJEY4S","created_at":"2026-07-05T08:59:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:UBLJEY4SCS32LJBNFNDQNQKEYT","target":"record","payload":{"canonical_record":{"source":{"id":"2311.15873","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-27T14:45:19Z","cross_cats_sorted":[],"title_canon_sha256":"563a141675cb9430fbd47fe25a170d1d494a5ce14e81c29c09a95a7b8f2c5261","abstract_canon_sha256":"8b10053c8f9c0a4013a2212b7de25917838171c4f247603c600ac37a0c254af0"},"schema_version":"1.0"},"canonical_sha256":"a05692639214b7a5a42d2b4706c144c4dc4307a867dff9453beb4f94a84a6f72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:49.492386Z","signature_b64":"2xeHtaBCxwkwHE+mgqUIaLePEL6H15oYUQ5zLM5zwSW5wpTq25mj41olZ9JKWXTM7+znCj7zIiZmJcveXTihDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a05692639214b7a5a42d2b4706c144c4dc4307a867dff9453beb4f94a84a6f72","last_reissued_at":"2026-07-05T08:59:49.491904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:49.491904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.15873","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-05T08:59:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yOZ85O1okLmAQp/kgEdLLHM9yExAHRWMfw8RCZ5LDsJBBwkl8jY9AQc068ZlPayu7bC5J8YCru1XBv0Qc7DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:33:24.348201Z"},"content_sha256":"b95074e78b042db2c5f3c22ddfbcb1b84662b32ff6d44e0af94bd4826194f468","schema_version":"1.0","event_id":"sha256:b95074e78b042db2c5f3c22ddfbcb1b84662b32ff6d44e0af94bd4826194f468"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:UBLJEY4SCS32LJBNFNDQNQKEYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Taming Quantum Time Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Duyal Yolcu, Stacey Jeffery","submitted_at":"2023-11-27T14:45:19Z","abstract_excerpt":"Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction (exactness). Second, through careful accounting (thriftiness), the total query complexity is smaller if subroutines are mostly run on cheaper inputs -- a property that is much less obvious in quantum algorithms than in their classical counterparts. While these properties were previously seen through the model of span programs (alternatively, the dual adversary bound), a recent work by two of the aut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15873","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/2311.15873/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-05T08:59:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KVnxuUvkMgy8V6GjYAMePSm0/gl1r+8xh2zAHfDxMjt5x0NCoxisO1a7Et3TKWNEHQOkAcOaY08BHaWe7qIgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:33:24.348586Z"},"content_sha256":"7b455030796d1abc0ff6f56658d1e977b0097c7ddabf58828955d61fd79f0d70","schema_version":"1.0","event_id":"sha256:7b455030796d1abc0ff6f56658d1e977b0097c7ddabf58828955d61fd79f0d70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBLJEY4SCS32LJBNFNDQNQKEYT/bundle.json","state_url":"https://pith.science/pith/UBLJEY4SCS32LJBNFNDQNQKEYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBLJEY4SCS32LJBNFNDQNQKEYT/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-08-12T23:33:24Z","links":{"resolver":"https://pith.science/pith/UBLJEY4SCS32LJBNFNDQNQKEYT","bundle":"https://pith.science/pith/UBLJEY4SCS32LJBNFNDQNQKEYT/bundle.json","state":"https://pith.science/pith/UBLJEY4SCS32LJBNFNDQNQKEYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBLJEY4SCS32LJBNFNDQNQKEYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:UBLJEY4SCS32LJBNFNDQNQKEYT","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":"8b10053c8f9c0a4013a2212b7de25917838171c4f247603c600ac37a0c254af0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-27T14:45:19Z","title_canon_sha256":"563a141675cb9430fbd47fe25a170d1d494a5ce14e81c29c09a95a7b8f2c5261"},"schema_version":"1.0","source":{"id":"2311.15873","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.15873","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"arxiv_version","alias_value":"2311.15873v3","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15873","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"pith_short_12","alias_value":"UBLJEY4SCS32","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"pith_short_16","alias_value":"UBLJEY4SCS32LJBN","created_at":"2026-07-05T08:59:49Z"},{"alias_kind":"pith_short_8","alias_value":"UBLJEY4S","created_at":"2026-07-05T08:59:49Z"}],"graph_snapshots":[{"event_id":"sha256:7b455030796d1abc0ff6f56658d1e977b0097c7ddabf58828955d61fd79f0d70","target":"graph","created_at":"2026-07-05T08:59:49Z","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/2311.15873/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction (exactness). Second, through careful accounting (thriftiness), the total query complexity is smaller if subroutines are mostly run on cheaper inputs -- a property that is much less obvious in quantum algorithms than in their classical counterparts. While these properties were previously seen through the model of span programs (alternatively, the dual adversary bound), a recent work by two of the aut","authors_text":"Aleksandrs Belovs, Duyal Yolcu, Stacey Jeffery","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-27T14:45:19Z","title":"Taming Quantum Time Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15873","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:b95074e78b042db2c5f3c22ddfbcb1b84662b32ff6d44e0af94bd4826194f468","target":"record","created_at":"2026-07-05T08:59:49Z","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":"8b10053c8f9c0a4013a2212b7de25917838171c4f247603c600ac37a0c254af0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-27T14:45:19Z","title_canon_sha256":"563a141675cb9430fbd47fe25a170d1d494a5ce14e81c29c09a95a7b8f2c5261"},"schema_version":"1.0","source":{"id":"2311.15873","kind":"arxiv","version":3}},"canonical_sha256":"a05692639214b7a5a42d2b4706c144c4dc4307a867dff9453beb4f94a84a6f72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a05692639214b7a5a42d2b4706c144c4dc4307a867dff9453beb4f94a84a6f72","first_computed_at":"2026-07-05T08:59:49.491904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:59:49.491904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2xeHtaBCxwkwHE+mgqUIaLePEL6H15oYUQ5zLM5zwSW5wpTq25mj41olZ9JKWXTM7+znCj7zIiZmJcveXTihDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:59:49.492386Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.15873","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b95074e78b042db2c5f3c22ddfbcb1b84662b32ff6d44e0af94bd4826194f468","sha256:7b455030796d1abc0ff6f56658d1e977b0097c7ddabf58828955d61fd79f0d70"],"state_sha256":"bd93d18e2221bbe0711771feef30ae78cba34e165977e10ce0ca45620b81d282"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuVCFWOKsPHr+MtbUR4Y5WfNWVVOU/mT7WKLib89v4YNjEGJZ6L8BnPaZ4mAO21cZoUE551Ewbb2JcA5mO9NBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:33:24.351185Z","bundle_sha256":"1a5eb8358509febab26d2b83cc48c625b46ebf1911037a547fcfbe597a3a1c5f"}}