{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:H4QZI6C3O3CAMDODOO6ZOY2XQK","short_pith_number":"pith:H4QZI6C3","canonical_record":{"source":{"id":"1011.3646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2010-11-16T10:56:07Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"06d366c4aa574bd9a329290613741334a70ee2b06419ad2eccff2d8162d4f7a2","abstract_canon_sha256":"670321987f6d6fc2cfc19555940d4111d9413dbf3fd4a8e25f2501f719664a0e"},"schema_version":"1.0"},"canonical_sha256":"3f2194785b76c4060dc373bd976357828fae7c6bfd5e6a36e79b4cd16f1d3f1d","source":{"kind":"arxiv","id":"1011.3646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3646","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3646v1","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3646","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"H4QZI6C3O3CA","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"H4QZI6C3O3CAMDOD","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"H4QZI6C3","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:H4QZI6C3O3CAMDODOO6ZOY2XQK","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2010-11-16T10:56:07Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"06d366c4aa574bd9a329290613741334a70ee2b06419ad2eccff2d8162d4f7a2","abstract_canon_sha256":"670321987f6d6fc2cfc19555940d4111d9413dbf3fd4a8e25f2501f719664a0e"},"schema_version":"1.0"},"canonical_sha256":"3f2194785b76c4060dc373bd976357828fae7c6bfd5e6a36e79b4cd16f1d3f1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:23:47.460148Z","signature_b64":"jfT+x2Tfhhg8VTxyp/oGBlqJcbBGcr228tgPLRwmuvzrD0Qlm18JJw71a/5uJEwOhzlkAo2GO7wqOagPIO+3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f2194785b76c4060dc373bd976357828fae7c6bfd5e6a36e79b4cd16f1d3f1d","last_reissued_at":"2026-05-18T03:23:47.459294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:23:47.459294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3646","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-05-18T03:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZTebPHGFB6KuPZYiYWTUs82TtYOeFfk5vAiri4pT5OpJkihs/vkNkdn+1zuynEY9wLSKlG1XTN33y/Wv1gSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:43:20.969212Z"},"content_sha256":"a45973b4ca28e812f356479e04586d901524c25cc58a7b4f8d6ee6a639c3ab7f","schema_version":"1.0","event_id":"sha256:a45973b4ca28e812f356479e04586d901524c25cc58a7b4f8d6ee6a639c3ab7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:H4QZI6C3O3CAMDODOO6ZOY2XQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Abacus for counting and factorizing numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.mes-hall","authors_text":"G. Blatter, G. B. Lesovik, M. V. Suslov","submitted_at":"2010-11-16T10:56:07Z","abstract_excerpt":"We generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. A 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base 2, base 3, or base d representation. In operating the algorithm, the number n < N = d^K is read into a K-qudit register through its interaction with a stream of n particles passing in a nearby wire; this step corresponds to a quantum Fourier transformation from the Hilbert space of particles to the Hilbert space of qudit states. An inverse quantum Fourier transformation pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3646","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":""},"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-18T03:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LD7Si/J5M5N0HoMMywoxm+ZthkN5ugToIJpLQ3IWNRUSWtXjAs4md+wpVyh1ykYsGo9cK4805T20xQvlddSFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:43:20.970093Z"},"content_sha256":"17a3b66e7f81e785fce91fef43e91d60a48acc09c2153fb23b13d3672f4a3fd3","schema_version":"1.0","event_id":"sha256:17a3b66e7f81e785fce91fef43e91d60a48acc09c2153fb23b13d3672f4a3fd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4QZI6C3O3CAMDODOO6ZOY2XQK/bundle.json","state_url":"https://pith.science/pith/H4QZI6C3O3CAMDODOO6ZOY2XQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4QZI6C3O3CAMDODOO6ZOY2XQK/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-06-06T06:43:20Z","links":{"resolver":"https://pith.science/pith/H4QZI6C3O3CAMDODOO6ZOY2XQK","bundle":"https://pith.science/pith/H4QZI6C3O3CAMDODOO6ZOY2XQK/bundle.json","state":"https://pith.science/pith/H4QZI6C3O3CAMDODOO6ZOY2XQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4QZI6C3O3CAMDODOO6ZOY2XQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:H4QZI6C3O3CAMDODOO6ZOY2XQK","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":"670321987f6d6fc2cfc19555940d4111d9413dbf3fd4a8e25f2501f719664a0e","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2010-11-16T10:56:07Z","title_canon_sha256":"06d366c4aa574bd9a329290613741334a70ee2b06419ad2eccff2d8162d4f7a2"},"schema_version":"1.0","source":{"id":"1011.3646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3646","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3646v1","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3646","created_at":"2026-05-18T03:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"H4QZI6C3O3CA","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"H4QZI6C3O3CAMDOD","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"H4QZI6C3","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:17a3b66e7f81e785fce91fef43e91d60a48acc09c2153fb23b13d3672f4a3fd3","target":"graph","created_at":"2026-05-18T03:23:47Z","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 generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. A 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base 2, base 3, or base d representation. In operating the algorithm, the number n < N = d^K is read into a K-qudit register through its interaction with a stream of n particles passing in a nearby wire; this step corresponds to a quantum Fourier transformation from the Hilbert space of particles to the Hilbert space of qudit states. An inverse quantum Fourier transformation pr","authors_text":"G. Blatter, G. B. Lesovik, M. V. Suslov","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2010-11-16T10:56:07Z","title":"Quantum Abacus for counting and factorizing numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3646","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:a45973b4ca28e812f356479e04586d901524c25cc58a7b4f8d6ee6a639c3ab7f","target":"record","created_at":"2026-05-18T03:23:47Z","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":"670321987f6d6fc2cfc19555940d4111d9413dbf3fd4a8e25f2501f719664a0e","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mes-hall","submitted_at":"2010-11-16T10:56:07Z","title_canon_sha256":"06d366c4aa574bd9a329290613741334a70ee2b06419ad2eccff2d8162d4f7a2"},"schema_version":"1.0","source":{"id":"1011.3646","kind":"arxiv","version":1}},"canonical_sha256":"3f2194785b76c4060dc373bd976357828fae7c6bfd5e6a36e79b4cd16f1d3f1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f2194785b76c4060dc373bd976357828fae7c6bfd5e6a36e79b4cd16f1d3f1d","first_computed_at":"2026-05-18T03:23:47.459294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:23:47.459294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jfT+x2Tfhhg8VTxyp/oGBlqJcbBGcr228tgPLRwmuvzrD0Qlm18JJw71a/5uJEwOhzlkAo2GO7wqOagPIO+3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:23:47.460148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a45973b4ca28e812f356479e04586d901524c25cc58a7b4f8d6ee6a639c3ab7f","sha256:17a3b66e7f81e785fce91fef43e91d60a48acc09c2153fb23b13d3672f4a3fd3"],"state_sha256":"e160c50eb11ace5a6ed161def6ac6fe1e2d72d3f459a56aa0863734694a1f402"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXvCuFL3MeItKqnqhFXXrL830wTyYCkO99m7k0BmLF0CIxxB71f/4Gl5zQEX5ruzMCA1WOhBEWphziiS8bj7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:43:20.973738Z","bundle_sha256":"aeb31838653283158e31b6f7961827b29ec98ec5378e6364dc35de552c2ddb32"}}