{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:664RP3MRSFD7WZEUMTM2SCRK6G","short_pith_number":"pith:664RP3MR","canonical_record":{"source":{"id":"2410.04373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T06:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"ac7019a58ef4e06662bfe8b3f59e18e675a1337f130113ef899cecf1475a0c30","abstract_canon_sha256":"e524f48cb08d9574e88118f8daf818097dca277f22c7248d31ce764fa4379aa6"},"schema_version":"1.0"},"canonical_sha256":"f7b917ed919147fb649464d9a90a2af1918338f1a8f40f35b9d8326c390a9c14","source":{"kind":"arxiv","id":"2410.04373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.04373","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"2410.04373v1","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04373","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"664RP3MRSFD7","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"pith_short_16","alias_value":"664RP3MRSFD7WZEU","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"pith_short_8","alias_value":"664RP3MR","created_at":"2026-07-05T09:16:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:664RP3MRSFD7WZEUMTM2SCRK6G","target":"record","payload":{"canonical_record":{"source":{"id":"2410.04373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T06:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"ac7019a58ef4e06662bfe8b3f59e18e675a1337f130113ef899cecf1475a0c30","abstract_canon_sha256":"e524f48cb08d9574e88118f8daf818097dca277f22c7248d31ce764fa4379aa6"},"schema_version":"1.0"},"canonical_sha256":"f7b917ed919147fb649464d9a90a2af1918338f1a8f40f35b9d8326c390a9c14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:16:33.497840Z","signature_b64":"CTM7hRDr80h3fc7p91ZXNEGJySgvHlsNk77x5h+nuktvdK9CcE63sbFW01XSTo+tiXOLVNmJ3p0e4zqfpcySDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7b917ed919147fb649464d9a90a2af1918338f1a8f40f35b9d8326c390a9c14","last_reissued_at":"2026-07-05T09:16:33.497487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:16:33.497487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.04373","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-07-05T09:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+2QiGN3k/Wlsch2VDj5g13vsZu/+DDRzHLQjwqBnyBLScmo4T2YABWRYpRpq5cyWaJ516fqlMjBALZhvNYtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:44:20.039627Z"},"content_sha256":"a2ccee0d5e110449c83529ec38b273f679b87e54bb5b5402500cd7c34360b96e","schema_version":"1.0","event_id":"sha256:a2ccee0d5e110449c83529ec38b273f679b87e54bb5b5402500cd7c34360b96e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:664RP3MRSFD7WZEUMTM2SCRK6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity of Learning Efficiently Generatable Pure States","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Min-Hsiu Hsieh, Taiga Hiroka","submitted_at":"2024-10-06T06:25:36Z","abstract_excerpt":"Understanding the computational complexity of learning efficient classical programs in various learning models has been a fundamental and important question in classical computational learning theory. In this work, we study the computational complexity of quantum state learning, which can be seen as a quantum generalization of distributional learning introduced by Kearns et.al [STOC94]. Previous works by Chung and Lin [TQC21], and B\\u{a}descu and O$'$Donnell [STOC21] study the sample complexity of the quantum state learning and show that polynomial copies are sufficient if unknown quantum stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04373","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.04373/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-05T09:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNp+aarF8jAKnhTodMU4Qi9saV94VEOSZycRyq+qLOLWi33HJm27Vfv9mrekyvTOWM+TrvAE2aaORBhq/D2WCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:44:20.040189Z"},"content_sha256":"50fb417ad459633b9d80eb5a765b100f161f53a57893a1097073dfec04b0c7a8","schema_version":"1.0","event_id":"sha256:50fb417ad459633b9d80eb5a765b100f161f53a57893a1097073dfec04b0c7a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/664RP3MRSFD7WZEUMTM2SCRK6G/bundle.json","state_url":"https://pith.science/pith/664RP3MRSFD7WZEUMTM2SCRK6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/664RP3MRSFD7WZEUMTM2SCRK6G/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-19T15:44:20Z","links":{"resolver":"https://pith.science/pith/664RP3MRSFD7WZEUMTM2SCRK6G","bundle":"https://pith.science/pith/664RP3MRSFD7WZEUMTM2SCRK6G/bundle.json","state":"https://pith.science/pith/664RP3MRSFD7WZEUMTM2SCRK6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/664RP3MRSFD7WZEUMTM2SCRK6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:664RP3MRSFD7WZEUMTM2SCRK6G","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":"e524f48cb08d9574e88118f8daf818097dca277f22c7248d31ce764fa4379aa6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T06:25:36Z","title_canon_sha256":"ac7019a58ef4e06662bfe8b3f59e18e675a1337f130113ef899cecf1475a0c30"},"schema_version":"1.0","source":{"id":"2410.04373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.04373","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"2410.04373v1","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04373","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"664RP3MRSFD7","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"pith_short_16","alias_value":"664RP3MRSFD7WZEU","created_at":"2026-07-05T09:16:33Z"},{"alias_kind":"pith_short_8","alias_value":"664RP3MR","created_at":"2026-07-05T09:16:33Z"}],"graph_snapshots":[{"event_id":"sha256:50fb417ad459633b9d80eb5a765b100f161f53a57893a1097073dfec04b0c7a8","target":"graph","created_at":"2026-07-05T09:16:33Z","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/2410.04373/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Understanding the computational complexity of learning efficient classical programs in various learning models has been a fundamental and important question in classical computational learning theory. In this work, we study the computational complexity of quantum state learning, which can be seen as a quantum generalization of distributional learning introduced by Kearns et.al [STOC94]. Previous works by Chung and Lin [TQC21], and B\\u{a}descu and O$'$Donnell [STOC21] study the sample complexity of the quantum state learning and show that polynomial copies are sufficient if unknown quantum stat","authors_text":"Min-Hsiu Hsieh, Taiga Hiroka","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T06:25:36Z","title":"Computational Complexity of Learning Efficiently Generatable Pure States"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04373","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:a2ccee0d5e110449c83529ec38b273f679b87e54bb5b5402500cd7c34360b96e","target":"record","created_at":"2026-07-05T09:16:33Z","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":"e524f48cb08d9574e88118f8daf818097dca277f22c7248d31ce764fa4379aa6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T06:25:36Z","title_canon_sha256":"ac7019a58ef4e06662bfe8b3f59e18e675a1337f130113ef899cecf1475a0c30"},"schema_version":"1.0","source":{"id":"2410.04373","kind":"arxiv","version":1}},"canonical_sha256":"f7b917ed919147fb649464d9a90a2af1918338f1a8f40f35b9d8326c390a9c14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7b917ed919147fb649464d9a90a2af1918338f1a8f40f35b9d8326c390a9c14","first_computed_at":"2026-07-05T09:16:33.497487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:16:33.497487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CTM7hRDr80h3fc7p91ZXNEGJySgvHlsNk77x5h+nuktvdK9CcE63sbFW01XSTo+tiXOLVNmJ3p0e4zqfpcySDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:16:33.497840Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.04373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2ccee0d5e110449c83529ec38b273f679b87e54bb5b5402500cd7c34360b96e","sha256:50fb417ad459633b9d80eb5a765b100f161f53a57893a1097073dfec04b0c7a8"],"state_sha256":"ed9158f555219f650652863f663327f4d05a3973a081a9456c31625c7841387f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4nRLtclcTBpq9d2Et9GahnDjkEZU0ZKtQc+I8kFrmNvk6hv5iJpQV+wf/J4qU8Sau4M5R/3FdfFxi7Pq3z+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T15:44:20.044432Z","bundle_sha256":"518c7d62e5d06f3cdec4b057feae295abad718a2d50bb0920f80464ce11dd188"}}