{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:AMYBGPMHCACOVCPS4WUGKIUTR4","short_pith_number":"pith:AMYBGPMH","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"},"canonical_sha256":"0330133d871004ea89f2e5a86522938f2107c5ed6324b8b6ba4bce9dae87fcb4","source":{"kind":"arxiv","id":"0902.3175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.3175","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"0902.3175v2","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3175","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"AMYBGPMHCACO","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"pith_short_16","alias_value":"AMYBGPMHCACOVCPS","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"pith_short_8","alias_value":"AMYBGPMH","created_at":"2026-07-05T03:19:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:AMYBGPMHCACOVCPS4WUGKIUTR4","target":"record","payload":{"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"},"canonical_sha256":"0330133d871004ea89f2e5a86522938f2107c5ed6324b8b6ba4bce9dae87fcb4","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"},"source_kind":"arxiv","source_id":"0902.3175","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-05T03:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFYUmLl6e7u9cxaemnLbo/V2Z0eAZkYCJ1+E88t9dwrYxvMIMQlXNQneSakCEgsdGTJgiz/8V1AJQZD4SrS2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:38:26.264294Z"},"content_sha256":"0b8721ad257f15408d4000541d7007fc3236b0ba5810e43a70b4fb3c8fc9633e","schema_version":"1.0","event_id":"sha256:0b8721ad257f15408d4000541d7007fc3236b0ba5810e43a70b4fb3c8fc9633e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:AMYBGPMHCACOVCPS4WUGKIUTR4","target":"graph","payload":{"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"},"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-05T03:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCJ79uOwe0Y+rAiJSzPlTWUMhWzP3Cex97+gLYbgVvFzV+EOlmM8Lm22pbS0+6qbDrA8mfgRnrM/Ro8ahwtLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:38:26.264787Z"},"content_sha256":"f82f5682d5786a19ca22f6e50959f9256d270c10a6a22b6517da0d993d12d428","schema_version":"1.0","event_id":"sha256:f82f5682d5786a19ca22f6e50959f9256d270c10a6a22b6517da0d993d12d428"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/bundle.json","state_url":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/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-04T20:38:26Z","links":{"resolver":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4","bundle":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/bundle.json","state":"https://pith.science/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMYBGPMHCACOVCPS4WUGKIUTR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:AMYBGPMHCACOVCPS4WUGKIUTR4","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":"7f05d7477ccab9cfebf491d7af67e3a94b546704a5482e7e416474232e3f8020","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-02-18T15:57:37Z","title_canon_sha256":"8a70dd4ddbbf49102a0d531b425c94824f8a7e79492754a75b77d058907e5ab0"},"schema_version":"1.0","source":{"id":"0902.3175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.3175","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"0902.3175v2","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3175","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"AMYBGPMHCACO","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"pith_short_16","alias_value":"AMYBGPMHCACOVCPS","created_at":"2026-07-05T03:19:36Z"},{"alias_kind":"pith_short_8","alias_value":"AMYBGPMH","created_at":"2026-07-05T03:19:36Z"}],"graph_snapshots":[{"event_id":"sha256:f82f5682d5786a19ca22f6e50959f9256d270c10a6a22b6517da0d993d12d428","target":"graph","created_at":"2026-07-05T03:19:36Z","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/0902.3175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander Russell, Fran\\c{c}ois Le Gall, Scott Aaronson, Seiichiro Tani","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-02-18T15:57:37Z","title":"The One-Way Communication Complexity of Group Membership"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3175","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:0b8721ad257f15408d4000541d7007fc3236b0ba5810e43a70b4fb3c8fc9633e","target":"record","created_at":"2026-07-05T03:19:36Z","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":"7f05d7477ccab9cfebf491d7af67e3a94b546704a5482e7e416474232e3f8020","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-02-18T15:57:37Z","title_canon_sha256":"8a70dd4ddbbf49102a0d531b425c94824f8a7e79492754a75b77d058907e5ab0"},"schema_version":"1.0","source":{"id":"0902.3175","kind":"arxiv","version":2}},"canonical_sha256":"0330133d871004ea89f2e5a86522938f2107c5ed6324b8b6ba4bce9dae87fcb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0330133d871004ea89f2e5a86522938f2107c5ed6324b8b6ba4bce9dae87fcb4","first_computed_at":"2026-07-05T03:19:36.490711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:36.490711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"StJfUXduabJAjK3ySI3EuJZBggTUy3TtvK/dDGY+a3G4xNWZiodGDgn1L5kYaI/gKOPxJTqgxoJMiQfawKQaDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:36.491144Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.3175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b8721ad257f15408d4000541d7007fc3236b0ba5810e43a70b4fb3c8fc9633e","sha256:f82f5682d5786a19ca22f6e50959f9256d270c10a6a22b6517da0d993d12d428"],"state_sha256":"8488d4833330cb2b4eefaefd701bccc267c85b75add44c9376ebeb21179ba64c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPFYV51UpsB91PTk56nk1ZCHnxyXaWeMqhfaZ4Gv0NFQlXQVlOuFabMw9PtJ83wVdgbnhjUU5BqvGEkDZFLxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T20:38:26.268200Z","bundle_sha256":"7db39c4c7e6c99f90d9dfabd7e20020d5eefceb0ad84ec286d78d4c38ed47178"}}