{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:RI3IB3EZDHGCF2GHRB2W6QSC6Y","short_pith_number":"pith:RI3IB3EZ","canonical_record":{"source":{"id":"0903.1497","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-09T09:00:22Z","cross_cats_sorted":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"title_canon_sha256":"80d46ed96adca6477720beb73f0e3b3ef32ccf97a6447102722b74526ccad83f","abstract_canon_sha256":"3084e6ddc012624a8d2db8907c1ab342b0a05958532553c97f35aa28364f9c08"},"schema_version":"1.0"},"canonical_sha256":"8a3680ec9919cc22e8c788756f4242f637b9af4a894bffe402f7cf5127eb5c1a","source":{"kind":"arxiv","id":"0903.1497","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1497","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1497v2","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1497","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"RI3IB3EZDHGC","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RI3IB3EZDHGCF2GH","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RI3IB3EZ","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:RI3IB3EZDHGCF2GHRB2W6QSC6Y","target":"record","payload":{"canonical_record":{"source":{"id":"0903.1497","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-09T09:00:22Z","cross_cats_sorted":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"title_canon_sha256":"80d46ed96adca6477720beb73f0e3b3ef32ccf97a6447102722b74526ccad83f","abstract_canon_sha256":"3084e6ddc012624a8d2db8907c1ab342b0a05958532553c97f35aa28364f9c08"},"schema_version":"1.0"},"canonical_sha256":"8a3680ec9919cc22e8c788756f4242f637b9af4a894bffe402f7cf5127eb5c1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:56.300771Z","signature_b64":"iLsY1dNeK8gloH6ywRIMj2nFb/+VooVLJrakYHWarH98LDak5R3skw4jQIrXiD/CVMMKtWnpE+7+CSnU9/UABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a3680ec9919cc22e8c788756f4242f637b9af4a894bffe402f7cf5127eb5c1a","last_reissued_at":"2026-05-18T02:24:56.300050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:56.300050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.1497","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-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLwg2D61IJplBCsgxIyttCh6gkuQOX2ya0/uih98gfo7AK8Av8hgI4KfNtKYrovNKR7XDciJX5X4J/TAqIdIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:18:55.009524Z"},"content_sha256":"e2d8654ac097e3c54ddd7ec5b1576b4ca50da05974e026f86f3d59482b13a906","schema_version":"1.0","event_id":"sha256:e2d8654ac097e3c54ddd7ec5b1576b4ca50da05974e026f86f3d59482b13a906"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:RI3IB3EZDHGCF2GHRB2W6QSC6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum hashing with the icosahedral group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"primary_cat":"quant-ph","authors_text":"Giuseppe Mussardo, Haitan Xu, Michele Burrello, Xin Wan","submitted_at":"2009-03-09T09:00:22Z","abstract_excerpt":"We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudo-groups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O[log(1/epsilon)], we can approximate all SU(2) matrices to an average error epsilon with a cost of O[log(1/epsilon)] in time. The algorithm is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1497","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPTGQ9eqDohzhZQXpn5qU1Xx3o6fOxdD0XzB7+Hs6kZhPtjouv+TTbIM1Sq1WOZSB31LeA2kJMZ4L4mw6cRwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:18:55.010215Z"},"content_sha256":"deb106dfae54e779ab1cbc4c0f7f68f25ef253e1b332f7cf186656c2c9e83c1e","schema_version":"1.0","event_id":"sha256:deb106dfae54e779ab1cbc4c0f7f68f25ef253e1b332f7cf186656c2c9e83c1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/bundle.json","state_url":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/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-31T17:18:55Z","links":{"resolver":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y","bundle":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/bundle.json","state":"https://pith.science/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RI3IB3EZDHGCF2GHRB2W6QSC6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RI3IB3EZDHGCF2GHRB2W6QSC6Y","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":"3084e6ddc012624a8d2db8907c1ab342b0a05958532553c97f35aa28364f9c08","cross_cats_sorted":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-09T09:00:22Z","title_canon_sha256":"80d46ed96adca6477720beb73f0e3b3ef32ccf97a6447102722b74526ccad83f"},"schema_version":"1.0","source":{"id":"0903.1497","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1497","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1497v2","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1497","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"RI3IB3EZDHGC","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RI3IB3EZDHGCF2GH","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RI3IB3EZ","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:deb106dfae54e779ab1cbc4c0f7f68f25ef253e1b332f7cf186656c2c9e83c1e","target":"graph","created_at":"2026-05-18T02:24:56Z","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"},"paper":{"abstract_excerpt":"We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudo-groups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O[log(1/epsilon)], we can approximate all SU(2) matrices to an average error epsilon with a cost of O[log(1/epsilon)] in time. The algorithm is a","authors_text":"Giuseppe Mussardo, Haitan Xu, Michele Burrello, Xin Wan","cross_cats":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-09T09:00:22Z","title":"Quantum hashing with the icosahedral group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1497","kind":"arxiv","version":2},"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:e2d8654ac097e3c54ddd7ec5b1576b4ca50da05974e026f86f3d59482b13a906","target":"record","created_at":"2026-05-18T02:24:56Z","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":"3084e6ddc012624a8d2db8907c1ab342b0a05958532553c97f35aa28364f9c08","cross_cats_sorted":["cond-mat.mes-hall","cond-mat.str-el","hep-th"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-09T09:00:22Z","title_canon_sha256":"80d46ed96adca6477720beb73f0e3b3ef32ccf97a6447102722b74526ccad83f"},"schema_version":"1.0","source":{"id":"0903.1497","kind":"arxiv","version":2}},"canonical_sha256":"8a3680ec9919cc22e8c788756f4242f637b9af4a894bffe402f7cf5127eb5c1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a3680ec9919cc22e8c788756f4242f637b9af4a894bffe402f7cf5127eb5c1a","first_computed_at":"2026-05-18T02:24:56.300050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:56.300050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iLsY1dNeK8gloH6ywRIMj2nFb/+VooVLJrakYHWarH98LDak5R3skw4jQIrXiD/CVMMKtWnpE+7+CSnU9/UABA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:56.300771Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.1497","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2d8654ac097e3c54ddd7ec5b1576b4ca50da05974e026f86f3d59482b13a906","sha256:deb106dfae54e779ab1cbc4c0f7f68f25ef253e1b332f7cf186656c2c9e83c1e"],"state_sha256":"f15377137d322b4230e553478c48c918436e5527f45dc9e312f73a1f26efbb9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9EiUUaOhTbj0aACRs6hFCPRzcyrywrLmiLn3LcuimLqX9W62fPvIKUhEbc5tgHUUbHlfScamDGHoECeB+/n4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:18:55.014410Z","bundle_sha256":"af0b8152643fe8b5f45aa8bead94f64dd380a6842fdeeb3e4dd14f86f03b6765"}}