{"as_of":"2026-08-22T16:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a45e7c104afb17a9a5bce84d8ef6ecc048dbb223b89fb0124ee4e2d73ab86a3e","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-22T06:32:14.747728+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-15T22:59:43.605574Z","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-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":16,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1511.02210","last_updated":"2015-11-06T19:55:59Z","snapshot_observed_at":"2026-08-20T04:32:24.377493Z","submitted_at":"2015-11-06T19:55:59Z","title":"Learning Optimized Or's of And's","version":1},"cited_work":{"arxiv_id":"1511.02210","doi":"10.48550/arxiv.1511.02210","metadata_source":"pith","pith_arxiv_id":"1511.02210","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Learning Optimized Or's of And's","venue":"cs.AI","work_id":"f8ebe2df-e8ba-4c4f-9d79-abae1398682a","year":2015},"citing_paper":{"arxiv_id":"2502.02221","last_updated":"2025-06-11T08:50:00Z","snapshot_observed_at":"2026-08-20T04:34:21.002188Z","submitted_at":"2025-02-04T11:01:03Z","title":"Bias Detection via Maximum Subgroup Discrepancy","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T13:05:11.148787Z"},"links":{"cited_paper":"/paper/1511.02210","citing_paper":"/paper/2502.02221"},"observation_digest":"sha256:4952029dbb42f53bff3b0df00c1d3bb674102940fa0a9953ae5e41bcbdfc5860","observation_id":"728ef4ab-ce8a-42f0-b299-4b463596bb82","resolution":{"observed_at":"2026-08-09T13:05:11.227853Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.02210","last_updated":"2015-11-06T19:55:59Z","snapshot_observed_at":"2026-08-20T04:32:24.377493Z","submitted_at":"2015-11-06T19:55:59Z","title":"Learning Optimized Or's of And's","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.02210","snapshot_observed_at":"2026-08-15T22:59:43.605574Z","title":"Integration of AI and OR Techniques in Constraint Programming: 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings 14, 94–103 (Springer)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.05857","last_updated":"2025-08-30T16:26:24Z","snapshot_observed_at":"2026-08-17T10:10:55.098035Z","submitted_at":"2025-05-09T07:51:36Z","title":"Responsible Machine Learning via Mixed-Integer Optimization","version":3},"reference_index":397,"source":"pdf_text","source_observed_at":"2026-08-15T22:59:43.605574Z"},"links":{"cited_paper":"/paper/1511.02210","citing_paper":"/paper/2505.05857"},"observation_digest":"sha256:65077ec8a35f58f39d0f85b6013e856174e8ac58dd24cc83bb9c2d2cfcfa9d2d","observation_id":"d9d8370a-0b0f-4ff3-bde4-40277cbc7e61","resolution":{"observed_at":"2026-08-15T22:59:43.605574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1511.02210/citation-record","integrity":"/paper/1511.02210/integrity","json":"/paper/1511.02210/citation-record.json","paper":"/paper/1511.02210"},"outbound":[],"paper":{"arxiv_id":"1511.02210","last_updated":"2015-11-06T19:55:59Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-20T04:32:24.377493Z","submitted_at":"2015-11-06T19:55:59Z","title":"Learning Optimized Or's of And's"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1511.02210."}