{"as_of":"2026-08-18T19:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc06b24388bd3fe3bbe2cc82ef08685b8fae6e8a5c83a62616722f851ebc0641","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-18T06:34:40.430872+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-16T11:42:41.013972Z","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-16T11:42:41.054974Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.19147","last_updated":"2025-03-24T21:06:32Z","snapshot_observed_at":"2026-08-18T17:44:15.861929Z","submitted_at":"2025-03-24T21:06:32Z","title":"On the number of asynchronous attractors in AND-NOT Boolean networks","version":1},"cited_work":{"arxiv_id":"2503.19147","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.19147","snapshot_observed_at":"2026-08-16T11:42:41.054974Z","title":"On the number of asynchronous attractors in AND-NOT Boolean networks","venue":"cs.DM","work_id":"4426991c-6607-499c-b028-f7116e74d326","year":2025},"citing_paper":{"arxiv_id":"2504.15417","last_updated":"2025-05-19T22:00:47Z","snapshot_observed_at":"2026-08-18T17:23:21.459685Z","submitted_at":"2025-04-21T20:02:59Z","title":"On the Boolean Network Theory of Datalog$^\\neg$","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:42:41.013972Z"},"links":{"cited_paper":"/paper/2503.19147","citing_paper":"/paper/2504.15417"},"observation_digest":"sha256:602cadcbc0816d372bf3120a63d4d70bb689ad3fb42f979c40cb0a60c680045b","observation_id":"0100d2a7-5b03-4d98-b475-d7aa03ffd225","resolution":{"observed_at":"2026-08-16T11:42:41.061563Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.19147/citation-record","integrity":"/paper/2503.19147/integrity","json":"/paper/2503.19147/citation-record.json","paper":"/paper/2503.19147"},"outbound":[],"paper":{"arxiv_id":"2503.19147","last_updated":"2025-03-24T21:06:32Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-18T17:44:15.861929Z","submitted_at":"2025-03-24T21:06:32Z","title":"On the number of asynchronous attractors in AND-NOT Boolean networks"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2503.19147."}