{"as_of":"2026-08-17T18:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbea52129cb8052472accfe6c1d8ca13e89663edb37c554a60aded70020e3dcb","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-16T11:21:03.116858Z","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-16T11:21:03.993098Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1101.1902","last_updated":"2011-01-10T17:46:40Z","snapshot_observed_at":"2026-08-15T04:57:56.658948Z","submitted_at":"2011-01-10T17:46:40Z","title":"Sorting, Searching, and Simulation in the MapReduce Framework","version":1},"cited_work":{"arxiv_id":"1101.1902","doi":null,"metadata_source":"pith","pith_arxiv_id":"1101.1902","snapshot_observed_at":"2026-08-16T11:21:03.993098Z","title":"Sorting, Searching, and Simulation in the MapReduce Framework","venue":"cs.DC","work_id":"e3118a10-e9df-4309-9ac6-87eb205175bf","year":2011},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.116858Z"},"links":{"cited_paper":"/paper/1101.1902","citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:a200a7f143c9fc4f0772a9bb52075ae8229a0a8c2361330d37ba768d2b2db08d","observation_id":"9fbd0668-3c01-48c2-9b47-94af9f70253c","resolution":{"observed_at":"2026-08-16T11:21:03.997487Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/1101.1902/citation-record","integrity":"/paper/1101.1902/integrity","json":"/paper/1101.1902/citation-record.json","paper":"/paper/1101.1902"},"outbound":[],"paper":{"arxiv_id":"1101.1902","last_updated":"2011-01-10T17:46:40Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-15T04:57:56.658948Z","submitted_at":"2011-01-10T17:46:40Z","title":"Sorting, Searching, and Simulation in the MapReduce Framework"},"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:1101.1902."}