{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7SL36IWLVXQORXRYCHBGA3Z3FV","short_pith_number":"pith:7SL36IWL","schema_version":"1.0","canonical_sha256":"fc97bf22cbade0e8de3811c2606f3b2d55fef9a2199ebcf18e4bcb2fed1a7c34","source":{"kind":"arxiv","id":"2203.02400","version":1},"attestation_state":"computed","paper":{"title":"Quantum Approximate Optimization Algorithm for Bayesian network structure learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Concha Bielza, Pedro Larra\\~naga, Vicente P. Soloviev","submitted_at":"2022-03-04T16:11:34Z","abstract_excerpt":"Bayesian network structure learning is an NP-hard problem that has been faced by a number of traditional approaches in recent decades. Currently, quantum technologies offer a wide range of advantages that can be exploited to solve optimization tasks that cannot be addressed in an efficient way when utilizing classic computing approaches. In this work, a specific type of variational quantum algorithm, the quantum approximate optimization algorithm, was used to solve the Bayesian network structure learning problem, by employing $3n(n-1)/2$ qubits, where $n$ is the number of nodes in the Bayesian"},"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":"2203.02400","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T16:11:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6df37688ef6aea8a0cef182f4742076efc8f2b6b01cb5b4e4f7060acde9bc89b","abstract_canon_sha256":"65354efdd346dfee3a6ea5cd266c643a7a3e2596d30babda0c95bbad4aa7e335"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:02:04.304748Z","signature_b64":"S2PMTnY7L4tVJPZgvDw5uiHw/j4jar8xiGbd8jX6CoMPu3V363ZsR6H/UZULyenkTtIAPiQXl6N/daIxNpxlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc97bf22cbade0e8de3811c2606f3b2d55fef9a2199ebcf18e4bcb2fed1a7c34","last_reissued_at":"2026-07-05T04:02:04.304309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:02:04.304309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Approximate Optimization Algorithm for Bayesian network structure learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Concha Bielza, Pedro Larra\\~naga, Vicente P. Soloviev","submitted_at":"2022-03-04T16:11:34Z","abstract_excerpt":"Bayesian network structure learning is an NP-hard problem that has been faced by a number of traditional approaches in recent decades. Currently, quantum technologies offer a wide range of advantages that can be exploited to solve optimization tasks that cannot be addressed in an efficient way when utilizing classic computing approaches. In this work, a specific type of variational quantum algorithm, the quantum approximate optimization algorithm, was used to solve the Bayesian network structure learning problem, by employing $3n(n-1)/2$ qubits, where $n$ is the number of nodes in the Bayesian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02400","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/2203.02400/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":"2203.02400","created_at":"2026-07-05T04:02:04.304392+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.02400v1","created_at":"2026-07-05T04:02:04.304392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02400","created_at":"2026-07-05T04:02:04.304392+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SL36IWLVXQO","created_at":"2026-07-05T04:02:04.304392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SL36IWLVXQORXRY","created_at":"2026-07-05T04:02:04.304392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SL36IWL","created_at":"2026-07-05T04:02:04.304392+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/7SL36IWLVXQORXRYCHBGA3Z3FV","json":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV.json","graph_json":"https://pith.science/api/pith-number/7SL36IWLVXQORXRYCHBGA3Z3FV/graph.json","events_json":"https://pith.science/api/pith-number/7SL36IWLVXQORXRYCHBGA3Z3FV/events.json","paper":"https://pith.science/paper/7SL36IWL"},"agent_actions":{"view_html":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV","download_json":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV.json","view_paper":"https://pith.science/paper/7SL36IWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.02400&json=true","fetch_graph":"https://pith.science/api/pith-number/7SL36IWLVXQORXRYCHBGA3Z3FV/graph.json","fetch_events":"https://pith.science/api/pith-number/7SL36IWLVXQORXRYCHBGA3Z3FV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/action/storage_attestation","attest_author":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/action/author_attestation","sign_citation":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/action/citation_signature","submit_replication":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/action/replication_record"}},"created_at":"2026-07-05T04:02:04.304392+00:00","updated_at":"2026-07-05T04:02:04.304392+00:00"}