{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ACU6YDLFD22FSWPD5G7QAKF4KT","short_pith_number":"pith:ACU6YDLF","schema_version":"1.0","canonical_sha256":"00a9ec0d651eb45959e3e9bf0028bc54e09643a014f266b430582c0f7a5faa66","source":{"kind":"arxiv","id":"2509.13231","version":2},"attestation_state":"computed","paper":{"title":"An algorithm for Aubert-Zelevinsky duality \\`a la M{\\oe}glin-Waldspurger","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.RT","authors_text":"Alberto M\\'inguez, Thomas Lanard","submitted_at":"2025-09-16T16:38:35Z","abstract_excerpt":"Let $F$ be a locally compact non-Archimedean field of characteristic $0$, and let $G$ be either the split special orthogonal group $\\mathrm{SO}_{2n+1}(F)$ or the symplectic group $\\mathrm{Sp}_{2n}(F)$. The goal of this paper is to give an explicit description of the Aubert-Zelevinsky duality for $G$ in terms of Langlands parameters. We present a new algorithm, inspired by the Moeglin-Waldspurger algorithm for $\\mathrm{GL}_n(F)$, which computes the dual Langlands data in a recursive and combinatorial way. Our method is simple enough to be carried out by hand and provides a practical tool for ex"},"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":"2509.13231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2025-09-16T16:38:35Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"e481e139699d0dd5f9a07524b2af7e0baa4fb2d238024ce9e39cfc8706bd9b33","abstract_canon_sha256":"1b32ad55ea58343e0e473ce268c9c065e86c69fb7fd18c6ced4201752fdd8f2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:37.857016Z","signature_b64":"Hp7vvwcXMaXuHkboSvTJN35J1xzQeOObLJJmgWXQdPrSbF0PqCRh8fz0AEZPkWtilLnaA7hyAkykuuhtfMF9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00a9ec0d651eb45959e3e9bf0028bc54e09643a014f266b430582c0f7a5faa66","last_reissued_at":"2026-05-27T01:05:37.856319Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:37.856319Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm for Aubert-Zelevinsky duality \\`a la M{\\oe}glin-Waldspurger","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.RT","authors_text":"Alberto M\\'inguez, Thomas Lanard","submitted_at":"2025-09-16T16:38:35Z","abstract_excerpt":"Let $F$ be a locally compact non-Archimedean field of characteristic $0$, and let $G$ be either the split special orthogonal group $\\mathrm{SO}_{2n+1}(F)$ or the symplectic group $\\mathrm{Sp}_{2n}(F)$. The goal of this paper is to give an explicit description of the Aubert-Zelevinsky duality for $G$ in terms of Langlands parameters. We present a new algorithm, inspired by the Moeglin-Waldspurger algorithm for $\\mathrm{GL}_n(F)$, which computes the dual Langlands data in a recursive and combinatorial way. Our method is simple enough to be carried out by hand and provides a practical tool for ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.13231","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/2509.13231/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":"2509.13231","created_at":"2026-05-27T01:05:37.856398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.13231v2","created_at":"2026-05-27T01:05:37.856398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.13231","created_at":"2026-05-27T01:05:37.856398+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACU6YDLFD22F","created_at":"2026-05-27T01:05:37.856398+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACU6YDLFD22FSWPD","created_at":"2026-05-27T01:05:37.856398+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACU6YDLF","created_at":"2026-05-27T01:05:37.856398+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2601.13209","citing_title":"AI for Mathematics: Progress, Challenges, and Prospects","ref_index":89,"is_internal_anchor":true},{"citing_arxiv_id":"2604.11049","citing_title":"Algorithms on the Pyasetskii involution on local Langlands parameters of classical groups","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT","json":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT.json","graph_json":"https://pith.science/api/pith-number/ACU6YDLFD22FSWPD5G7QAKF4KT/graph.json","events_json":"https://pith.science/api/pith-number/ACU6YDLFD22FSWPD5G7QAKF4KT/events.json","paper":"https://pith.science/paper/ACU6YDLF"},"agent_actions":{"view_html":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT","download_json":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT.json","view_paper":"https://pith.science/paper/ACU6YDLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.13231&json=true","fetch_graph":"https://pith.science/api/pith-number/ACU6YDLFD22FSWPD5G7QAKF4KT/graph.json","fetch_events":"https://pith.science/api/pith-number/ACU6YDLFD22FSWPD5G7QAKF4KT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT/action/storage_attestation","attest_author":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT/action/author_attestation","sign_citation":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT/action/citation_signature","submit_replication":"https://pith.science/pith/ACU6YDLFD22FSWPD5G7QAKF4KT/action/replication_record"}},"created_at":"2026-05-27T01:05:37.856398+00:00","updated_at":"2026-05-27T01:05:37.856398+00:00"}