{"as_of":"2026-08-14T17:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99f4ce76cd56359b2613b4975819d23fb5e332f68b6bfa936bd488ff3eb30b0d","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:12:50.011248Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:22:17.678187Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-08T08:04:48.187614Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12579","snapshot_observed_at":"2026-08-05T05:22:17.678187Z","title":"Classical and quantum algorithms for characters of the symmetric group","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05710","last_updated":"2025-09-09T04:58:35Z","snapshot_observed_at":"2026-08-09T18:28:02.083169Z","submitted_at":"2025-09-06T13:09:50Z","title":"Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T05:22:17.678187Z"},"links":{"cited_paper":"/paper/2501.12579","citing_paper":"/paper/2509.05710"},"observation_digest":"sha256:3f04079d016bf5959ffbee71c6fb37b03b725bee56fcfd798287c3a40a8906ce","observation_id":"b9570cd9-78bb-4fbe-b115-1c288ce4e12f","resolution":{"observed_at":"2026-08-05T05:22:17.678187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"cited_work":{"arxiv_id":"2501.12579","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.12579","snapshot_observed_at":"2026-07-08T08:04:48.187614Z","title":"Classical and quantum algorithms for characters of the symmetric group","venue":"quant-ph","work_id":"bd87855a-c4a1-4164-9fe9-8e2ab6486ffc","year":2025},"citing_paper":{"arxiv_id":"2607.06384","last_updated":"2026-07-07T15:22:01Z","snapshot_observed_at":"2026-08-13T01:11:30.819540Z","submitted_at":"2026-07-07T15:22:01Z","title":"Unitary matrix models, quantized symmetric functions and spin chain","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-08T07:56:37.920886Z"},"links":{"cited_paper":"/paper/2501.12579","citing_paper":"/paper/2607.06384"},"observation_digest":"sha256:34fbe71d291918e0a088d1f1b807154ca329f5b6081f405b75e5af319ea0c6ec","observation_id":"9a3ae53f-7efb-4192-b228-7df8910fd9b9","resolution":{"observed_at":"2026-07-08T08:04:48.189524Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.12579/citation-record","integrity":"/paper/2501.12579/integrity","json":"/paper/2501.12579/citation-record.json","paper":"/paper/2501.12579"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.623090Z","title":"Interactive shallow clif- ford circuits: quantum advantage against NC 1 and be- yond","venue":null,"work_id":"ddf22c9d-354c-4456-99c6-9e9da5c504b7","year":2020},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.825906Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:6463e8321a47bfa25efa85a2a87223496c6d8c4b03db68b26b0623e15d53edbc","observation_id":"93082ded-aaea-410a-a98e-41b23962c805","resolution":{"observed_at":"2026-08-10T17:12:50.722313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.609198Z","title":"Minimal permutation repre- sentations of finite groups","venue":null,"work_id":"c452829b-dc4e-486f-8a8b-357279fc73fd","year":1971},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.830563Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:b3966f94e50bcafef62ece1407f10a6b3e3e1ff8fc9cc947a886b5420d0d2044","observation_id":"18548a99-f67f-4fad-b89d-1b0c0e4a91a9","resolution":{"observed_at":"2026-08-10T17:12:50.613634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.595087Z","title":"On the complexity of computing characters of finite groups","venue":null,"work_id":"fc2d749b-e7b7-466a-8aee-6694a8d9e0d7","year":1996},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.835188Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:025d0730728206e95ec9e57cc2318fee97f3d2606cff1168593f4527aff8a05d","observation_id":"c802fd39-fd8e-4729-a5de-81f9aee6a6d4","resolution":{"observed_at":"2026-08-10T17:12:50.599883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.580316Z","title":"Posi- tivity of the symmetric group characters is as hard as the polynomial time hierarchy","venue":null,"work_id":"2ccd534e-d46f-4a6b-b5ac-7107e7e63e01","year":2024},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.840145Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:2114fc2cb7dc30d95cbf2859a3e8361f66f2230ba2cbdfc6f271d60b544c7004","observation_id":"b1a05d4a-51cc-4620-9119-59b5de466554","resolution":{"observed_at":"2026-08-10T17:12:50.584902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.566869Z","title":"Slater decomposition of Laughlin states","venue":null,"work_id":"6aafa041-a1c1-4487-89d5-e4d1bfa272a6","year":1993},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.844809Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:5c2c4d58607fc2a4adfb91841d339e804ef8875e218fc12531afe801fd0c2e9a","observation_id":"c3379ca3-4557-496b-85ff-792217d90869","resolution":{"observed_at":"2026-08-10T17:12:50.571322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07073","last_updated":"2017-05-19T16:20:23Z","snapshot_observed_at":"2026-07-06T05:43:24.039769Z","submitted_at":"2017-05-19T16:20:23Z","title":"Unified Fock space representation of fractional quantum Hall states","version":1},"cited_work":{"arxiv_id":"1705.07073","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.07073","snapshot_observed_at":"2026-08-10T17:12:50.101933Z","title":"Unified Fock space representation of fractional quantum Hall states","venue":"cond-mat.str-el","work_id":"6373b3d0-8776-4cc5-bddc-3156bf532109","year":2017},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.849966Z"},"links":{"cited_paper":"/paper/1705.07073","citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:3dc975b4e64170fcbf728835cb62b0f1a3877be461132bcd8d26352050bb7db4","observation_id":"381e3185-6d8a-4261-a465-2eda36b626df","resolution":{"observed_at":"2026-08-10T17:12:50.107523Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.553224Z","title":"Fock-space operator construction of Laughlin fractional quantum hall effect states","venue":null,"work_id":"768469aa-bdd9-4519-a602-a2beae27c0f0","year":2015},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.856127Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:5129a339b34367fceed9d2dd5d3f6ed3e5b31ead882870ddc22f919b618620da","observation_id":"b982c8bb-c233-4e1a-9405-847db380c313","resolution":{"observed_at":"2026-08-10T17:12:50.557669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.538616Z","title":"Laughlin’s wave functions, coulomb gases and expansions of the discriminant","venue":null,"work_id":"8a945566-92ff-488c-bd93-796caf3c16fb","year":1994},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.861847Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:ecb8ae24d3290f7aad5d78f59ba6fbaf78b3ac328614ee8d22f51f99ee57a364","observation_id":"72fad2d7-f36b-4a2d-b31e-e4d322b3a814","resolution":{"observed_at":"2026-08-10T17:12:50.543775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.524740Z","title":"Integration with respect to the haar measure on unitary, orthogonal and sym- plectic group","venue":null,"work_id":"9b1a851a-6837-4cca-9391-497076afe93e","year":2006},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.866289Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:64f80ea7acf25bc5786b7fc107b3f5ebb7dd2a59b42b2d87bb47a44e72582417","observation_id":"02d45b9e-6a3f-4274-9a6e-b37cf1a312b1","resolution":{"observed_at":"2026-08-10T17:12:50.529396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.510122Z","title":"Group theoretical methods in machine learning","venue":null,"work_id":"4b225c06-bfec-46fe-9b3e-8a576598d337","year":2008},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.870637Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:b473e89cb54b5f6e7469c3830a962715ca0583e4046dfc7e6e558b381938e9c3","observation_id":"b0e0bf67-ef33-4e68-9822-aace76dc544b","resolution":{"observed_at":"2026-08-10T17:12:50.515264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.496145Z","title":"Ranking with ker- nels in fourier space","venue":null,"work_id":"049fa1a1-6519-4546-b50b-08ce213ca0f9","year":2010},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.875227Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:8df5dc2b9038b1ee7739e05260c695489bca4e7a5ed37b200b2d4a20ee1e9b5e","observation_id":"581f4ec8-b1ef-4ee7-9847-daa180f7f593","resolution":{"observed_at":"2026-08-10T17:12:50.500819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.482059Z","title":"Efficient classical simulation of slightly en- tangled quantum computations","venue":null,"work_id":"9537e5cf-a1bc-4979-9680-bd5f109ca872","year":2003},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.879816Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:a82bb8996a9fb62d72484abf3c7cbccf86e4196354932e05ec429c7ccb85d547","observation_id":"66b83730-9dd3-4dbd-88de-fe034e8f2951","resolution":{"observed_at":"2026-08-10T17:12:50.486752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.04322","last_updated":"2024-07-23T11:54:49Z","snapshot_observed_at":"2026-08-13T00:36:53.544418Z","submitted_at":"2024-04-05T18:00:02Z","title":"Quantum Spin Chains and Symmetric Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.04322","snapshot_observed_at":"2026-08-10T17:12:49.885114Z","title":"Quantum spin chains and symmetric functions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.885114Z"},"links":{"cited_paper":"/paper/2404.04322","citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:12c835d711e2a1b9ce063a63a92d5a4069e83df9da316feaa08ad46853d22e9e","observation_id":"80f6d23a-d7db-4637-a2b6-a8a1bae620c3","resolution":{"observed_at":"2026-08-10T17:12:49.885114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.467159Z","title":"Noncommutative schur functions and their applications","venue":null,"work_id":"c7f05157-f831-4203-83f4-41108468043a","year":1998},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.889942Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:d61a9657af0b9778573d51fbaf34e2f607597ea25dbce89820dd37c837b31a1d","observation_id":"d6765d5f-e468-433d-9514-a9f66b28174e","resolution":{"observed_at":"2026-08-10T17:12:50.471603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.453879Z","title":null,"venue":null,"work_id":"dbb8802b-446a-4130-81e6-848d57a79866","year":1900},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.894191Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:8971e6ba97768736003bfbd59505e8aa33d4dfeab8bc165be9f7f9185fa050c4","observation_id":"bf7f5c5f-8856-45df-a04f-cbd0d4e78806","resolution":{"observed_at":"2026-08-10T17:12:50.458221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.438799Z","title":"quimb: A python package for quantum in- formation and many-body calculations","venue":null,"work_id":"8048a216-e6f8-4cb8-bd7a-a580e8bdae5f","year":2018},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.898948Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:d6a406d7174add934234c1941eff513e819f286c9617e2d9047d9986b2aa0335","observation_id":"da41e000-1e9e-4d81-8109-ca6eb804e631","resolution":{"observed_at":"2026-08-10T17:12:50.444264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.424335Z","title":"mpnum: A matrix product representation library for python","venue":null,"work_id":"445b642d-766c-4d26-a840-e38b5c0d7ce9","year":2017},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.903260Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:e97e75bd0f6336475d70f11120d2f9c1503bd3fffd0ac9ce0a6a3d26f617d245","observation_id":"591fbfa0-864e-4945-8db4-2e1c86d4af48","resolution":{"observed_at":"2026-08-10T17:12:50.428905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.410121Z","title":"Quantum computation of Fourier trans- forms over symmetric groups","venue":null,"work_id":"7db361f1-11b9-4e0d-97c1-ba5a8f1584fc","year":1997},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.907408Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:506123d03c19c6041a4bc563f70a3c2a7dcd89bcfb2209eb39ff85d2d5c958af","observation_id":"b14b336d-6bb0-4485-9c3e-60878e0d836c","resolution":{"observed_at":"2026-08-10T17:12:50.415019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.394899Z","title":"The computational complexity of linear optics","venue":null,"work_id":"b0a73e69-1c91-4593-ae93-2f41355cdc1b","year":2011},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.911617Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:afb9ad6184a8d1c3d0d81e0d45187954755560aa4a0cf5a24ae12dc28d10e38c","observation_id":"00b611df-364d-4ee7-b189-f9bd89d79380","resolution":{"observed_at":"2026-08-10T17:12:50.400303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.380783Z","title":"Average-case complexity versus approximate sim- ulation of commuting quantum computations","venue":null,"work_id":"be396706-89fd-4d2f-bd58-b32384e3a9a0","year":2016},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.915873Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:45c5da82a5de057564eff15df8f42f2fb1e84b5ebe0e60c1382bba7a4beb3892","observation_id":"c705d11e-e937-4796-a471-b675c8c66f12","resolution":{"observed_at":"2026-08-10T17:12:50.385538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.366112Z","title":"Computational ad- vantage of quantum random sampling","venue":null,"work_id":"5a1ee839-878f-439a-af9e-a3498a996da6","year":2023},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.921060Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:a2b4ffc843659ca07871ddb294ae374c80fa17988185abbc731b2fdf60a478cd","observation_id":"6436d3f1-5ab8-4980-a7df-608527512230","resolution":{"observed_at":"2026-08-10T17:12:50.370572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.351600Z","title":"The characters of the symmetric group","venue":null,"work_id":"7da53934-c328-4da5-a634-d1d28d039d26","year":1937},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.926456Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:259e5503b3500ac46df549fc576460bdd8df3be3eef9b1fe8c8b0c4c3a828ec3","observation_id":"ce7037cc-94f0-46b2-a843-45ec444341ea","resolution":{"observed_at":"2026-08-10T17:12:50.356718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.336780Z","title":"On some modular properties of ir- reducible representations of symmetric groups, ii","venue":null,"work_id":"b46e54d9-036a-4586-ae82-8e81b54e7b42","year":1940},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.930843Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:c5dc584705871662dc1aa1bcff66c82a255147357dde66864f7a9669c76c39a6","observation_id":"c010c38c-bc04-4213-97db-3eabe2b65430","resolution":{"observed_at":"2026-08-10T17:12:50.341412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.321540Z","title":"Algorithms for the character theory of the symmetric group","venue":null,"work_id":"010d30f0-6409-42dd-b0ff-70ca7724d4e7","year":1985},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.936145Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:ab2f7f878bbac228cd9a839848fa4f6372d50c208ff94a5a095864ed1f760cff","observation_id":"4ca640b1-33a8-42ac-b26f-5d8696c4ee98","resolution":{"observed_at":"2026-08-10T17:12:50.326250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.306445Z","title":null,"venue":null,"work_id":"ee25afa7-10aa-412e-8d88-f1abde8489ff","year":2009},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.940380Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:d699d04c0a421f12fd2a1631d07e27ba90f32c1b91ffd43c21921d830b4eaca4","observation_id":"574c2f8b-b154-4add-b586-16c3ff3d2551","resolution":{"observed_at":"2026-08-10T17:12:50.311116Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.291868Z","title":"Quantum com- plexity of the Kronecker coefficients","venue":null,"work_id":"295be6c4-6975-4a21-8461-ed0d6aed4812","year":2024},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.945694Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:558902750e3a1316b291f732782559f081d7ae854f19016108114267521024ca","observation_id":"6c840c5a-b737-4274-aed1-2d586e5a758e","resolution":{"observed_at":"2026-08-10T17:12:50.296672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17649","last_updated":"2025-03-25T18:51:14Z","snapshot_observed_at":"2026-08-12T23:15:19.485726Z","submitted_at":"2024-07-24T21:34:05Z","title":"Quantum Algorithms for Representation-Theoretic Multiplicities","version":5},"cited_work":{"arxiv_id":"2407.17649","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.17649","snapshot_observed_at":"2026-08-10T17:12:50.062219Z","title":"Quantum Algorithms for Representation-Theoretic Multiplicities","venue":"quant-ph","work_id":"830177af-d264-49c9-ad73-2c65f0ef6281","year":2024},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.951081Z"},"links":{"cited_paper":"/paper/2407.17649","citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:1c5eeb188e0f592f8a5dd613f35d45ce6815379560d6cbb6578d08a5435b0ccc","observation_id":"c86fc6b4-8693-47e7-b6f5-192bbf6d5a2a","resolution":{"observed_at":"2026-08-10T17:12:50.069222Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.277137Z","title":"Introduction to representation theory, volume 59","venue":null,"work_id":"d62c06b5-3a57-40a5-82b3-bce3faba089c","year":2011},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.955662Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:3d179be27fe51b0ad6ceda3a57b80f49a5d5509927791b5892f218877ceac715","observation_id":"d32980c0-3470-4dab-be02-ba343ccbdd15","resolution":{"observed_at":"2026-08-10T17:12:50.282226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.262794Z","title":"up by one","venue":null,"work_id":"fbdcdffa-06c7-468d-9140-d9ca40f632cb","year":null},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.960007Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:7f4b916483567edd6609c62220c2ac1205179150dcfa3f58ff105eb23ec991b9","observation_id":"1ab7fbc8-61af-4479-b107-71422b709680","resolution":{"observed_at":"2026-08-10T17:12:50.267231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:49.964384Z","title":"The density-matrix renormalization group in the age of matrix product states","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.964384Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:85e9104d6ff41bc419dd06bdeb4c328b60d4236650c393780a1586098492ff58","observation_id":"7469bcea-2312-444b-9b77-b4fc2fd7452c","resolution":{"observed_at":"2026-08-10T17:12:49.964384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.238954Z","title":"GAP – Groups, Algorithms, and Pro- gramming, Version 4.12.2, 2022","venue":null,"work_id":"0436b8c6-fb4d-4c36-a848-322bd0d90824","year":2022},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.969037Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:cb17f2591002248522a1a7cb29d6401d40302527643b181b7f8ecf9d0d2677d2","observation_id":"b3b2cf31-3f96-4d60-8585-1f1431e5aa67","resolution":{"observed_at":"2026-08-10T17:12:50.243682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.224747Z","title":null,"venue":null,"work_id":"bca8fd2f-0f41-4c65-9e3f-8d3c1c480164","year":2023},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.973347Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:fc1a17b7f0336160ec6a036f1953b2bec80512407befc232a88732143c39f8b6","observation_id":"3556df80-2c7e-4b65-9d97-eb9dd32d8cda","resolution":{"observed_at":"2026-08-10T17:12:50.229199Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.209919Z","title":"Github repository","venue":null,"work_id":"9f118846-51b1-4e48-86a9-0f2af10a995a","year":2025},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.977864Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:0327e13ebd220de001f30fd3ab36215d6147df41eb7d349a27314e1938630dee","observation_id":"f65686bc-a7c9-4c3a-bd42-f2e9bf5bd4b7","resolution":{"observed_at":"2026-08-10T17:12:50.214467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.195723Z","title":"An efficient quantum algorithm for preparation of uniform quantum superpo- sition states","venue":null,"work_id":"124a1bd8-54cc-49c8-968d-524d2cc39a32","year":2024},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.982243Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:3cc5b595cd171fe7e1595bac3fa3f6fe790784e3642b85fead68148701f59dc7","observation_id":"0a822796-363e-404a-a276-3d952acc1338","resolution":{"observed_at":"2026-08-10T17:12:50.200158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.180165Z","title":"Enumerative combinatorics: volume 2, volume 62","venue":null,"work_id":"1fa0a2eb-3d87-4f58-b5dc-b1ed77314742","year":1999},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.987253Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:e9be71c581392ecb2178f2de0acafad710d8c5a0be6e9f7a9946b546217aa4ff","observation_id":"644a6054-84a8-40cd-9d7e-b327309c37eb","resolution":{"observed_at":"2026-08-10T17:12:50.185319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.164789Z","title":"Classical simulation of commuting quantum computa- tions implies collapse of the polynomial hierarchy","venue":null,"work_id":"cb46223d-87e9-4f51-9576-4d4a003a0b13","year":2011},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.992223Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:d20d8bd0a07f1ce3d4bc279ca94f11963bf320368a9a364f143bd2e63cd223b0","observation_id":"4b74bfb9-8a63-43b3-939c-c2e1e20cb711","resolution":{"observed_at":"2026-08-10T17:12:50.170040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.732625Z","title":"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 )","venue":null,"work_id":"b235dda3-7d3b-42d9-a9f2-5bce10872c82","year":null},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.819951Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:a7851de16b2b53e594be48b688162c6bd0354f9369c305888c1509053cde2322","observation_id":"75b923a4-c2e9-4578-b8a7-6996c50f2ac2","resolution":{"observed_at":"2026-08-10T17:12:50.737841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.150064Z","title":"The complexity of approximate count- ing","venue":null,"work_id":"a792a93f-cba5-4974-ab4d-12c5f5daed1d","year":1983},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:49.996447Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:b94174fe88182123a6500dc5ae39edf89f9cd1cc69816048320e66e0eb546786","observation_id":"148f3dd5-5eec-409e-8215-47dbb247f4cd","resolution":{"observed_at":"2026-08-10T17:12:50.154789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12019","last_updated":"2022-09-07T01:15:40Z","snapshot_observed_at":"2026-08-13T19:34:15.553720Z","submitted_at":"2021-04-24T20:34:42Z","title":"Cycle type of random permutations: A toolkit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12019","snapshot_observed_at":"2026-08-10T17:12:50.001439Z","title":"Cycle type of random permutations: a toolkit","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:50.001439Z"},"links":{"cited_paper":"/paper/2104.12019","citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:ba75f12751b71993a67fc2a1778540246506e39acba4f3bc170774f3d84d92a0","observation_id":"9bae8b00-e2c2-4036-86db-2f3fb926659b","resolution":{"observed_at":"2026-08-10T17:12:50.001439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.134542Z","title":null,"venue":null,"work_id":"6f49ceff-d1c9-4995-93e4-6cd323f70889","year":1918},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:50.006639Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:f459f7c71d7bdde7a8cde5aaaceb4d5046189179f93bcac37e2c622a0f07eb75","observation_id":"2cbc26f8-a442-43a3-8f13-5eb340904919","resolution":{"observed_at":"2026-08-10T17:12:50.139223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:12:50.118839Z","title":"The distribution of the number of summands in the partitions of a positive inte- ger","venue":null,"work_id":"20a26486-6527-4b83-be2e-417b9f20c879","year":1941},"citing_paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T17:12:50.011248Z"},"links":{"citing_paper":"/paper/2501.12579"},"observation_digest":"sha256:dc16705c49499c8a60313d058407d6a9d62823d707483236c6738ccaf48bf111","observation_id":"d6ad18f3-81a7-4829-b25f-446bbee9a374","resolution":{"observed_at":"2026-08-10T17:12:50.123652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.12579","last_updated":"2025-02-19T05:14:21Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T16:59:34.927567Z","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":32},"total_outbound_references":41},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"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."}