{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JGSTTVWO5TK7JEY73RIVZITUU5","short_pith_number":"pith:JGSTTVWO","schema_version":"1.0","canonical_sha256":"49a539d6ceecd5f4931fdc515ca274a75cd7a1887ecda8e0146437f5891140ad","source":{"kind":"arxiv","id":"1104.1148","version":2},"attestation_state":"computed","paper":{"title":"A method for exponential operator decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter van Loock, Seckin Sefi","submitted_at":"2011-04-06T16:58:01Z","abstract_excerpt":"Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions, which is efficient in terms of the required number of operators. Compared to existing schemes, our more direct approach is general, in the sense that it can be applied to various kinds of operators including nested commutation operators, and it is systematic."},"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":"1104.1148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-06T16:58:01Z","cross_cats_sorted":[],"title_canon_sha256":"e025001507ecea9ba88e129d5f8d9314b9b8b8d4b89eeccb9e971bac25ccdcc6","abstract_canon_sha256":"b481cdc97c665848abf07d188da2770489d62db9e919a1c22c09189c20812ad3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:48.188202Z","signature_b64":"pXLkjCssXRyCvMXCl0aRQpjhcL/E8o1lwFCf0a34d9HBD149FptrmKZBF6T3xmihD0p/INPMY0bKPcHddbUkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49a539d6ceecd5f4931fdc515ca274a75cd7a1887ecda8e0146437f5891140ad","last_reissued_at":"2026-05-18T04:10:48.187774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:48.187774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A method for exponential operator decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter van Loock, Seckin Sefi","submitted_at":"2011-04-06T16:58:01Z","abstract_excerpt":"Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions, which is efficient in terms of the required number of operators. Compared to existing schemes, our more direct approach is general, in the sense that it can be applied to various kinds of operators including nested commutation operators, and it is systematic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1148","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.1148","created_at":"2026-05-18T04:10:48.187837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1148v2","created_at":"2026-05-18T04:10:48.187837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1148","created_at":"2026-05-18T04:10:48.187837+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGSTTVWO5TK7","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGSTTVWO5TK7JEY7","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGSTTVWO","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5","json":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5.json","graph_json":"https://pith.science/api/pith-number/JGSTTVWO5TK7JEY73RIVZITUU5/graph.json","events_json":"https://pith.science/api/pith-number/JGSTTVWO5TK7JEY73RIVZITUU5/events.json","paper":"https://pith.science/paper/JGSTTVWO"},"agent_actions":{"view_html":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5","download_json":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5.json","view_paper":"https://pith.science/paper/JGSTTVWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1148&json=true","fetch_graph":"https://pith.science/api/pith-number/JGSTTVWO5TK7JEY73RIVZITUU5/graph.json","fetch_events":"https://pith.science/api/pith-number/JGSTTVWO5TK7JEY73RIVZITUU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5/action/storage_attestation","attest_author":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5/action/author_attestation","sign_citation":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5/action/citation_signature","submit_replication":"https://pith.science/pith/JGSTTVWO5TK7JEY73RIVZITUU5/action/replication_record"}},"created_at":"2026-05-18T04:10:48.187837+00:00","updated_at":"2026-05-18T04:10:48.187837+00:00"}