{"as_of":"2026-08-08T15:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ab8279dc94b1c2d98203803d5dd8056ff814e3f3d2af28fa4d19f7c8a06f95e","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-08T06:32:00.761636+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-06T21:34:42.752161Z","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-06T21:34:46.480797Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.09701","last_updated":"2023-04-19T14:45:36Z","snapshot_observed_at":"2026-07-06T15:17:29.215781Z","submitted_at":"2023-04-19T14:45:36Z","title":"On the complexity of Dominating Set for graphs with fixed diameter","version":1},"cited_work":{"arxiv_id":"2304.09701","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.09701","snapshot_observed_at":"2026-08-06T21:34:46.480797Z","title":"On the complexity of Dominating Set for graphs with fixed diameter","venue":"math.CO","work_id":"11c44239-d489-4b97-ab21-8dc871919bc9","year":2023},"citing_paper":{"arxiv_id":"2506.23844","last_updated":"2025-06-30T13:34:34Z","snapshot_observed_at":"2026-08-07T18:36:52.892587Z","submitted_at":"2025-06-30T13:34:34Z","title":"A Survey on Autonomy-Induced Security Risks in Large Model-Based Agents","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T21:34:42.752161Z"},"links":{"cited_paper":"/paper/2304.09701","citing_paper":"/paper/2506.23844"},"observation_digest":"sha256:b8c74d056971c9a916262886c492c212690f9af4d219d84d994b06f174fd69d0","observation_id":"6df1a124-9a9b-42dc-b862-40087227c7d5","resolution":{"observed_at":"2026-08-06T21:34:46.484622Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2304.09701/citation-record","integrity":"/paper/2304.09701/integrity","json":"/paper/2304.09701/citation-record.json","paper":"/paper/2304.09701"},"outbound":[],"paper":{"arxiv_id":"2304.09701","last_updated":"2023-04-19T14:45:36Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T15:17:29.215781Z","submitted_at":"2023-04-19T14:45:36Z","title":"On the complexity of Dominating Set for graphs with fixed diameter"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2304.09701."}