Pith. sign in

Paper Citation Record · LEDGER

On Sampling Lower Bounds for Polynomials

As of 13 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2605.00995.

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

pith.paper-citation-record.v1
2605.00995 v1

Coverage vector

measured 32 of 32 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-09T14:34:40.912183Z

measured 32 of 32 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

32 of 32 outbound references displayed

  • verified exact3
  • verified fuzzy29
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 762e410c-a486-41e5-a67e-b5fe8567f56a · outbound

This paper cites Annals of Combinatorics , volume=.

On Sampling Lower Bounds for Polynomials Annals of Combinatorics , volume=

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.535336Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:6701d4c02445286ca822bdcf59adb0851fe7d0884b2ff9e76572a5239afcb684

Observation 240c8ba1-751c-4de4-9f2f-6c2dc6d2f13e · outbound

This paper cites Foundations and Trends.

On Sampling Lower Bounds for Polynomials Foundations and Trends

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.539298Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:9c93850aaf97b80657163ed15d8dd7577297302969e8ff88720f1d86f98698bc

Observation a7647475-35aa-42bf-86f0-89bfe0228bf5 · outbound

This paper cites 1996 , place=.

On Sampling Lower Bounds for Polynomials 1996 , place=

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.523932Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:79821ace2046d7a7b82aedfddbcb717924c1b839c55bb9d8c7577a8f1d163b19

Observation 88328eca-8f15-4cbc-9ec3-b9dc19011a90 · outbound

This paper cites Proceedings of the forty-second ACM symposium on Theory of computing , pages=.

On Sampling Lower Bounds for Polynomials Proceedings of the forty-second ACM symposium on Theory of computing , pages=

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.527880Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:44c78735a9f417463c4173ead1a7bd9a5e31d6d5634732f98b53147e00829440

Observation 6e16b343-99c6-47fc-9b23-ded01b3397cb · outbound

This paper cites Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=.

On Sampling Lower Bounds for Polynomials Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.517006Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:e5f5f69fa1669a529a58f1d3ec3350cd33a3ffe33c00ac84da273af600f3dba3

Observation 2bcaf734-d02b-4e42-8ae7-71d02e2ab461 · outbound

This paper cites Electronic Colloquium on Computational Complexity (ECCC) , year =.

On Sampling Lower Bounds for Polynomials Electronic Colloquium on Computational Complexity (ECCC) , year =

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.513040Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:60e109dde1785615d5df553456b504696d63db498f0bdd2a39eba0bc007a064d

Observation 79566570-b417-4024-8879-b4ce55533585 · outbound

This paper cites 2008 49th Annual IEEE Symposium on Foundations of Computer Science , pages=.

On Sampling Lower Bounds for Polynomials 2008 49th Annual IEEE Symposium on Foundations of Computer Science , pages=

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.520476Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:43459f262544339dd2b50ae5c52f1a799704d1d96fda713644ba6c235b0bb67c

Observation c9c1614f-f153-4d44-95be-48173d5dafd9 · outbound

This paper cites Contributions to Discrete Mathematics , volume =.

On Sampling Lower Bounds for Polynomials Contributions to Discrete Mathematics , volume =

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.531608Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:85de18a9c552a3a03d716902b7ee683115e5a8db68c00028e5a80526b6448d85

Observation 4261fd62-2e68-4fd6-9f6e-b00f2bfc3b3e · outbound

This paper cites 38th Computational Complexity Conference (CCC 2023) , pages=.

On Sampling Lower Bounds for Polynomials 38th Computational Complexity Conference (CCC 2023) , pages=

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.543638Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:9aef6be57e1d763b063a6f23f750f0f9dc8bf14d4d4c19353b5314bd87ccde9f

Observation 4724c6d5-da28-4c79-ab54-e94646b991e3 · outbound

This paper cites SIAM Journal on Computing , volume=.

On Sampling Lower Bounds for Polynomials SIAM Journal on Computing , volume=

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.494163Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:cf28925ab1f53210d06b389774ab3cc942e5821697cbc53b58ce47dc1335e1de

Observation 1c5b9a72-e9b3-425e-9d28-56b29b58cafd · outbound

This paper cites Symmetric Distributions from Shallow Circuits.

On Sampling Lower Bounds for Polynomials Symmetric Distributions from Shallow Circuits

Reference 11

Resolution
verified exact
arxiv_id, observed 2026-07-27T01:19:52.532817Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:76b0ff60fa9b68fe61b39fe220e452aa9d57b8e304993cb291d3a1297541c171

Observation 8a892716-b363-44ee-a081-9738a32acc40 · outbound

This paper cites Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=.

On Sampling Lower Bounds for Polynomials Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.497897Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:f354348899a81b8531ff5bc21846fb3272d716fed1ac6e3aed07c6f9dcb059d7

Observation ee6a0a32-7173-4f48-9735-086b1df8aa98 · outbound

This paper cites Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=.

On Sampling Lower Bounds for Polynomials Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.490548Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:2565332c04ab37e94ce157c5e244a4afe13e406d6588e5bdf8797c61467520b1

Observation 5609e7da-a906-408b-a011-5b8846b50a75 · outbound

This paper cites 17th Innovations in Theoretical Computer Science Conference (ITCS 2026) , pages =.

On Sampling Lower Bounds for Polynomials 17th Innovations in Theoretical Computer Science Conference (ITCS 2026) , pages =

Reference 14

Resolution
verified exact
doi, observed 2026-05-09T22:24:01.042231Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:8c8088d183a87a43270313b07eb6fff5804c9ffc7262fde00020eb8eee5bc1fc

Observation d8d128c7-14e8-4e33-9695-8ce38771159e · outbound

This paper cites 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) , pages=.

On Sampling Lower Bounds for Polynomials 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) , pages=

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.478947Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:63065693421f0e5eae4ecec2cbf68ef453514c41c03942bbe8f50df9a9453b25

Observation 525470a8-7cfa-4814-800c-83d8a4c0cfbd · outbound

This paper cites Journal of the London Mathematical Society , volume=.

On Sampling Lower Bounds for Polynomials Journal of the London Mathematical Society , volume=

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.475370Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:413c07a245bbe849fa618d2ee5b10f7328c316fbd2d4aba61a1b39fa72a18528

Observation ceaccbc4-f9d1-43cc-ad88-ad77d98e5dab · outbound

This paper cites Information and control , volume=.

On Sampling Lower Bounds for Polynomials Information and control , volume=

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.482583Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:7895cfbd3de6c4d82a6bb92a75e6176ed1b7da55471ba3f33f33a8a1f9142a1c

Observation 7aa6185b-1f7e-4e9d-96c6-6829b117a0ff · outbound

This paper cites IEEE Transactions on Information Theory , volume=.

On Sampling Lower Bounds for Polynomials IEEE Transactions on Information Theory , volume=

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.486492Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:e1bc1c66fea006ae2602c66a2236bb700b4ccc9e68a9aab751f64df816faee66

Observation ff15a334-c057-4483-92ed-51358b0b340a · outbound

This paper cites IEEE transactions on information theory , volume=.

On Sampling Lower Bounds for Polynomials IEEE transactions on information theory , volume=

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.501536Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:3eb39ceee775e1c20ac16ee2161a677d14698c1e59f67999960c537f4144fd1d

Observation a3fc82f4-b8cf-4807-86e0-f21f7476d73c · outbound

This paper cites Proceedings of the fortieth annual ACM symposium on Theory of computing , pages=.

On Sampling Lower Bounds for Polynomials Proceedings of the fortieth annual ACM symposium on Theory of computing , pages=

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.505230Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:73fe69b58b0a0942ee413c53a3c553d0affb8a34d0178cdbe193e1f8fc376147

Observation 4380a689-6431-46b8-ab01-82e3777fe6b6 · outbound

This paper cites Mathematical systems theory , volume=.

On Sampling Lower Bounds for Polynomials Mathematical systems theory , volume=

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.508812Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:4d8dcc821c173d47115412c8039c0b9368fd6e109cd9fe81fed257acdab0c2dd

Observation 9010d2b5-6c91-43f6-a900-7a28e48d9972 · outbound

This paper cites Annals of pure and applied logic , volume=.

On Sampling Lower Bounds for Polynomials Annals of pure and applied logic , volume=

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.547183Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:fee0d0e157b05ee35c95ca29fe0c9970a92fad880f75c3bbe428823794f20e64

Observation 0380c43d-1f4c-421f-9285-ffacded008e5 · outbound

This paper cites Proceedings of the eighteenth annual ACM symposium on Theory of computing , pages=.

On Sampling Lower Bounds for Polynomials Proceedings of the eighteenth annual ACM symposium on Theory of computing , pages=

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.579400Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:373f1ac13b09e86c5ad701cc6c6cb1697a1bc5d78261a9b9ad5456ed2e26d2a7

Observation 8f7911a0-8139-4f4e-9641-dc3c45fedbe4 · outbound

This paper cites Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=.

On Sampling Lower Bounds for Polynomials Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.568550Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:b37e9f3d74eafe7b01a31d664f778ed80654d27f650d56b743031cf3f95aa974

Observation c5f4145c-ebee-4005-a065-8bc74ea6cdef · outbound

This paper cites Approximation, Randomization, and Combinatorial Optimization.

On Sampling Lower Bounds for Polynomials Approximation, Randomization, and Combinatorial Optimization

Reference 25

Resolution
verified exact
doi, observed 2026-05-09T22:24:01.045174Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:7ff43b06a8d5106b48210111aa89e324ec4e334b926661e7317c16e0adc7ee2a

Observation b7a88773-ecb6-4a85-b356-36ad7686a11d · outbound

This paper cites 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) , pages=.

On Sampling Lower Bounds for Polynomials 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) , pages=

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.575820Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:44bab1bb4c5eaafd3899a76de47ea37d9d0aa56fbd88ee076ad97f8c373acfed

Observation d7f418a8-fa76-4e5f-b6d1-d4d4ec523987 · outbound

This paper cites ACM Transactions on Computation Theory (TOCT) , volume=.

On Sampling Lower Bounds for Polynomials ACM Transactions on Computation Theory (TOCT) , volume=

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.572484Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:b4f4180641c707778768698dffe3f686fcc236a3331f796a28a5198d2184c9d4

Observation 77dd893f-8179-452d-b82b-4f2fea1fbb16 · outbound

This paper cites SIAM Journal on Computing , volume=.

On Sampling Lower Bounds for Polynomials SIAM Journal on Computing , volume=

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.564749Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:1a9c93e53223765ff6c126a19669e12ea30439a5a7540da65e7224b83ff944ff

Observation fa7473cc-6a52-41c5-a576-65c7457bb209 · outbound

This paper cites ACM Transactions on Computation Theory (TOCT) , volume=.

On Sampling Lower Bounds for Polynomials ACM Transactions on Computation Theory (TOCT) , volume=

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.561111Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:43b2f81a978072558e8330cc41e7521a971f92fa7bcc6322a83ef603ba554069

Observation 4c3f1ea1-6d18-4c88-a54f-3c080e67c867 · outbound

This paper cites ACM Transactions on Computation Theory (TOCT) , volume=.

On Sampling Lower Bounds for Polynomials ACM Transactions on Computation Theory (TOCT) , volume=

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.557736Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:2328308a396b1595f96bcd127c71a63173d99fb1cb2b79c4865fac00f056e178

Observation d2aed236-81f7-40e2-b900-784d1d1690b9 · outbound

This paper cites 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science , pages=.

On Sampling Lower Bounds for Polynomials 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science , pages=

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.554156Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:b3689b586041b950f22d9276fdba4de81c48eb9c806e2df7f9623f40b8808aac

Observation 43470f16-1f56-4dbe-b903-336b4ee48d91 · outbound

This paper cites 2011 IEEE 26th Annual Conference on Computational Complexity , pages=.

On Sampling Lower Bounds for Polynomials 2011 IEEE 26th Annual Conference on Computational Complexity , pages=

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T01:56:30.550585Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-09T14:34:40.912183Z digest=sha256:e5d271f05a9b50899e002c20e2f5370e245c074a1bef445db8269bb6862c8370

Pith citing papers

No inbound Pith citation observations are available.