{"as_of":"2026-08-21T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a58390e9a77f44ecdd23a4868b36f51fadd6181274c14252ec6a734ca7d40c1c","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-21T06:32:19.484+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-15T20:12:17.982441Z","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-15T20:12:18.647305Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1103.4870","last_updated":"2011-03-24T20:19:43Z","snapshot_observed_at":"2026-08-21T14:50:06.889995Z","submitted_at":"2011-03-24T20:19:43Z","title":"Covering the edges of a random graph by cliques","version":1},"cited_work":{"arxiv_id":"1103.4870","doi":null,"metadata_source":"pith","pith_arxiv_id":"1103.4870","snapshot_observed_at":"2026-08-15T20:12:18.647305Z","title":"Covering the edges of a random graph by cliques","venue":"math.CO","work_id":"c0f40115-37d9-45c5-9479-2b92d8879cd4","year":2011},"citing_paper":{"arxiv_id":"2506.14042","last_updated":"2025-06-16T22:31:41Z","snapshot_observed_at":"2026-08-19T01:44:44.849951Z","submitted_at":"2025-06-16T22:31:41Z","title":"Asymptotically Smaller Encodings for Graph Problems and Scheduling","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:17.982441Z"},"links":{"cited_paper":"/paper/1103.4870","citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:0536db84b10b7e4664b3cb24f13691f2c881fcb9a3045ce457ed103879d3cc7c","observation_id":"ac1b2175-fbe8-431a-b104-ebe213b0edcc","resolution":{"observed_at":"2026-08-15T20:12:18.656735Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1103.4870/citation-record","integrity":"/paper/1103.4870/integrity","json":"/paper/1103.4870/citation-record.json","paper":"/paper/1103.4870"},"outbound":[],"paper":{"arxiv_id":"1103.4870","last_updated":"2011-03-24T20:19:43Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-21T14:50:06.889995Z","submitted_at":"2011-03-24T20:19:43Z","title":"Covering the edges of a random graph by cliques"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1103.4870."}