{"as_of":"2026-08-10T15:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:46f32609e63977e124019c6baf5e76e4292e9bb9f7f503eb35bdf5356e797ffb","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-10T06:31:04.303077+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-09T12:13:11.688179Z","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-09T12:13:12.445016Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.20456","last_updated":"2024-07-29T23:24:59Z","snapshot_observed_at":"2026-08-09T18:51:18.102842Z","submitted_at":"2024-07-29T23:24:59Z","title":"Learning to Provably Satisfy High Relative Degree Constraints for Black-Box Systems","version":1},"cited_work":{"arxiv_id":"2407.20456","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.20456","snapshot_observed_at":"2026-08-09T12:13:12.445016Z","title":"Learning to Provably Satisfy High Relative Degree Constraints for Black-Box Systems","venue":"eess.SY","work_id":"498b343c-b984-41e7-b736-9e8c2a216444","year":2024},"citing_paper":{"arxiv_id":"2502.02434","last_updated":"2025-05-26T16:16:03Z","snapshot_observed_at":"2026-08-09T18:51:18.913773Z","submitted_at":"2025-02-04T15:58:12Z","title":"mPOLICE: Provable Enforcement of Multi-Region Affine Constraints in Deep Neural Networks","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T12:13:11.688179Z"},"links":{"cited_paper":"/paper/2407.20456","citing_paper":"/paper/2502.02434"},"observation_digest":"sha256:45404ea9807c907c85342a367aa84705aa2f7ef4ca00d64d6d457d94b5207192","observation_id":"3c025031-0650-440e-a744-2f02ee54ebfb","resolution":{"observed_at":"2026-08-09T12:13:12.448477Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.20456/citation-record","integrity":"/paper/2407.20456/integrity","json":"/paper/2407.20456/citation-record.json","paper":"/paper/2407.20456"},"outbound":[],"paper":{"arxiv_id":"2407.20456","last_updated":"2024-07-29T23:24:59Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-09T18:51:18.102842Z","submitted_at":"2024-07-29T23:24:59Z","title":"Learning to Provably Satisfy High Relative Degree Constraints for Black-Box Systems"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2407.20456."}