{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:AMYBGPMHCACOVCPS4WUGKIUTR4","short_pith_number":"pith:AMYBGPMH","schema_version":"1.0","canonical_sha256":"0330133d871004ea89f2e5a86522938f2107c5ed6324b8b6ba4bce9dae87fcb4","source":{"kind":"arxiv","id":"0902.3175","version":2},"attestation_state":"computed","paper":{"title":"The One-Way Communication Complexity of Group Membership","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Alexander Russell, Fran\\c{c}ois Le Gall, Scott Aaronson, Seiichiro Tani","submitted_at":"2009-02-18T15:57:37Z","abstract_excerpt":"This paper studies the one-way communication complexity of the subgroup membership problem, a classical problem closely related to basic questions in quantum computing. Here Alice receives, as input, a subgroup $H$ of a finite group $G$; Bob receives an element $x \\in G$. Alice is permitted to send a single message to Bob, after which he must decide if his input $x$ is an element of $H$. We prove the following upper bounds on the classical communication complexity of this problem in the bounded-error setting: (1) The problem can be solved with $O(\\log |G|)$ communication, provided the subgroup"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0902.3175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-02-18T15:57:37Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"8a70dd4ddbbf49102a0d531b425c94824f8a7e79492754a75b77d058907e5ab0","abstract_canon_sha256":"7f05d7477ccab9cfebf491d7af67e3a94b546704a5482e7e416474232e3f8020"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:36.491144Z","signature_b64":"StJfUXduabJAjK3ySI3EuJZBggTUy3TtvK/dDGY+a3G4xNWZiodGDgn1L5kYaI/gKOPxJTqgxoJMiQfawKQaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0330133d871004ea89f2e5a86522938f2107c5ed6324b8b6ba4bce9dae87fcb4","last_reissued_at":"2026-07-05T03:19:36.490711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:36.490711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The One-Way Communication Complexity of Group Membership","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Alexander Russell, Fran\\c{c}ois Le Gall, Scott Aaronson, Seiichiro Tani","submitted_at":"2009-02-18T15:57:37Z","abstract_excerpt":"This paper studies the one-way communication complexity of the subgroup membership problem, a classical problem closely related to basic questions in quantum computing. Here Alice receives, as input, a subgroup $H$ of a finite group $G$; Bob receives an element $x \\in G$. Alice is permitted to send a single message to Bob, after which he must decide if his input $x$ is an element of $H$. We prove the following upper bounds on the classical communication complexity of this problem in the bounded-error setting: (1) The problem can be solved with $O(\\log |G|)$ communication, provided the subgroup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3175","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/0902.3175/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0902.3175","created_at":"2026-07-05T03:19:36.490782+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.3175v2","created_at":"2026-07-05T03:19:36.490782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3175","created_at":"2026-07-05T03:19:36.490782+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMYBGPMHCACO","created_at":"2026-07-05T03:19:36.490782+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMYBGPMHCACOVCPS","created_at":"2026-07-05T03:19:36.490782+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMYBGPMH","created_at":"2026-07-05T03:19:36.490782+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4","json":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4.json","graph_json":"https://pith.science/api/pith-number/AMYBGPMHCACOVCPS4WUGKIUTR4/graph.json","events_json":"https://pith.science/api/pith-number/AMYBGPMHCACOVCPS4WUGKIUTR4/events.json","paper":"https://pith.science/paper/AMYBGPMH"},"agent_actions":{"view_html":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4","download_json":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4.json","view_paper":"https://pith.science/paper/AMYBGPMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.3175&json=true","fetch_graph":"https://pith.science/api/pith-number/AMYBGPMHCACOVCPS4WUGKIUTR4/graph.json","fetch_events":"https://pith.science/api/pith-number/AMYBGPMHCACOVCPS4WUGKIUTR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/action/storage_attestation","attest_author":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/action/author_attestation","sign_citation":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/action/citation_signature","submit_replication":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/action/replication_record"}},"created_at":"2026-07-05T03:19:36.490782+00:00","updated_at":"2026-07-05T03:19:36.490782+00:00"}