{"as_of":"2026-08-21T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd4bbc6738ca4370dab21c6436c468e0e1355a9627a4741aa9f8bdb373cab97e","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:08:42.447851Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T06:21:23.923750Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T21:11:20.712712Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"cited_work":{"arxiv_id":"2507.19259","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.19259","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","venue":null,"work_id":"4c2f7a4c-0792-48ad-b9fe-8c746b1880a0","year":2025},"citing_paper":{"arxiv_id":"2605.05618","last_updated":"2026-05-07T03:17:33Z","snapshot_observed_at":"2026-08-14T18:29:33.852224Z","submitted_at":"2026-05-07T03:17:33Z","title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T06:21:23.923750Z"},"links":{"cited_paper":"/paper/2507.19259","citing_paper":"/paper/2605.05618"},"observation_digest":"sha256:8a4e2fc35e7c01f93643cb470b22e0927d2081d993a8ee55af2367d43369410d","observation_id":"f2b5820a-4f58-4939-825e-2432c6c86c3d","resolution":{"observed_at":"2026-05-11T21:11:20.719162Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.19259/citation-record","integrity":"/paper/2507.19259/integrity","json":"/paper/2507.19259/citation-record.json","paper":"/paper/2507.19259"},"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-15T18:08:43.581482Z","title":"Bhamidi, P","venue":null,"work_id":"ec507f20-ca07-46dd-a87a-4b474d641e43","year":2017},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.203136Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:cf71af3866496abed18fad6c5344e0a0203d386ad9b093955846b0ab0a6e8801","observation_id":"952c8edf-61e0-4622-9ef9-b7fcd20dd8cf","resolution":{"observed_at":"2026-08-15T18:08:43.585584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.567656Z","title":"Bodwin, K","venue":null,"work_id":"db5678c2-67e6-4aa5-a633-1ede8ab66381","year":2018},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.207301Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:5b74e6d0abd48632759e7f8ac7dc93aaa0315922728cf625adb94076d3812788","observation_id":"8866344b-eb8e-41d7-b0f2-3cd4b50848bf","resolution":{"observed_at":"2026-08-15T18:08:43.573736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.513830Z","title":"Cai and T","venue":null,"work_id":"6e3c116a-f649-4475-9ad6-1a7cd1d5cac1","year":2011},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.210727Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:966d2a9ecc328f7b9ce111562106d41c877da13d9a4421d11159b4e57d7d03d5","observation_id":"c3b807e8-0d8d-4b9f-a659-af53c3fe5d98","resolution":{"observed_at":"2026-08-15T18:08:43.536233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.501597Z","title":"Dewaskar, J","venue":null,"work_id":"ad936813-854a-4a55-b073-d6782a32f71a","year":2023},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.214206Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:765ef9d6ac7da0dfbaa1c6cbc095ec3d52bde17a0faf49f4ebbf3cfa717837b6","observation_id":"61323034-7a30-44ef-a2b0-1fb3eda87514","resolution":{"observed_at":"2026-08-15T18:08:43.506257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.394924Z","title":null,"venue":null,"work_id":"1d7c995e-25bd-453e-83e5-6181e8913cf8","year":2025},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.218783Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:75678544c7b5e2477fabf007da89b0e7603b9968964ae7d72479a1e244fe33a7","observation_id":"abd41a6c-f5cc-4312-80d4-1b82c64f11b1","resolution":{"observed_at":"2026-08-15T18:08:43.493295Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.380732Z","title":null,"venue":null,"work_id":"e6f25b33-5915-4825-b43a-ceda2ff594d8","year":2025},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.223974Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:8194718ccb941bb8cc8d04c1e1a4795e88e88af70ea5d517d0f2f7c042b3e9da","observation_id":"7743d3a9-2c9f-4a1c-9c81-ef77c35ddf06","resolution":{"observed_at":"2026-08-15T18:08:43.384301Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.307497Z","title":"Gamarnik, The overlap gap property: A topological barrier to optimizing over random structures , Proceedings of the National Academy of Sciences 118 (2021), no","venue":null,"work_id":"d53d6613-e0cd-4201-b306-f4cb83d656f9","year":2021},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.340071Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:eafacda21b548ec62ec3e3fed60ab2d9b4a7532bf2c78980b418c73bfef5ebf4","observation_id":"61235e63-1d94-43a5-aeb7-2accf64c2be2","resolution":{"observed_at":"2026-08-15T18:08:43.372282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.293559Z","title":"Gamarnik, Turing in the shadows of nobel and abel: an algorithmic story behind two recent prizes , Notices of AMS 72 (2025), no","venue":null,"work_id":"24a92188-dceb-48c2-b001-37c8d3dab4b8","year":2025},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.343730Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:2e45ac39e5231f5d4d5c88cf4b4c9a128128878e10e66023801c93d05549d0f7","observation_id":"34042fdd-1a47-40e1-852b-6b35c1487959","resolution":{"observed_at":"2026-08-15T18:08:43.298452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.195437Z","title":"Gamarnik, E","venue":null,"work_id":"402a146b-1fee-44f1-9483-31f4b084a224","year":2023},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.347613Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:e05a1d402a120033a983ff204966893aea5ec0af34a69f57773e17051ea36579","observation_id":"a308c532-9908-4c48-afc8-def24340766a","resolution":{"observed_at":"2026-08-15T18:08:43.283314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:42.351147Z","title":"Gamarnik, E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.351147Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:a4e37d14fa447265ff0ef2ebba4077291763a8c572e39c65b00412e6bdd697d4","observation_id":"dc6f75c4-d263-4c81-8620-d594f095d67d","resolution":{"observed_at":"2026-08-15T18:08:42.351147Z","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-15T18:08:43.024498Z","title":"Gamarnik and Q","venue":null,"work_id":"096a3815-0141-48f4-8cce-cb97d2dfcc8d","year":2018},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.354956Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:858690b20b2a0fb206684c6ad3fa560107cff0d602d2e542c9650ce6e959b237","observation_id":"c9ef69f8-d356-4a92-9415-51f639c70a9e","resolution":{"observed_at":"2026-08-15T18:08:43.106791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:43.008041Z","title":"Gamarnik, C","venue":null,"work_id":"1d472114-471c-446e-9323-9a6f46458cc8","year":2022},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.359842Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:82042f370b8a4cee4ac8423ec13e380e7945e14ca0c092d07f0848f7d56afa8f","observation_id":"62791078-aa2e-4dcb-8e45-34fe2a008497","resolution":{"observed_at":"2026-08-15T18:08:43.013729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.17118","last_updated":"2025-06-20T16:18:17Z","snapshot_observed_at":"2026-08-17T21:00:50.595300Z","submitted_at":"2025-06-20T16:18:17Z","title":"Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers","version":1},"cited_work":{"arxiv_id":"2506.17118","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.17118","snapshot_observed_at":"2026-08-15T18:08:42.629851Z","title":"Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers","venue":"math.ST","work_id":"e5ec9d4e-e6ec-4573-b220-6276414c7fb2","year":2025},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.365041Z"},"links":{"cited_paper":"/paper/2506.17118","citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:5cd8f9cad55249defb6bce6715fd079f13e71902e6be0be237264cfc84f108eb","observation_id":"fa0784cc-5d3d-466a-bdde-f57f137d85d9","resolution":{"observed_at":"2026-08-15T18:08:42.636153Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:42.941884Z","title":"Huang and M","venue":null,"work_id":"cad2a033-4752-4447-9009-2a6110139c52","year":2025},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.369606Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:0b4dd1fc1355e1804cfad068132e57be154248ef20e47f378c3a5809bd6e32c5","observation_id":"153d7d44-212c-45e7-89a5-52b0153b5ef2","resolution":{"observed_at":"2026-08-15T18:08:42.993898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:42.859463Z","title":null,"venue":null,"work_id":"07ce96a5-d554-46c8-85e4-41cafbe2eef0","year":null},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.435439Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:3d6dc477d0594b467a9fce41072d3f6042ffd5bcb4f3fcdd7a53e32a8def1f76","observation_id":"91a21327-ef9b-42e8-b7d2-4997fa962e6e","resolution":{"observed_at":"2026-08-15T18:08:42.863400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.10427","last_updated":"2021-01-08T06:38:22Z","snapshot_observed_at":"2026-08-14T20:09:16.306095Z","submitted_at":"2017-11-28T17:38:53Z","title":"Latent Association Mining in Binary Data","version":2},"cited_work":{"arxiv_id":"1711.10427","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.10427","snapshot_observed_at":"2026-08-15T18:08:42.485338Z","title":"Latent Association Mining in Binary Data","venue":"stat.ME","work_id":"3599aa87-7d6e-43ca-87a3-bc1895c16ee2","year":2017},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.440322Z"},"links":{"cited_paper":"/paper/1711.10427","citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:7028f1a046accf59f407475bc2438276b9887b4243fa02ea0b40c89d181ad3f6","observation_id":"0a0b3cb4-7036-4d32-84ba-9dd227fa7b39","resolution":{"observed_at":"2026-08-15T18:08:42.568077Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:42.845091Z","title":"Pontes, R","venue":null,"work_id":"5e1512ee-f7a5-4d6d-9e0e-9cb95b609338","year":2015},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.443984Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:cc6d30db45e9281375aa1cecbc173376e7fa5eafbac038ce54e90cd002094d42","observation_id":"1063a3d7-8889-4b44-915e-08d96868673c","resolution":{"observed_at":"2026-08-15T18:08:42.850000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T18:08:42.753815Z","title":null,"venue":null,"work_id":"9bb86848-9b13-43fa-9312-3a0cb0f6a37c","year":2009},"citing_paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:08:42.447851Z"},"links":{"citing_paper":"/paper/2507.19259"},"observation_digest":"sha256:5fbf1eecc86238f94ebc9400037127c6a27204218af559c832b501d8d05779bd","observation_id":"f6810b2c-4465-4e14-b805-5cbc711977be","resolution":{"observed_at":"2026-08-15T18:08:42.834281Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.19259","last_updated":"2025-07-25T13:37:19Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-19T03:26:12.559586Z","submitted_at":"2025-07-25T13:37:19Z","title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":18},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"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."}