{"as_of":"2026-08-20T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fdaf4f058c17855ce52a651b6d1939c20f26300ea2afbf9331121ca643291025","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-19T06:32:44.657259+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-06-28T11:48:55.666803Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T01:36:25.232249Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.03959","last_updated":"2021-06-24T17:06:08Z","snapshot_observed_at":"2026-08-19T10:53:28.114498Z","submitted_at":"2021-03-05T22:27:36Z","title":"Fine-Grained Complexity and Algorithms for the Schulze Voting Method","version":2},"cited_work":{"arxiv_id":"2103.03959","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.03959","snapshot_observed_at":"2026-07-02T01:36:25.232249Z","title":null,"venue":null,"work_id":"1493e8c1-652e-4e0f-ac0e-2ad2b8336cf4","year":2021},"citing_paper":{"arxiv_id":"2606.02213","last_updated":"2026-06-07T06:05:36Z","snapshot_observed_at":"2026-08-08T07:23:57.057991Z","submitted_at":"2026-06-01T13:12:41Z","title":"A New Method for Finding the Schulze Winner Set","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-28T11:48:55.666803Z"},"links":{"cited_paper":"/paper/2103.03959","citing_paper":"/paper/2606.02213"},"observation_digest":"sha256:b3fcfe45fb6b1751e1fa075cbb3fd4acf38ae8c726b4c05078946c06844ef55a","observation_id":"3fba2e32-9d5b-4c78-b53e-d34cd8ed1d62","resolution":{"observed_at":"2026-07-02T01:36:25.234602Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2103.03959/citation-record","integrity":"/paper/2103.03959/integrity","json":"/paper/2103.03959/citation-record.json","paper":"/paper/2103.03959"},"outbound":[],"paper":{"arxiv_id":"2103.03959","last_updated":"2021-06-24T17:06:08Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T10:53:28.114498Z","submitted_at":"2021-03-05T22:27:36Z","title":"Fine-Grained Complexity and Algorithms for the Schulze Voting Method"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2103.03959."}