{"as_of":"2026-08-11T17:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96804dfdf279f47c4f0d032c5c547a0573194c81b9f1aa90af5b6040fd819b49","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-11T06:34:44.6726+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-01T13:00:56.770832Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1505.04969","last_updated":"2015-05-19T12:40:31Z","snapshot_observed_at":"2026-08-04T16:58:49.757501Z","submitted_at":"2015-05-19T12:40:31Z","title":"Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\\mathcal{G}(n,p)$ random model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.04969","snapshot_observed_at":"2026-08-01T13:00:56.770832Z","title":"Catellier and Tom Denat and Vangelis Th","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.770832Z"},"links":{"cited_paper":"/paper/1505.04969","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:902bb80d14caebe0b93c654e8218922ac6bda9dd28b073eb18a114c767f3cefb","observation_id":"f03b6adb-75ef-4d3c-af33-aae2de5fb4e3","resolution":{"observed_at":"2026-08-01T13:00:56.770832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1505.04969/citation-record","integrity":"/paper/1505.04969/integrity","json":"/paper/1505.04969/citation-record.json","paper":"/paper/1505.04969"},"outbound":[],"paper":{"arxiv_id":"1505.04969","last_updated":"2015-05-19T12:40:31Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-04T16:58:49.757501Z","submitted_at":"2015-05-19T12:40:31Z","title":"Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\\mathcal{G}(n,p)$ random model"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1505.04969."}