{"as_of":"2026-08-08T17:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16824f727535d87b2bc4ccf630b9ff4edd34bb2564df0f9c4495dbbb4596e7cd","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-08T06:32:00.761636+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-05-14T21:16:07.851540Z","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-05-14T21:17:59.040294Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.01786","last_updated":"2025-03-03T23:56:51Z","snapshot_observed_at":"2026-07-06T20:00:23.632792Z","submitted_at":"2024-12-02T18:36:26Z","title":"Gradient-Free Generation for Hard-Constrained Systems","version":2},"cited_work":{"arxiv_id":"2412.01786","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.01786","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient-free generation for hard-constrained systems","venue":null,"work_id":"cfa7de60-dd67-4c14-9286-3912d9360ccd","year":2024},"citing_paper":{"arxiv_id":"2605.12754","last_updated":"2026-05-12T21:07:13Z","snapshot_observed_at":"2026-08-06T22:47:40.719313Z","submitted_at":"2026-05-12T21:07:13Z","title":"Constraint-Aware Flow Matching: Decision Aligned End-to-End Training for Constrained Sampling","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-14T21:16:07.851540Z"},"links":{"cited_paper":"/paper/2412.01786","citing_paper":"/paper/2605.12754"},"observation_digest":"sha256:db00ee6d4ecc7dd0d76c03b26c45596500aba0b6f6a2135abb5589ebd3e9888a","observation_id":"a90175e2-1c77-4c7f-aa42-c0715ef20fee","resolution":{"observed_at":"2026-05-14T21:17:59.042419Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.01786/citation-record","integrity":"/paper/2412.01786/integrity","json":"/paper/2412.01786/citation-record.json","paper":"/paper/2412.01786"},"outbound":[],"paper":{"arxiv_id":"2412.01786","last_updated":"2025-03-03T23:56:51Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:00:23.632792Z","submitted_at":"2024-12-02T18:36:26Z","title":"Gradient-Free Generation for Hard-Constrained 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2412.01786."}