{"as_of":"2026-08-09T09:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f175c53b7b742c01d0569fd622fa708398d349de714e34b46e01312231a95f2","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-09T06:31:02.800959+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-06T22:03:20.716950Z","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-05-11T04:55:56.198677Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-07-06T19:53:17.024873Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.13513","snapshot_observed_at":"2026-08-06T22:03:20.716950Z","title":"Procurement Auctions via Approximately Optimal Submodular Opti- mization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-08T01:25:47.694969Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.716950Z"},"links":{"cited_paper":"/paper/2411.13513","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:005fb60a911eab3705341db0f6ca817da01002344ac52ffdf69a4a645375ba58","observation_id":"53a96779-0ea2-4f5e-a62a-5df93b8c06ca","resolution":{"observed_at":"2026-08-06T22:03:20.716950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-07-06T19:53:17.024873Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"cited_work":{"arxiv_id":"2411.13513","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13513","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2411.13513 , year=","venue":null,"work_id":"6b43b662-e0d7-4ea7-92a5-7d16b6c2913a","year":null},"citing_paper":{"arxiv_id":"2605.06711","last_updated":"2026-05-06T22:12:46Z","snapshot_observed_at":"2026-07-06T23:19:10.574595Z","submitted_at":"2026-05-06T22:12:46Z","title":"Pricing, Matching, and Bundling: an Equilibrium Analysis of Online Platforms","version":1},"reference_index":207,"source":"arxiv_source","source_observed_at":"2026-05-11T01:00:26.562282Z"},"links":{"cited_paper":"/paper/2411.13513","citing_paper":"/paper/2605.06711"},"observation_digest":"sha256:4a10219e5320f76ccaca92a961d5eb525769f6706a4ebed3a172af42adb20fee","observation_id":"ba511367-7c89-4dd3-a6ce-c0fc36e0a8b7","resolution":{"observed_at":"2026-05-11T04:55:56.202582Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.13513/citation-record","integrity":"/paper/2411.13513/integrity","json":"/paper/2411.13513/citation-record.json","paper":"/paper/2411.13513"},"outbound":[],"paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T19:53:17.024873Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2411.13513."}