{"as_of":"2026-08-22T11:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f93f89859c187adff1372bb00b3326d28527ad420f590a841d6ecb6132729c82","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:58:59.116665Z","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-07-04T06:09:37.720739Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1710.00862","last_updated":"2017-10-16T04:57:52Z","snapshot_observed_at":"2026-08-18T16:10:06.638649Z","submitted_at":"2017-10-02T18:39:20Z","title":"Testing for Global Network Structure Using Small Subgraph Statistics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.00862","snapshot_observed_at":"2026-08-14T15:58:59.116665Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.00523","last_updated":"2019-08-01T17:28:54Z","snapshot_observed_at":"2026-08-18T16:10:36.080276Z","submitted_at":"2019-08-01T17:28:54Z","title":"Measuring the Clustering Strength of a Network via the Normalized Clustering Coefficient","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T15:58:59.116665Z"},"links":{"cited_paper":"/paper/1710.00862","citing_paper":"/paper/1908.00523"},"observation_digest":"sha256:159f4201d9aa74148484dcf6bf812d9086233011a9a415b7757cf2a185b708b9","observation_id":"0d921e10-2e15-463c-a48c-acd765480426","resolution":{"observed_at":"2026-08-14T15:58:59.116665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.00862","last_updated":"2017-10-16T04:57:52Z","snapshot_observed_at":"2026-08-18T16:10:06.638649Z","submitted_at":"2017-10-02T18:39:20Z","title":"Testing for Global Network Structure Using Small Subgraph Statistics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.00862","snapshot_observed_at":"2026-08-07T14:45:03.759449Z","title":"Testing for global network structure using small subgraph statistics.arXiv preprint arXiv:1710.00862, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.759449Z"},"links":{"cited_paper":"/paper/1710.00862","citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:86a8362f75d0737d4d451278101fc68c7e2a5a84f47cad73c0b7335c051f27a6","observation_id":"56d129ae-a7db-4c7b-8453-5b371e3004b7","resolution":{"observed_at":"2026-08-07T14:45:03.759449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.00862","last_updated":"2017-10-16T04:57:52Z","snapshot_observed_at":"2026-08-18T16:10:06.638649Z","submitted_at":"2017-10-02T18:39:20Z","title":"Testing for Global Network Structure Using Small Subgraph Statistics","version":2},"cited_work":{"arxiv_id":"1710.00862","doi":null,"metadata_source":"pith","pith_arxiv_id":"1710.00862","snapshot_observed_at":"2026-07-04T06:09:37.720739Z","title":"Testing for Global Network Structure Using Small Subgraph Statistics","venue":"stat.ME","work_id":"6141bd32-5665-43e2-a050-f7f9b287b1e6","year":2017},"citing_paper":{"arxiv_id":"2606.26136","last_updated":"2026-06-18T19:11:43Z","snapshot_observed_at":"2026-08-15T11:19:27.016959Z","submitted_at":"2026-06-18T19:11:43Z","title":"Bayesian Predictive Synthesis for Dynamic Networks: Forecasting and Identifying Structural Mechanisms","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-26T14:46:03.636911Z"},"links":{"cited_paper":"/paper/1710.00862","citing_paper":"/paper/2606.26136"},"observation_digest":"sha256:a4b8f3a4d66348916de6ce15d85a05119eb53da2c3a02416ff5e65818c7422f5","observation_id":"6f1e5d34-8089-4c80-8102-7e1615103b78","resolution":{"observed_at":"2026-07-04T06:09:37.722380Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.00862","last_updated":"2017-10-16T04:57:52Z","snapshot_observed_at":"2026-08-18T16:10:06.638649Z","submitted_at":"2017-10-02T18:39:20Z","title":"Testing for Global Network Structure Using Small Subgraph Statistics","version":2},"cited_work":{"arxiv_id":"1710.00862","doi":null,"metadata_source":"pith","pith_arxiv_id":"1710.00862","snapshot_observed_at":"2026-07-04T06:09:37.720739Z","title":"Testing for Global Network Structure Using Small Subgraph Statistics","venue":"stat.ME","work_id":"6141bd32-5665-43e2-a050-f7f9b287b1e6","year":2017},"citing_paper":{"arxiv_id":"2607.02013","last_updated":"2026-07-02T10:45:46Z","snapshot_observed_at":"2026-08-17T18:08:52.657296Z","submitted_at":"2026-07-02T10:45:46Z","title":"Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-03T06:56:31.693595Z"},"links":{"cited_paper":"/paper/1710.00862","citing_paper":"/paper/2607.02013"},"observation_digest":"sha256:6789402fa7edb4543fd05be2b5811af569fc5a94f3c79bb523f944a5727ae097","observation_id":"ab86fa87-e313-4d1f-8321-8e3bbc6a59d4","resolution":{"observed_at":"2026-07-03T06:57:42.571362Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1710.00862/citation-record","integrity":"/paper/1710.00862/integrity","json":"/paper/1710.00862/citation-record.json","paper":"/paper/1710.00862"},"outbound":[],"paper":{"arxiv_id":"1710.00862","last_updated":"2017-10-16T04:57:52Z","latest_version":2,"primary_category":"stat.ME","snapshot_observed_at":"2026-08-18T16:10:06.638649Z","submitted_at":"2017-10-02T18:39:20Z","title":"Testing for Global Network Structure Using Small Subgraph Statistics"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1710.00862."}