{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SYWQJKE466LIHGMLCUHAHFEMOP","short_pith_number":"pith:SYWQJKE4","canonical_record":{"source":{"id":"2406.13412","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-19T10:05:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c29e4e12cea3a12318a9ed0ab7ef7242d9a7c96f90d936e7fb6848a7e5caecb2","abstract_canon_sha256":"4b897583f741ccbc849577a81e4c917a5adc61f4936a9f0b4bf842503e290348"},"schema_version":"1.0"},"canonical_sha256":"962d04a89cf79683998b150e03948c73ce19ec9e6dda2953e7339cbf16588313","source":{"kind":"arxiv","id":"2406.13412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.13412","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"arxiv_version","alias_value":"2406.13412v1","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13412","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"pith_short_12","alias_value":"SYWQJKE466LI","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"pith_short_16","alias_value":"SYWQJKE466LIHGML","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"pith_short_8","alias_value":"SYWQJKE4","created_at":"2026-07-05T12:02:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SYWQJKE466LIHGMLCUHAHFEMOP","target":"record","payload":{"canonical_record":{"source":{"id":"2406.13412","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-19T10:05:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c29e4e12cea3a12318a9ed0ab7ef7242d9a7c96f90d936e7fb6848a7e5caecb2","abstract_canon_sha256":"4b897583f741ccbc849577a81e4c917a5adc61f4936a9f0b4bf842503e290348"},"schema_version":"1.0"},"canonical_sha256":"962d04a89cf79683998b150e03948c73ce19ec9e6dda2953e7339cbf16588313","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:34.726244Z","signature_b64":"3Xa2dBwMLkvqEPSVP9c3ecLabXkWYYr0R+9c8A74NYZ8cUZP/WqfyWx6vCLipVQPz2KutxXk+J3l2fUf2BDcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"962d04a89cf79683998b150e03948c73ce19ec9e6dda2953e7339cbf16588313","last_reissued_at":"2026-07-05T12:02:34.725741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:34.725741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.13412","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-05T12:02:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Spe+kZatkXIruoqLuBVuTS+RHHIFxPhuJRpmQ3EEwTktW7GJISDcYSQPDGCsMIHuEzqF1IBeQ9ptc8cuXrabAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:31:52.675670Z"},"content_sha256":"3852139b7d1353c4c3f3391f57b92727946ce0e14e6178cbb775cb0e96d56a67","schema_version":"1.0","event_id":"sha256:3852139b7d1353c4c3f3391f57b92727946ce0e14e6178cbb775cb0e96d56a67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SYWQJKE466LIHGMLCUHAHFEMOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Valter Uotila","submitted_at":"2024-06-19T10:05:57Z","abstract_excerpt":"Quantum computing and modern tensor-based computing have a strong connection, which is especially demonstrated by simulating quantum computations with tensor networks. The other direction is less studied: quantum computing is not often applied to tensor-based problems. Considering tensor decompositions, we focus on discovering practical matrix multiplication algorithms and develop two algorithms to compute decompositions on quantum computers. The algorithms are expressed as higher-order unconstrained binary optimization (HUBO) problems, which are translated into quadratic unconstrained binary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13412","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/2406.13412/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-05T12:02:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBooyc7zfgf1mJqEX/3dbU9cVzKMx30zfnbG8a/w+YpIma4WimDqPpgIIzyiL/J7sGmgxqtrqtUwp39K7pvxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:31:52.676619Z"},"content_sha256":"2a0757ee3eeb4a9b2901bb6f4ec2c1f101e4dfe01ad2b11376f30df16456dd38","schema_version":"1.0","event_id":"sha256:2a0757ee3eeb4a9b2901bb6f4ec2c1f101e4dfe01ad2b11376f30df16456dd38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/bundle.json","state_url":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYWQJKE466LIHGMLCUHAHFEMOP/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-08-10T12:31:52Z","links":{"resolver":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP","bundle":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/bundle.json","state":"https://pith.science/pith/SYWQJKE466LIHGMLCUHAHFEMOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYWQJKE466LIHGMLCUHAHFEMOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SYWQJKE466LIHGMLCUHAHFEMOP","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":"4b897583f741ccbc849577a81e4c917a5adc61f4936a9f0b4bf842503e290348","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-19T10:05:57Z","title_canon_sha256":"c29e4e12cea3a12318a9ed0ab7ef7242d9a7c96f90d936e7fb6848a7e5caecb2"},"schema_version":"1.0","source":{"id":"2406.13412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.13412","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"arxiv_version","alias_value":"2406.13412v1","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13412","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"pith_short_12","alias_value":"SYWQJKE466LI","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"pith_short_16","alias_value":"SYWQJKE466LIHGML","created_at":"2026-07-05T12:02:34Z"},{"alias_kind":"pith_short_8","alias_value":"SYWQJKE4","created_at":"2026-07-05T12:02:34Z"}],"graph_snapshots":[{"event_id":"sha256:2a0757ee3eeb4a9b2901bb6f4ec2c1f101e4dfe01ad2b11376f30df16456dd38","target":"graph","created_at":"2026-07-05T12:02:34Z","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/2406.13412/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computing and modern tensor-based computing have a strong connection, which is especially demonstrated by simulating quantum computations with tensor networks. The other direction is less studied: quantum computing is not often applied to tensor-based problems. Considering tensor decompositions, we focus on discovering practical matrix multiplication algorithms and develop two algorithms to compute decompositions on quantum computers. The algorithms are expressed as higher-order unconstrained binary optimization (HUBO) problems, which are translated into quadratic unconstrained binary ","authors_text":"Valter Uotila","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-19T10:05:57Z","title":"Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13412","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:3852139b7d1353c4c3f3391f57b92727946ce0e14e6178cbb775cb0e96d56a67","target":"record","created_at":"2026-07-05T12:02:34Z","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":"4b897583f741ccbc849577a81e4c917a5adc61f4936a9f0b4bf842503e290348","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-19T10:05:57Z","title_canon_sha256":"c29e4e12cea3a12318a9ed0ab7ef7242d9a7c96f90d936e7fb6848a7e5caecb2"},"schema_version":"1.0","source":{"id":"2406.13412","kind":"arxiv","version":1}},"canonical_sha256":"962d04a89cf79683998b150e03948c73ce19ec9e6dda2953e7339cbf16588313","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"962d04a89cf79683998b150e03948c73ce19ec9e6dda2953e7339cbf16588313","first_computed_at":"2026-07-05T12:02:34.725741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:34.725741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Xa2dBwMLkvqEPSVP9c3ecLabXkWYYr0R+9c8A74NYZ8cUZP/WqfyWx6vCLipVQPz2KutxXk+J3l2fUf2BDcCg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:34.726244Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.13412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3852139b7d1353c4c3f3391f57b92727946ce0e14e6178cbb775cb0e96d56a67","sha256:2a0757ee3eeb4a9b2901bb6f4ec2c1f101e4dfe01ad2b11376f30df16456dd38"],"state_sha256":"0032a78e668170afa2d732382d99084aca60ba270f955ef6bf4c3c1d730a738b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fbffjEDV0YQ7XsOTen6A3F2XoeH5Zou5hndFtnusFgvizK4TSEwv8Ot3HqDHwdfhA93+JNfc4bZIfcv5CTaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T12:31:52.681339Z","bundle_sha256":"4198d690a57abe4466f0178095cb73279f15da69fec197eacbcc4bc9eebf1bf7"}}