{"as_of":"2026-08-11T19:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c283385260393fae7314a8837136982cf058f1d7c8a262e074816b8526fb82a","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:49:53.395882Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.16041/citation-record","integrity":"/paper/2602.16041/integrity","json":"/paper/2602.16041/citation-record.json","paper":"/paper/2602.16041"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:52.458809Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:52.458809Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:4578ad1504a535f453948475aa27b87abbb0815ca5e10bdf081269262848bf4b","observation_id":"4f9fb9a2-8d65-44d6-85e3-01d7949ea33c","resolution":{"observed_at":"2026-08-02T22:49:52.458809Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:53.097623Z","title":"Then t2 1 2ρn∥V∥ 2 + 2∥V∥ 2∞t1/3 ≥ 2 3 v(ν, d, n)∥V∥2→∞ + p 2ρnv(ν, d, n)∥V∥ 2 2ρn∥V∥+ 2 3 ∥V∥ 2→∞ 2 3 v(ν, d, n)∥V∥2→∞ + p 2ρnv(ν, d, n)∥V∥ ≥v(ν, d, n)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:53.097623Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:3ac8ddd1c82952a447788ed2f8345c4ba3a8489b5434d6d43ccf650d156833c9","observation_id":"bde178c1-2277-400f-83e6-6ffbd2e8fcd8","resolution":{"observed_at":"2026-08-02T22:49:53.097623Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:53.034735Z","title":"Then for anym×dmatrixVindependent ofE, ∥EV∥ 2→∞ ≤2 p 2ρnv(ν, d, n)∥V∥+4 3 ∥V∥ 2→∞v(ν, d, n) 39 with probability at least1−n −(ν−1) wherev(ν, d, n) = log(nν5d)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:53.034735Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:50005faddd9f94ccadbb9529a333fe881bc4cb4f9057bfd77c52b61175e57dca","observation_id":"b8b31639-d1f6-45db-aa2a-f868bafc06f4","resolution":{"observed_at":"2026-08-02T22:49:53.034735Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:52.970409Z","title":"ProofWe follow the proof ideas in Bhattacharjee et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:52.970409Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:478d8bb68e8fd67f512a2948df5ac86269a78cb442c252aaf2c8f624156e8fea","observation_id":"85ccebaf-3dd9-4730-9c5a-f9247642ba83","resolution":{"observed_at":"2026-08-02T22:49:52.970409Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:53.188380Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:53.188380Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:7642556d643e15d95d4783ca7a82718a25e2e49a961b4e6a00637e23f0578ab1","observation_id":"b9a3fb69-a481-4c70-8689-1a267d0e4b12","resolution":{"observed_at":"2026-08-02T22:49:53.188380Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:53.300738Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:53.300738Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:da41307202545db983e53d3169187359b38904a54c7e51762cece71cc2736e9b","observation_id":"3890e372-1c13-479e-8a44-8a8a8f406a1f","resolution":{"observed_at":"2026-08-02T22:49:53.300738Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:52.496675Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:52.496675Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:63c2be3f64619aeb9eaa4e20da92e7b1f139ff71988900e070fde96f955a1a4f","observation_id":"e34d37ff-9240-4a9b-bb49-16d0a1c64fe7","resolution":{"observed_at":"2026-08-02T22:49:52.496675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15725","last_updated":"2025-01-27T01:40:03Z","snapshot_observed_at":"2026-08-10T13:58:10.738840Z","submitted_at":"2025-01-27T01:40:03Z","title":"Eigenvector fluctuations and limit results for random graphs with infinite rank kernels","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15725","snapshot_observed_at":"2026-08-02T22:49:52.810919Z","title":"Tang and J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:52.810919Z"},"links":{"cited_paper":"/paper/2501.15725","citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:8de3fec71c13d285a1f88375010fe96b3608923dc10c9e9d68e474f38de76e5c","observation_id":"f654c088-8782-433f-9c27-9a309ad706f2","resolution":{"observed_at":"2026-08-02T22:49:52.810919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.15633","last_updated":"2021-11-28T04:34:48Z","snapshot_observed_at":"2026-07-06T12:13:49.830016Z","submitted_at":"2021-11-28T04:34:48Z","title":"Scalable Community Extraction of Text Networks for Automated Grouping in Medical Databases","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.15633","snapshot_observed_at":"2026-08-02T22:49:52.709459Z","title":"Komolafe, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:52.709459Z"},"links":{"cited_paper":"/paper/2111.15633","citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:3d0b1bc4cfffe4e0ff08e30a1d6de4954f3534b3f5bf56da58d760e1a4fc9c99","observation_id":"112fb195-b806-4518-86cd-22600fa42623","resolution":{"observed_at":"2026-08-02T22:49:52.709459Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:53.395882Z","title":"(2019) we have ∥R2±∥ ≤ ∥PSc,S∥ × ∥UAS ± −U PS ±W ∗ ±∥=O p(√nρn)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:53.395882Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:35cf151d2083c2778c571efec0f29e09b003f87a3c8f891336d375908fedd3aa","observation_id":"d940e445-e80e-43bc-9e61-75047371ec58","resolution":{"observed_at":"2026-08-02T22:49:53.395882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16730","last_updated":"2025-03-20T22:14:06Z","snapshot_observed_at":"2026-08-10T03:07:54.567271Z","submitted_at":"2025-03-20T22:14:06Z","title":"Scalable community detection in massive networks via predictive assignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16730","snapshot_observed_at":"2026-08-02T22:49:52.592761Z","title":"doi: 10.1073/pnas.1800683115","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:52.592761Z"},"links":{"cited_paper":"/paper/2503.16730","citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:7347fdb3654967aed0b932384cf87ae78d5b04b013a93a9cd001ff8c7d2350d5","observation_id":"44d0813e-17da-4190-93c0-21b35b57c335","resolution":{"observed_at":"2026-08-02T22:49:52.592761Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T22:49:52.910045Z","title":"Proof of Stated Results We begin by stating a collection of lemmas and known results, along with proofs as appro- priate, that will be used throughout the subsequent analysis","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T22:49:52.910045Z"},"links":{"citing_paper":"/paper/2602.16041"},"observation_digest":"sha256:6724f28e9227e4dfccf756fd797e9b57a4e84508ab0ce33580cbb5c85ca94e17","observation_id":"b367e67b-7450-45f0-b99c-618fdc3c7c35","resolution":{"observed_at":"2026-08-02T22:49:52.910045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.16041","last_updated":"2026-07-27T15:32:20Z","latest_version":2,"primary_category":"stat.ME","snapshot_observed_at":"2026-08-11T02:34:19.194482Z","submitted_at":"2026-02-17T21:48:57Z","title":"Predictive Subsampling for Scalable Inference in Networks"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":12},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2602.16041."}