{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VDC64DWWNITX3YC7N5LSAOJTV7","short_pith_number":"pith:VDC64DWW","schema_version":"1.0","canonical_sha256":"a8c5ee0ed66a277de05f6f57203933afccd42755c2e8f138d1c281ee093402b5","source":{"kind":"arxiv","id":"2411.09123","version":1},"attestation_state":"computed","paper":{"title":"Quantum multi-output Gaussian Processes based Machine Learning for Line Parameter Estimation in Electrical Grids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Antonello Monti, Corey O'Meara, Giorgio Cortiana, Jan Schiefelbein-Lach, Kumar Ghosh, Priyanka Arkalgud Ganeshamurthy","submitted_at":"2024-11-14T01:44:39Z","abstract_excerpt":"Gaussian process (GP) is a powerful modeling method with applications in machine learning for various engineering and non-engineering fields. Despite numerous benefits of modeling using GPs, the computational complexity associated with GPs demanding immense resources make their practical usage highly challenging. In this article, we develop a quantum version of multi-output Gaussian Process (QGP) by implementing a well-known quantum algorithm called HHL, to perform the Kernel matrix inversion within the Gaussian Process. To reduce the large circuit depth of HHL a circuit optimization technique"},"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":"2411.09123","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-14T01:44:39Z","cross_cats_sorted":[],"title_canon_sha256":"0dcb13c6bba2716e3a47edccff67de936ed400184e210e083316690ecc15d3e1","abstract_canon_sha256":"397b6a8c3ce91461c8e80bb4736a23c2ba62bfeb7edc4748254c47d03c49c529"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:20.518475Z","signature_b64":"Z23KaTJ70dhLpvGl6ikMcJ4265i57QMBU1vTABBXLxRIbe/86eejHUpSajUZN2aro+xDZfRCplvKtVzoyB//DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8c5ee0ed66a277de05f6f57203933afccd42755c2e8f138d1c281ee093402b5","last_reissued_at":"2026-07-05T09:35:20.517965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:20.517965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum multi-output Gaussian Processes based Machine Learning for Line Parameter Estimation in Electrical Grids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Antonello Monti, Corey O'Meara, Giorgio Cortiana, Jan Schiefelbein-Lach, Kumar Ghosh, Priyanka Arkalgud Ganeshamurthy","submitted_at":"2024-11-14T01:44:39Z","abstract_excerpt":"Gaussian process (GP) is a powerful modeling method with applications in machine learning for various engineering and non-engineering fields. Despite numerous benefits of modeling using GPs, the computational complexity associated with GPs demanding immense resources make their practical usage highly challenging. In this article, we develop a quantum version of multi-output Gaussian Process (QGP) by implementing a well-known quantum algorithm called HHL, to perform the Kernel matrix inversion within the Gaussian Process. To reduce the large circuit depth of HHL a circuit optimization technique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09123","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/2411.09123/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":"2411.09123","created_at":"2026-07-05T09:35:20.518031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09123v1","created_at":"2026-07-05T09:35:20.518031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09123","created_at":"2026-07-05T09:35:20.518031+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDC64DWWNITX","created_at":"2026-07-05T09:35:20.518031+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDC64DWWNITX3YC7","created_at":"2026-07-05T09:35:20.518031+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDC64DWW","created_at":"2026-07-05T09:35:20.518031+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7","json":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7.json","graph_json":"https://pith.science/api/pith-number/VDC64DWWNITX3YC7N5LSAOJTV7/graph.json","events_json":"https://pith.science/api/pith-number/VDC64DWWNITX3YC7N5LSAOJTV7/events.json","paper":"https://pith.science/paper/VDC64DWW"},"agent_actions":{"view_html":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7","download_json":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7.json","view_paper":"https://pith.science/paper/VDC64DWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09123&json=true","fetch_graph":"https://pith.science/api/pith-number/VDC64DWWNITX3YC7N5LSAOJTV7/graph.json","fetch_events":"https://pith.science/api/pith-number/VDC64DWWNITX3YC7N5LSAOJTV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7/action/storage_attestation","attest_author":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7/action/author_attestation","sign_citation":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7/action/citation_signature","submit_replication":"https://pith.science/pith/VDC64DWWNITX3YC7N5LSAOJTV7/action/replication_record"}},"created_at":"2026-07-05T09:35:20.518031+00:00","updated_at":"2026-07-05T09:35:20.518031+00:00"}