{"as_of":"2026-08-22T06:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3ebe30ade7df3584174278f6f2d34cd13532fce7f130d34eb992b1a569eb06fa","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-22T06:32:14.747728+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:18.107887Z","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.410361Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.06274","last_updated":"2020-05-12T03:23:00Z","snapshot_observed_at":"2026-08-13T22:44:59.852691Z","submitted_at":"2020-05-12T03:23:00Z","title":"Yet Another Comparison of SAT Encodings for the At-Most-K Constraint","version":1},"cited_work":{"arxiv_id":"2005.06274","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.06274","snapshot_observed_at":"2026-08-15T20:12:18.410361Z","title":"Yet Another Comparison of SAT Encodings for the At-Most-K Constraint","venue":"cs.LO","work_id":"2ed96ce2-e044-490b-952e-3a88f4e9dbff","year":2020},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-15T20:12:18.107887Z"},"links":{"cited_paper":"/paper/2005.06274","citing_paper":"/paper/2506.14042"},"observation_digest":"sha256:303b4f071419a9378fe3ae2f2787dc00800d2fd6f603e517d166ddd26ab22202","observation_id":"fc38e807-dc48-43e0-9485-e9884bd14262","resolution":{"observed_at":"2026-08-15T20:12:18.419788Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2005.06274/citation-record","integrity":"/paper/2005.06274/integrity","json":"/paper/2005.06274/citation-record.json","paper":"/paper/2005.06274"},"outbound":[],"paper":{"arxiv_id":"2005.06274","last_updated":"2020-05-12T03:23:00Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-13T22:44:59.852691Z","submitted_at":"2020-05-12T03:23:00Z","title":"Yet Another Comparison of SAT Encodings for the At-Most-K Constraint"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2005.06274."}