{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:7SL36IWLVXQORXRYCHBGA3Z3FV","short_pith_number":"pith:7SL36IWL","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"},"canonical_sha256":"fc97bf22cbade0e8de3811c2606f3b2d55fef9a2199ebcf18e4bcb2fed1a7c34","source":{"kind":"arxiv","id":"2203.02400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.02400","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"2203.02400v1","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02400","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"7SL36IWLVXQO","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"pith_short_16","alias_value":"7SL36IWLVXQORXRY","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"pith_short_8","alias_value":"7SL36IWL","created_at":"2026-07-05T04:02:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:7SL36IWLVXQORXRYCHBGA3Z3FV","target":"record","payload":{"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"},"canonical_sha256":"fc97bf22cbade0e8de3811c2606f3b2d55fef9a2199ebcf18e4bcb2fed1a7c34","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"},"source_kind":"arxiv","source_id":"2203.02400","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-05T04:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3nMAXu3g7OmoTNbzWQ9TnYSiu4Y1mvV+0VWNBTTg+cP5g1VQIAYS9M12XU2hPRKazA8XuC1dNLU7KzL20hVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T17:50:59.098506Z"},"content_sha256":"999afef2b566531aa97d71ca147efa5ab60a24169a8b27a3f5ddeaba324ac9b8","schema_version":"1.0","event_id":"sha256:999afef2b566531aa97d71ca147efa5ab60a24169a8b27a3f5ddeaba324ac9b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:7SL36IWLVXQORXRYCHBGA3Z3FV","target":"graph","payload":{"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"},"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-05T04:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blpbQ70i8rUBHZx5v6ySt3MuDyMKcW8G/f+fCRx4KK3gVreRPaazKlz/TD1K2iAb3IOvcCuGPmoxUS8RAgmCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T17:50:59.098880Z"},"content_sha256":"074a349ff0f30afea4a34b0142877f37a499e74dff29b1576e75c7b4cc05afb5","schema_version":"1.0","event_id":"sha256:074a349ff0f30afea4a34b0142877f37a499e74dff29b1576e75c7b4cc05afb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/bundle.json","state_url":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/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-07-11T17:50:59Z","links":{"resolver":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV","bundle":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/bundle.json","state":"https://pith.science/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SL36IWLVXQORXRYCHBGA3Z3FV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7SL36IWLVXQORXRYCHBGA3Z3FV","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":"65354efdd346dfee3a6ea5cd266c643a7a3e2596d30babda0c95bbad4aa7e335","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T16:11:34Z","title_canon_sha256":"6df37688ef6aea8a0cef182f4742076efc8f2b6b01cb5b4e4f7060acde9bc89b"},"schema_version":"1.0","source":{"id":"2203.02400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.02400","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"2203.02400v1","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02400","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"7SL36IWLVXQO","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"pith_short_16","alias_value":"7SL36IWLVXQORXRY","created_at":"2026-07-05T04:02:04Z"},{"alias_kind":"pith_short_8","alias_value":"7SL36IWL","created_at":"2026-07-05T04:02:04Z"}],"graph_snapshots":[{"event_id":"sha256:074a349ff0f30afea4a34b0142877f37a499e74dff29b1576e75c7b4cc05afb5","target":"graph","created_at":"2026-07-05T04:02:04Z","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/2203.02400/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Concha Bielza, Pedro Larra\\~naga, Vicente P. Soloviev","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T16:11:34Z","title":"Quantum Approximate Optimization Algorithm for Bayesian network structure learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02400","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:999afef2b566531aa97d71ca147efa5ab60a24169a8b27a3f5ddeaba324ac9b8","target":"record","created_at":"2026-07-05T04:02:04Z","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":"65354efdd346dfee3a6ea5cd266c643a7a3e2596d30babda0c95bbad4aa7e335","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-03-04T16:11:34Z","title_canon_sha256":"6df37688ef6aea8a0cef182f4742076efc8f2b6b01cb5b4e4f7060acde9bc89b"},"schema_version":"1.0","source":{"id":"2203.02400","kind":"arxiv","version":1}},"canonical_sha256":"fc97bf22cbade0e8de3811c2606f3b2d55fef9a2199ebcf18e4bcb2fed1a7c34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc97bf22cbade0e8de3811c2606f3b2d55fef9a2199ebcf18e4bcb2fed1a7c34","first_computed_at":"2026-07-05T04:02:04.304309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:02:04.304309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S2PMTnY7L4tVJPZgvDw5uiHw/j4jar8xiGbd8jX6CoMPu3V363ZsR6H/UZULyenkTtIAPiQXl6N/daIxNpxlAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:02:04.304748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.02400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:999afef2b566531aa97d71ca147efa5ab60a24169a8b27a3f5ddeaba324ac9b8","sha256:074a349ff0f30afea4a34b0142877f37a499e74dff29b1576e75c7b4cc05afb5"],"state_sha256":"de41c68fd951dd2b9debd7702812fbc24cf6f333306fbd78fb7421a5b561ed71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iI8WomuWfeG7H967KGYqFU2l5w+ZfW+Zk5pJwDJW5y8D9cW23miRhQizAdxr1Dx3ZNyUpP2lBnX6K7rzKTkfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T17:50:59.100911Z","bundle_sha256":"223d1db471f942bab0e20ac3db40dd8c21f9661839cdbd51c3980ac7629a876d"}}