Pith. sign in

Paper Citation Record · LEDGER

Classical and quantum algorithms for characters of the symmetric group

As of 14 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 2 inbound Pith citation observations for arXiv:2501.12579.

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

pith.paper-citation-record.v1
2501.12579 v2

Coverage vector

measured 41 of 41 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T17:12:50.011248Z

measured 43 of 43 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+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-05T05:22:17.678187Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-08T08:04:48.187614Z

Reference resolution

41 of 41 outbound references displayed

  • verified exact2
  • verified fuzzy32
  • unresolved7
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 93082ded-aaea-410a-a98e-41b23962c805 · outbound

This paper cites Interactive shallow clif- ford circuits: quantum advantage against NC 1 and be- yond.

Classical and quantum algorithms for characters of the symmetric group Interactive shallow clif- ford circuits: quantum advantage against NC 1 and be- yond

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.722313Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.825906Z digest=sha256:6463e8321a47bfa25efa85a2a87223496c6d8c4b03db68b26b0623e15d53edbc

Observation 18548a99-f67f-4fad-b89d-1b0c0e4a91a9 · outbound

This paper cites Minimal permutation repre- sentations of finite groups.

Classical and quantum algorithms for characters of the symmetric group Minimal permutation repre- sentations of finite groups

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.613634Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.830563Z digest=sha256:b3966f94e50bcafef62ece1407f10a6b3e3e1ff8fc9cc947a886b5420d0d2044

Observation c802fd39-fd8e-4729-a5de-81f9aee6a6d4 · outbound

This paper cites On the complexity of computing characters of finite groups.

Classical and quantum algorithms for characters of the symmetric group On the complexity of computing characters of finite groups

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.599883Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.835188Z digest=sha256:025d0730728206e95ec9e57cc2318fee97f3d2606cff1168593f4527aff8a05d

Observation b1a05d4a-51cc-4620-9119-59b5de466554 · outbound

This paper cites Posi- tivity of the symmetric group characters is as hard as the polynomial time hierarchy.

Classical and quantum algorithms for characters of the symmetric group Posi- tivity of the symmetric group characters is as hard as the polynomial time hierarchy

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.584902Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.840145Z digest=sha256:2114fc2cb7dc30d95cbf2859a3e8361f66f2230ba2cbdfc6f271d60b544c7004

Observation c3379ca3-4557-496b-85ff-792217d90869 · outbound

This paper cites Slater decomposition of Laughlin states.

Classical and quantum algorithms for characters of the symmetric group Slater decomposition of Laughlin states

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.571322Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.844809Z digest=sha256:5c2c4d58607fc2a4adfb91841d339e804ef8875e218fc12531afe801fd0c2e9a

Observation 381e3185-6d8a-4261-a465-2eda36b626df · outbound

This paper cites Unified Fock space representation of fractional quantum Hall states.

Classical and quantum algorithms for characters of the symmetric group Unified Fock space representation of fractional quantum Hall states

Reference 6

Resolution
verified exact
local_arxiv, observed 2026-08-10T17:12:50.107523Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.849966Z digest=sha256:d02ff5bd4990b52f74b104062bfd33fa8a62d6d17faaa9832d66d45ad8d36252

Observation b982c8bb-c233-4e1a-9405-847db380c313 · outbound

This paper cites Fock-space operator construction of Laughlin fractional quantum hall effect states.

Classical and quantum algorithms for characters of the symmetric group Fock-space operator construction of Laughlin fractional quantum hall effect states

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.557669Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.856127Z digest=sha256:5129a339b34367fceed9d2dd5d3f6ed3e5b31ead882870ddc22f919b618620da

Observation 72fad2d7-f36b-4a2d-b31e-e4d322b3a814 · outbound

This paper cites Laughlin’s wave functions, coulomb gases and expansions of the discriminant.

Classical and quantum algorithms for characters of the symmetric group Laughlin’s wave functions, coulomb gases and expansions of the discriminant

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.543775Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.861847Z digest=sha256:ecb8ae24d3290f7aad5d78f59ba6fbaf78b3ac328614ee8d22f51f99ee57a364

Observation 02d45b9e-6a3f-4274-9a6e-b37cf1a312b1 · outbound

This paper cites Integration with respect to the haar measure on unitary, orthogonal and sym- plectic group.

Classical and quantum algorithms for characters of the symmetric group Integration with respect to the haar measure on unitary, orthogonal and sym- plectic group

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.529396Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.866289Z digest=sha256:64f80ea7acf25bc5786b7fc107b3f5ebb7dd2a59b42b2d87bb47a44e72582417

Observation b0e0bf67-ef33-4e68-9822-aace76dc544b · outbound

This paper cites Group theoretical methods in machine learning.

Classical and quantum algorithms for characters of the symmetric group Group theoretical methods in machine learning

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.515264Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.870637Z digest=sha256:b473e89cb54b5f6e7469c3830a962715ca0583e4046dfc7e6e558b381938e9c3

Observation 581f4ec8-b1ef-4ee7-9847-daa180f7f593 · outbound

This paper cites Ranking with ker- nels in fourier space.

Classical and quantum algorithms for characters of the symmetric group Ranking with ker- nels in fourier space

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.500819Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.875227Z digest=sha256:8df5dc2b9038b1ee7739e05260c695489bca4e7a5ed37b200b2d4a20ee1e9b5e

Observation 66b83730-9dd3-4dbd-88de-fe034e8f2951 · outbound

This paper cites Efficient classical simulation of slightly en- tangled quantum computations.

Classical and quantum algorithms for characters of the symmetric group Efficient classical simulation of slightly en- tangled quantum computations

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.486752Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.879816Z digest=sha256:a82bb8996a9fb62d72484abf3c7cbccf86e4196354932e05ec429c7ccb85d547

Observation 80f6d23a-d7db-4637-a2b6-a8a1bae620c3 · outbound

This paper cites Quantum Spin Chains and Symmetric Functions.

Classical and quantum algorithms for characters of the symmetric group Quantum Spin Chains and Symmetric Functions

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-10T17:12:49.885114Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T17:12:49.885114Z digest=sha256:12c835d711e2a1b9ce063a63a92d5a4069e83df9da316feaa08ad46853d22e9e

Observation d6765d5f-e468-433d-9514-a9f66b28174e · outbound

This paper cites Noncommutative schur functions and their applications.

Classical and quantum algorithms for characters of the symmetric group Noncommutative schur functions and their applications

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.471603Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.889942Z digest=sha256:d61a9657af0b9778573d51fbaf34e2f607597ea25dbce89820dd37c837b31a1d

Observation bf7f5c5f-8856-45df-a04f-cbd0d4e78806 · outbound

This paper cites an unresolved cited work.

Classical and quantum algorithms for characters of the symmetric group Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-08-10T17:12:50.458221Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.894191Z digest=sha256:8971e6ba97768736003bfbd59505e8aa33d4dfeab8bc165be9f7f9185fa050c4

Observation da41e000-1e9e-4d81-8109-ca6eb804e631 · outbound

This paper cites quimb: A python package for quantum in- formation and many-body calculations.

Classical and quantum algorithms for characters of the symmetric group quimb: A python package for quantum in- formation and many-body calculations

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.444264Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.898948Z digest=sha256:d6a406d7174add934234c1941eff513e819f286c9617e2d9047d9986b2aa0335

Observation 591fbfa0-864e-4945-8db4-2e1c86d4af48 · outbound

This paper cites mpnum: A matrix product representation library for python.

Classical and quantum algorithms for characters of the symmetric group mpnum: A matrix product representation library for python

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.428905Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.903260Z digest=sha256:e97e75bd0f6336475d70f11120d2f9c1503bd3fffd0ac9ce0a6a3d26f617d245

Observation b14b336d-6bb0-4485-9c3e-60878e0d836c · outbound

This paper cites Quantum computation of Fourier trans- forms over symmetric groups.

Classical and quantum algorithms for characters of the symmetric group Quantum computation of Fourier trans- forms over symmetric groups

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.415019Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.907408Z digest=sha256:506123d03c19c6041a4bc563f70a3c2a7dcd89bcfb2209eb39ff85d2d5c958af

Observation 00b611df-364d-4ee7-b189-f9bd89d79380 · outbound

This paper cites The computational complexity of linear optics.

Classical and quantum algorithms for characters of the symmetric group The computational complexity of linear optics

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.400303Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.911617Z digest=sha256:afb9ad6184a8d1c3d0d81e0d45187954755560aa4a0cf5a24ae12dc28d10e38c

Observation c705d11e-e937-4796-a471-b675c8c66f12 · outbound

This paper cites Average-case complexity versus approximate sim- ulation of commuting quantum computations.

Classical and quantum algorithms for characters of the symmetric group Average-case complexity versus approximate sim- ulation of commuting quantum computations

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.385538Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.915873Z digest=sha256:45c5da82a5de057564eff15df8f42f2fb1e84b5ebe0e60c1382bba7a4beb3892

Observation 6436d3f1-5ab8-4980-a7df-608527512230 · outbound

This paper cites Computational ad- vantage of quantum random sampling.

Classical and quantum algorithms for characters of the symmetric group Computational ad- vantage of quantum random sampling

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.370572Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.921060Z digest=sha256:a2b4ffc843659ca07871ddb294ae374c80fa17988185abbc731b2fdf60a478cd

Observation ce7037cc-94f0-46b2-a843-45ec444341ea · outbound

This paper cites The characters of the symmetric group.

Classical and quantum algorithms for characters of the symmetric group The characters of the symmetric group

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.356718Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.926456Z digest=sha256:259e5503b3500ac46df549fc576460bdd8df3be3eef9b1fe8c8b0c4c3a828ec3

Observation c010c38c-bc04-4213-97db-3eabe2b65430 · outbound

This paper cites On some modular properties of ir- reducible representations of symmetric groups, ii.

Classical and quantum algorithms for characters of the symmetric group On some modular properties of ir- reducible representations of symmetric groups, ii

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.341412Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.930843Z digest=sha256:c5dc584705871662dc1aa1bcff66c82a255147357dde66864f7a9669c76c39a6

Observation 4ca640b1-33a8-42ac-b26f-5d8696c4ee98 · outbound

This paper cites Algorithms for the character theory of the symmetric group.

Classical and quantum algorithms for characters of the symmetric group Algorithms for the character theory of the symmetric group

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.326250Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.936145Z digest=sha256:ab2f7f878bbac228cd9a839848fa4f6372d50c208ff94a5a095864ed1f760cff

Observation 574c2f8b-b154-4add-b586-16c3ff3d2551 · outbound

This paper cites an unresolved cited work.

Classical and quantum algorithms for characters of the symmetric group Unresolved cited work

Reference 25

Resolution
unresolved
raw_fallback, observed 2026-08-10T17:12:50.311116Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.940380Z digest=sha256:d699d04c0a421f12fd2a1631d07e27ba90f32c1b91ffd43c21921d830b4eaca4

Observation 6c840c5a-b737-4274-aed1-2d586e5a758e · outbound

This paper cites Quantum com- plexity of the Kronecker coefficients.

Classical and quantum algorithms for characters of the symmetric group Quantum com- plexity of the Kronecker coefficients

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.296672Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.945694Z digest=sha256:558902750e3a1316b291f732782559f081d7ae854f19016108114267521024ca

Observation c86fc6b4-8693-47e7-b6f5-192bbf6d5a2a · outbound

This paper cites Quantum Algorithms for Representation-Theoretic Multiplicities.

Classical and quantum algorithms for characters of the symmetric group Quantum Algorithms for Representation-Theoretic Multiplicities

Reference 27

Resolution
verified exact
local_arxiv, observed 2026-08-10T17:12:50.069222Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.951081Z digest=sha256:1c5eeb188e0f592f8a5dd613f35d45ce6815379560d6cbb6578d08a5435b0ccc

Observation d32980c0-3470-4dab-be02-ba343ccbdd15 · outbound

This paper cites Introduction to representation theory, volume 59.

Classical and quantum algorithms for characters of the symmetric group Introduction to representation theory, volume 59

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.282226Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.955662Z digest=sha256:3d179be27fe51b0ad6ceda3a57b80f49a5d5509927791b5892f218877ceac715

Observation 1ab7fbc8-61af-4479-b107-71422b709680 · outbound

This paper cites up by one.

Classical and quantum algorithms for characters of the symmetric group up by one

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.267231Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.960007Z digest=sha256:7f4b916483567edd6609c62220c2ac1205179150dcfa3f58ff105eb23ec991b9

Observation 7469bcea-2312-444b-9b77-b4fc2fd7452c · outbound

This paper cites The density-matrix renormalization group in the age of matrix product states.

Classical and quantum algorithms for characters of the symmetric group The density-matrix renormalization group in the age of matrix product states

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-10T17:12:49.964384Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T17:12:49.964384Z digest=sha256:85e9104d6ff41bc419dd06bdeb4c328b60d4236650c393780a1586098492ff58

Observation b3b2cf31-3f96-4d60-8585-1f1431e5aa67 · outbound

This paper cites GAP – Groups, Algorithms, and Pro- gramming, Version 4.12.2, 2022.

Classical and quantum algorithms for characters of the symmetric group GAP – Groups, Algorithms, and Pro- gramming, Version 4.12.2, 2022

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.243682Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.969037Z digest=sha256:cb17f2591002248522a1a7cb29d6401d40302527643b181b7f8ecf9d0d2677d2

Observation 3556df80-2c7e-4b65-9d97-eb9dd32d8cda · outbound

This paper cites an unresolved cited work.

Classical and quantum algorithms for characters of the symmetric group Unresolved cited work

Reference 32

Resolution
unresolved
raw_fallback, observed 2026-08-10T17:12:50.229199Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.973347Z digest=sha256:fc1a17b7f0336160ec6a036f1953b2bec80512407befc232a88732143c39f8b6

Observation f65686bc-a7c9-4c3a-bd42-f2e9bf5bd4b7 · outbound

This paper cites Github repository.

Classical and quantum algorithms for characters of the symmetric group Github repository

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.214467Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.977864Z digest=sha256:0327e13ebd220de001f30fd3ab36215d6147df41eb7d349a27314e1938630dee

Observation 0a822796-363e-404a-a276-3d952acc1338 · outbound

This paper cites An efficient quantum algorithm for preparation of uniform quantum superpo- sition states.

Classical and quantum algorithms for characters of the symmetric group An efficient quantum algorithm for preparation of uniform quantum superpo- sition states

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.200158Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.982243Z digest=sha256:3cc5b595cd171fe7e1595bac3fa3f6fe790784e3642b85fead68148701f59dc7

Observation 644a6054-84a8-40cd-9d7e-b327309c37eb · outbound

This paper cites Enumerative combinatorics: volume 2, volume 62.

Classical and quantum algorithms for characters of the symmetric group Enumerative combinatorics: volume 2, volume 62

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.185319Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.987253Z digest=sha256:e9be71c581392ecb2178f2de0acafad710d8c5a0be6e9f7a9946b546217aa4ff

Observation 4b74bfb9-8a63-43b3-939c-c2e1e20cb711 · outbound

This paper cites Classical simulation of commuting quantum computa- tions implies collapse of the polynomial hierarchy.

Classical and quantum algorithms for characters of the symmetric group Classical simulation of commuting quantum computa- tions implies collapse of the polynomial hierarchy

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.170040Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.992223Z digest=sha256:d20d8bd0a07f1ce3d4bc279ca94f11963bf320368a9a364f143bd2e63cd223b0

Observation 75b923a4-c2e9-4578-b8a7-6996c50f2ac2 · outbound

This paper cites 10 For any x ∈ S ∩ T one has P1(x) ≤ P0(x) + 1/(10N ) ≤ 1/(10N ϵ) + 1/(10N ) ≤ 1/(5N ϵ) which imples |P2(x) − P1(x)| ≤1/(5N ).

Classical and quantum algorithms for characters of the symmetric group 10 For any x ∈ S ∩ T one has P1(x) ≤ P0(x) + 1/(10N ) ≤ 1/(10N ϵ) + 1/(10N ) ≤ 1/(5N ϵ) which imples |P2(x) − P1(x)| ≤1/(5N )

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.737841Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.819951Z digest=sha256:a7851de16b2b53e594be48b688162c6bd0354f9369c305888c1509053cde2322

Observation 148f3dd5-5eec-409e-8215-47dbb247f4cd · outbound

This paper cites The complexity of approximate count- ing.

Classical and quantum algorithms for characters of the symmetric group The complexity of approximate count- ing

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.154789Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:49.996447Z digest=sha256:b94174fe88182123a6500dc5ae39edf89f9cd1cc69816048320e66e0eb546786

Observation 9bae8b00-e2c2-4036-86db-2f3fb926659b · outbound

This paper cites Cycle type of random permutations: A toolkit.

Classical and quantum algorithms for characters of the symmetric group Cycle type of random permutations: A toolkit

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-10T17:12:50.001439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T17:12:50.001439Z digest=sha256:ba75f12751b71993a67fc2a1778540246506e39acba4f3bc170774f3d84d92a0

Observation 2cbc26f8-a442-43a3-8f13-5eb340904919 · outbound

This paper cites an unresolved cited work.

Classical and quantum algorithms for characters of the symmetric group Unresolved cited work

Reference 40

Resolution
unresolved
raw_fallback, observed 2026-08-10T17:12:50.139223Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:50.006639Z digest=sha256:f459f7c71d7bdde7a8cde5aaaceb4d5046189179f93bcac37e2c622a0f07eb75

Observation d6ad18f3-81a7-4829-b25f-446bbee9a374 · outbound

This paper cites The distribution of the number of summands in the partitions of a positive inte- ger.

Classical and quantum algorithms for characters of the symmetric group The distribution of the number of summands in the partitions of a positive inte- ger

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T17:12:50.123652Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-10T17:12:50.011248Z digest=sha256:dc16705c49499c8a60313d058407d6a9d62823d707483236c6738ccaf48bf111

Pith citing papers

Observation b9570cd9-78bb-4fbe-b115-1c288ce4e12f · inbound

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group cites this paper.

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group Classical and quantum algorithms for characters of the symmetric group

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-05T05:22:17.678187Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T05:22:17.678187Z digest=sha256:3f04079d016bf5959ffbee71c6fb37b03b725bee56fcfd798287c3a40a8906ce

Observation 9a3ae53f-7efb-4192-b228-7df8910fd9b9 · inbound

Unitary matrix models, quantized symmetric functions and spin chain cites this paper.

Unitary matrix models, quantized symmetric functions and spin chain Classical and quantum algorithms for characters of the symmetric group

Reference 25

Resolution
verified exact
local_arxiv, observed 2026-07-08T08:04:48.189524Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-07-08T07:56:37.920886Z digest=sha256:34fbe71d291918e0a088d1f1b807154ca329f5b6081f405b75e5af319ea0c6ec