{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:M6AVIDO2VNTTZKWJWFTI7BXAWG","short_pith_number":"pith:M6AVIDO2","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"},"canonical_sha256":"6781540ddaab673caac9b1668f86e0b1b91d2f9930170889ca5ffefe5541ca48","source":{"kind":"arxiv","id":"2109.01014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.01014","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"arxiv_version","alias_value":"2109.01014v1","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01014","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"pith_short_12","alias_value":"M6AVIDO2VNTT","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"pith_short_16","alias_value":"M6AVIDO2VNTTZKWJ","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"pith_short_8","alias_value":"M6AVIDO2","created_at":"2026-07-05T03:11:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:M6AVIDO2VNTTZKWJWFTI7BXAWG","target":"record","payload":{"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"},"canonical_sha256":"6781540ddaab673caac9b1668f86e0b1b91d2f9930170889ca5ffefe5541ca48","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"},"source_kind":"arxiv","source_id":"2109.01014","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-05T03:11:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCDMcXQ1YaLq6hTwB7tYYsmyJOk5SpyItTPfhYNFZmGaqIlaAk0Wis7bRtrgw1jsiZ2GJV6m3LlMf8x1EFs6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:38:05.710383Z"},"content_sha256":"1f7c40d9e7dce4a67ee9e4a02aa50cda839c65226e43d837b3a1447c302ad5cc","schema_version":"1.0","event_id":"sha256:1f7c40d9e7dce4a67ee9e4a02aa50cda839c65226e43d837b3a1447c302ad5cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:M6AVIDO2VNTTZKWJWFTI7BXAWG","target":"graph","payload":{"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"},"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-05T03:11:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDbpRTYDmLi10UlLIT4ZgjvueR3tk+GpFdkLvu9ANIFfB2w0dhN04Nfi8aTYVjjyKD6TixzQWy/DMjx8qT0uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:38:05.710756Z"},"content_sha256":"2663baa8ca3cd4dccffb0510f6299d1101b7a3b868bd026b7adfbf0c2c8f0181","schema_version":"1.0","event_id":"sha256:2663baa8ca3cd4dccffb0510f6299d1101b7a3b868bd026b7adfbf0c2c8f0181"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/bundle.json","state_url":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/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-05T07:38:05Z","links":{"resolver":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG","bundle":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/bundle.json","state":"https://pith.science/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6AVIDO2VNTTZKWJWFTI7BXAWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:M6AVIDO2VNTTZKWJWFTI7BXAWG","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":"da4f9046bc3f9aa771b793b27a322dd5a0adebba11a95b4113648ec0c8239215","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-09-02T15:22:38Z","title_canon_sha256":"a54d91ec9a7f5d7ff9e1f12db2de1365f12e6ca6e8ab7c0c2f9b903527a22c7c"},"schema_version":"1.0","source":{"id":"2109.01014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.01014","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"arxiv_version","alias_value":"2109.01014v1","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01014","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"pith_short_12","alias_value":"M6AVIDO2VNTT","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"pith_short_16","alias_value":"M6AVIDO2VNTTZKWJ","created_at":"2026-07-05T03:11:49Z"},{"alias_kind":"pith_short_8","alias_value":"M6AVIDO2","created_at":"2026-07-05T03:11:49Z"}],"graph_snapshots":[{"event_id":"sha256:2663baa8ca3cd4dccffb0510f6299d1101b7a3b868bd026b7adfbf0c2c8f0181","target":"graph","created_at":"2026-07-05T03:11:49Z","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/2109.01014/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Liming Zhao, Patrick Rebentrost, Siyi Yang","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-09-02T15:22:38Z","title":"Quantum algorithm for structure learning of Markov Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.01014","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:1f7c40d9e7dce4a67ee9e4a02aa50cda839c65226e43d837b3a1447c302ad5cc","target":"record","created_at":"2026-07-05T03:11:49Z","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":"da4f9046bc3f9aa771b793b27a322dd5a0adebba11a95b4113648ec0c8239215","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-09-02T15:22:38Z","title_canon_sha256":"a54d91ec9a7f5d7ff9e1f12db2de1365f12e6ca6e8ab7c0c2f9b903527a22c7c"},"schema_version":"1.0","source":{"id":"2109.01014","kind":"arxiv","version":1}},"canonical_sha256":"6781540ddaab673caac9b1668f86e0b1b91d2f9930170889ca5ffefe5541ca48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6781540ddaab673caac9b1668f86e0b1b91d2f9930170889ca5ffefe5541ca48","first_computed_at":"2026-07-05T03:11:49.479363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:11:49.479363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pe6GjkBgpumJccQUTA5hEvY0DmV2uadyPuNxYTJtj2IZb8DsetwuaTLgCmPwLV/Bc2j2Q4+PLFa+QC04QxDGBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:11:49.479783Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.01014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f7c40d9e7dce4a67ee9e4a02aa50cda839c65226e43d837b3a1447c302ad5cc","sha256:2663baa8ca3cd4dccffb0510f6299d1101b7a3b868bd026b7adfbf0c2c8f0181"],"state_sha256":"e23e747732cafa0dbba0a9f02f6db048b28884f52f6ed58498dbce98f91e57a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0sCLjzDXhPVPaPvI2gZkT8y66WavR6EFCy4utXrxhvVQ3F20HJ50VV/n6ivOawg9BxIpsH13X39AeI+9E5SxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:38:05.712770Z","bundle_sha256":"1b47e6524ab335da719accd16f926292fba2f7a8a9a63ecc1a00c1f98c905d2c"}}