{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:M6AVIDO2VNTTZKWJWFTI7BXAWG","short_pith_number":"pith:M6AVIDO2","schema_version":"1.0","canonical_sha256":"6781540ddaab673caac9b1668f86e0b1b91d2f9930170889ca5ffefe5541ca48","source":{"kind":"arxiv","id":"2109.01014","version":1},"attestation_state":"computed","paper":{"title":"Quantum algorithm for structure learning of Markov Random Fields","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Liming Zhao, Patrick Rebentrost, Siyi Yang","submitted_at":"2021-09-02T15:22:38Z","abstract_excerpt":"Markov random fields (MRFs) appear in many problems in machine learning and statistics. From a computational learning theory point of view, a natural problem of learning MRFs arises: given samples from an MRF from a restricted class, learn the structure of the MRF, that is the neighbors of each node of the underlying graph. In this work, we start at a known near-optimal classical algorithm for this learning problem and develop a modified classical algorithm. This classical algorithm retains the run time and guarantee of the previous algorithm and enables the use of quantum subroutines. Adaptin"},"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":"2109.01014","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-09-02T15:22:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a54d91ec9a7f5d7ff9e1f12db2de1365f12e6ca6e8ab7c0c2f9b903527a22c7c","abstract_canon_sha256":"da4f9046bc3f9aa771b793b27a322dd5a0adebba11a95b4113648ec0c8239215"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:49.479783Z","signature_b64":"pe6GjkBgpumJccQUTA5hEvY0DmV2uadyPuNxYTJtj2IZb8DsetwuaTLgCmPwLV/Bc2j2Q4+PLFa+QC04QxDGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6781540ddaab673caac9b1668f86e0b1b91d2f9930170889ca5ffefe5541ca48","last_reissued_at":"2026-07-05T03:11:49.479363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:49.479363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithm for structure learning of Markov Random Fields","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Liming Zhao, Patrick Rebentrost, Siyi Yang","submitted_at":"2021-09-02T15:22:38Z","abstract_excerpt":"Markov random fields (MRFs) appear in many problems in machine learning and statistics. From a computational learning theory point of view, a natural problem of learning MRFs arises: given samples from an MRF from a restricted class, learn the structure of the MRF, that is the neighbors of each node of the underlying graph. In this work, we start at a known near-optimal classical algorithm for this learning problem and develop a modified classical algorithm. This classical algorithm retains the run time and guarantee of the previous algorithm and enables the use of quantum subroutines. Adaptin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.01014","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/2109.01014/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":"2109.01014","created_at":"2026-07-05T03:11:49.479426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.01014v1","created_at":"2026-07-05T03:11:49.479426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01014","created_at":"2026-07-05T03:11:49.479426+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6AVIDO2VNTT","created_at":"2026-07-05T03:11:49.479426+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6AVIDO2VNTTZKWJ","created_at":"2026-07-05T03:11:49.479426+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6AVIDO2","created_at":"2026-07-05T03:11:49.479426+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/M6AVIDO2VNTTZKWJWFTI7BXAWG","json":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG.json","graph_json":"https://pith.science/api/pith-number/M6AVIDO2VNTTZKWJWFTI7BXAWG/graph.json","events_json":"https://pith.science/api/pith-number/M6AVIDO2VNTTZKWJWFTI7BXAWG/events.json","paper":"https://pith.science/paper/M6AVIDO2"},"agent_actions":{"view_html":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG","download_json":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG.json","view_paper":"https://pith.science/paper/M6AVIDO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.01014&json=true","fetch_graph":"https://pith.science/api/pith-number/M6AVIDO2VNTTZKWJWFTI7BXAWG/graph.json","fetch_events":"https://pith.science/api/pith-number/M6AVIDO2VNTTZKWJWFTI7BXAWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/action/storage_attestation","attest_author":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/action/author_attestation","sign_citation":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/action/citation_signature","submit_replication":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/action/replication_record"}},"created_at":"2026-07-05T03:11:49.479426+00:00","updated_at":"2026-07-05T03:11:49.479426+00:00"}