{"as_of":"2026-08-17T14:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:589f3396bf770fe28f531dbfc0e458ed7df20386cee27fe2309c086d4eb6087e","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-12T00:16:16.714751Z","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-12T00:16:19.855379Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1504.06475","last_updated":"2017-12-05T16:38:10Z","snapshot_observed_at":"2026-08-15T17:21:02.592958Z","submitted_at":"2015-04-24T11:37:00Z","title":"A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment","version":4},"cited_work":{"arxiv_id":"1504.06475","doi":null,"metadata_source":"pith","pith_arxiv_id":"1504.06475","snapshot_observed_at":"2026-08-12T00:16:19.855379Z","title":"A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment","venue":"cs.DS","work_id":"1766cf2c-30d9-462c-b6a4-7014f899e011","year":2015},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.714751Z"},"links":{"cited_paper":"/paper/1504.06475","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:6eb8a4c42aed24413fca0743886a6a6138d3fa6180fb915ee53a3f73117b1cd1","observation_id":"a4f79b1c-5e74-46aa-aeda-b724aa88f95a","resolution":{"observed_at":"2026-08-12T00:16:19.894740Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1504.06475/citation-record","integrity":"/paper/1504.06475/integrity","json":"/paper/1504.06475/citation-record.json","paper":"/paper/1504.06475"},"outbound":[],"paper":{"arxiv_id":"1504.06475","last_updated":"2017-12-05T16:38:10Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T17:21:02.592958Z","submitted_at":"2015-04-24T11:37:00Z","title":"A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment"},"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:1504.06475."}