{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:XCSZRJRCRJIU2QTKOQ6L262I5U","short_pith_number":"pith:XCSZRJRC","canonical_record":{"source":{"id":"2212.03599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-07T12:29:41Z","cross_cats_sorted":[],"title_canon_sha256":"aae36cef0d7ea51d370c7068678f2d0e13d63d11c773be2c42476bae30b23fd0","abstract_canon_sha256":"2938f77e789c285bd1d45b9923d9b6e415419c4bbbffc54afc41c7204d95a66d"},"schema_version":"1.0"},"canonical_sha256":"b8a598a6228a514d426a743cbd7b48ed3ee64a01b2f5c37f86e6d3793286e091","source":{"kind":"arxiv","id":"2212.03599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03599","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03599v1","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03599","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"XCSZRJRCRJIU","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"XCSZRJRCRJIU2QTK","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"XCSZRJRC","created_at":"2026-07-05T05:23:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:XCSZRJRCRJIU2QTKOQ6L262I5U","target":"record","payload":{"canonical_record":{"source":{"id":"2212.03599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-07T12:29:41Z","cross_cats_sorted":[],"title_canon_sha256":"aae36cef0d7ea51d370c7068678f2d0e13d63d11c773be2c42476bae30b23fd0","abstract_canon_sha256":"2938f77e789c285bd1d45b9923d9b6e415419c4bbbffc54afc41c7204d95a66d"},"schema_version":"1.0"},"canonical_sha256":"b8a598a6228a514d426a743cbd7b48ed3ee64a01b2f5c37f86e6d3793286e091","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:18.295023Z","signature_b64":"0uYJQhvVpPDQbUt8thlY+smcqp4NoCHCK8NNj2243Fo/6fpvWIajv7k4MPg52jtraSb+ysuhYehcFpVV1G56DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8a598a6228a514d426a743cbd7b48ed3ee64a01b2f5c37f86e6d3793286e091","last_reissued_at":"2026-07-05T05:23:18.294600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:18.294600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.03599","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-05T05:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+lyJkFeuGTV6ayUj6GG2fnCFoY2oTgg211Z8a5ytFg99GMEPFe3zz9N8yUVTfuNShxzA+Z3UFH2/hpZ4LHbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:55:01.767356Z"},"content_sha256":"0bd9a227de2d6dd56c34ee818447c60eb336d1481ff44518ace85478f1b1a59d","schema_version":"1.0","event_id":"sha256:0bd9a227de2d6dd56c34ee818447c60eb336d1481ff44518ace85478f1b1a59d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:XCSZRJRCRJIU2QTKOQ6L262I5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Manifold Learning for Dimensionality Reduction: Quantum Isomap algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gongde Guo, Kai Yu, Song Lin, Weijun Feng, Xin Zhang","submitted_at":"2022-12-07T12:29:41Z","abstract_excerpt":"Isomap algorithm is a representative manifold learning algorithm. The algorithm simplifies the data analysis process and is widely used in neuroimaging, spectral analysis and other fields. However, the classic Isomap algorithm becomes unwieldy when dealing with large data sets. Our object is to accelerate the classical algorithm with quantum computing, and propose the quantum Isomap algorithm. The algorithm consists of two sub-algorithms. The first one is the quantum Floyd algorithm, which calculates the shortest distance for any two nodes. The other is quantum Isomap algorithm based on quantu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03599","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/2212.03599/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-05T05:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iN3vBEv86sxeB5VPjKpK4pyo1Kvc++dWDnVlFz2a2i2tV9UNZRm3sHLxEJW8E+XCdPjCql9zTSbtXsTBjbOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:55:01.767881Z"},"content_sha256":"2abeeafcd27041a9b74c0aa55078210c2fc0e7588a5de75dcf7614732d1bebdc","schema_version":"1.0","event_id":"sha256:2abeeafcd27041a9b74c0aa55078210c2fc0e7588a5de75dcf7614732d1bebdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCSZRJRCRJIU2QTKOQ6L262I5U/bundle.json","state_url":"https://pith.science/pith/XCSZRJRCRJIU2QTKOQ6L262I5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCSZRJRCRJIU2QTKOQ6L262I5U/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-09T07:55:01Z","links":{"resolver":"https://pith.science/pith/XCSZRJRCRJIU2QTKOQ6L262I5U","bundle":"https://pith.science/pith/XCSZRJRCRJIU2QTKOQ6L262I5U/bundle.json","state":"https://pith.science/pith/XCSZRJRCRJIU2QTKOQ6L262I5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCSZRJRCRJIU2QTKOQ6L262I5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XCSZRJRCRJIU2QTKOQ6L262I5U","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":"2938f77e789c285bd1d45b9923d9b6e415419c4bbbffc54afc41c7204d95a66d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-07T12:29:41Z","title_canon_sha256":"aae36cef0d7ea51d370c7068678f2d0e13d63d11c773be2c42476bae30b23fd0"},"schema_version":"1.0","source":{"id":"2212.03599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03599","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03599v1","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03599","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"XCSZRJRCRJIU","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"XCSZRJRCRJIU2QTK","created_at":"2026-07-05T05:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"XCSZRJRC","created_at":"2026-07-05T05:23:18Z"}],"graph_snapshots":[{"event_id":"sha256:2abeeafcd27041a9b74c0aa55078210c2fc0e7588a5de75dcf7614732d1bebdc","target":"graph","created_at":"2026-07-05T05:23:18Z","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/2212.03599/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Isomap algorithm is a representative manifold learning algorithm. The algorithm simplifies the data analysis process and is widely used in neuroimaging, spectral analysis and other fields. However, the classic Isomap algorithm becomes unwieldy when dealing with large data sets. Our object is to accelerate the classical algorithm with quantum computing, and propose the quantum Isomap algorithm. The algorithm consists of two sub-algorithms. The first one is the quantum Floyd algorithm, which calculates the shortest distance for any two nodes. The other is quantum Isomap algorithm based on quantu","authors_text":"Gongde Guo, Kai Yu, Song Lin, Weijun Feng, Xin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-07T12:29:41Z","title":"Manifold Learning for Dimensionality Reduction: Quantum Isomap algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03599","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:0bd9a227de2d6dd56c34ee818447c60eb336d1481ff44518ace85478f1b1a59d","target":"record","created_at":"2026-07-05T05:23:18Z","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":"2938f77e789c285bd1d45b9923d9b6e415419c4bbbffc54afc41c7204d95a66d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-07T12:29:41Z","title_canon_sha256":"aae36cef0d7ea51d370c7068678f2d0e13d63d11c773be2c42476bae30b23fd0"},"schema_version":"1.0","source":{"id":"2212.03599","kind":"arxiv","version":1}},"canonical_sha256":"b8a598a6228a514d426a743cbd7b48ed3ee64a01b2f5c37f86e6d3793286e091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8a598a6228a514d426a743cbd7b48ed3ee64a01b2f5c37f86e6d3793286e091","first_computed_at":"2026-07-05T05:23:18.294600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:18.294600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0uYJQhvVpPDQbUt8thlY+smcqp4NoCHCK8NNj2243Fo/6fpvWIajv7k4MPg52jtraSb+ysuhYehcFpVV1G56DA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:18.295023Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.03599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bd9a227de2d6dd56c34ee818447c60eb336d1481ff44518ace85478f1b1a59d","sha256:2abeeafcd27041a9b74c0aa55078210c2fc0e7588a5de75dcf7614732d1bebdc"],"state_sha256":"86c382970ff89c24734455c86931d03aa489926da46cf29670a6944171f5ef97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGZdUgHuUZvGR4z2yg7/g9OGS81ju7QfZkJDnI03RE4eB06yEknomfHACe4r+Vnbp3Aoin4bLYysDLb/VZaoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:55:01.772284Z","bundle_sha256":"fb3a92fcd4106495f3c8f3ae94ed39ae5cd92f600ea6f0122b0fb5172a6deefb"}}