{"as_of":"2026-08-21T10:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2abd5e241216895008d9d7db37e3807ced9275598184d90eda0e46621ab59dab","coverage":[{"denominator":1,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:29:08.158722Z","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-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-02T12:27:44.025791Z","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":"2508.06997","last_updated":"2025-08-09T14:17:51Z","snapshot_observed_at":"2026-08-14T21:09:23.343052Z","submitted_at":"2025-08-09T14:17:51Z","title":"Conformal Set-based Human-AI Complementarity with Multiple Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06997","snapshot_observed_at":"2026-08-02T12:27:44.025791Z","title":"No-regret learning with unbounded losses: The case of logarithmic pooling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.04779","last_updated":"2026-07-25T11:58:07Z","snapshot_observed_at":"2026-08-19T01:43:00.750456Z","submitted_at":"2026-06-03T12:02:19Z","title":"Tree-Based Formalization of Multi-Agent Complementarity in Human-AI Interactions","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T12:27:44.025791Z"},"links":{"cited_paper":"/paper/2508.06997","citing_paper":"/paper/2606.04779"},"observation_digest":"sha256:8b3cddef59f3cb8136440409728f70b90c76218736ba88fbe21b71b52e228d43","observation_id":"b280c595-e0c2-4a9a-a683-2be595cf81a1","resolution":{"observed_at":"2026-08-02T12:27:44.025791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.06997/citation-record","integrity":"/paper/2508.06997/integrity","json":"/paper/2508.06997/citation-record.json","paper":"/paper/2508.06997"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.06995","last_updated":"2025-08-13T19:47:09Z","snapshot_observed_at":"2026-08-16T21:40:00.317977Z","submitted_at":"2025-08-09T14:12:39Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","version":2},"cited_work":{"arxiv_id":"2508.06995","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06995","snapshot_observed_at":"2026-08-05T22:29:08.232404Z","title":"S2-UniSeg: Fast Universal Agglomerative Pooling for Scalable Segment Anything without Supervision","venue":"cs.CV","work_id":"d6d49716-23da-4cc9-b4eb-55fea403297c","year":2025},"citing_paper":{"arxiv_id":"2508.06997","last_updated":"2025-08-09T14:17:51Z","snapshot_observed_at":"2026-08-14T21:09:23.343052Z","submitted_at":"2025-08-09T14:17:51Z","title":"Conformal Set-based Human-AI Complementarity with Multiple Experts","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:29:08.158722Z"},"links":{"cited_paper":"/paper/2508.06995","citing_paper":"/paper/2508.06997"},"observation_digest":"sha256:f8313cba76f9edd20d0273e81de6bd1ade9981cf69c656a04bcdbc338289f49a","observation_id":"ff406d0b-d9cf-42ba-adff-140139113c80","resolution":{"observed_at":"2026-08-05T22:29:08.322890Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.06997","last_updated":"2025-08-09T14:17:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T21:09:23.343052Z","submitted_at":"2025-08-09T14:17:51Z","title":"Conformal Set-based Human-AI Complementarity with Multiple Experts"},"reference_resolution":{"displayed":1,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":1},"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 1 of 1 outbound references and 1 inbound Pith citation observation for arXiv:2508.06997."}