{"as_of":"2026-08-21T08:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4fcfff69a561606b2be374339b8c8ec3bd18d397d8e5f2536b2b0a233979ead","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-03T01:31:51.096584Z","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":"1310.5367","last_updated":"2013-10-20T20:15:07Z","snapshot_observed_at":"2026-08-14T23:58:19.921785Z","submitted_at":"2013-10-20T20:15:07Z","title":"Balanced Allocations: A Simple Proof for the Heavily Loaded Case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.5367","snapshot_observed_at":"2026-08-03T01:31:51.096584Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.28892","last_updated":"2026-07-30T23:19:05Z","snapshot_observed_at":"2026-08-20T20:44:57.217201Z","submitted_at":"2026-07-30T23:19:05Z","title":"Succinct and Fast Tiny Pointer Hash Tables","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-03T01:31:51.096584Z"},"links":{"cited_paper":"/paper/1310.5367","citing_paper":"/paper/2607.28892"},"observation_digest":"sha256:2e62901aea4110f75e48d6934e6fc85a15db603cb46678317f70c8782eb26613","observation_id":"832f17f2-4a33-4807-abef-15a4a38a9bf4","resolution":{"observed_at":"2026-08-03T01:31:51.096584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1310.5367/citation-record","integrity":"/paper/1310.5367/integrity","json":"/paper/1310.5367/citation-record.json","paper":"/paper/1310.5367"},"outbound":[],"paper":{"arxiv_id":"1310.5367","last_updated":"2013-10-20T20:15:07Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-14T23:58:19.921785Z","submitted_at":"2013-10-20T20:15:07Z","title":"Balanced Allocations: A Simple Proof for the Heavily Loaded Case"},"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:1310.5367."}