{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PFFO26YBLDY7PXVMSUGALUUMB7","short_pith_number":"pith:PFFO26YB","schema_version":"1.0","canonical_sha256":"794aed7b0158f1f7deac950c05d28c0fec9375762d89277b1ad62a2638cb2b79","source":{"kind":"arxiv","id":"2601.14513","version":2},"attestation_state":"computed","paper":{"title":"Spin-$s$ $U(1)$-eigenstate preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nabi Zare Harofteh, Rafael I. Nepomechie","submitted_at":"2026-01-20T22:07:41Z","abstract_excerpt":"We formulate a deterministic algorithm for preparing a general $U(1)$-eigenstate of a spin-$s$ chain of length $n$. These states consist of linear combinations of computational basis states $|\\vec{m}\\rangle$ of $n$ qudits, each with $(2s+1)$ levels and $s= 1/2, 1, 3/2, \\ldots$, whose ditstrings $\\vec{m}$ have a fixed digit sum. Exploiting a Gray code for bounded integer compositions, whose consecutive ditstrings obey the Gray property, the quantum state is prepared by applying corresponding ``Gray gates.'' We use this algorithm to prepare exact eigenstates of integrable spin-$s$ XXX Hamiltonia"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2601.14513","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-01-20T22:07:41Z","cross_cats_sorted":[],"title_canon_sha256":"aa6e0865ebb6723838840149b0476d6729a8c688f98f52457f323f5dce11959c","abstract_canon_sha256":"f57637140c08a62ec124ec4f3525ba73a7a02b78310f5b43fca275efeba2fbb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:32.878632Z","signature_b64":"k85BYueIo2Sr4w8t5N7QMEXGC2ODYCDkjAvJ21/YlCe33miYbp2/u5Y1wC9If+UOgVQpQb8+muTMj+SKrp8zBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"794aed7b0158f1f7deac950c05d28c0fec9375762d89277b1ad62a2638cb2b79","last_reissued_at":"2026-06-30T01:17:32.878001Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:32.878001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spin-$s$ $U(1)$-eigenstate preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nabi Zare Harofteh, Rafael I. Nepomechie","submitted_at":"2026-01-20T22:07:41Z","abstract_excerpt":"We formulate a deterministic algorithm for preparing a general $U(1)$-eigenstate of a spin-$s$ chain of length $n$. These states consist of linear combinations of computational basis states $|\\vec{m}\\rangle$ of $n$ qudits, each with $(2s+1)$ levels and $s= 1/2, 1, 3/2, \\ldots$, whose ditstrings $\\vec{m}$ have a fixed digit sum. Exploiting a Gray code for bounded integer compositions, whose consecutive ditstrings obey the Gray property, the quantum state is prepared by applying corresponding ``Gray gates.'' We use this algorithm to prepare exact eigenstates of integrable spin-$s$ XXX Hamiltonia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.14513","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.14513/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2601.14513","created_at":"2026-06-30T01:17:32.878085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.14513v2","created_at":"2026-06-30T01:17:32.878085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.14513","created_at":"2026-06-30T01:17:32.878085+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFFO26YBLDY7","created_at":"2026-06-30T01:17:32.878085+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFFO26YBLDY7PXVM","created_at":"2026-06-30T01:17:32.878085+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFFO26YB","created_at":"2026-06-30T01:17:32.878085+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7","json":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7.json","graph_json":"https://pith.science/api/pith-number/PFFO26YBLDY7PXVMSUGALUUMB7/graph.json","events_json":"https://pith.science/api/pith-number/PFFO26YBLDY7PXVMSUGALUUMB7/events.json","paper":"https://pith.science/paper/PFFO26YB"},"agent_actions":{"view_html":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7","download_json":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7.json","view_paper":"https://pith.science/paper/PFFO26YB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.14513&json=true","fetch_graph":"https://pith.science/api/pith-number/PFFO26YBLDY7PXVMSUGALUUMB7/graph.json","fetch_events":"https://pith.science/api/pith-number/PFFO26YBLDY7PXVMSUGALUUMB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7/action/storage_attestation","attest_author":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7/action/author_attestation","sign_citation":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7/action/citation_signature","submit_replication":"https://pith.science/pith/PFFO26YBLDY7PXVMSUGALUUMB7/action/replication_record"}},"created_at":"2026-06-30T01:17:32.878085+00:00","updated_at":"2026-06-30T01:17:32.878085+00:00"}