{"as_of":"2026-08-13T06:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c83b78629985a98d02fd86cf99f2f6cb80451e4ec8b0290153bf6a1f709ece8","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-13T06:32:02.005865+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-07T15:45:25.132387Z","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-07T15:45:25.959032Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.08421","last_updated":"2024-09-17T17:20:05Z","snapshot_observed_at":"2026-08-13T00:08:11.908556Z","submitted_at":"2024-05-14T08:30:29Z","title":"Faster algorithms for the alignment of sparse correlated Erd\\\"os-R\\'enyi random graphs","version":2},"cited_work":{"arxiv_id":"2405.08421","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.08421","snapshot_observed_at":"2026-08-07T15:45:25.959032Z","title":"Faster algorithms for the alignment of sparse correlated Erd\\\"os-R\\'enyi random graphs","venue":"cond-mat.dis-nn","work_id":"a3d3bf27-da83-4526-9d9d-e6af241ff5a7","year":2024},"citing_paper":{"arxiv_id":"2505.14138","last_updated":"2025-05-20T09:41:12Z","snapshot_observed_at":"2026-08-10T05:34:00.368633Z","submitted_at":"2025-05-20T09:41:12Z","title":"Sample Complexity of Correlation Detection in the Gaussian Wigner Model","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:45:25.132387Z"},"links":{"cited_paper":"/paper/2405.08421","citing_paper":"/paper/2505.14138"},"observation_digest":"sha256:be399ce94f816909d177c62f61df3dcce9771d40c2e071234a888439814f931c","observation_id":"7041d175-8f59-4a2c-829a-63b8ac63e286","resolution":{"observed_at":"2026-08-07T15:45:26.109926Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08421","last_updated":"2024-09-17T17:20:05Z","snapshot_observed_at":"2026-08-13T00:08:11.908556Z","submitted_at":"2024-05-14T08:30:29Z","title":"Faster algorithms for the alignment of sparse correlated Erd\\\"os-R\\'enyi random graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08421","snapshot_observed_at":"2026-08-04T12:38:59.251637Z","title":"Faster algorithms for the alignment of sparse correlated erd\\” os-r\\’enyi random graphs.arXiv preprint arXiv:2405.08421,","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-10T19:58:39.274441Z","submitted_at":"2025-10-03T15:17:00Z","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-04T12:38:59.251637Z"},"links":{"cited_paper":"/paper/2405.08421","citing_paper":"/paper/2510.03086"},"observation_digest":"sha256:430c958efb0b3d9025bc9f303c9c3a15b118b2fa0769b8d072fe9f7a06fc5637","observation_id":"1632bd53-618e-42e0-9e83-1310a26574be","resolution":{"observed_at":"2026-08-04T12:38:59.251637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.08421/citation-record","integrity":"/paper/2405.08421/integrity","json":"/paper/2405.08421/citation-record.json","paper":"/paper/2405.08421"},"outbound":[],"paper":{"arxiv_id":"2405.08421","last_updated":"2024-09-17T17:20:05Z","latest_version":2,"primary_category":"cond-mat.dis-nn","snapshot_observed_at":"2026-08-13T00:08:11.908556Z","submitted_at":"2024-05-14T08:30:29Z","title":"Faster algorithms for the alignment of sparse correlated Erd\\\"os-R\\'enyi random 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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2405.08421."}