{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SW3TKNNEQOMVDNO5DDE7CHHBTU","short_pith_number":"pith:SW3TKNNE","canonical_record":{"source":{"id":"1806.09660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-25T18:48:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"61e1cee1f5201d0f5875ad8a90ef9962532a1d67a3f416c66c928e46b1d29eeb","abstract_canon_sha256":"51d0e3cdd32863af9c4078290e1626b025d8f2277a303d49f9b497369b8c78ec"},"schema_version":"1.0"},"canonical_sha256":"95b73535a4839951b5dd18c9f11ce19d08f80036f32060176d51a8cf392195b8","source":{"kind":"arxiv","id":"1806.09660","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09660","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09660v1","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09660","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"SW3TKNNEQOMV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SW3TKNNEQOMVDNO5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SW3TKNNE","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SW3TKNNEQOMVDNO5DDE7CHHBTU","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-25T18:48:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"61e1cee1f5201d0f5875ad8a90ef9962532a1d67a3f416c66c928e46b1d29eeb","abstract_canon_sha256":"51d0e3cdd32863af9c4078290e1626b025d8f2277a303d49f9b497369b8c78ec"},"schema_version":"1.0"},"canonical_sha256":"95b73535a4839951b5dd18c9f11ce19d08f80036f32060176d51a8cf392195b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:23.811638Z","signature_b64":"i6bDuc2W5Zh8nlAlQN0OJ5tOrSjT4akwnwaapc7TK8BZekkRj6GPnLLL3V3nOOW5JRY7+YXGCsuZuIFsUhDNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95b73535a4839951b5dd18c9f11ce19d08f80036f32060176d51a8cf392195b8","last_reissued_at":"2026-05-18T00:12:23.810896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:23.810896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09660","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-18T00:12:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqLdf5J3tdWiKd6aY4t4y1AUTPS+d/PXzceLUaahXwmXvejdFu6c6e8b2skSgTcJrN7MSndt19YFRyKoEYnXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:35:33.282114Z"},"content_sha256":"633ce30aabc2f59627b36a5bd223296ef927469fcefc9e8a5bf743fa05f84a93","schema_version":"1.0","event_id":"sha256:633ce30aabc2f59627b36a5bd223296ef927469fcefc9e8a5bf743fa05f84a93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SW3TKNNEQOMVDNO5DDE7CHHBTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On learning linear functions from subset and its applications in quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Anupam Prakash, G\\'abor Ivanyos, Miklos Santha","submitted_at":"2018-06-25T18:48:36Z","abstract_excerpt":"Let $\\mathbb{F}_q$ be the finite field of size $q$ and let $\\ell: \\mathbb{F}_q^n \\to \\mathbb{F}_q$ be a linear function. We introduce the {\\em Learning From Subset} problem LFS$(q,n,d)$ of learning $\\ell$, given samples $u \\in \\mathbb{F}_q^n$ from a special distribution depending on $\\ell$: the probability of sampling $u$ is a function of $\\ell(u)$ and is non zero for at most $d$ values of $\\ell(u)$. We provide a randomized algorithm for LFS$(q,n,d)$ with sample complexity $(n+d)^{O(d)}$ and running time polynomial in $\\log q$ and $(n+d)^{O(d)}$. Our algorithm generalizes and improves upon pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09660","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-18T00:12:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPEu9ujd9D8nES0Z5GtAeJwxllar4sfavnPXLV0K2qTvl+hO02SRm3X8QIfa3NWECoI9ppAq4LzIY05+WYCaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:35:33.282479Z"},"content_sha256":"08edc0ba5b266d07c1bd17de4e579ff6a6c0580d0cdcf9aa3aafdb2ddbb07100","schema_version":"1.0","event_id":"sha256:08edc0ba5b266d07c1bd17de4e579ff6a6c0580d0cdcf9aa3aafdb2ddbb07100"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SW3TKNNEQOMVDNO5DDE7CHHBTU/bundle.json","state_url":"https://pith.science/pith/SW3TKNNEQOMVDNO5DDE7CHHBTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SW3TKNNEQOMVDNO5DDE7CHHBTU/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-01T09:35:33Z","links":{"resolver":"https://pith.science/pith/SW3TKNNEQOMVDNO5DDE7CHHBTU","bundle":"https://pith.science/pith/SW3TKNNEQOMVDNO5DDE7CHHBTU/bundle.json","state":"https://pith.science/pith/SW3TKNNEQOMVDNO5DDE7CHHBTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SW3TKNNEQOMVDNO5DDE7CHHBTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SW3TKNNEQOMVDNO5DDE7CHHBTU","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":"51d0e3cdd32863af9c4078290e1626b025d8f2277a303d49f9b497369b8c78ec","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-25T18:48:36Z","title_canon_sha256":"61e1cee1f5201d0f5875ad8a90ef9962532a1d67a3f416c66c928e46b1d29eeb"},"schema_version":"1.0","source":{"id":"1806.09660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09660","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09660v1","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09660","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"SW3TKNNEQOMV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SW3TKNNEQOMVDNO5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SW3TKNNE","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:08edc0ba5b266d07c1bd17de4e579ff6a6c0580d0cdcf9aa3aafdb2ddbb07100","target":"graph","created_at":"2026-05-18T00:12:23Z","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":"Let $\\mathbb{F}_q$ be the finite field of size $q$ and let $\\ell: \\mathbb{F}_q^n \\to \\mathbb{F}_q$ be a linear function. We introduce the {\\em Learning From Subset} problem LFS$(q,n,d)$ of learning $\\ell$, given samples $u \\in \\mathbb{F}_q^n$ from a special distribution depending on $\\ell$: the probability of sampling $u$ is a function of $\\ell(u)$ and is non zero for at most $d$ values of $\\ell(u)$. We provide a randomized algorithm for LFS$(q,n,d)$ with sample complexity $(n+d)^{O(d)}$ and running time polynomial in $\\log q$ and $(n+d)^{O(d)}$. Our algorithm generalizes and improves upon pre","authors_text":"Anupam Prakash, G\\'abor Ivanyos, Miklos Santha","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-25T18:48:36Z","title":"On learning linear functions from subset and its applications in quantum computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09660","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:633ce30aabc2f59627b36a5bd223296ef927469fcefc9e8a5bf743fa05f84a93","target":"record","created_at":"2026-05-18T00:12:23Z","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":"51d0e3cdd32863af9c4078290e1626b025d8f2277a303d49f9b497369b8c78ec","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-25T18:48:36Z","title_canon_sha256":"61e1cee1f5201d0f5875ad8a90ef9962532a1d67a3f416c66c928e46b1d29eeb"},"schema_version":"1.0","source":{"id":"1806.09660","kind":"arxiv","version":1}},"canonical_sha256":"95b73535a4839951b5dd18c9f11ce19d08f80036f32060176d51a8cf392195b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95b73535a4839951b5dd18c9f11ce19d08f80036f32060176d51a8cf392195b8","first_computed_at":"2026-05-18T00:12:23.810896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:23.810896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i6bDuc2W5Zh8nlAlQN0OJ5tOrSjT4akwnwaapc7TK8BZekkRj6GPnLLL3V3nOOW5JRY7+YXGCsuZuIFsUhDNCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:23.811638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:633ce30aabc2f59627b36a5bd223296ef927469fcefc9e8a5bf743fa05f84a93","sha256:08edc0ba5b266d07c1bd17de4e579ff6a6c0580d0cdcf9aa3aafdb2ddbb07100"],"state_sha256":"ccd148bdaba978af3eeb666d4672f0cdbdae3e126a6e72ab9cac0d898bd29d61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8Fzr8elUCv1/IhBQwuhbZwJdUuF70eRIyXlJBGxnR/6bPAL6CE5V/88a+urzw2hBHp/hGGVc0/7GcQD3fbhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:35:33.284430Z","bundle_sha256":"7c9fe86c74373d2ce885ed1cc09a6152174c159aa9961d3b15bf99e0c9faa018"}}