{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KRFMONNWS4WSZCQ7WH6KRSP57D","short_pith_number":"pith:KRFMONNW","canonical_record":{"source":{"id":"2605.06633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-07T17:44:45Z","cross_cats_sorted":["hep-th"],"title_canon_sha256":"8af4ba1c9d2f63089d2e6460f90326f629eb3df78ca45816a6bcb2a4dfc6fb6f","abstract_canon_sha256":"6e9f46c055d107023deade3d6990c288453ab8c7d7243c387cfbd982fcea8356"},"schema_version":"1.0"},"canonical_sha256":"544ac735b6972d2c8a1fb1fca8c9fdf8d3d829403b5931f66bf0a4a159bfce94","source":{"kind":"arxiv","id":"2605.06633","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06633","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06633v2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06633","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"KRFMONNWS4WS","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"KRFMONNWS4WSZCQ7","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"KRFMONNW","created_at":"2026-05-21T01:04:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KRFMONNWS4WSZCQ7WH6KRSP57D","target":"record","payload":{"canonical_record":{"source":{"id":"2605.06633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-07T17:44:45Z","cross_cats_sorted":["hep-th"],"title_canon_sha256":"8af4ba1c9d2f63089d2e6460f90326f629eb3df78ca45816a6bcb2a4dfc6fb6f","abstract_canon_sha256":"6e9f46c055d107023deade3d6990c288453ab8c7d7243c387cfbd982fcea8356"},"schema_version":"1.0"},"canonical_sha256":"544ac735b6972d2c8a1fb1fca8c9fdf8d3d829403b5931f66bf0a4a159bfce94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:27.005215Z","signature_b64":"ZUHUz6vZJnc6WAM9N7P7FDlKFaiaMyR/3jBE/ex9kUliOKpE4HUI8dN3sx1sxCZJ0xD6ozrS+jms8qj5uhpPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"544ac735b6972d2c8a1fb1fca8c9fdf8d3d829403b5931f66bf0a4a159bfce94","last_reissued_at":"2026-05-21T01:04:27.004673Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:27.004673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.06633","source_version":2,"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-05-21T01:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LdzraSYXzvG4cXn871RC9K9KvFCsJAva+K8TISgQPOj9zTf0PdRTKiaBcai84djcy6LDoaXzvaYZcJEO41qBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:50:32.220264Z"},"content_sha256":"57a1cd770e154fbc9612b65d6cd87967499d323a2395b6d8f5e5010f4c58c424","schema_version":"1.0","event_id":"sha256:57a1cd770e154fbc9612b65d6cd87967499d323a2395b6d8f5e5010f4c58c424"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KRFMONNWS4WSZCQ7WH6KRSP57D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Machine Learning Approaches to Building Quantum Circuits for Sets of Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Machine learning parameters directly produce a universal shortest quantum circuit for diagonal matrices of any size.","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Andrei Morozov, Matvei Fedin","submitted_at":"2026-05-07T17:44:45Z","abstract_excerpt":"Machine learning nowadays becomes a useful instrument in many subjects. In this paper we use interpretable machine learning to build quantum algorithm. By studying the parameters of the machine learning algorithm we were able to construct universal shortest analytic quantum algorithm for arbitrary diagonal matrix of any size."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By studying the parameters of the machine learning algorithm we were able to construct universal shortest analytic quantum algorithm for arbitrary diagonal matrix of any size.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the parameters learned by the machine learning model directly translate into the shortest and truly universal analytic quantum circuit without additional unstated optimizations or assumptions about matrix structure.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Interpretable machine learning yields a universal shortest analytic quantum algorithm for arbitrary diagonal matrices of any size.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Machine learning parameters directly produce a universal shortest quantum circuit for diagonal matrices of any size.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8331f403af42e8344e8a061edf0ce1c5721230813e8b05a01d7eabbabd6e7da9"},"source":{"id":"2605.06633","kind":"arxiv","version":2},"verdict":{"id":"ce366e15-c541-4742-84fe-dceeb8133659","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T10:53:12.689497Z","strongest_claim":"By studying the parameters of the machine learning algorithm we were able to construct universal shortest analytic quantum algorithm for arbitrary diagonal matrix of any size.","one_line_summary":"Interpretable machine learning yields a universal shortest analytic quantum algorithm for arbitrary diagonal matrices of any size.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the parameters learned by the machine learning model directly translate into the shortest and truly universal analytic quantum circuit without additional unstated optimizations or assumptions about matrix structure.","pith_extraction_headline":"Machine learning parameters directly produce a universal shortest quantum circuit for diagonal matrices of any size."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.06633/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T12:02:03.919448Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T07:37:21.018075Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T18:01:19.242555Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T12:32:50.736743Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"4b350e7977fae64f2d2830f2478bb1e93da38ae71215e47bd03b6f3da0077f61"},"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":"ce366e15-c541-4742-84fe-dceeb8133659"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yilz/xcFA0/+Ry5Hb/xrgSa6Gfp94hT429CioZPcSkYeikmG13ImkCwsWtSw0SVddQEPm9Tw0XE9Q6Ly9KeLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:50:32.220808Z"},"content_sha256":"e5aae43a12da330cafa2dadc77f18d2d7c4669d58cddc7dc10384fd2365db8b8","schema_version":"1.0","event_id":"sha256:e5aae43a12da330cafa2dadc77f18d2d7c4669d58cddc7dc10384fd2365db8b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRFMONNWS4WSZCQ7WH6KRSP57D/bundle.json","state_url":"https://pith.science/pith/KRFMONNWS4WSZCQ7WH6KRSP57D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRFMONNWS4WSZCQ7WH6KRSP57D/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-05-27T20:50:32Z","links":{"resolver":"https://pith.science/pith/KRFMONNWS4WSZCQ7WH6KRSP57D","bundle":"https://pith.science/pith/KRFMONNWS4WSZCQ7WH6KRSP57D/bundle.json","state":"https://pith.science/pith/KRFMONNWS4WSZCQ7WH6KRSP57D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRFMONNWS4WSZCQ7WH6KRSP57D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KRFMONNWS4WSZCQ7WH6KRSP57D","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":"6e9f46c055d107023deade3d6990c288453ab8c7d7243c387cfbd982fcea8356","cross_cats_sorted":["hep-th"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-07T17:44:45Z","title_canon_sha256":"8af4ba1c9d2f63089d2e6460f90326f629eb3df78ca45816a6bcb2a4dfc6fb6f"},"schema_version":"1.0","source":{"id":"2605.06633","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06633","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06633v2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06633","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"KRFMONNWS4WS","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"KRFMONNWS4WSZCQ7","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"KRFMONNW","created_at":"2026-05-21T01:04:27Z"}],"graph_snapshots":[{"event_id":"sha256:e5aae43a12da330cafa2dadc77f18d2d7c4669d58cddc7dc10384fd2365db8b8","target":"graph","created_at":"2026-05-21T01:04:27Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"By studying the parameters of the machine learning algorithm we were able to construct universal shortest analytic quantum algorithm for arbitrary diagonal matrix of any size."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the parameters learned by the machine learning model directly translate into the shortest and truly universal analytic quantum circuit without additional unstated optimizations or assumptions about matrix structure."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Interpretable machine learning yields a universal shortest analytic quantum algorithm for arbitrary diagonal matrices of any size."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Machine learning parameters directly produce a universal shortest quantum circuit for diagonal matrices of any size."}],"snapshot_sha256":"8331f403af42e8344e8a061edf0ce1c5721230813e8b05a01d7eabbabd6e7da9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T12:02:03.919448Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T07:37:21.018075Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:01:19.242555Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T12:32:50.736743Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.06633/integrity.json","findings":[],"snapshot_sha256":"4b350e7977fae64f2d2830f2478bb1e93da38ae71215e47bd03b6f3da0077f61","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Machine learning nowadays becomes a useful instrument in many subjects. In this paper we use interpretable machine learning to build quantum algorithm. By studying the parameters of the machine learning algorithm we were able to construct universal shortest analytic quantum algorithm for arbitrary diagonal matrix of any size.","authors_text":"Andrei Morozov, Matvei Fedin","cross_cats":["hep-th"],"headline":"Machine learning parameters directly produce a universal shortest quantum circuit for diagonal matrices of any size.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-07T17:44:45Z","title":"Machine Learning Approaches to Building Quantum Circuits for Sets of Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.06633","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T10:53:12.689497Z","id":"ce366e15-c541-4742-84fe-dceeb8133659","model_set":{"reader":"grok-4.3"},"one_line_summary":"Interpretable machine learning yields a universal shortest analytic quantum algorithm for arbitrary diagonal matrices of any size.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Machine learning parameters directly produce a universal shortest quantum circuit for diagonal matrices of any size.","strongest_claim":"By studying the parameters of the machine learning algorithm we were able to construct universal shortest analytic quantum algorithm for arbitrary diagonal matrix of any size.","weakest_assumption":"That the parameters learned by the machine learning model directly translate into the shortest and truly universal analytic quantum circuit without additional unstated optimizations or assumptions about matrix structure."}},"verdict_id":"ce366e15-c541-4742-84fe-dceeb8133659"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:57a1cd770e154fbc9612b65d6cd87967499d323a2395b6d8f5e5010f4c58c424","target":"record","created_at":"2026-05-21T01:04:27Z","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":"6e9f46c055d107023deade3d6990c288453ab8c7d7243c387cfbd982fcea8356","cross_cats_sorted":["hep-th"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-07T17:44:45Z","title_canon_sha256":"8af4ba1c9d2f63089d2e6460f90326f629eb3df78ca45816a6bcb2a4dfc6fb6f"},"schema_version":"1.0","source":{"id":"2605.06633","kind":"arxiv","version":2}},"canonical_sha256":"544ac735b6972d2c8a1fb1fca8c9fdf8d3d829403b5931f66bf0a4a159bfce94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"544ac735b6972d2c8a1fb1fca8c9fdf8d3d829403b5931f66bf0a4a159bfce94","first_computed_at":"2026-05-21T01:04:27.004673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:27.004673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZUHUz6vZJnc6WAM9N7P7FDlKFaiaMyR/3jBE/ex9kUliOKpE4HUI8dN3sx1sxCZJ0xD6ozrS+jms8qj5uhpPAg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:27.005215Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.06633","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57a1cd770e154fbc9612b65d6cd87967499d323a2395b6d8f5e5010f4c58c424","sha256:e5aae43a12da330cafa2dadc77f18d2d7c4669d58cddc7dc10384fd2365db8b8"],"state_sha256":"799fa16ddf77cbccd0ba49fa2766aec2a55733e605d051ce6610a18418a4e8fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3U19gJOSJ4N2gLWOmsJAlBJpjEYLlBqE8rxJOmSY8U8Y8+zJmzSRDx3Hd16T2fMroFLhzm50CIJVDYOCbJTbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:50:32.224184Z","bundle_sha256":"f3150eac26ef6be58bb83a71da66c537b5d98a5d1c64104ff73903e92f3a43df"}}