Paper Citation Record · LEDGER

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms

As of 21 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:2507.19259.

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

pith.paper-citation-record.v1
2507.19259 v1

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T18:08:42.447851Z

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-08T06:21:23.923750Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-11T21:11:20.712712Z

Reference resolution

18 of 18 outbound references displayed

verified exact2
verified fuzzy11
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 952c8edf-61e0-4622-9ef9-b7fcd20dd8cf · outbound

This paper cites Bhamidi, P.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Bhamidi, P

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.585584Z

Source-reported events for the cited work

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

Observation 8866344b-eb8e-41d7-b0f2-3cd4b50848bf · outbound

This paper cites Bodwin, K.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Bodwin, K

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.573736Z

Source-reported events for the cited work

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

Observation c3b807e8-0d8d-4b9f-a659-af53c3fe5d98 · outbound

This paper cites Cai and T.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Cai and T

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.536233Z

Source-reported events for the cited work

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

Observation 61323034-7a30-44ef-a2b0-1fb3eda87514 · outbound

This paper cites Dewaskar, J.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Dewaskar, J

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.506257Z

Source-reported events for the cited work

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

Observation abd41a6c-f5cc-4312-80d4-1b82c64f11b1 · outbound

This paper cites an unresolved cited work.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Unresolved cited work

Reference 5

Resolution: unresolved; raw_fallback, observed 2026-08-15T18:08:43.493295Z

Source-reported events for the cited work

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

Observation 7743d3a9-2c9f-4a1c-9c81-ef77c35ddf06 · outbound

This paper cites an unresolved cited work.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-15T18:08:43.384301Z

Source-reported events for the cited work

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

Observation 61235e63-1d94-43a5-aeb7-2accf64c2be2 · outbound

This paper cites Gamarnik, The overlap gap property: A topological barrier to optimizing over random structures , Proceedings of the National Academy of Sciences 118 (2021), no.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Gamarnik, The overlap gap property: A topological barrier to optimizing over random structures , Proceedings of the National Academy of Sciences 118 (2021), no

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.372282Z

Source-reported events for the cited work

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

Observation 34042fdd-1a47-40e1-852b-6b35c1487959 · outbound

This paper cites Gamarnik, Turing in the shadows of nobel and abel: an algorithmic story behind two recent prizes , Notices of AMS 72 (2025), no.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Gamarnik, Turing in the shadows of nobel and abel: an algorithmic story behind two recent prizes , Notices of AMS 72 (2025), no

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.298452Z

Source-reported events for the cited work

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

Observation a308c532-9908-4c48-afc8-def24340766a · outbound

This paper cites Gamarnik, E.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Gamarnik, E

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.283314Z

Source-reported events for the cited work

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

Observation dc6f75c4-d263-4c81-8620-d594f095d67d · outbound

This paper cites Gamarnik, E.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Gamarnik, E

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-15T18:08:42.351147Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9ef69f8-d356-4a92-9415-51f639c70a9e · outbound

This paper cites Gamarnik and Q.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Gamarnik and Q

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.106791Z

Source-reported events for the cited work

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

Observation 62791078-aa2e-4dcb-8e45-34fe2a008497 · outbound

This paper cites Gamarnik, C.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Gamarnik, C

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:43.013729Z

Source-reported events for the cited work

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

Observation fa0784cc-5d3d-466a-bdde-f57f137d85d9 · outbound

This paper cites Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers

Reference 13

Resolution: verified exact; local_arxiv, observed 2026-08-15T18:08:42.636153Z

Source-reported events for the cited work

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

Observation 153d7d44-212c-45e7-89a5-52b0153b5ef2 · outbound

This paper cites Huang and M.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Huang and M

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:42.993898Z

Source-reported events for the cited work

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

Observation 91a21327-ef9b-42e8-b7d2-4997fa962e6e · outbound

This paper cites an unresolved cited work.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Unresolved cited work

Reference 15

Resolution: unresolved; raw_fallback, observed 2026-08-15T18:08:42.863400Z

Source-reported events for the cited work

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

Observation 0a0b3cb4-7036-4d32-84ba-9dd227fa7b39 · outbound

This paper cites Latent Association Mining in Binary Data.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Latent Association Mining in Binary Data

Reference 16

Resolution: verified exact; local_arxiv, observed 2026-08-15T18:08:42.568077Z

Source-reported events for the cited work

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

Observation 1063a3d7-8889-4b44-915e-08d96868673c · outbound

This paper cites Pontes, R.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Pontes, R

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:08:42.850000Z

Source-reported events for the cited work

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

Observation f6810b2c-4465-4e14-b805-5cbc711977be · outbound

This paper cites an unresolved cited work.

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms Unresolved cited work

Reference 18

Resolution: unresolved; raw_fallback, observed 2026-08-15T18:08:42.834281Z

Source-reported events for the cited work

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

Pith citing papers

Observation f2b5820a-4f58-4939-825e-2432c6c86c3d · inbound

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs cites this paper.

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms

Reference 12

Resolution: verified exact; arxiv_id, observed 2026-05-11T21:11:20.719162Z

Source-reported events for the cited work

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