{"as_of":"2026-08-12T09:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8e6376169fbae0a18d401861e7d8013786446e8c92ffd12cb9d0419717cc4d0","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:27:56.883707Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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-07-30T13:40:49.816845Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19551","snapshot_observed_at":"2026-07-30T13:40:49.816845Z","title":"arXiv preprint arXiv:2412.19551 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23754","last_updated":"2026-07-26T16:58:48Z","snapshot_observed_at":"2026-08-07T10:26:58.145293Z","submitted_at":"2026-07-26T16:58:48Z","title":"Set-defined graph classes: $\\chi$-boundedness meets tropical algebra","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-30T13:40:49.816845Z"},"links":{"cited_paper":"/paper/2412.19551","citing_paper":"/paper/2607.23754"},"observation_digest":"sha256:7e5974ed6106be347e31d1204d86fc0ca2434226c967e39f668dd5db3a17c473","observation_id":"ab45cff9-3876-476d-9740-99f3b82a9eed","resolution":{"observed_at":"2026-07-30T13:40:49.816845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.19551/citation-record","integrity":"/paper/2412.19551/integrity","json":"/paper/2412.19551/citation-record.json","paper":"/paper/2412.19551"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.14412","last_updated":"2025-06-19T16:21:22Z","snapshot_observed_at":"2026-08-11T21:13:16.512032Z","submitted_at":"2022-08-30T17:26:34Z","title":"On first-order transductions of classes of graphs","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.14412","snapshot_observed_at":"2026-08-11T00:27:56.846666Z","title":"On the first-order transduction quasiorder of her editary classes of graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.846666Z"},"links":{"cited_paper":"/paper/2208.14412","citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:2c631b609d458da9817a536aa8e384dc19c0a975dd44778cffa3d173730ce206","observation_id":"ee3784ec-54c3-43fa-83cc-b6782ca4bd50","resolution":{"observed_at":"2026-08-11T00:27:56.846666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:27:57.254424Z","title":"Randomized com munication and implicit representations for matrices and graphs of small sign-rank","venue":null,"work_id":"13ec7143-ad04-4b41-b4fc-01a67c980712","year":2024},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.868402Z"},"links":{"citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:203701a76ddcc0dd846a805afaacdc2792065711dc34fde07cd00305f88ea516","observation_id":"a80f946c-3fbd-440c-8c8c-26583dbd6e54","resolution":{"observed_at":"2026-08-11T00:27:57.260700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15572","last_updated":"2025-09-10T10:49:18Z","snapshot_observed_at":"2026-08-11T21:14:10.340590Z","submitted_at":"2023-12-25T00:53:40Z","title":"Induced subgraph density. VI. Bounded VC-dimension","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.15572","snapshot_observed_at":"2026-08-11T00:27:56.883707Z","title":"Induced s ubgraph density","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.883707Z"},"links":{"cited_paper":"/paper/2312.15572","citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:ec5a0163498504592fe76a75ff3d3f44cbba69f00cce5dec2ba5ab570a4d4ac7","observation_id":"ba90ad9d-38f4-471a-99b3-9b94a1260325","resolution":{"observed_at":"2026-08-11T00:27:56.883707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08980","last_updated":"2025-02-21T06:02:31Z","snapshot_observed_at":"2026-08-12T07:44:20.973517Z","submitted_at":"2024-12-12T06:26:56Z","title":"Cover numbers by certain graph families","version":2},"cited_work":{"arxiv_id":"2412.08980","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.08980","snapshot_observed_at":"2026-08-11T00:27:56.948714Z","title":"Cover numbers by certain graph families","venue":"math.CO","work_id":"14d0bec5-ff10-435c-9fc8-3ebae7909fed","year":2024},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":1972,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.873485Z"},"links":{"cited_paper":"/paper/2412.08980","citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:5c06b0e620367d4c90eb13dc495b889eeb52cee136e60952c1447844b5a21c01","observation_id":"9f3e778a-4115-4986-980c-bfe941f9ff3d","resolution":{"observed_at":"2026-08-11T00:27:56.957373Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:27:57.271927Z","title":"Giannopoulou, Stephan Kre utzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, and Sebastian Siebert z","venue":null,"work_id":"4ef36bd9-9c1a-4bff-911f-4e4f820225a6","year":2017},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.857432Z"},"links":{"citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:11b7587305e700b606d3c10885384fe95018825acc74aab1fc2c73af26e2f45a","observation_id":"999b8276-67cf-46be-a3c1-4c8bc17ad33b","resolution":{"observed_at":"2026-08-11T00:27:57.277465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:27:57.289255Z","title":"Closure properties for pri- vate classification and online prediction","venue":null,"work_id":"4846da0e-924b-4eee-b8f4-02acabeb9c03","year":2020},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.824238Z"},"links":{"citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:d650ac27fe48331c195a18882cd11635fb193d005fafa90c2d5c9d844a1202c9","observation_id":"6f09e26f-de9f-4519-95a0-8d08ad73c7c9","resolution":{"observed_at":"2026-08-11T00:27:57.294396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:27:57.236722Z","title":"Rankwidth meets stability","venue":null,"work_id":"b172de54-1e8e-4531-b23d-455ab65366f9","year":2021},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.878726Z"},"links":{"citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:75c195392504ed0dcb6201cba64b28cc1f5b76966bc2f782cbfb495b000136a8","observation_id":"90cb189e-d34a-410f-a186-da51b9a03c5d","resolution":{"observed_at":"2026-08-11T00:27:57.242240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.18740","last_updated":"2023-11-30T17:38:00Z","snapshot_observed_at":"2026-08-11T21:13:58.829498Z","submitted_at":"2023-11-30T17:38:00Z","title":"First-Order Model Checking on Monadically Stable Graph Classes","version":1},"cited_work":{"arxiv_id":"2311.18740","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.18740","snapshot_observed_at":"2026-08-11T00:27:57.072060Z","title":"First-Order Model Checking on Monadically Stable Graph Classes","venue":"cs.LO","work_id":"8343c115-4fef-4d52-86c1-13beeadced91","year":2023},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.852080Z"},"links":{"cited_paper":"/paper/2311.18740","citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:06a6d9da8759f299ba4c41a61e2c92f6ae4fed532048768c83643762a0a0adb0","observation_id":"db403fe3-4dd5-4eca-9168-60a3b1b3c7e5","resolution":{"observed_at":"2026-08-11T00:27:57.078945Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:27:56.862475Z","title":"Partitioning perfect graphs into comparability graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.862475Z"},"links":{"citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:f3b552aa9b74455eece941180735e9bd61b74366ecd37ab910c764b822f9a6ef","observation_id":"d245431a-8aca-4dfb-ba8b-e15c9a7fbf03","resolution":{"observed_at":"2026-08-11T00:27:56.862475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.04821","last_updated":"2024-09-07T13:26:48Z","snapshot_observed_at":"2026-08-11T21:14:10.844759Z","submitted_at":"2024-09-07T13:26:48Z","title":"Adjacency Labeling Schemes for Small Classes","version":1},"cited_work":{"arxiv_id":"2409.04821","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.04821","snapshot_observed_at":"2026-08-11T00:27:57.197238Z","title":"Adjacency Labeling Schemes for Small Classes","venue":"math.CO","work_id":"f04cc6a7-3ba0-4b59-ac72-46f46562d3e2","year":2024},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.835157Z"},"links":{"cited_paper":"/paper/2409.04821","citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:65edd3288269afda193e9f2729129a10da0a7ba9a5581d69fb8675e419b4948f","observation_id":"e0bb575d-676c-4dfd-ad2b-fb64b91d13d1","resolution":{"observed_at":"2026-08-11T00:27:57.203915Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:27:56.840595Z","title":"Laskowski","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.840595Z"},"links":{"citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:304d9654353336c4adfb5bd5f62e894336815b014f717e07c65bd7379652380d","observation_id":"ae49bb47-dcda-4bca-b890-d5fe20bf8ede","resolution":{"observed_at":"2026-08-11T00:27:56.840595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.06487","last_updated":"2023-06-10T17:03:27Z","snapshot_observed_at":"2026-08-11T21:14:05.448170Z","submitted_at":"2023-06-10T17:03:27Z","title":"Path Odd-Covers of Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.06487","snapshot_observed_at":"2026-08-11T00:27:56.829946Z","title":"Path odd-covers of graphs.arXiv preprint arXiv:2306.06487,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T00:27:56.829946Z"},"links":{"cited_paper":"/paper/2306.06487","citing_paper":"/paper/2412.19551"},"observation_digest":"sha256:9add3247dc628860b2f8df11403067c962ab64804814978a78e518b929734742","observation_id":"4281c986-bceb-41be-9a4f-4accbbf3636d","resolution":{"observed_at":"2026-08-11T00:27:56.829946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.19551","last_updated":"2024-12-27T09:47:53Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-11T21:13:41.418210Z","submitted_at":"2024-12-27T09:47:53Z","title":"Boolean combinations of graphs"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":3,"verified_fuzzy":4},"total_outbound_references":12},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 1 inbound Pith citation observation for arXiv:2412.19551."}