{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:SPYMR262TVSQMMAKM3SGIBEPTA","short_pith_number":"pith:SPYMR262","canonical_record":{"source":{"id":"quant-ph/0311060","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-10T22:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"37461a4863cb9271805f5877fddaee8bfb989ea4ac36fd42461b67800be5a0af","abstract_canon_sha256":"344906ff8e9315c32de1575fa630ecd04f1afc91a8767b92aa2f880fab084d93"},"schema_version":"1.0"},"canonical_sha256":"93f0c8ebda9d6506300a66e464048f980979ea128865a6bebf41d27f9593967c","source":{"kind":"arxiv","id":"quant-ph/0311060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0311060","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0311060v2","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0311060","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"pith_short_12","alias_value":"SPYMR262TVSQ","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"pith_short_16","alias_value":"SPYMR262TVSQMMAK","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"pith_short_8","alias_value":"SPYMR262","created_at":"2026-07-04T14:46:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:SPYMR262TVSQMMAKM3SGIBEPTA","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0311060","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-10T22:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"37461a4863cb9271805f5877fddaee8bfb989ea4ac36fd42461b67800be5a0af","abstract_canon_sha256":"344906ff8e9315c32de1575fa630ecd04f1afc91a8767b92aa2f880fab084d93"},"schema_version":"1.0"},"canonical_sha256":"93f0c8ebda9d6506300a66e464048f980979ea128865a6bebf41d27f9593967c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:27.098956Z","signature_b64":"BAU6GcHytpkwLcQ3UCdk0s0phypTouVTHEnTRnuBsu9/7Kbc7TO7ZwWT4AHsXv7w95QQACTDld0oApNbvqXqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f0c8ebda9d6506300a66e464048f980979ea128865a6bebf41d27f9593967c","last_reissued_at":"2026-07-04T14:46:27.098507Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:27.098507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0311060","source_version":2,"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-04T14:46:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0qmOI5edQUfoenEHIQF1Z4rj7NW4n/jc2xZNul+lFaN7salwhIkpjWfwueox8qo5oSNkoBzrWanveaEU1uWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:58:12.336713Z"},"content_sha256":"19b4af1226c7d6204bb21925cac384253ebe15c056031622b09cedd794bdd7ee","schema_version":"1.0","event_id":"sha256:19b4af1226c7d6204bb21925cac384253ebe15c056031622b09cedd794bdd7ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:SPYMR262TVSQMMAKM3SGIBEPTA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the power of Ambainis's lower bounds","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shengyu Zhang","submitted_at":"2003-11-10T22:46:20Z","abstract_excerpt":"The polynomial method and the Ambainis's lower bound (or \\emph{Alb}, for short) method are two main quantum lower bound techniques. While recently Ambainis showed that the polynomial method is not tight, the present paper aims at studying the power and limitation of \\emph{Alb}'s. We first use known \\emph{Alb}'s to derive $\\Omega(n^{1.5})$ lower bounds for \\textsc{Bipartiteness}, \\textsc{Bipartiteness Matching} and \\textsc{Graph Matching}, in which the lower bound for \\textsc{Bipartiteness} improves the previous $\\Omega(n)$ one. We then show that all the three known Ambainis's lower bounds have"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0311060","kind":"arxiv","version":2},"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/quant-ph/0311060/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-04T14:46:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrWj/DVNcihhlF8zP1qS58yHGKU78fnD1zOpAsLpXSaoW98ikF2P2Fd+oPjuTTF/IkEU6KJh6Q7uehVXP/8HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:58:12.337875Z"},"content_sha256":"4d4d09792666168ed1a65d4f1bcb002de83b9e68664f18bb4da36e48cf838849","schema_version":"1.0","event_id":"sha256:4d4d09792666168ed1a65d4f1bcb002de83b9e68664f18bb4da36e48cf838849"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/bundle.json","state_url":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPYMR262TVSQMMAKM3SGIBEPTA/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-16T18:58:12Z","links":{"resolver":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA","bundle":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/bundle.json","state":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPYMR262TVSQMMAKM3SGIBEPTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:SPYMR262TVSQMMAKM3SGIBEPTA","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":"344906ff8e9315c32de1575fa630ecd04f1afc91a8767b92aa2f880fab084d93","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-10T22:46:20Z","title_canon_sha256":"37461a4863cb9271805f5877fddaee8bfb989ea4ac36fd42461b67800be5a0af"},"schema_version":"1.0","source":{"id":"quant-ph/0311060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0311060","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0311060v2","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0311060","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"pith_short_12","alias_value":"SPYMR262TVSQ","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"pith_short_16","alias_value":"SPYMR262TVSQMMAK","created_at":"2026-07-04T14:46:27Z"},{"alias_kind":"pith_short_8","alias_value":"SPYMR262","created_at":"2026-07-04T14:46:27Z"}],"graph_snapshots":[{"event_id":"sha256:4d4d09792666168ed1a65d4f1bcb002de83b9e68664f18bb4da36e48cf838849","target":"graph","created_at":"2026-07-04T14:46:27Z","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/quant-ph/0311060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The polynomial method and the Ambainis's lower bound (or \\emph{Alb}, for short) method are two main quantum lower bound techniques. While recently Ambainis showed that the polynomial method is not tight, the present paper aims at studying the power and limitation of \\emph{Alb}'s. We first use known \\emph{Alb}'s to derive $\\Omega(n^{1.5})$ lower bounds for \\textsc{Bipartiteness}, \\textsc{Bipartiteness Matching} and \\textsc{Graph Matching}, in which the lower bound for \\textsc{Bipartiteness} improves the previous $\\Omega(n)$ one. We then show that all the three known Ambainis's lower bounds have","authors_text":"Shengyu Zhang","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2003-11-10T22:46:20Z","title":"On the power of Ambainis's lower bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0311060","kind":"arxiv","version":2},"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:19b4af1226c7d6204bb21925cac384253ebe15c056031622b09cedd794bdd7ee","target":"record","created_at":"2026-07-04T14:46:27Z","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":"344906ff8e9315c32de1575fa630ecd04f1afc91a8767b92aa2f880fab084d93","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-10T22:46:20Z","title_canon_sha256":"37461a4863cb9271805f5877fddaee8bfb989ea4ac36fd42461b67800be5a0af"},"schema_version":"1.0","source":{"id":"quant-ph/0311060","kind":"arxiv","version":2}},"canonical_sha256":"93f0c8ebda9d6506300a66e464048f980979ea128865a6bebf41d27f9593967c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93f0c8ebda9d6506300a66e464048f980979ea128865a6bebf41d27f9593967c","first_computed_at":"2026-07-04T14:46:27.098507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:46:27.098507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BAU6GcHytpkwLcQ3UCdk0s0phypTouVTHEnTRnuBsu9/7Kbc7TO7ZwWT4AHsXv7w95QQACTDld0oApNbvqXqDQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:46:27.098956Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0311060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19b4af1226c7d6204bb21925cac384253ebe15c056031622b09cedd794bdd7ee","sha256:4d4d09792666168ed1a65d4f1bcb002de83b9e68664f18bb4da36e48cf838849"],"state_sha256":"c512339c842f5590d405d5161e8210045037d07a0a5ebb221dd4d6941efbcb87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mK8iahYWQcV+MWRfRZ37JbqMjW6u4zzfTf6evbA04FsC4BXXk43Uq2fMm9qGRRAaWyHdIp87rZ0kYRpyhvBJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:58:12.345268Z","bundle_sha256":"505401348076012ecedf3a4d82ed512db674d78f58657e8a3a523adb9298c37b"}}