{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S7TPSNZCNYPWPR3QJ7DJHEDOPU","short_pith_number":"pith:S7TPSNZC","schema_version":"1.0","canonical_sha256":"97e6f937226e1f67c7704fc693906e7d2b78726b5ad0f63a9c26fceb68969d53","source":{"kind":"arxiv","id":"2605.30428","version":1},"attestation_state":"computed","paper":{"title":"Graph automorphisms to obtain Clifford symmetries in open and closed qudit models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alessandro Ricottone, Charlie Nation, Federico Cerisola, Francesco Martini, Luca Dellantonio, Rick P. A. Simon, Shreya Banerjee","submitted_at":"2026-05-28T18:00:10Z","abstract_excerpt":"In the recent article [arXiv:2605.18966], we demonstrated that finding Clifford symmetries can be mapped to a Graph Automorphism (GA) problem. Here, we provide an algorithm to obtain such symmetries on general qudit systems, that works on the principle of encoding Clifford invariants of a Hamiltonian onto properties of a graph. Labelling Hamiltonian terms as vertices, a permutation of such vertices that respects the Clifford invariants (a GA) is both a valid Clifford, and a symmetry up to phase correction checks. We test this on multiple physical models and discuss the scaling with respect to "},"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":"2605.30428","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-28T18:00:10Z","cross_cats_sorted":[],"title_canon_sha256":"932c5429faa3ee5d1949a2c2821e8b717f78558289afa30e3f9e2da17b5b75dd","abstract_canon_sha256":"d84fcbd7d4b5193157b6c77bd5a98e0b4fb070507dbf84272fed4c7bb2b905c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T00:02:10.520949Z","signature_b64":"1yS7TJ4HHJqVTGiXupzZDlgRfRAzp8oI6IQyqgmQyX7hUWc8cBxmRzovWT1PUalxLofasktGbIqmW7k9TJ7MDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e6f937226e1f67c7704fc693906e7d2b78726b5ad0f63a9c26fceb68969d53","last_reissued_at":"2026-06-01T00:02:10.520533Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T00:02:10.520533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph automorphisms to obtain Clifford symmetries in open and closed qudit models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alessandro Ricottone, Charlie Nation, Federico Cerisola, Francesco Martini, Luca Dellantonio, Rick P. A. Simon, Shreya Banerjee","submitted_at":"2026-05-28T18:00:10Z","abstract_excerpt":"In the recent article [arXiv:2605.18966], we demonstrated that finding Clifford symmetries can be mapped to a Graph Automorphism (GA) problem. Here, we provide an algorithm to obtain such symmetries on general qudit systems, that works on the principle of encoding Clifford invariants of a Hamiltonian onto properties of a graph. Labelling Hamiltonian terms as vertices, a permutation of such vertices that respects the Clifford invariants (a GA) is both a valid Clifford, and a symmetry up to phase correction checks. We test this on multiple physical models and discuss the scaling with respect to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30428","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/2605.30428/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":"2605.30428","created_at":"2026-06-01T00:02:10.520596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.30428v1","created_at":"2026-06-01T00:02:10.520596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30428","created_at":"2026-06-01T00:02:10.520596+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7TPSNZCNYPW","created_at":"2026-06-01T00:02:10.520596+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7TPSNZCNYPWPR3Q","created_at":"2026-06-01T00:02:10.520596+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7TPSNZC","created_at":"2026-06-01T00:02:10.520596+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/S7TPSNZCNYPWPR3QJ7DJHEDOPU","json":"https://pith.science/pith/S7TPSNZCNYPWPR3QJ7DJHEDOPU.json","graph_json":"https://pith.science/api/pith-number/S7TPSNZCNYPWPR3QJ7DJHEDOPU/graph.json","events_json":"https://pith.science/api/pith-number/S7TPSNZCNYPWPR3QJ7DJHEDOPU/events.json","paper":"https://pith.science/paper/S7TPSNZC"},"agent_actions":{"view_html":"https://pith.science/pith/S7TPSNZCNYPWPR3QJ7DJHEDOPU","download_json":"https://pith.science/pith/S7TPSNZCNYPWPR3QJ7DJHEDOPU.json","view_paper":"https://pith.science/paper/S7TPSNZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.30428&json=true","fetch_graph":"https://pith.science/api/pith-number/S7TPSNZCNYPWPR3QJ7DJHEDOPU/graph.json","fetch_events":"https://pith.science/api/pith-number/S7TPSNZCNYPWPR3QJ7DJHEDOPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7TPSNZCNYPWPR3QJ7DJHEDOPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7TPSNZCNYPWPR3QJ7DJHEDOPU/action/storage_attestation","attest_author":"https://pith.science/pith/S7TPSNZCNYPWPR3QJ7DJHEDOPU/action/author_attestation","sign_citation":"https://pith.science/pith/S7TPSNZCNYPWPR3QJ7DJHEDOPU/action/citation_signature","submit_replication":"https://pith.science/pith/S7TPSNZCNYPWPR3QJ7DJHEDOPU/action/replication_record"}},"created_at":"2026-06-01T00:02:10.520596+00:00","updated_at":"2026-06-01T00:02:10.520596+00:00"}