{"as_of":"2026-08-14T07:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b71881d57736b5f5f2aa92ec3fc9b474792402c277d7170fd4973d09f2d011e2","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:49:22.942207Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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-06-30T05:36:13.291635Z","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-06-30T14:14:45.997579Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"cited_work":{"arxiv_id":"2412.12904","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.12904","snapshot_observed_at":"2026-06-30T14:14:45.997579Z","title":"Forcing Graphs to Be Forcing.arXiv preprint arXiv:2412.12904, 2024","venue":null,"work_id":"012e2df2-ac4c-4a49-82a8-38f3f51ba9a7","year":2024},"citing_paper":{"arxiv_id":"2606.30010","last_updated":"2026-06-29T09:16:50Z","snapshot_observed_at":"2026-07-07T00:03:56.075924Z","submitted_at":"2026-06-29T09:16:50Z","title":"$L^p$-form of the KNRS conjecture","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T05:36:13.291635Z"},"links":{"cited_paper":"/paper/2412.12904","citing_paper":"/paper/2606.30010"},"observation_digest":"sha256:9a0515706d3c399763311392896a04da33c76141c453c6995c1344bc84e91118","observation_id":"d48820ba-2347-41ee-ab10-07b3a97f7465","resolution":{"observed_at":"2026-06-30T14:14:45.999247Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.12904/citation-record","integrity":"/paper/2412.12904/integrity","json":"/paper/2412.12904/citation-record.json","paper":"/paper/2412.12904"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:49:22.724438Z","title":"Combinatorics, Probabili ty and Computing 29(1), 44–67 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.724438Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:26c12da4bc3c2c5565c159753a8ded04160b5f87cf5855083d7a8145c5bd265c","observation_id":"34f8010c-35ce-45a7-b815-c73806398009","resolution":{"observed_at":"2026-08-11T13:49:22.724438Z","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-11T13:49:23.843610Z","title":"Combinatorica 40(4), 455–471 (2020)","venue":null,"work_id":"414036f0-58e7-44f4-8dbc-d21f48951a5b","year":2020},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.732973Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:446a62d128930711cddecd9c49d3d9a091179aad6ea5176ab9d3928602b74cfd","observation_id":"0184c32b-e31f-45c1-8ced-4bea26484e71","resolution":{"observed_at":"2026-08-11T13:49:23.861688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.809954Z","title":"Combinatorica 9, 345–362 (1989) 18","venue":null,"work_id":"f31dceeb-d476-4662-8052-884857de80ec","year":1989},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.743072Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:8f12e613188b45e049d90c7b0b10feb5654b60a234d6c14c13efbb3d720add32","observation_id":"00c0bf7f-c43d-4e10-8a0a-8b35fabf0552","resolution":{"observed_at":"2026-08-11T13:49:23.820338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.771478Z","title":"Geo- metric and Functional Analysis 20, 1354–1366 (2010)","venue":null,"work_id":"90c7bbfa-100b-4739-892c-c00d7eb8403d","year":2010},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.749642Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:c93d1467cb8d183c98f8b93084e2f5214b4cca086920294afe9e157734e85690","observation_id":"e244acfd-ecbf-4c09-a338-6d157fa76bce","resolution":{"observed_at":"2026-08-11T13:49:23.779275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.749866Z","title":"Random Structures & Algorithms 40(1), 1–38 (2012)","venue":null,"work_id":"92054c60-869d-477d-8c7b-fa0e7ae2ccce","year":2012},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.754767Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:513fb1fb29ed7fabd4be7fb5b81f91c98f1572d808de5452975c590b700ecb34","observation_id":"cece9346-8de0-44d0-8178-286404abf56a","resolution":{"observed_at":"2026-08-11T13:49:23.754916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.735785Z","title":"Journal of the London Mathematical Society 98(3), 593–608 (2018)","venue":null,"work_id":"706dc8d9-3ad0-4bc8-bf6a-15ddb5f6cae3","year":2018},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.763002Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:e4f6d7727bb6938993e08c5a0880afe42a1ffe440171b3b12b51a25d75d4bf3f","observation_id":"ea9ed00f-e946-45e6-99d6-05c9ad2ada3a","resolution":{"observed_at":"2026-08-11T13:49:23.741183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.703971Z","title":"Advances in Mathematics 315, 130–165 (2017)","venue":null,"work_id":"65c2a442-4e70-4b3c-b6cf-28bf0065237e","year":2017},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.773598Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:c6bdaf147953ef605eb01eb1de99578d1aecb53d0bfaeaea5512be58412133ed","observation_id":"df7eccff-000c-46e9-b9ea-f8d17b011ac6","resolution":{"observed_at":"2026-08-11T13:49:23.710059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:22.779242Z","title":"Discrete Analysis (mar 30 2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.779242Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:bd3ebc0ffeffa4affe89e4ef480742826132eb5b89ed9c7b048a3b76fca3ffe8","observation_id":"80ac81b1-82fc-45c1-b770-a2871c548cd3","resolution":{"observed_at":"2026-08-11T13:49:22.779242Z","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":"10.1093/imrn/rnae071","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:49:22.985793Z","title":"International Mathematics Research Notices 2024(13), 10285–10297 (04 2024)","venue":null,"work_id":"d74de6ce-a7cc-427f-8af6-77fd1f98dde5","year":2024},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.790400Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:2d51bed5239b579699f92cd82c72739da4fcec988b436dc8332640e62a2b7dd5","observation_id":"005d8c29-1ba0-42c9-9daa-e3385656552c","resolution":{"observed_at":"2026-08-11T13:49:23.004312Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.670701Z","title":"Russian Mathematical Surveys 75(4), 627 (2020)","venue":null,"work_id":"f8182821-6f56-4a96-a383-90615ebaa48b","year":2020},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.800746Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:18a96c05d700472e818aab738a242aecee621cc5201f0940a9b50bc6d4574e44","observation_id":"afde11a6-ce22-436d-a893-477991f56d4f","resolution":{"observed_at":"2026-08-11T13:49:23.674149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.10058","last_updated":"2022-06-21T00:45:01Z","snapshot_observed_at":"2026-08-13T15:19:57.673173Z","submitted_at":"2022-06-21T00:45:01Z","title":"Non-trivial squares and Sidorenko's conjecture","version":1},"cited_work":{"arxiv_id":"2206.10058","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.10058","snapshot_observed_at":"2026-08-11T13:49:23.241701Z","title":"Non-trivial squares and Sidorenko's conjecture","venue":"math.CO","work_id":"9218e21c-c452-4630-bb80-0df0ecd8478b","year":2022},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.808870Z"},"links":{"cited_paper":"/paper/2206.10058","citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:6b507ba6354046a19eb7ff072a3b34e63195705e5afb4c8d51f7468de434aecb","observation_id":"827537b2-71ed-4bdb-a549-ffd1b61d79d4","resolution":{"observed_at":"2026-08-11T13:49:23.248212Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.654935Z","title":"Journal of Pure and Applied Algebra 192(1-3), 95–128 (2004)","venue":null,"work_id":"c1e211f7-34be-4e3d-bfed-67aeba5bb33c","year":2004},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.818176Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:86379605b14fb25508710587fb7ccbc7d8cceeb8329703052dddc3c1bc2a5259","observation_id":"a0ac445b-21a6-4664-bf3c-af2ad1296bb0","resolution":{"observed_at":"2026-08-11T13:49:23.661770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.612674Z","title":"The American Mathematical Monthly 66(9), 778–783 (1959)","venue":null,"work_id":"1a4d7f64-d2d2-4ebf-b46f-14d66cf17b16","year":1959},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.823465Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:dcfd1e410d21e768a0fd77f4ae68a04b00f80f33b9db5e68dfecc9b471c748e8","observation_id":"a31fc7ea-4983-4978-a414-0e75e531fda9","resolution":{"observed_at":"2026-08-11T13:49:23.629486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.577094Z","title":"Electronic Notes in Discrete Mathematics 38, 437–442 (2011)","venue":null,"work_id":"66dcb5ad-bba9-4497-8b05-b595fef7e418","year":2011},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.828865Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:34cf1cbe83ac87f1658a9844fc7fc7167b6720b4edebd647d19877ab9ebecec2","observation_id":"6a4c0650-51ce-4c4f-adba-69984c97da82","resolution":{"observed_at":"2026-08-11T13:49:23.585858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.556142Z","title":"Is rael Journal of Mathematics 175, 125–150 (2010)","venue":null,"work_id":"975389bf-04e9-4ba5-bcc2-9336dcde97c3","year":2010},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.836974Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:4c89db829dd71fe120740d9589c6fa951df89379b36375acb2c2bcf96b7478af","observation_id":"46a43c11-6cda-45b0-967b-041f9413ee17","resolution":{"observed_at":"2026-08-11T13:49:23.561444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03491","last_updated":"2024-08-28T06:17:16Z","snapshot_observed_at":"2026-08-13T18:01:03.371289Z","submitted_at":"2024-08-07T01:02:08Z","title":"Sidorenko's conjecture for subdivisions and theta substitutions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03491","snapshot_observed_at":"2026-08-11T13:49:22.842105Z","title":"arXiv preprint arXiv:2408.03491 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.842105Z"},"links":{"cited_paper":"/paper/2408.03491","citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:da832d9957bacc0f385a8b3727d60952be540361eead3cf33f70fa7d6f3c41b5","observation_id":"711a4645-44f5-4aa1-a291-7fd12bdc5fb3","resolution":{"observed_at":"2026-08-11T13:49:22.842105Z","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-11T13:49:23.532435Z","title":"In: Proceedings of Discrete Mathematics Days (2024)","venue":null,"work_id":"5a0467d1-d64d-49de-a9ac-02827946b906","year":2024},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.847416Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:74d6646ebefe6c4808c81c6a151f1c70f1a2a9d9c31d9ed6c52c6b1abb930e90","observation_id":"dcb48385-f38f-4141-9793-2bcd8176ffd6","resolution":{"observed_at":"2026-08-11T13:49:23.536836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.510246Z","title":"Transactions of the American Mathematical Society 368(7), 5057–5074 (2016)","venue":null,"work_id":"605b6f8b-da72-4df0-9791-c3210514c2e8","year":2016},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.863410Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:953f2ed40ee835a6789b8ea1f7495a0871057e44aef2b6bd0bdf78aab67e056d","observation_id":"0b561347-a31f-45de-a803-a8b1c8238494","resolution":{"observed_at":"2026-08-11T13:49:23.514461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.471888Z","title":"Journal of Combinatorial Theory, Series B 100(2), 151–160 (2010) 19","venue":null,"work_id":"11523f04-a33a-4ebb-9b37-87a4615df550","year":2010},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.869077Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:e247d8478745e4272fb286ccefe2b276678f4cee095e525395b2da54f8e8d3fe","observation_id":"3f207e1a-a71f-4051-a907-a0353bf25267","resolution":{"observed_at":"2026-08-11T13:49:23.482318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1107.1153","last_updated":"2011-07-06T15:08:52Z","snapshot_observed_at":"2026-07-06T02:30:28.781533Z","submitted_at":"2011-07-06T15:08:52Z","title":"On the logarithimic calculus and Sidorenko's conjecture","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1107.1153","snapshot_observed_at":"2026-08-11T13:49:22.873963Z","title":"arXiv preprint arXiv:1107.1153 (2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.873963Z"},"links":{"cited_paper":"/paper/1107.1153","citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:30d74babcf5335089e2455c4cf210d7eb908e056c4bd2d275da96703ff3db3cf","observation_id":"ca08c45f-e04b-4f89-9632-a60aa0151815","resolution":{"observed_at":"2026-08-11T13:49:22.873963Z","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-11T13:49:23.449026Z","title":"Journal of Combinatorial Theory, Series B 96(6), 933–957 (2006)","venue":null,"work_id":"9a82c1aa-1272-4ad7-bb1f-ed8fe1c1a76d","year":2006},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.880257Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:2afe2bd35a92d2e007ddcf741944089e7831a55ada8229f08dc472b336ff0cb3","observation_id":"baf985d1-b679-40fe-bb98-1520ea8a57d6","resolution":{"observed_at":"2026-08-11T13:49:23.453427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.12873","last_updated":"2025-06-20T01:13:59Z","snapshot_observed_at":"2026-08-13T10:07:33.536589Z","submitted_at":"2023-09-22T13:55:12Z","title":"Sidorenko Hypergraphs and Random Tur\\'an Numbers","version":2},"cited_work":{"arxiv_id":"2309.12873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.12873","snapshot_observed_at":"2026-08-11T13:49:23.119009Z","title":"Sidorenko Hypergraphs and Random Tur\\'an Numbers","venue":"math.CO","work_id":"ee00f2e6-562d-40a2-9f21-d288c7dfcb4e","year":2023},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.886208Z"},"links":{"cited_paper":"/paper/2309.12873","citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:69bd3d858564cd0a62873aee8cc9eefbb29b6a64975f6435d70445da5289ffaa","observation_id":"80aff30f-4d95-4227-bdb8-423157803b4c","resolution":{"observed_at":"2026-08-11T13:49:23.132333Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.422033Z","title":"Algebraic Combinatorics 1(2), 249–274 (2018)","venue":null,"work_id":"00d19384-ec78-4f2a-9fcb-6c1e1e4630b0","year":2018},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.894048Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:80e56cbe1f773629371e97e9795d335c0706095b527b4832a8fa6c598a4eb544","observation_id":"fbfc5c61-9bbd-4f1a-96f7-ee534df51c88","resolution":{"observed_at":"2026-08-11T13:49:23.428459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.403435Z","title":"The Journal of Symbolic Logic 72(4), 1239–1282 (2007)","venue":null,"work_id":"ae2d8f5a-f8a2-45e4-9a17-e779b5f4bd0f","year":2007},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.898351Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:33094245b73d8881dab6f4f83497ee06a1782c252f7f91f31e62c7bfdf752560","observation_id":"9e5bc784-893c-4666-93ee-7d37a9f1ca42","resolution":{"observed_at":"2026-08-11T13:49:23.409250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.379797Z","title":"In: Forum of Mathemat- ics, Sigma","venue":null,"work_id":"1f826e4b-07e7-4059-aa5b-19c848cb062e","year":2019},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.904559Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:76704f69e9187a0947ed0d13af971eae9315fb38473dcabee11a07cf82a126a1","observation_id":"30548642-73f3-4215-ab52-95b7fd3c333f","resolution":{"observed_at":"2026-08-11T13:49:23.385167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.357029Z","title":"Graphs and Combinatorics 9(2), 201–204 (1993)","venue":null,"work_id":"39dd7405-9a58-4884-a9ad-1c96dd2bfb23","year":1993},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.909960Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:7c01e9900b1865efc7e4a5347d5324dbafa8430d21871fe4f841e4d4862dcb1e","observation_id":"108619f3-e9eb-43dc-9d18-48b52eedc37a","resolution":{"observed_at":"2026-08-11T13:49:23.361322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.323883Z","title":"Progress in graph theory (Waterloo, Ont., 198 2) pp","venue":null,"work_id":"10326ed2-7a60-41e8-bdfb-6e8a22105e0b","year":1984},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.914457Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:d5243f21527d7b901067f577e1646481dc80c34fd77a9e2aad19476700eebe8b","observation_id":"272e42df-5416-44dc-b34f-3e824148947f","resolution":{"observed_at":"2026-08-11T13:49:23.333143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T13:49:23.299722Z","title":"Graphs and Combina- torics 20, 255–262 (2004)","venue":null,"work_id":"78e2552e-9415-4ff7-8a8b-07c37b20a1ee","year":2004},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.921330Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:8f402781dd8ea6f19830748ec0b46725a2d61314d637053038707b38f55e79f7","observation_id":"6ad8ce19-d766-4c46-9bc0-f3b6245bf6a0","resolution":{"observed_at":"2026-08-11T13:49:23.305988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1406.6738","last_updated":"2015-01-26T18:11:00Z","snapshot_observed_at":"2026-08-11T05:38:09.750530Z","submitted_at":"2014-06-26T00:14:39Z","title":"An information theoretic approach to Sidorenko's conjecture","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.6738","snapshot_observed_at":"2026-08-11T13:49:22.935622Z","title":"arXiv preprint arXiv:1406.6738 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.935622Z"},"links":{"cited_paper":"/paper/1406.6738","citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:3de58a5fb75da88eca155db5751d95de9016c2d16f5086068dce92cbe28ea427","observation_id":"3225c6ae-ce35-47eb-9203-89e74d0836db","resolution":{"observed_at":"2026-08-11T13:49:22.935622Z","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-11T13:49:23.274050Z","title":"math.tau.ac.il/~yuvalwig/math/expository/HypergraphSidorenko.pdf 20","venue":null,"work_id":"6142fc61-1bf9-4de1-b180-776e4a7c99e0","year":null},"citing_paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T13:49:22.942207Z"},"links":{"citing_paper":"/paper/2412.12904"},"observation_digest":"sha256:57fcc65cee54803fb6bcfb94643f6bbc60ecea2348b8dc8fe48421fb62c97025","observation_id":"1978523e-45d9-489c-b0be-58cd86676c97","resolution":{"observed_at":"2026-08-11T13:49:23.278897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.12904","last_updated":"2024-12-17T13:28:49Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-11T13:34:53.443809Z","submitted_at":"2024-12-17T13:28:49Z","title":"Forcing Graphs to be Forcing"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":30},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2412.12904."}