{"as_of":"2026-08-22T02:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e98ac67f51fa1787f055263e860a3019371a1c53d085a8f31b35f05c3a200e9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"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-08-15T18:08:42.440322Z","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-08-15T18:08:42.485338Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/1711.10427/citation-record","integrity":"/paper/1711.10427/integrity","json":"/paper/1711.10427/citation-record.json","paper":"/paper/1711.10427"},"outbound":[],"paper":{"arxiv_id":"1711.10427","last_updated":"2021-01-08T06:38:22Z","latest_version":2,"primary_category":"stat.ME","snapshot_observed_at":"2026-08-14T20:09:16.306095Z","submitted_at":"2017-11-28T17:38:53Z","title":"Latent Association Mining in Binary Data"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1711.10427."}