{"as_of":"2026-08-20T17:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c8745cb21362c0cb159db776950ab9550d3d26ae815214a7680b76e6dfe441dd","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:17:19.631111Z","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-07-03T16:28:38.795130Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-08-11T10:42:31.381606Z","title":"Optimal recovery of correlated graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2412.16457","last_updated":"2026-06-07T12:25:36Z","snapshot_observed_at":"2026-08-16T07:39:19.804994Z","submitted_at":"2024-12-21T03:15:38Z","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.381606Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:9d2c9f50970ab7cd61680f1de0d8bd68d688177f12eb9447f525c5fa7fffd25d","observation_id":"eee1b8ca-32c7-49fb-8982-3b9f9b91bd76","resolution":{"observed_at":"2026-08-11T10:42:31.381606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-08-16T11:17:19.631111Z","title":"Optimal recovery of correlated Erdos-Renyi gra phs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.16279","last_updated":"2026-06-11T17:22:37Z","snapshot_observed_at":"2026-08-17T13:16:53.723902Z","submitted_at":"2025-04-22T21:30:25Z","title":"Sharp Detection Threshold for Correlation among Multiple Unlabeled Gaussian Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:19.631111Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2504.16279"},"observation_digest":"sha256:68ac229e3dbfd876714ec530a3a115cb2b89eeda57ce9696238e135c35ae996d","observation_id":"ecb5ddb6-87b0-455b-a01d-2318c70c94d9","resolution":{"observed_at":"2026-08-16T11:17:19.631111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-08-07T00:59:21.722567Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12752","last_updated":"2025-06-15T07:19:33Z","snapshot_observed_at":"2026-08-20T01:17:41.162068Z","submitted_at":"2025-06-15T07:19:33Z","title":"Strong Detection Threshold for Correlated Erd\\H{o}s-R\\'enyi Graphs with Constant Average Degree","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:59:21.722567Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2506.12752"},"observation_digest":"sha256:eee74682a319bb34a0ef433af7d5e193ebd68f70cf4b59343a59b34ac6c22cfb","observation_id":"440461ef-8e8a-4eac-8ff0-c26411fcaf7a","resolution":{"observed_at":"2026-08-07T00:59:21.722567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":"2502.12077","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-07-03T16:28:38.795130Z","title":"Optimal recovery of correlated Erd˝ os-R´ enyi graphs.arXiv preprint arXiv:2502.12077","venue":null,"work_id":"ba1b87ec-00af-41b6-9d98-15e7be9e485f","year":2025},"citing_paper":{"arxiv_id":"2604.04365","last_updated":"2026-04-06T02:27:50Z","snapshot_observed_at":"2026-07-31T18:44:50.458178Z","submitted_at":"2026-04-06T02:27:50Z","title":"Attributed Network Alignment: Statistical Limits and Efficient Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T20:16:27.446354Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2604.04365"},"observation_digest":"sha256:9a09edf65c2f18efec81b55aa0fe986829cacb51528830881d2f74b43c469fa9","observation_id":"a8df0591-de15-4741-8783-9d3c0d32b84c","resolution":{"observed_at":"2026-05-10T22:05:48.284468Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":"2502.12077","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-07-03T16:28:38.795130Z","title":"Optimal recovery of correlated Erd˝ os-R´ enyi graphs.arXiv preprint arXiv:2502.12077","venue":null,"work_id":"ba1b87ec-00af-41b6-9d98-15e7be9e485f","year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:34c4b490c4b53b00e1bfdefa354d2d80979329c927ac0f948262a8e43eefac65","observation_id":"9be7fbd5-1b1c-474d-aae7-0285a5d7d31f","resolution":{"observed_at":"2026-07-03T16:28:38.796540Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-08-02T07:56:18.462670Z","title":"Optimal recovery of correlated Erd ˝os–R´enyi graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.462670Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:94c016585cb9ba4b28719def82df825879a633b5c2fc94584534b4a57941d7c4","observation_id":"84ce12f2-562d-45fd-a734-bfd3e599937e","resolution":{"observed_at":"2026-08-02T07:56:18.462670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-08-02T00:46:31.455693Z","title":"(2025).Optimal recovery of correlated Erd˝ os-R’enyi graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14948","last_updated":"2026-07-16T12:57:28Z","snapshot_observed_at":"2026-08-18T18:15:27.289429Z","submitted_at":"2026-07-16T12:57:28Z","title":"Graph alignment in sparse inhomogeneous models via self-overlap","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T00:46:31.455693Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2607.14948"},"observation_digest":"sha256:00037a3d54144f96ca59e42b45ea98940b84eabe8f90902d107050368a6e1fc1","observation_id":"1c002b15-579b-4e0f-b441-7203fbb315ab","resolution":{"observed_at":"2026-08-02T00:46:31.455693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.12077/citation-record","integrity":"/paper/2502.12077/integrity","json":"/paper/2502.12077/citation-record.json","paper":"/paper/2502.12077"},"outbound":[],"paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2502.12077."}