{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EJKLOKFKSZXZRIMFE3VJ6LBKHB","short_pith_number":"pith:EJKLOKFK","schema_version":"1.0","canonical_sha256":"2254b728aa966f98a18526ea9f2c2a3872de070db7e945cdab31c67bc5f0eb91","source":{"kind":"arxiv","id":"2405.19287","version":1},"attestation_state":"computed","paper":{"title":"Efficiently manipulating Pauli strings with PauliArray","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Maxime Dion, Nolan Bastien, Tania Belabbas","submitted_at":"2024-05-29T17:18:08Z","abstract_excerpt":"Pauli matrices and Pauli strings are widely used in quantum computing. These mathematical objects are useful to describe or manipulate the quantum state of qubits. They offer a convenient basis to express operators and observables used in different problem instances such as molecular simulation and combinatorial optimization. Therefore, it is important to have a well-rounded, versatile and efficient tool to handle a large number of Pauli strings and operators expressed in this basis. This is the objective behind the development of the PauliArray library presented in this work. This library int"},"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":"2405.19287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-29T17:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"0a98d3911a82cf99479cd5868b60c8cf0dc8489701b0c55158445fa36a9ba21b","abstract_canon_sha256":"4e2bd76fe225fbbcefb3eccb95815413d59484071b91211427cdc4d5142aec73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:50.496589Z","signature_b64":"ucGV+hxZM8UwqLfEeyDJ4tyQyMnktE6ohNZ2BKpgteh0cdLDvXR0uBJPKHkNFTXaPO8yGhrE+Sl2S/6YkHJiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2254b728aa966f98a18526ea9f2c2a3872de070db7e945cdab31c67bc5f0eb91","last_reissued_at":"2026-07-05T08:24:50.495998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:50.495998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently manipulating Pauli strings with PauliArray","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Maxime Dion, Nolan Bastien, Tania Belabbas","submitted_at":"2024-05-29T17:18:08Z","abstract_excerpt":"Pauli matrices and Pauli strings are widely used in quantum computing. These mathematical objects are useful to describe or manipulate the quantum state of qubits. They offer a convenient basis to express operators and observables used in different problem instances such as molecular simulation and combinatorial optimization. Therefore, it is important to have a well-rounded, versatile and efficient tool to handle a large number of Pauli strings and operators expressed in this basis. This is the objective behind the development of the PauliArray library presented in this work. This library int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19287","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/2405.19287/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":"2405.19287","created_at":"2026-07-05T08:24:50.496073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.19287v1","created_at":"2026-07-05T08:24:50.496073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19287","created_at":"2026-07-05T08:24:50.496073+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJKLOKFKSZXZ","created_at":"2026-07-05T08:24:50.496073+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJKLOKFKSZXZRIMF","created_at":"2026-07-05T08:24:50.496073+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJKLOKFK","created_at":"2026-07-05T08:24:50.496073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28952","citing_title":"A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2601.02233","citing_title":"PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23138","citing_title":"An Analysis of Commutation-Based Trotter Ordering Strategies on Heisenberg-Style Hamiltonians","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB","json":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB.json","graph_json":"https://pith.science/api/pith-number/EJKLOKFKSZXZRIMFE3VJ6LBKHB/graph.json","events_json":"https://pith.science/api/pith-number/EJKLOKFKSZXZRIMFE3VJ6LBKHB/events.json","paper":"https://pith.science/paper/EJKLOKFK"},"agent_actions":{"view_html":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB","download_json":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB.json","view_paper":"https://pith.science/paper/EJKLOKFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.19287&json=true","fetch_graph":"https://pith.science/api/pith-number/EJKLOKFKSZXZRIMFE3VJ6LBKHB/graph.json","fetch_events":"https://pith.science/api/pith-number/EJKLOKFKSZXZRIMFE3VJ6LBKHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB/action/storage_attestation","attest_author":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB/action/author_attestation","sign_citation":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB/action/citation_signature","submit_replication":"https://pith.science/pith/EJKLOKFKSZXZRIMFE3VJ6LBKHB/action/replication_record"}},"created_at":"2026-07-05T08:24:50.496073+00:00","updated_at":"2026-07-05T08:24:50.496073+00:00"}