{"as_of":"2026-08-16T20:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:50c8532ac322e4e637625113bf97bf9d117add9f042046a8c7dbbbef775f0322","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-16T06:30:59.297886+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-14T12:47:04.345319Z","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-14T04:56:05.425126Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.11412","last_updated":"2017-12-02T14:47:19Z","snapshot_observed_at":"2026-08-14T20:08:25.005070Z","submitted_at":"2017-11-30T14:18:55Z","title":"Approximating Connected Safe Sets in Weighted Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.11412","snapshot_observed_at":"2026-08-14T12:47:04.345319Z","title":"Ehard and D","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06664","last_updated":"2019-08-19T09:33:26Z","snapshot_observed_at":"2026-08-14T12:35:26.377685Z","submitted_at":"2019-08-19T09:33:26Z","title":"Safe sets in digraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:47:04.345319Z"},"links":{"cited_paper":"/paper/1711.11412","citing_paper":"/paper/1908.06664"},"observation_digest":"sha256:a36a58133a42b530310207e9a7c1c1dd30e7a831674575691c86bf78a04a6fec","observation_id":"842b7674-8181-439c-9aa0-31a02d894e29","resolution":{"observed_at":"2026-08-14T12:47:04.345319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.11412","last_updated":"2017-12-02T14:47:19Z","snapshot_observed_at":"2026-08-14T20:08:25.005070Z","submitted_at":"2017-11-30T14:18:55Z","title":"Approximating Connected Safe Sets in Weighted Trees","version":2},"cited_work":{"arxiv_id":"1711.11412","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.11412","snapshot_observed_at":"2026-08-14T04:56:05.425126Z","title":"Approximating Connected Safe Sets in Weighted Trees","venue":"math.CO","work_id":"ae6e5cb5-bc54-4c51-bd31-fb97a0f57606","year":2017},"citing_paper":{"arxiv_id":"1909.02718","last_updated":"2020-02-24T12:56:36Z","snapshot_observed_at":"2026-08-16T09:42:49.517473Z","submitted_at":"2019-09-06T05:29:36Z","title":"Stable structure on safe set problems in vertex-weighted graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T04:56:05.357990Z"},"links":{"cited_paper":"/paper/1711.11412","citing_paper":"/paper/1909.02718"},"observation_digest":"sha256:171a704bde3b693f72de10d2c02e4425131ac4e339af13feee94ab5f2f1a20c6","observation_id":"4fc3a2fa-a4bd-48f9-9445-e0fc6cc8f9d6","resolution":{"observed_at":"2026-08-14T04:56:05.431524Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1711.11412/citation-record","integrity":"/paper/1711.11412/integrity","json":"/paper/1711.11412/citation-record.json","paper":"/paper/1711.11412"},"outbound":[],"paper":{"arxiv_id":"1711.11412","last_updated":"2017-12-02T14:47:19Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T20:08:25.005070Z","submitted_at":"2017-11-30T14:18:55Z","title":"Approximating Connected Safe Sets in Weighted Trees"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:1711.11412."}