{"as_of":"2026-08-18T13:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d21d90397f285634efb1e8ce3f5ec496d0b7cb4d75068ef8c03937a0e32b8d2c","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-18T06:34:40.430872+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-11T11:25:46.058940Z","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-11T11:25:46.166806Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1511.07249","last_updated":"2015-11-23T14:52:10Z","snapshot_observed_at":"2026-08-14T22:21:44.262475Z","submitted_at":"2015-11-23T14:52:10Z","title":"On the total $(k,r)$-domination number of random graphs","version":1},"cited_work":{"arxiv_id":"1511.07249","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.07249","snapshot_observed_at":"2026-08-11T11:25:46.166806Z","title":"On the total $(k,r)$-domination number of random graphs","venue":"cs.DM","work_id":"7fa39fe8-c88a-49d9-8fef-6988e14fc444","year":2015},"citing_paper":{"arxiv_id":"2412.15671","last_updated":"2025-03-16T09:04:21Z","snapshot_observed_at":"2026-08-18T08:23:14.517243Z","submitted_at":"2024-12-20T08:37:32Z","title":"Parameterized Complexity of (d,r)-Domination via Modular Decomposition","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T11:25:46.058940Z"},"links":{"cited_paper":"/paper/1511.07249","citing_paper":"/paper/2412.15671"},"observation_digest":"sha256:534c0229818ceb274ffe90c85ab5ad49be97a32188df435fbbf0a2ef4ffbace8","observation_id":"5441fdc2-6b71-4ec8-b4e7-eb48232accbd","resolution":{"observed_at":"2026-08-11T11:25:46.172899Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1511.07249/citation-record","integrity":"/paper/1511.07249/integrity","json":"/paper/1511.07249/citation-record.json","paper":"/paper/1511.07249"},"outbound":[],"paper":{"arxiv_id":"1511.07249","last_updated":"2015-11-23T14:52:10Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-14T22:21:44.262475Z","submitted_at":"2015-11-23T14:52:10Z","title":"On the total $(k,r)$-domination number of 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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1511.07249."}