{"as_of":"2026-08-24T02:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f63610f48d8af29a562a5bc5521378aa362dd1d534a558fdd03158c6e4f0ca5","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T17:45:06.987331Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":15,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1508.03167","last_updated":"2015-08-13T10:37:54Z","snapshot_observed_at":"2026-08-16T15:06:05.443233Z","submitted_at":"2015-08-13T10:37:54Z","title":"MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.03167","snapshot_observed_at":"2026-08-04T17:45:06.987331Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10793","last_updated":"2026-06-23T13:17:51Z","snapshot_observed_at":"2026-08-12T20:05:32.298205Z","submitted_at":"2025-09-13T03:19:01Z","title":"ORQ: Complex Analytics on Private Data with Strong Security Guarantees","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T17:45:06.987331Z"},"links":{"cited_paper":"/paper/1508.03167","citing_paper":"/paper/2509.10793"},"observation_digest":"sha256:6405438bdadc9873f67f2203b6f1a18587a084b48f77ad7ff23db43f379a497a","observation_id":"c301b634-8946-4e36-b1be-50db1d16020c","resolution":{"observed_at":"2026-08-04T17:45:06.987331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03167","last_updated":"2015-08-13T10:37:54Z","snapshot_observed_at":"2026-08-16T15:06:05.443233Z","submitted_at":"2015-08-13T10:37:54Z","title":"MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm","version":1},"cited_work":{"arxiv_id":"1508.03167","doi":"10.48550/arxiv.1508.03167","metadata_source":"pith","pith_arxiv_id":"1508.03167","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm","venue":"cs.DS","work_id":"b926a4f8-268d-4f1b-8527-c0accab3e3d8","year":2015},"citing_paper":{"arxiv_id":"2606.13157","last_updated":"2026-06-11T10:27:33Z","snapshot_observed_at":"2026-08-23T08:26:11.065772Z","submitted_at":"2026-06-11T10:27:33Z","title":"Entropic Generation of Binary Words","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T05:12:30.761717Z"},"links":{"cited_paper":"/paper/1508.03167","citing_paper":"/paper/2606.13157"},"observation_digest":"sha256:748061b103315460d279f9bb387fb1d6d11b09c334b7091edb0d784b1c4cba19","observation_id":"e476ae75-9e09-4989-a6cc-24aeaedfec93","resolution":{"observed_at":"2026-06-27T05:20:35.421434Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1508.03167/citation-record","integrity":"/paper/1508.03167/integrity","json":"/paper/1508.03167/citation-record.json","paper":"/paper/1508.03167"},"outbound":[],"paper":{"arxiv_id":"1508.03167","last_updated":"2015-08-13T10:37:54Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T15:06:05.443233Z","submitted_at":"2015-08-13T10:37:54Z","title":"MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1508.03167."}