{"as_of":"2026-08-21T15:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7c377c97e42a216bdaf5faae4da62b2e30838654960df08ea09b81bda615527","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:42:31.352343Z","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-24T03:48:53.115328Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","snapshot_observed_at":"2026-08-20T18:44:31.303074Z","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","version":2},"cited_work":{"arxiv_id":"2306.00266","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.00266","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ding and Z","venue":null,"work_id":"be4ca40a-3c9b-43b3-b7d9-59a81b63a904","year":null},"citing_paper":{"arxiv_id":"2402.15095","last_updated":"2026-04-07T01:31:00Z","snapshot_observed_at":"2026-08-14T02:31:19.663868Z","submitted_at":"2024-02-23T04:58:54Z","title":"The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T03:46:11.205970Z"},"links":{"cited_paper":"/paper/2306.00266","citing_paper":"/paper/2402.15095"},"observation_digest":"sha256:8b177c10c000c246f744b0a6f2a4fb017b9d2d649c3a1a1bec55f6ed408444ec","observation_id":"e2188e29-b7dd-4afd-a27c-316dc27ff8ae","resolution":{"observed_at":"2026-05-24T03:48:53.118649Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","snapshot_observed_at":"2026-08-20T18:44:31.303074Z","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00266","snapshot_observed_at":"2026-08-11T10:42:31.352343Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","venue":null,"work_id":null,"year":2023},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.352343Z"},"links":{"cited_paper":"/paper/2306.00266","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:6586cfeff5d2cdf599eae858dfff9bacd943fcb5d593b6848277f1552ec25448","observation_id":"bd63f753-2941-4e1a-9ecf-07051004b23e","resolution":{"observed_at":"2026-08-11T10:42:31.352343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","snapshot_observed_at":"2026-08-20T18:44:31.303074Z","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00266","snapshot_observed_at":"2026-08-07T15:45:24.722553Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation.arXiv preprint arXiv:2306.00266,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14138","last_updated":"2025-05-20T09:41:12Z","snapshot_observed_at":"2026-08-18T02:17:14.266951Z","submitted_at":"2025-05-20T09:41:12Z","title":"Sample Complexity of Correlation Detection in the Gaussian Wigner Model","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:24.722553Z"},"links":{"cited_paper":"/paper/2306.00266","citing_paper":"/paper/2505.14138"},"observation_digest":"sha256:bd2bbcfcc8b095906f8e41101883fdccdd578743f5eec210da66f8c877e58466","observation_id":"b1a971f1-dba6-49be-b07a-a32219d2bfd7","resolution":{"observed_at":"2026-08-07T15:45:24.722553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","snapshot_observed_at":"2026-08-20T18:44:31.303074Z","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00266","snapshot_observed_at":"2026-08-07T00:59:21.329550Z","title":"Ding and Z","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":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:59:21.329550Z"},"links":{"cited_paper":"/paper/2306.00266","citing_paper":"/paper/2506.12752"},"observation_digest":"sha256:46dbf6b17c44133428b9c62eb2e4630664b1130777f02bfd80f1c1a7fe70b405","observation_id":"5cfa173f-d1df-4bec-8eca-f32fcdbcadc6","resolution":{"observed_at":"2026-08-07T00:59:21.329550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","snapshot_observed_at":"2026-08-20T18:44:31.303074Z","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00266","snapshot_observed_at":"2026-08-04T12:38:58.891476Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation.arXiv preprint arXiv:2306.00266,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.03086","last_updated":"2026-06-01T14:50:49Z","snapshot_observed_at":"2026-08-18T02:18:43.659922Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:58.891476Z"},"links":{"cited_paper":"/paper/2306.00266","citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:76d94d19fa726b06064ca4fc07b54b9c6563a02a2b622c78c77e51641b1fe014","observation_id":"769b6a9d-3f63-415a-805a-8466c4ee97a6","resolution":{"observed_at":"2026-08-04T12:38:58.891476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","snapshot_observed_at":"2026-08-20T18:44:31.303074Z","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","version":2},"cited_work":{"arxiv_id":"2306.00266","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.00266","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ding and Z","venue":null,"work_id":"be4ca40a-3c9b-43b3-b7d9-59a81b63a904","year":null},"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":5,"source":"pdf_text","source_observed_at":"2026-05-10T20:16:27.446354Z"},"links":{"cited_paper":"/paper/2306.00266","citing_paper":"/paper/2604.04365"},"observation_digest":"sha256:e734643681cb5a426a3ee8600c3d3077ca3e47563f0edb078e71d544a69c057c","observation_id":"83ca232b-0700-46fa-9971-b037d68489fd","resolution":{"observed_at":"2026-05-10T22:05:48.261038Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2306.00266/citation-record","integrity":"/paper/2306.00266/integrity","json":"/paper/2306.00266/citation-record.json","paper":"/paper/2306.00266"},"outbound":[],"paper":{"arxiv_id":"2306.00266","last_updated":"2024-03-06T03:30:41Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T18:44:31.303074Z","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation"},"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 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2306.00266."}