{"as_of":"2026-08-13T05:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f09e27f59c99cd8741a9479ca0717a982c38d492e88e8d404d600cef43009108","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:38:41.809426Z","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-09T15:38:41.906720Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.09124","last_updated":"2024-02-14T12:22:50Z","snapshot_observed_at":"2026-08-13T04:19:09.951311Z","submitted_at":"2024-02-14T12:22:50Z","title":"Finding Densest Subgraphs with Edge-Color Constraints","version":1},"cited_work":{"arxiv_id":"2402.09124","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.09124","snapshot_observed_at":"2026-08-09T15:38:41.906720Z","title":"Finding Densest Subgraphs with Edge-Color Constraints","venue":"cs.SI","work_id":"dbdc8c0b-1c1d-4161-a563-74717d52fa10","year":2024},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.809426Z"},"links":{"cited_paper":"/paper/2402.09124","citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:71a9b1295cced26f9a8911399295eb5d4aa474544f035ad31f2845c13445de4c","observation_id":"02be1a1d-533a-4e6d-9587-7b1199ada240","resolution":{"observed_at":"2026-08-09T15:38:41.982638Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.09124/citation-record","integrity":"/paper/2402.09124/integrity","json":"/paper/2402.09124/citation-record.json","paper":"/paper/2402.09124"},"outbound":[],"paper":{"arxiv_id":"2402.09124","last_updated":"2024-02-14T12:22:50Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-13T04:19:09.951311Z","submitted_at":"2024-02-14T12:22:50Z","title":"Finding Densest Subgraphs with Edge-Color Constraints"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2402.09124."}