{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YF57X57F55CLKYIQBYFX7IEBUL","short_pith_number":"pith:YF57X57F","schema_version":"1.0","canonical_sha256":"c17bfbf7e5ef44b561100e0b7fa081a2d655164821d816904f820c1d6f23aedd","source":{"kind":"arxiv","id":"2603.08651","version":2},"attestation_state":"computed","paper":{"title":"Group Entropies and Mirror Duality: A Class of Flexible Mirror Descent Updates for Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["hep-th","math-ph","math.MP"],"primary_cat":"cs.LG","authors_text":"Andrzej Cichocki, Piergiulio Tempesta","submitted_at":"2026-03-09T17:31:03Z","abstract_excerpt":"We introduce a comprehensive theoretical and algorithmic framework that bridges formal group theory and group entropies with modern machine learning, paving the way for an infinite, flexible family of Mirror Descent (MD) optimization algorithms. Our approach exploits the rich structure of group entropies, which are generalized entropic functionals governed by group composition laws, encompassing and significantly extending all trace-form entropies such as the Shannon, Tsallis, and Kaniadakis families. By leveraging group-theoretical mirror maps (or link functions) in MD, expressed via multi-pa"},"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":"2603.08651","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-09T17:31:03Z","cross_cats_sorted":["hep-th","math-ph","math.MP"],"title_canon_sha256":"134918d0e75c727f1017542956f4ef657244d15e32b27a02357c0148d7b8d37d","abstract_canon_sha256":"4dfc150808fcad505f11d10cc15c3eb0ab7e8c57148dfebffbe8ad88d78d5365"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:36.744121Z","signature_b64":"KUTT9lSqs8FCPb9HfTGMJ1pFxcGeF9GKkI5VOt/sEiJ2Mp+8mKquzGkbs2OWXiFSvGsBTdtewxDbiNIAzD9qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c17bfbf7e5ef44b561100e0b7fa081a2d655164821d816904f820c1d6f23aedd","last_reissued_at":"2026-06-01T02:03:36.742913Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:36.742913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Entropies and Mirror Duality: A Class of Flexible Mirror Descent Updates for Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["hep-th","math-ph","math.MP"],"primary_cat":"cs.LG","authors_text":"Andrzej Cichocki, Piergiulio Tempesta","submitted_at":"2026-03-09T17:31:03Z","abstract_excerpt":"We introduce a comprehensive theoretical and algorithmic framework that bridges formal group theory and group entropies with modern machine learning, paving the way for an infinite, flexible family of Mirror Descent (MD) optimization algorithms. Our approach exploits the rich structure of group entropies, which are generalized entropic functionals governed by group composition laws, encompassing and significantly extending all trace-form entropies such as the Shannon, Tsallis, and Kaniadakis families. By leveraging group-theoretical mirror maps (or link functions) in MD, expressed via multi-pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.08651","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/2603.08651/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":"2603.08651","created_at":"2026-06-01T02:03:36.743072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.08651v2","created_at":"2026-06-01T02:03:36.743072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.08651","created_at":"2026-06-01T02:03:36.743072+00:00"},{"alias_kind":"pith_short_12","alias_value":"YF57X57F55CL","created_at":"2026-06-01T02:03:36.743072+00:00"},{"alias_kind":"pith_short_16","alias_value":"YF57X57F55CLKYIQ","created_at":"2026-06-01T02:03:36.743072+00:00"},{"alias_kind":"pith_short_8","alias_value":"YF57X57F","created_at":"2026-06-01T02:03:36.743072+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/YF57X57F55CLKYIQBYFX7IEBUL","json":"https://pith.science/pith/YF57X57F55CLKYIQBYFX7IEBUL.json","graph_json":"https://pith.science/api/pith-number/YF57X57F55CLKYIQBYFX7IEBUL/graph.json","events_json":"https://pith.science/api/pith-number/YF57X57F55CLKYIQBYFX7IEBUL/events.json","paper":"https://pith.science/paper/YF57X57F"},"agent_actions":{"view_html":"https://pith.science/pith/YF57X57F55CLKYIQBYFX7IEBUL","download_json":"https://pith.science/pith/YF57X57F55CLKYIQBYFX7IEBUL.json","view_paper":"https://pith.science/paper/YF57X57F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.08651&json=true","fetch_graph":"https://pith.science/api/pith-number/YF57X57F55CLKYIQBYFX7IEBUL/graph.json","fetch_events":"https://pith.science/api/pith-number/YF57X57F55CLKYIQBYFX7IEBUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YF57X57F55CLKYIQBYFX7IEBUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YF57X57F55CLKYIQBYFX7IEBUL/action/storage_attestation","attest_author":"https://pith.science/pith/YF57X57F55CLKYIQBYFX7IEBUL/action/author_attestation","sign_citation":"https://pith.science/pith/YF57X57F55CLKYIQBYFX7IEBUL/action/citation_signature","submit_replication":"https://pith.science/pith/YF57X57F55CLKYIQBYFX7IEBUL/action/replication_record"}},"created_at":"2026-06-01T02:03:36.743072+00:00","updated_at":"2026-06-01T02:03:36.743072+00:00"}