{"as_of":"2026-08-14T23:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16ad791c20500036b00d0c5f0dd56af7add94e75a8e16605253bde98d75b0c99","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-14T06:32:32.682623+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-07-13T05:26:06.829382Z","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-01T22:16:16.358373Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.11844","last_updated":"2024-03-18T14:55:45Z","snapshot_observed_at":"2026-08-13T00:51:50.230166Z","submitted_at":"2024-03-18T14:55:45Z","title":"Near-Optimal Solutions of Constrained Learning Problems","version":1},"cited_work":{"arxiv_id":"2403.11844","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.11844","snapshot_observed_at":"2026-07-01T22:16:16.358373Z","title":null,"venue":null,"work_id":"69347257-89c9-4d36-83c4-90fbca1de0dd","year":null},"citing_paper":{"arxiv_id":"2606.01557","last_updated":"2026-06-01T02:02:22Z","snapshot_observed_at":"2026-08-12T19:13:51.006010Z","submitted_at":"2026-06-01T02:02:22Z","title":"Everywhere Learning: Artificial Intelligence with Pointwise Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T15:34:51.581338Z"},"links":{"cited_paper":"/paper/2403.11844","citing_paper":"/paper/2606.01557"},"observation_digest":"sha256:3af818240c563c6b21bbf3e8429ceef3a4f9beb8520c20bce0b732515613eb36","observation_id":"6c2c36fa-b4b7-426d-a5b3-cf369e2460d0","resolution":{"observed_at":"2026-07-01T22:16:16.359721Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.11844","last_updated":"2024-03-18T14:55:45Z","snapshot_observed_at":"2026-08-13T00:51:50.230166Z","submitted_at":"2024-03-18T14:55:45Z","title":"Near-Optimal Solutions of Constrained Learning Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.11844","snapshot_observed_at":"2026-07-13T05:26:06.829382Z","title":"Near-optimal solutions of constrained learning problems.arXiv preprint arXiv:2403.11844, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08968","last_updated":"2026-07-09T22:09:16Z","snapshot_observed_at":"2026-08-09T10:00:22.541985Z","submitted_at":"2026-07-09T22:09:16Z","title":"Every Sample Counts: Supervised Fine-Tuning of Language Models with Pointwise Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T05:26:06.829382Z"},"links":{"cited_paper":"/paper/2403.11844","citing_paper":"/paper/2607.08968"},"observation_digest":"sha256:bf6c6f05afb2bf895083116d8947f3adf0391e70e19a1efcb37e7758411b1dc6","observation_id":"3cf03e89-576e-494c-b7aa-fca5776f860a","resolution":{"observed_at":"2026-07-13T05:26:06.829382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.11844/citation-record","integrity":"/paper/2403.11844/integrity","json":"/paper/2403.11844/citation-record.json","paper":"/paper/2403.11844"},"outbound":[],"paper":{"arxiv_id":"2403.11844","last_updated":"2024-03-18T14:55:45Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T00:51:50.230166Z","submitted_at":"2024-03-18T14:55:45Z","title":"Near-Optimal Solutions of Constrained Learning Problems"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.11844."}