{"as_of":"2026-08-12T15:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5fb75da51c702ac7c5c2ec9f2fdaf9336637cb0da7c41241a610585fde16f170","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-12T06:34:41.77262+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-10T17:55:01.242975Z","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-10T17:55:01.601876Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1511.07077","last_updated":"2015-11-22T22:25:47Z","snapshot_observed_at":"2026-08-12T03:40:18.030813Z","submitted_at":"2015-11-22T22:25:47Z","title":"Max-sum diversity via convex programming","version":1},"cited_work":{"arxiv_id":"1511.07077","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.07077","snapshot_observed_at":"2026-08-10T17:55:01.601876Z","title":"Max-sum diversity via convex programming","venue":"cs.DS","work_id":"78bece51-5310-4a26-ba8b-cdf70b87fceb","year":2015},"citing_paper":{"arxiv_id":"2501.11827","last_updated":"2025-01-21T02:10:50Z","snapshot_observed_at":"2026-08-12T14:16:12.895534Z","submitted_at":"2025-01-21T02:10:50Z","title":"PXGen: A Post-hoc Explainable Method for Generative Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:01.242975Z"},"links":{"cited_paper":"/paper/1511.07077","citing_paper":"/paper/2501.11827"},"observation_digest":"sha256:8093d8a1eab313d80024587a1e64097aaa8aff9714f9489f64d7f2f6ed880f61","observation_id":"f5d288fd-7f18-48bb-afcf-294f1ad4f9e0","resolution":{"observed_at":"2026-08-10T17:55:01.608346Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1511.07077/citation-record","integrity":"/paper/1511.07077/integrity","json":"/paper/1511.07077/citation-record.json","paper":"/paper/1511.07077"},"outbound":[],"paper":{"arxiv_id":"1511.07077","last_updated":"2015-11-22T22:25:47Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T03:40:18.030813Z","submitted_at":"2015-11-22T22:25:47Z","title":"Max-sum diversity via convex programming"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1511.07077."}