{"as_of":"2026-08-16T19:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8809d10769f4881e98774b7a24ecdef9d0cbdf8eb8ef00f8f328738a13e4f22d","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:59:03.426816Z","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-03T07:57:45.421952Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.14570","last_updated":"2020-12-23T10:25:53Z","snapshot_observed_at":"2026-08-16T19:02:24.859132Z","submitted_at":"2020-11-30T06:18:03Z","title":"How to Sell Information Optimally: an Algorithmic Study","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.14570","snapshot_observed_at":"2026-08-12T00:14:34.061641Z","title":"How to sell information optimally: An algorithmic study","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.01968","last_updated":"2024-12-02T20:55:04Z","snapshot_observed_at":"2026-08-16T13:59:01.437214Z","submitted_at":"2024-12-02T20:55:04Z","title":"On the Theoretical Foundations of Data Exchange Economies","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T00:14:34.061641Z"},"links":{"cited_paper":"/paper/2011.14570","citing_paper":"/paper/2412.01968"},"observation_digest":"sha256:86348c88492607c374b46458bc7bfa9b47608eb862662ad1546ad4cbe4ec193c","observation_id":"1fa26ba5-e47c-49e7-a552-39546c8f8803","resolution":{"observed_at":"2026-08-12T00:14:34.061641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.14570","last_updated":"2020-12-23T10:25:53Z","snapshot_observed_at":"2026-08-16T19:02:24.859132Z","submitted_at":"2020-11-30T06:18:03Z","title":"How to Sell Information Optimally: an Algorithmic Study","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.14570","snapshot_observed_at":"2026-08-16T04:59:03.426816Z","title":"and Velegkas, G","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.00405","last_updated":"2025-05-01T08:53:16Z","snapshot_observed_at":"2026-08-16T04:40:47.077627Z","submitted_at":"2025-05-01T08:53:16Z","title":"Selling Information in Games with Externalities","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T04:59:03.426816Z"},"links":{"cited_paper":"/paper/2011.14570","citing_paper":"/paper/2505.00405"},"observation_digest":"sha256:55af7772bb81f50445febfb535b5fe3c333fbc11663446f2f756bce0e8db322b","observation_id":"ebc91861-dfac-4dd7-b30e-f15796d92a25","resolution":{"observed_at":"2026-08-16T04:59:03.426816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.14570","last_updated":"2020-12-23T10:25:53Z","snapshot_observed_at":"2026-08-16T19:02:24.859132Z","submitted_at":"2020-11-30T06:18:03Z","title":"How to Sell Information Optimally: an Algorithmic Study","version":2},"cited_work":{"arxiv_id":"2011.14570","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.14570","snapshot_observed_at":"2026-07-03T07:57:45.421952Z","title":"How to sell information optimally: An algorithmic study","venue":null,"work_id":"14ccdcb7-89f1-4129-b94b-acb5cda15552","year":2011},"citing_paper":{"arxiv_id":"2606.10451","last_updated":"2026-07-03T11:55:00Z","snapshot_observed_at":"2026-08-15T13:12:56.046420Z","submitted_at":"2026-06-09T05:58:22Z","title":"Arbitrage-free Data Pricing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T11:17:13.779561Z"},"links":{"cited_paper":"/paper/2011.14570","citing_paper":"/paper/2606.10451"},"observation_digest":"sha256:a463a9eeca40fea5fb47ea591f86839b1dc34df27ba879ce96a2e492fc09af4a","observation_id":"52af4dcb-c868-4337-981a-0d1ea369e25d","resolution":{"observed_at":"2026-07-03T07:57:45.423559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2011.14570/citation-record","integrity":"/paper/2011.14570/integrity","json":"/paper/2011.14570/citation-record.json","paper":"/paper/2011.14570"},"outbound":[],"paper":{"arxiv_id":"2011.14570","last_updated":"2020-12-23T10:25:53Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T19:02:24.859132Z","submitted_at":"2020-11-30T06:18:03Z","title":"How to Sell Information Optimally: an Algorithmic Study"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2011.14570."}