{"as_of":"2026-08-20T21:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c2508cb47c924bcf74d52c4c47677ff58c4e091830eeb28dfa6fb0d8985b7997","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:17:19.641224Z","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-08-11T23:13:29.813605Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.18543","last_updated":"2023-11-01T00:09:47Z","snapshot_observed_at":"2026-08-17T13:15:43.009125Z","submitted_at":"2023-10-28T00:16:04Z","title":"Robust Graph Matching when Nodes are Corrupt","version":2},"cited_work":{"arxiv_id":"2310.18543","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.18543","snapshot_observed_at":"2026-08-11T23:13:29.813605Z","title":"Robust Graph Matching when Nodes are Corrupt","venue":"math.ST","work_id":"7fd0094a-6ee4-4474-8d90-76389812e8aa","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":4,"source":"pdf_text","source_observed_at":"2026-08-11T23:13:28.315658Z"},"links":{"cited_paper":"/paper/2310.18543","citing_paper":"/paper/2412.02796"},"observation_digest":"sha256:85033c3480216f68be79b2ae9791ed9b171360db5f9c3f531460b7e520c48d0b","observation_id":"0d37c3e7-17af-4c7c-bea0-48f8b61ea23e","resolution":{"observed_at":"2026-08-11T23:13:29.894651Z","resolver_source":"local_arxiv","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":"2310.18543","last_updated":"2023-11-01T00:09:47Z","snapshot_observed_at":"2026-08-17T13:15:43.009125Z","submitted_at":"2023-10-28T00:16:04Z","title":"Robust Graph Matching when Nodes are Corrupt","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18543","snapshot_observed_at":"2026-08-16T11:17:19.641224Z","title":"Robust graph matching when nodes are corrupt,","venue":null,"work_id":null,"year":2023},"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":27,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:19.641224Z"},"links":{"cited_paper":"/paper/2310.18543","citing_paper":"/paper/2504.16279"},"observation_digest":"sha256:491572065a65b5a220552eaa2db92c042a03c3709a5ab9f3f3568045be3de696","observation_id":"a4b25b87-0c83-4efa-8962-faa81e4bfa1b","resolution":{"observed_at":"2026-08-16T11:17:19.641224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.18543/citation-record","integrity":"/paper/2310.18543/integrity","json":"/paper/2310.18543/citation-record.json","paper":"/paper/2310.18543"},"outbound":[],"paper":{"arxiv_id":"2310.18543","last_updated":"2023-11-01T00:09:47Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-17T13:15:43.009125Z","submitted_at":"2023-10-28T00:16:04Z","title":"Robust Graph Matching when Nodes are Corrupt"},"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 2 inbound Pith citation observations for arXiv:2310.18543."}