{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Z7S4EGPJS44PWAI7BF3OJV6QAL","short_pith_number":"pith:Z7S4EGPJ","canonical_record":{"source":{"id":"2512.11855","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-12-05T03:18:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1a3b44eba6d740dca13d946bc3ba1fd512fb76f5ec3b5e4a70e13e53c18cdb8d","abstract_canon_sha256":"a9cbbf128fe3283786a526e3b12a463660e220dd63e2ab1b9adc10b578404806"},"schema_version":"1.0"},"canonical_sha256":"cfe5c219e99738fb011f0976e4d7d002c968d4ee4b54d2014dbe39bdc8a88c0a","source":{"kind":"arxiv","id":"2512.11855","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.11855","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2512.11855v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.11855","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"Z7S4EGPJS44P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Z7S4EGPJS44PWAI7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Z7S4EGPJ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Z7S4EGPJS44PWAI7BF3OJV6QAL","target":"record","payload":{"canonical_record":{"source":{"id":"2512.11855","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-12-05T03:18:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1a3b44eba6d740dca13d946bc3ba1fd512fb76f5ec3b5e4a70e13e53c18cdb8d","abstract_canon_sha256":"a9cbbf128fe3283786a526e3b12a463660e220dd63e2ab1b9adc10b578404806"},"schema_version":"1.0"},"canonical_sha256":"cfe5c219e99738fb011f0976e4d7d002c968d4ee4b54d2014dbe39bdc8a88c0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:16.886781Z","signature_b64":"TJpd+ykpBJetlrJPAWYJ1rgO+prlU7m48p56YdoVoRdp2lRB9I2rsBs52rhVRG6GmmG44aabOpo6PHt7UfU+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfe5c219e99738fb011f0976e4d7d002c968d4ee4b54d2014dbe39bdc8a88c0a","last_reissued_at":"2026-05-17T23:39:16.886020Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:16.886020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.11855","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2OmyTTSQyhkllh9EPAddwuwP07MJ3Y2SAToVMTWFiu81HJeAWEevRjQW/szjw3MYcyq+YJhs+kSCx5kg4tkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T05:29:31.012017Z"},"content_sha256":"9477dcf111b49db83081265764d91d71a24885aaf96440c16d2b80e1aa66b973","schema_version":"1.0","event_id":"sha256:9477dcf111b49db83081265764d91d71a24885aaf96440c16d2b80e1aa66b973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Z7S4EGPJS44PWAI7BF3OJV6QAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Approximate symmetry can be enforced with only logarithmic averaging complexity while exact symmetry requires linear complexity in the group size.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Behrooz Tahmasebi, Melanie Weber","submitted_at":"2025-12-05T03:18:18Z","abstract_excerpt":"Enforcing exact symmetry in machine learning models often yields significant gains in scientific applications, serving as a powerful inductive bias. However, recent work suggests that relying on approximate symmetry can offer greater flexibility and robustness. Despite promising empirical evidence, there has been little theoretical understanding, and in particular, a direct comparison between exact and approximate symmetry is missing from the literature. In this paper, we initiate this study by asking: What is the cost of enforcing exact versus approximate symmetry? To address this question, w"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"under standard conditions, exact symmetry requires linear averaging complexity, whereas approximate symmetry can be attained with only logarithmic complexity in the group size.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The unspecified 'standard conditions' under which the exponential separation holds, and that averaging complexity is the appropriate measure of the cost of enforcing symmetry.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Approximate symmetry can be enforced with logarithmic averaging complexity while exact symmetry requires linear complexity in the group size.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Approximate symmetry can be enforced with only logarithmic averaging complexity while exact symmetry requires linear complexity in the group size.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0156dcac0b1acf4b553d989735fa24d4273cd8b89968040192d503444e45a8b5"},"source":{"id":"2512.11855","kind":"arxiv","version":2},"verdict":{"id":"a5690fd2-1627-4abd-bdcc-0c589fcdb422","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T01:11:23.027619Z","strongest_claim":"under standard conditions, exact symmetry requires linear averaging complexity, whereas approximate symmetry can be attained with only logarithmic complexity in the group size.","one_line_summary":"Approximate symmetry can be enforced with logarithmic averaging complexity while exact symmetry requires linear complexity in the group size.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The unspecified 'standard conditions' under which the exponential separation holds, and that averaging complexity is the appropriate measure of the cost of enforcing symmetry.","pith_extraction_headline":"Approximate symmetry can be enforced with only logarithmic averaging complexity while exact symmetry requires linear complexity in the group size."},"references":{"count":5,"sample":[{"doi":"","year":2025,"title":"Approximately symmetric neural networks for quantum spin liquids.Physical Review Letters, 135 (5):056702, 2025","work_id":"53dc3957-0628-4ab9-9084-d8a0aa25069d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"On the Burnside-Brauer-Steinberg theorem","work_id":"f3e05478-7181-4289-a867-4700d974cccb","ref_index":2,"cited_arxiv_id":"1409.7632","is_internal_anchor":true},{"doi":"","year":1962,"title":"Complete sets of representations of algebras.Proceedings of the American Math- ematical Society, 13(5):746–747, 1962","work_id":"6cb1a797-bc1c-4443-8462-ffbe4837a0d3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"User-friendly tail bounds for sums of random matrices.Foundations of computational mathematics, 12(4):389–434, 2012","work_id":"c7157534-81d6-480c-af97-b32da63662ca","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1977,"title":"1, 3 13 Preprint A BACKGROUND FORPROOFS This appendix collects the background used in our proofs. We briefly review finite groups, group actions, group representations, character theory, and Fourier a","work_id":"f2686d42-c748-4ffe-a165-fe09d56d2715","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":5,"snapshot_sha256":"93eb451459f35d7ceadf091f893efc5e4c0da035c6c2c3c4450a8bd43d6bfa93","internal_anchors":1},"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"},"verdict_id":"a5690fd2-1627-4abd-bdcc-0c589fcdb422"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ElESY0qQ2c5x5G4mH0XBX2PxGIygGxKobZqxgUVq5xwR7TUFvxU5FgERd4Ir3/ib9sGU0vZrG9wrzAOhuhTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T05:29:31.012989Z"},"content_sha256":"2d88a354b608fb2af48ded627b5238c1dd511dc8fc92c66342df8a7ab534ca62","schema_version":"1.0","event_id":"sha256:2d88a354b608fb2af48ded627b5238c1dd511dc8fc92c66342df8a7ab534ca62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7S4EGPJS44PWAI7BF3OJV6QAL/bundle.json","state_url":"https://pith.science/pith/Z7S4EGPJS44PWAI7BF3OJV6QAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7S4EGPJS44PWAI7BF3OJV6QAL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T05:29:31Z","links":{"resolver":"https://pith.science/pith/Z7S4EGPJS44PWAI7BF3OJV6QAL","bundle":"https://pith.science/pith/Z7S4EGPJS44PWAI7BF3OJV6QAL/bundle.json","state":"https://pith.science/pith/Z7S4EGPJS44PWAI7BF3OJV6QAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7S4EGPJS44PWAI7BF3OJV6QAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Z7S4EGPJS44PWAI7BF3OJV6QAL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a9cbbf128fe3283786a526e3b12a463660e220dd63e2ab1b9adc10b578404806","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-12-05T03:18:18Z","title_canon_sha256":"1a3b44eba6d740dca13d946bc3ba1fd512fb76f5ec3b5e4a70e13e53c18cdb8d"},"schema_version":"1.0","source":{"id":"2512.11855","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.11855","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2512.11855v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.11855","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"Z7S4EGPJS44P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Z7S4EGPJS44PWAI7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Z7S4EGPJ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2d88a354b608fb2af48ded627b5238c1dd511dc8fc92c66342df8a7ab534ca62","target":"graph","created_at":"2026-05-17T23:39:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"under standard conditions, exact symmetry requires linear averaging complexity, whereas approximate symmetry can be attained with only logarithmic complexity in the group size."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The unspecified 'standard conditions' under which the exponential separation holds, and that averaging complexity is the appropriate measure of the cost of enforcing symmetry."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Approximate symmetry can be enforced with logarithmic averaging complexity while exact symmetry requires linear complexity in the group size."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Approximate symmetry can be enforced with only logarithmic averaging complexity while exact symmetry requires linear complexity in the group size."}],"snapshot_sha256":"0156dcac0b1acf4b553d989735fa24d4273cd8b89968040192d503444e45a8b5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Enforcing exact symmetry in machine learning models often yields significant gains in scientific applications, serving as a powerful inductive bias. However, recent work suggests that relying on approximate symmetry can offer greater flexibility and robustness. Despite promising empirical evidence, there has been little theoretical understanding, and in particular, a direct comparison between exact and approximate symmetry is missing from the literature. In this paper, we initiate this study by asking: What is the cost of enforcing exact versus approximate symmetry? To address this question, w","authors_text":"Behrooz Tahmasebi, Melanie Weber","cross_cats":["cs.AI"],"headline":"Approximate symmetry can be enforced with only logarithmic averaging complexity while exact symmetry requires linear complexity in the group size.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-12-05T03:18:18Z","title":"Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry"},"references":{"count":5,"internal_anchors":1,"resolved_work":5,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Approximately symmetric neural networks for quantum spin liquids.Physical Review Letters, 135 (5):056702, 2025","work_id":"53dc3957-0628-4ab9-9084-d8a0aa25069d","year":2025},{"cited_arxiv_id":"1409.7632","doi":"","is_internal_anchor":true,"ref_index":2,"title":"On the Burnside-Brauer-Steinberg theorem","work_id":"f3e05478-7181-4289-a867-4700d974cccb","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Complete sets of representations of algebras.Proceedings of the American Math- ematical Society, 13(5):746–747, 1962","work_id":"6cb1a797-bc1c-4443-8462-ffbe4837a0d3","year":1962},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"User-friendly tail bounds for sums of random matrices.Foundations of computational mathematics, 12(4):389–434, 2012","work_id":"c7157534-81d6-480c-af97-b32da63662ca","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"1, 3 13 Preprint A BACKGROUND FORPROOFS This appendix collects the background used in our proofs. We briefly review finite groups, group actions, group representations, character theory, and Fourier a","work_id":"f2686d42-c748-4ffe-a165-fe09d56d2715","year":1977}],"snapshot_sha256":"93eb451459f35d7ceadf091f893efc5e4c0da035c6c2c3c4450a8bd43d6bfa93"},"source":{"id":"2512.11855","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-17T01:11:23.027619Z","id":"a5690fd2-1627-4abd-bdcc-0c589fcdb422","model_set":{"reader":"grok-4.3"},"one_line_summary":"Approximate symmetry can be enforced with logarithmic averaging complexity while exact symmetry requires linear complexity in the group size.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Approximate symmetry can be enforced with only logarithmic averaging complexity while exact symmetry requires linear complexity in the group size.","strongest_claim":"under standard conditions, exact symmetry requires linear averaging complexity, whereas approximate symmetry can be attained with only logarithmic complexity in the group size.","weakest_assumption":"The unspecified 'standard conditions' under which the exponential separation holds, and that averaging complexity is the appropriate measure of the cost of enforcing symmetry."}},"verdict_id":"a5690fd2-1627-4abd-bdcc-0c589fcdb422"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9477dcf111b49db83081265764d91d71a24885aaf96440c16d2b80e1aa66b973","target":"record","created_at":"2026-05-17T23:39:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a9cbbf128fe3283786a526e3b12a463660e220dd63e2ab1b9adc10b578404806","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-12-05T03:18:18Z","title_canon_sha256":"1a3b44eba6d740dca13d946bc3ba1fd512fb76f5ec3b5e4a70e13e53c18cdb8d"},"schema_version":"1.0","source":{"id":"2512.11855","kind":"arxiv","version":2}},"canonical_sha256":"cfe5c219e99738fb011f0976e4d7d002c968d4ee4b54d2014dbe39bdc8a88c0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfe5c219e99738fb011f0976e4d7d002c968d4ee4b54d2014dbe39bdc8a88c0a","first_computed_at":"2026-05-17T23:39:16.886020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:16.886020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TJpd+ykpBJetlrJPAWYJ1rgO+prlU7m48p56YdoVoRdp2lRB9I2rsBs52rhVRG6GmmG44aabOpo6PHt7UfU+DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:16.886781Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.11855","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9477dcf111b49db83081265764d91d71a24885aaf96440c16d2b80e1aa66b973","sha256:2d88a354b608fb2af48ded627b5238c1dd511dc8fc92c66342df8a7ab534ca62"],"state_sha256":"eca69dbf0c7dfa005603cfa1a10e8538bc49d13d657386ddabf2ee5044e98d49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDo8rq+zyutG7PwYyajOdXsiJaEs6NDgSS4Irg/S1+0Z+4PK2oRpq7oCtNUQTrNi0m8fSfxNeifY8cpjvEJAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T05:29:31.016795Z","bundle_sha256":"e1973b14553b9774bc37a13d285073476d037ab14395ecbb536c1b5e0e9b5000"}}