{"as_of":"2026-08-21T13:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59e78a2f4c4aa1c8d05fef2315247b3bea1146e79c5afd996818a68e9259af2f","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:20:10.723544Z","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.080557Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.10441","last_updated":"2025-08-17T01:52:59Z","snapshot_observed_at":"2026-08-19T17:49:05.063554Z","submitted_at":"2023-10-16T14:25:43Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","version":2},"cited_work":{"arxiv_id":"2310.10441","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.10441","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"db8207bd-d71d-4b77-8035-dac5ae66a750","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":18,"source":"pdf_text","source_observed_at":"2026-05-24T03:46:11.205970Z"},"links":{"cited_paper":"/paper/2310.10441","citing_paper":"/paper/2402.15095"},"observation_digest":"sha256:88dbc2358ea605d6b2a7dce0f8da3b62512318ec4124677ae765e870ad51811f","observation_id":"649f3529-7da4-472a-8bd6-317812b0cbcc","resolution":{"observed_at":"2026-05-24T03:48:53.083627Z","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":"2310.10441","last_updated":"2025-08-17T01:52:59Z","snapshot_observed_at":"2026-08-19T17:49:05.063554Z","submitted_at":"2023-10-16T14:25:43Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10441","snapshot_observed_at":"2026-08-11T23:20:10.723544Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02661","last_updated":"2024-12-03T18:36:45Z","snapshot_observed_at":"2026-08-18T00:06:28.089992Z","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:20:10.723544Z"},"links":{"cited_paper":"/paper/2310.10441","citing_paper":"/paper/2412.02661"},"observation_digest":"sha256:eede874284767b4d3bd132846c423506db9a029f0532b8da409eac0d8e89fef8","observation_id":"440cb041-a9c9-421c-9adc-4221191960f6","resolution":{"observed_at":"2026-08-11T23:20:10.723544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10441","last_updated":"2025-08-17T01:52:59Z","snapshot_observed_at":"2026-08-19T17:49:05.063554Z","submitted_at":"2023-10-16T14:25:43Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10441","snapshot_observed_at":"2026-08-11T23:13:28.919711Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02796","last_updated":"2024-12-03T19:56:52Z","snapshot_observed_at":"2026-08-16T07:39:18.749557Z","submitted_at":"2024-12-03T19:56:52Z","title":"Harnessing Multiple Correlated Networks for Exact Community Recovery","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:13:28.919711Z"},"links":{"cited_paper":"/paper/2310.10441","citing_paper":"/paper/2412.02796"},"observation_digest":"sha256:0c85abd27fb011aa7bd9bffbe5b1c3d40a3aa2e71c9506a79df6fd79dcabaf43","observation_id":"cee3cf71-a301-404b-aa2a-bda8bb499581","resolution":{"observed_at":"2026-08-11T23:13:28.919711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10441","last_updated":"2025-08-17T01:52:59Z","snapshot_observed_at":"2026-08-19T17:49:05.063554Z","submitted_at":"2023-10-16T14:25:43Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10441","snapshot_observed_at":"2026-08-11T10:42:31.367073Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","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":24,"source":"arxiv_source","source_observed_at":"2026-08-11T10:42:31.367073Z"},"links":{"cited_paper":"/paper/2310.10441","citing_paper":"/paper/2412.16457"},"observation_digest":"sha256:40499f9f8b9aa65e98c3a3ebdff86a96f70d509afd72c7744ab316bb438ff348","observation_id":"23c16cd2-c490-4c63-9bd3-d8433cbd5b2e","resolution":{"observed_at":"2026-08-11T10:42:31.367073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10441","last_updated":"2025-08-17T01:52:59Z","snapshot_observed_at":"2026-08-19T17:49:05.063554Z","submitted_at":"2023-10-16T14:25:43Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10441","snapshot_observed_at":"2026-08-07T15:45:24.547987Z","title":"Efficiently matching random inhomo- geneous graphs via degree profiles.arXiv preprint arXiv:2310.10441,","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":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:24.547987Z"},"links":{"cited_paper":"/paper/2310.10441","citing_paper":"/paper/2505.14138"},"observation_digest":"sha256:c4d252e24bf38eadf80a47eb70d88167eec453c53cf5573df673d70000d59a98","observation_id":"cdfd6023-effa-4922-a545-c812a04e3b91","resolution":{"observed_at":"2026-08-07T15:45:24.547987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.10441/citation-record","integrity":"/paper/2310.10441/integrity","json":"/paper/2310.10441/citation-record.json","paper":"/paper/2310.10441"},"outbound":[],"paper":{"arxiv_id":"2310.10441","last_updated":"2025-08-17T01:52:59Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T17:49:05.063554Z","submitted_at":"2023-10-16T14:25:43Z","title":"Efficiently matching random inhomogeneous graphs via degree profiles"},"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 5 inbound Pith citation observations for arXiv:2310.10441."}