{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:GZ56EXIYTI7DWZDOQFVLMMD7YD","short_pith_number":"pith:GZ56EXIY","schema_version":"1.0","canonical_sha256":"367be25d189a3e3b646e816ab6307fc0d5cc021b1a4bf23c56cd8ede1fdb0ee5","source":{"kind":"arxiv","id":"0811.3208","version":2},"attestation_state":"computed","paper":{"title":"Quantum algorithms for highly non-linear Boolean functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Martin Roetteler","submitted_at":"2008-11-19T21:13:00Z","abstract_excerpt":"Attempts to separate the power of classical and quantum models of computation have a long history. The ultimate goal is to find exponential separations for computational problems. However, such separations do not come a dime a dozen: while there were some early successes in the form of hidden subgroup problems for abelian groups--which generalize Shor's factoring algorithm perhaps most faithfully--only for a handful of non-abelian groups efficient quantum algorithms were found. Recently, problems have gotten increased attention that seek to identify hidden sub-structures of other combinatorial"},"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":"0811.3208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-19T21:13:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a49eaf986a6e13924e9bfd1e0d81f19db40702098547432fc53e26f3e9ee5cda","abstract_canon_sha256":"e2c43359904539201d96565fed56e334bd7e6779ef0b82aff93cd2db008ad2d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:36.337253Z","signature_b64":"KyjI0eWkqEDg/aZszDwoGT/LEgOvgSXBQDZv2GwkDNXdN39St1DdnLka465ZZAYHv/6OSFx90DPbqkUP+4miDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"367be25d189a3e3b646e816ab6307fc0d5cc021b1a4bf23c56cd8ede1fdb0ee5","last_reissued_at":"2026-05-18T03:05:36.336826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:36.336826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms for highly non-linear Boolean functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Martin Roetteler","submitted_at":"2008-11-19T21:13:00Z","abstract_excerpt":"Attempts to separate the power of classical and quantum models of computation have a long history. The ultimate goal is to find exponential separations for computational problems. However, such separations do not come a dime a dozen: while there were some early successes in the form of hidden subgroup problems for abelian groups--which generalize Shor's factoring algorithm perhaps most faithfully--only for a handful of non-abelian groups efficient quantum algorithms were found. Recently, problems have gotten increased attention that seek to identify hidden sub-structures of other combinatorial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.3208","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":""},"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":"0811.3208","created_at":"2026-05-18T03:05:36.336884+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.3208v2","created_at":"2026-05-18T03:05:36.336884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.3208","created_at":"2026-05-18T03:05:36.336884+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZ56EXIYTI7D","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZ56EXIYTI7DWZDO","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZ56EXIY","created_at":"2026-05-18T12:25:57.157939+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/GZ56EXIYTI7DWZDOQFVLMMD7YD","json":"https://pith.science/pith/GZ56EXIYTI7DWZDOQFVLMMD7YD.json","graph_json":"https://pith.science/api/pith-number/GZ56EXIYTI7DWZDOQFVLMMD7YD/graph.json","events_json":"https://pith.science/api/pith-number/GZ56EXIYTI7DWZDOQFVLMMD7YD/events.json","paper":"https://pith.science/paper/GZ56EXIY"},"agent_actions":{"view_html":"https://pith.science/pith/GZ56EXIYTI7DWZDOQFVLMMD7YD","download_json":"https://pith.science/pith/GZ56EXIYTI7DWZDOQFVLMMD7YD.json","view_paper":"https://pith.science/paper/GZ56EXIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.3208&json=true","fetch_graph":"https://pith.science/api/pith-number/GZ56EXIYTI7DWZDOQFVLMMD7YD/graph.json","fetch_events":"https://pith.science/api/pith-number/GZ56EXIYTI7DWZDOQFVLMMD7YD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZ56EXIYTI7DWZDOQFVLMMD7YD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZ56EXIYTI7DWZDOQFVLMMD7YD/action/storage_attestation","attest_author":"https://pith.science/pith/GZ56EXIYTI7DWZDOQFVLMMD7YD/action/author_attestation","sign_citation":"https://pith.science/pith/GZ56EXIYTI7DWZDOQFVLMMD7YD/action/citation_signature","submit_replication":"https://pith.science/pith/GZ56EXIYTI7DWZDOQFVLMMD7YD/action/replication_record"}},"created_at":"2026-05-18T03:05:36.336884+00:00","updated_at":"2026-05-18T03:05:36.336884+00:00"}