{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CPLH6AJ4KFLSUEDF7KSYFXNVCV","short_pith_number":"pith:CPLH6AJ4","canonical_record":{"source":{"id":"1902.06473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-18T09:16:43Z","cross_cats_sorted":["cs.DS","math.CO","quant-ph"],"title_canon_sha256":"ce4d4d16f65297fa018ba8449b706713636edb7a68c06462453ffe42ea71de6f","abstract_canon_sha256":"2b60d12b655a64c882237d4b73c8bd776914ce3fd67439d4224782587748313a"},"schema_version":"1.0"},"canonical_sha256":"13d67f013c51572a1065faa582ddb5155bc7499299b47dbfa97ab9539eb8a5dc","source":{"kind":"arxiv","id":"1902.06473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06473","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06473v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06473","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"CPLH6AJ4KFLS","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CPLH6AJ4KFLSUEDF","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CPLH6AJ4","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CPLH6AJ4KFLSUEDF7KSYFXNVCV","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-18T09:16:43Z","cross_cats_sorted":["cs.DS","math.CO","quant-ph"],"title_canon_sha256":"ce4d4d16f65297fa018ba8449b706713636edb7a68c06462453ffe42ea71de6f","abstract_canon_sha256":"2b60d12b655a64c882237d4b73c8bd776914ce3fd67439d4224782587748313a"},"schema_version":"1.0"},"canonical_sha256":"13d67f013c51572a1065faa582ddb5155bc7499299b47dbfa97ab9539eb8a5dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:45.348544Z","signature_b64":"/HiG0GCirrcJ0stHGBRN49bhud1iD1uT05UTONtHqbYr9c0ukMFWNZjzsE9nzhy6KKsBPKqzS+W7b9nZp4g5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13d67f013c51572a1065faa582ddb5155bc7499299b47dbfa97ab9539eb8a5dc","last_reissued_at":"2026-05-17T23:53:45.347958Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:45.347958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06473","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-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1YghvCijXSi0tA/iHedgacJOH1IQtcUA3Edu98l3XGVwT3VEsqc9CcxSHXdNhNJKyrqrSc0TSNGWfS+KzIHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:17:55.022820Z"},"content_sha256":"ffc4c22ab09e3f7d9bdd20520bd455533b514086d3b8243dd15e3667e9be827f","schema_version":"1.0","event_id":"sha256:ffc4c22ab09e3f7d9bdd20520bd455533b514086d3b8243dd15e3667e9be827f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CPLH6AJ4KFLSUEDF7KSYFXNVCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-theoretic lower bounds for quantum sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","quant-ph"],"primary_cat":"cs.CC","authors_text":"Gwena\\\"el Joret, Jean Cardinal, J\\'er\\'emie Roland","submitted_at":"2019-02-18T09:16:43Z","abstract_excerpt":"We analyze the quantum query complexity of sorting under partial information. In this problem, we are given a partially ordered set $P$ and are asked to identify a linear extension of $P$ using pairwise comparisons. For the standard sorting problem, in which $P$ is empty, it is known that the quantum query complexity is not asymptotically smaller than the classical information-theoretic lower bound. We prove that this holds for a wide class of partially ordered sets, thereby improving on a result from Yao (STOC'04)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06473","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-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LL2sDyql6Mp8f62E2gXG9dXCICLP4Os7UYjekUeBUjUfQSf2j4Pgx6iz1hcd6Rm8oNcEw3tdKpB2ZJfjcUZsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:17:55.023162Z"},"content_sha256":"ac2ee096f11c30446d06b7654172ac14a7ef3aca679eef81b4e2ca3f43ae1fb3","schema_version":"1.0","event_id":"sha256:ac2ee096f11c30446d06b7654172ac14a7ef3aca679eef81b4e2ca3f43ae1fb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPLH6AJ4KFLSUEDF7KSYFXNVCV/bundle.json","state_url":"https://pith.science/pith/CPLH6AJ4KFLSUEDF7KSYFXNVCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPLH6AJ4KFLSUEDF7KSYFXNVCV/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-05T15:17:55Z","links":{"resolver":"https://pith.science/pith/CPLH6AJ4KFLSUEDF7KSYFXNVCV","bundle":"https://pith.science/pith/CPLH6AJ4KFLSUEDF7KSYFXNVCV/bundle.json","state":"https://pith.science/pith/CPLH6AJ4KFLSUEDF7KSYFXNVCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPLH6AJ4KFLSUEDF7KSYFXNVCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CPLH6AJ4KFLSUEDF7KSYFXNVCV","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":"2b60d12b655a64c882237d4b73c8bd776914ce3fd67439d4224782587748313a","cross_cats_sorted":["cs.DS","math.CO","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-18T09:16:43Z","title_canon_sha256":"ce4d4d16f65297fa018ba8449b706713636edb7a68c06462453ffe42ea71de6f"},"schema_version":"1.0","source":{"id":"1902.06473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06473","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06473v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06473","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"CPLH6AJ4KFLS","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CPLH6AJ4KFLSUEDF","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CPLH6AJ4","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:ac2ee096f11c30446d06b7654172ac14a7ef3aca679eef81b4e2ca3f43ae1fb3","target":"graph","created_at":"2026-05-17T23:53:45Z","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 analyze the quantum query complexity of sorting under partial information. In this problem, we are given a partially ordered set $P$ and are asked to identify a linear extension of $P$ using pairwise comparisons. For the standard sorting problem, in which $P$ is empty, it is known that the quantum query complexity is not asymptotically smaller than the classical information-theoretic lower bound. We prove that this holds for a wide class of partially ordered sets, thereby improving on a result from Yao (STOC'04).","authors_text":"Gwena\\\"el Joret, Jean Cardinal, J\\'er\\'emie Roland","cross_cats":["cs.DS","math.CO","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-18T09:16:43Z","title":"Information-theoretic lower bounds for quantum sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06473","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:ffc4c22ab09e3f7d9bdd20520bd455533b514086d3b8243dd15e3667e9be827f","target":"record","created_at":"2026-05-17T23:53:45Z","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":"2b60d12b655a64c882237d4b73c8bd776914ce3fd67439d4224782587748313a","cross_cats_sorted":["cs.DS","math.CO","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-18T09:16:43Z","title_canon_sha256":"ce4d4d16f65297fa018ba8449b706713636edb7a68c06462453ffe42ea71de6f"},"schema_version":"1.0","source":{"id":"1902.06473","kind":"arxiv","version":1}},"canonical_sha256":"13d67f013c51572a1065faa582ddb5155bc7499299b47dbfa97ab9539eb8a5dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13d67f013c51572a1065faa582ddb5155bc7499299b47dbfa97ab9539eb8a5dc","first_computed_at":"2026-05-17T23:53:45.347958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:45.347958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/HiG0GCirrcJ0stHGBRN49bhud1iD1uT05UTONtHqbYr9c0ukMFWNZjzsE9nzhy6KKsBPKqzS+W7b9nZp4g5Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:45.348544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffc4c22ab09e3f7d9bdd20520bd455533b514086d3b8243dd15e3667e9be827f","sha256:ac2ee096f11c30446d06b7654172ac14a7ef3aca679eef81b4e2ca3f43ae1fb3"],"state_sha256":"221105c536ef834607c495093b3227c812c08ccb9a047da66d37209f6383d0a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gwmNiFXa007FQqNfeHYumnZ4B3hfTcZ9LyLbd7Ovo4x6P2ioj2J7SZc7WAWlpi485Cx5EOdez26Jx5cLogGHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:17:55.025129Z","bundle_sha256":"76b4186a9026bf0d6c40cb94164155e15c52a35e4bfeab9253415b059a8f999f"}}