{"as_of":"2026-08-06T16:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20a6bbae9bdd051b42d9f590604de83cd7fd6abaec8033f0cf5c33946b9c99ff","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-06T06:34:29.942622+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-06T15:00:06.571299Z","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-06T15:00:06.848843Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.10330","last_updated":"2024-03-15T14:18:21Z","snapshot_observed_at":"2026-07-06T17:45:15.311629Z","submitted_at":"2024-03-15T14:18:21Z","title":"Towards Non-Adversarial Algorithmic Recourse","version":1},"cited_work":{"arxiv_id":"2403.10330","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.10330","snapshot_observed_at":"2026-08-06T15:00:06.848843Z","title":"Towards Non-Adversarial Algorithmic Recourse","venue":"cs.LG","work_id":"c71c3b85-8c3f-4f06-8634-03ce44b8bb6c","year":2024},"citing_paper":{"arxiv_id":"2507.17161","last_updated":"2025-07-23T02:53:58Z","snapshot_observed_at":"2026-08-06T14:53:21.376322Z","submitted_at":"2025-07-23T02:53:58Z","title":"Tabular Diffusion based Actionable Counterfactual Explanations for Network Intrusion Detection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T15:00:06.571299Z"},"links":{"cited_paper":"/paper/2403.10330","citing_paper":"/paper/2507.17161"},"observation_digest":"sha256:12de7934de6584690df9d8b967557d98fc6107bdedbe0dd144d955ac87a1b406","observation_id":"743c5be1-9d1f-46cf-81c7-d18b60a91762","resolution":{"observed_at":"2026-08-06T15:00:06.853010Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.10330/citation-record","integrity":"/paper/2403.10330/integrity","json":"/paper/2403.10330/citation-record.json","paper":"/paper/2403.10330"},"outbound":[],"paper":{"arxiv_id":"2403.10330","last_updated":"2024-03-15T14:18:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:45:15.311629Z","submitted_at":"2024-03-15T14:18:21Z","title":"Towards Non-Adversarial Algorithmic Recourse"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.10330."}