{"as_of":"2026-08-13T22:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c2c4add681d3bdc1e836cc1846d6cc2f7629da169903165fa13d5bc2dd107fb0","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-13T06:32:02.005865+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-08-12T12:28:19.352097Z","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-18T01:20:34.766694Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.07715","last_updated":"2024-10-15T16:23:50Z","snapshot_observed_at":"2026-08-13T16:40:08.905273Z","submitted_at":"2022-02-15T20:29:53Z","title":"Combinatorial Exploration: An algorithmic framework for enumeration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07715","snapshot_observed_at":"2026-08-12T12:28:19.352097Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.17778","last_updated":"2024-11-26T10:11:57Z","snapshot_observed_at":"2026-08-12T12:15:12.973851Z","submitted_at":"2024-11-26T10:11:57Z","title":"BiSC: An algorithm for discovering generalized permutation patterns","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T12:28:19.352097Z"},"links":{"cited_paper":"/paper/2202.07715","citing_paper":"/paper/2411.17778"},"observation_digest":"sha256:4c3a946f03616047f3eb91d70a4ecbbe787b3f9df8a4772cbf904a668f0cd71f","observation_id":"f2070cca-8a8b-4038-9fc3-c7d03bf93b01","resolution":{"observed_at":"2026-08-12T12:28:19.352097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07715","last_updated":"2024-10-15T16:23:50Z","snapshot_observed_at":"2026-08-13T16:40:08.905273Z","submitted_at":"2022-02-15T20:29:53Z","title":"Combinatorial Exploration: An algorithmic framework for enumeration","version":3},"cited_work":{"arxiv_id":"2202.07715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.07715","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fc7e7c3b-8350-4223-a0ea-16f6e3c5dc71","year":2024},"citing_paper":{"arxiv_id":"2511.00914","last_updated":"2026-05-10T21:49:36Z","snapshot_observed_at":"2026-08-02T12:43:56.256076Z","submitted_at":"2025-11-02T12:27:44Z","title":"Extending the symbolic method in enumerative combinatorics. I","version":9},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T01:17:09.042487Z"},"links":{"cited_paper":"/paper/2202.07715","citing_paper":"/paper/2511.00914"},"observation_digest":"sha256:b64fe965fffcdb1e5a5d7735df71456edd2ea0ef843b4a43d1504b31694e7ccb","observation_id":"c247315e-3d8f-4b69-a1e9-766f7cd825ee","resolution":{"observed_at":"2026-05-18T01:20:34.768720Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.07715/citation-record","integrity":"/paper/2202.07715/integrity","json":"/paper/2202.07715/citation-record.json","paper":"/paper/2202.07715"},"outbound":[],"paper":{"arxiv_id":"2202.07715","last_updated":"2024-10-15T16:23:50Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-13T16:40:08.905273Z","submitted_at":"2022-02-15T20:29:53Z","title":"Combinatorial Exploration: An algorithmic framework for enumeration"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2202.07715."}