Pith. sign in

Paper Citation Record · LEDGER

Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry

As of 15 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 2 inbound Pith citation observations for arXiv:2512.11855.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2512.11855 v2

Coverage vector

measured 5 of 5 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-17T01:16:10.593191Z

measured 7 of 7 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T00:34:34.834335Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-06-29T09:53:17.515541Z

Reference resolution

5 of 5 outbound references displayed

  • verified exact1
  • verified fuzzy3
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e20132b2-a2f1-4d33-94a8-0f71809b8fc3 · outbound

This paper cites Approximately symmetric neural networks for quantum spin liquids.Physical Review Letters, 135 (5):056702.

Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry Approximately symmetric neural networks for quantum spin liquids.Physical Review Letters, 135 (5):056702

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T01:18:49.042074Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-05-17T01:16:10.593191Z digest=sha256:e8b3e3cde6be70f2cf8d27e359e2b3ada423b8026461b20515ee2c00b7ec5a2e

Observation 43ff3101-59a5-470f-811d-41d4848a8105 · outbound

This paper cites On the Burnside-Brauer-Steinberg theorem.

Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry On the Burnside-Brauer-Steinberg theorem

Reference 2

Resolution
metadata mismatch
local_arxiv, observed 2026-05-17T01:18:48.311299Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-05-17T01:16:10.593191Z digest=sha256:e1e2cee362553951b0d25e5cb7be7f3f7b1563a324fab52f8e45c93c44a7e955

Observation e2d40253-794a-46e5-bcb6-f236179f5c01 · outbound

This paper cites Complete sets of representations of algebras.Proceedings of the American Math- ematical Society, 13(5):746–747.

Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry Complete sets of representations of algebras.Proceedings of the American Math- ematical Society, 13(5):746–747

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T01:18:49.044952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-05-17T01:16:10.593191Z digest=sha256:19310617af53c89e81b1de4a24f72ecbe345c04524b8da970447f2aa84703273

Observation 929b28d5-fca6-451a-87e7-288d12dc46c8 · outbound

This paper cites User-friendly tail bounds for sums of random matrices.Foundations of computational mathematics, 12(4):389–434.

Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry User-friendly tail bounds for sums of random matrices.Foundations of computational mathematics, 12(4):389–434

Reference 4

Resolution
verified exact
arxiv_id, observed 2026-05-17T01:18:48.315825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-05-17T01:16:10.593191Z digest=sha256:88e14d70a61a13c8d94f40de56cf6a057d8573e43eb89b292a21fa53089e282e

Observation 23045daf-f3d9-4cdc-84f2-b35e0bad8bff · outbound

This paper cites appropriate.

Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry appropriate

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T01:18:49.047963Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-05-17T01:16:10.593191Z digest=sha256:52d1c15b916aff8e1a48bccd080b1e9a478819330d173e4ea744d7bd899d324c

Pith citing papers

Observation b1b999fc-5a32-4172-990f-037657cc6f02 · inbound

Approximate label symmetries improve data efficiency cites this paper.

Approximate label symmetries improve data efficiency Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry

Reference 30

Resolution
verified exact
local_arxiv, observed 2026-06-29T09:53:17.517592Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-06-29T09:47:06.818853Z digest=sha256:4ed66f7c4e4c3b75d766d1241d3d5cdd470e6dc9842d5ffc4ca6c90df5e52e5b

Observation 666701fd-be8f-4768-9d68-5201062af1b3 · inbound

Adaptive Symmetry Discovery for Dynamical System Identification cites this paper.

Adaptive Symmetry Discovery for Dynamical System Identification Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry

Reference 73

Resolution
unresolved
no resolver link, observed 2026-08-12T00:34:34.834335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T00:34:34.834335Z digest=sha256:a78cf8fca3a542df4450b5bdecff517d70ce34443000f5db0de1b6554957d867