{"as_of":"2026-08-16T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c578837eee20e3148f1699f0a52bdc359a9d274f6edafcf3cbccf09b37ebd1ff","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-15T06:32:42.880941+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-15T23:08:35.103103Z","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-07T10:50:55.151885Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.02624","last_updated":"2025-07-10T23:43:29Z","snapshot_observed_at":"2026-08-12T23:30:06.947269Z","submitted_at":"2024-07-02T19:28:31Z","title":"Optimizing Probabilistic Propagation in Graphs by Adding Edges","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.02624","snapshot_observed_at":"2026-08-15T23:08:35.103103Z","title":"Bhaskara, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.06222","last_updated":"2025-05-09T17:57:04Z","snapshot_observed_at":"2026-08-15T22:43:29.143858Z","submitted_at":"2025-05-09T17:57:04Z","title":"Equalizing Closeness Centralities via Edge Additions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:08:35.103103Z"},"links":{"cited_paper":"/paper/2407.02624","citing_paper":"/paper/2505.06222"},"observation_digest":"sha256:ead2677c2061c962f31054cb2a3f8ad39b066b4d74f15d7706656fd3e81fdbbb","observation_id":"a18ef5a4-a681-4bd3-a65e-b1426d301cff","resolution":{"observed_at":"2026-08-15T23:08:35.103103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02624","last_updated":"2025-07-10T23:43:29Z","snapshot_observed_at":"2026-08-12T23:30:06.947269Z","submitted_at":"2024-07-02T19:28:31Z","title":"Optimizing Probabilistic Propagation in Graphs by Adding Edges","version":3},"cited_work":{"arxiv_id":"2407.02624","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.02624","snapshot_observed_at":"2026-08-07T10:50:55.151885Z","title":"Optimizing Probabilistic Propagation in Graphs by Adding Edges","venue":"cs.DS","work_id":"0174aa13-a673-4795-a6b3-a8c6ac61aaaf","year":2024},"citing_paper":{"arxiv_id":"2506.04435","last_updated":"2026-06-23T21:08:11Z","snapshot_observed_at":"2026-08-13T06:08:27.765970Z","submitted_at":"2025-06-04T20:36:24Z","title":"Edge interventions can mitigate demographic and prestige disparities in the Computer Science coauthorship network","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:54.740941Z"},"links":{"cited_paper":"/paper/2407.02624","citing_paper":"/paper/2506.04435"},"observation_digest":"sha256:6aea3486fd252fb76ace9dbee20de01f2b9d7370e1bd13ff912e45a030e4b54e","observation_id":"c35c6fff-8aa2-4ab9-975f-c7bfa574ef9a","resolution":{"observed_at":"2026-08-07T10:50:55.158559Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.02624/citation-record","integrity":"/paper/2407.02624/integrity","json":"/paper/2407.02624/citation-record.json","paper":"/paper/2407.02624"},"outbound":[],"paper":{"arxiv_id":"2407.02624","last_updated":"2025-07-10T23:43:29Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T23:30:06.947269Z","submitted_at":"2024-07-02T19:28:31Z","title":"Optimizing Probabilistic Propagation in Graphs by Adding Edges"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.02624."}