{"as_of":"2026-08-17T13:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:287f13f49cc454feadf5192ccbbec84bc3c5a29c6f08d4afee963dd07cdd8a7e","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-17T06:30:58.91139+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-14T15:01:13.639522Z","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-14T15:01:13.676630Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.10764","last_updated":"2019-03-13T23:21:17Z","snapshot_observed_at":"2026-08-14T17:52:56.399630Z","submitted_at":"2018-11-27T01:16:13Z","title":"On Bollob\\'as-Riordan random pairing model of preferential attachment graph","version":3},"cited_work":{"arxiv_id":"1811.10764","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.10764","snapshot_observed_at":"2026-08-14T15:01:13.676630Z","title":"On Bollob\\'as-Riordan random pairing model of preferential attachment graph","venue":"math.CO","work_id":"c53a40c5-a5db-40aa-b08e-80484ee275da","year":2018},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.639522Z"},"links":{"cited_paper":"/paper/1811.10764","citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:454e6471b7bb93431852de68995bcc2dc0a75c4b58a4a6af2f473c358225aec1","observation_id":"93d42973-adf8-492c-a28f-b0caa6d397b6","resolution":{"observed_at":"2026-08-14T15:01:13.683379Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1811.10764/citation-record","integrity":"/paper/1811.10764/integrity","json":"/paper/1811.10764/citation-record.json","paper":"/paper/1811.10764"},"outbound":[],"paper":{"arxiv_id":"1811.10764","last_updated":"2019-03-13T23:21:17Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T17:52:56.399630Z","submitted_at":"2018-11-27T01:16:13Z","title":"On Bollob\\'as-Riordan random pairing model of preferential attachment graph"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1811.10764."}