{"as_of":"2026-08-13T06:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac80d2056ba03a5e360b657f51e2689d72dd7d350bc4f30f9c710dd07dba8b14","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:22:00.649615Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2411.14553/citation-record","integrity":"/paper/2411.14553/integrity","json":"/paper/2411.14553/citation-record.json","paper":"/paper/2411.14553"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.968123Z","title":"A boundary property for upper domination","venue":null,"work_id":"f9c674ef-d6d1-4c82-95cd-b07625dc5f05","year":2016},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.566671Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:493beb67af5c069937ef4b6269e044d12fc55ecd014910aaaaa33fcc17e54135","observation_id":"ce1c01f3-71a9-42a2-aa9e-64e329c3c38c","resolution":{"observed_at":"2026-08-12T15:22:00.972067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.954700Z","title":"On easy and hard hereditary classes of graphs with respect to the independent set problem","venue":null,"work_id":"d8e4f64e-dae6-401d-ae03-24f93360a9c4","year":2003},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.572854Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:8bc6b2afc459dfd25fe3cb9c15cd7a718416af9e2bd939b9a7d747708da17fc3","observation_id":"d28f08ae-d377-49af-89f5-57f0129fc06d","resolution":{"observed_at":"2026-08-12T15:22:00.958689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.941575Z","title":"NP-hard graph problems and boundary classes of graphs","venue":null,"work_id":"fcf41e86-d1f9-48f1-a4e4-f716ff807df9","year":2007},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.577417Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:716b04948621d8d28c669989e3f2895572af74d776bff33f390908fe7e785526","observation_id":"5fcbb75d-f0a6-48ca-9980-f6bc5120b527","resolution":{"observed_at":"2026-08-12T15:22:00.946631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.927779Z","title":"Boundary classes of graphs for the dominating set problem","venue":null,"work_id":"e62fb83e-4e57-47df-a13b-eaef738e6b06","year":2004},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.581786Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:67918b31536c199c0066914c4bcb6e8486f56f4fb219f460ee1aba9209a629d5","observation_id":"0001f0b6-b87a-461b-8658-27730f63f0db","resolution":{"observed_at":"2026-08-12T15:22:00.931848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.915272Z","title":"On the complexity of the dominating induced matching problem in hereditary classes of graphs","venue":null,"work_id":"ab4c107c-e7dd-4d83-bc30-e81c7c1c5af3","year":2011},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.586214Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:b8dd4063b3e8cd4887e7d4a8ad42108e120799c88926e42eda388b65595b8bf4","observation_id":"bc1e0f82-2c7d-43ed-a373-db94f5055a7d","resolution":{"observed_at":"2026-08-12T15:22:00.919557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.903098Z","title":null,"venue":null,"work_id":"4eb114ac-1f54-460d-bd6b-da49de961f0d","year":2023},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.590564Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:7cab916e4a27c1ec9b54561b0aa848d887cc645e88210e45914cd9fb3f04b581","observation_id":"352243f1-d04a-4f37-a089-884cc7ff0a21","resolution":{"observed_at":"2026-08-12T15:22:00.906994Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.888271Z","title":"Computers and Intractability; A Guide to the Theory of NP- Completeness","venue":null,"work_id":"0c518dac-0160-4a7a-abb8-cf2621c42e88","year":1990},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.594735Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:38ac0b601fa5f61673ae8e22130d1e10935301ec63b7856a9f23ca4ad62d2323","observation_id":"51308afb-de19-47e2-8d3b-87ee45011c8c","resolution":{"observed_at":"2026-08-12T15:22:00.893746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.873252Z","title":"Reducibility among combinatorial problems","venue":null,"work_id":"d220e9c3-a899-4f14-9721-ebaf31c389ae","year":1972},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.598502Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:2e801dc79d17889edb903d4c91dedefabafeec489d4ef0cf44001d9a465830bd","observation_id":"9dda662e-91bd-4262-bbe9-70db6e1a181d","resolution":{"observed_at":"2026-08-12T15:22:00.878284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.858577Z","title":"A boundary class for the k-path partition problem","venue":null,"work_id":"7253a6c5-1e0c-437a-a0aa-1b1a676dceef","year":2018},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.602633Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:9d57f8960f845bfd742f4496e6b9c1a015ef38c1bd1bd9b19a40e709d3428a05","observation_id":"5708ed10-0388-4d89-8cb5-7f0b77421b44","resolution":{"observed_at":"2026-08-12T15:22:00.863525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.839966Z","title":"Boundary properties of graphs for algorithmic graph problems","venue":null,"work_id":"db29c62e-54ef-48dc-9fc8-217d73acd7a6","year":2011},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.606621Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:6cd58b4bae547a7eb35b6ed44a6457182a20b3d8020fbc9e5bb9d17e18396c95","observation_id":"a07f0d2b-ae72-4f3a-8217-8e03f1129c17","resolution":{"observed_at":"2026-08-12T15:22:00.845546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.824564Z","title":"Hamiltonian cycles in subcubic graphs: What makes the problem difficult","venue":null,"work_id":"e6b6cffc-a49e-42f4-bcae-6ec9e9b0290b","year":2010},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.610583Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:71cacdd4f13e9e4dfcb4e2b862495f47329dc29279a576bb15f72d325b6284eb","observation_id":"51b3f49a-ea00-428d-ba14-57e746c0e507","resolution":{"observed_at":"2026-08-12T15:22:00.829361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.808890Z","title":"On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number","venue":null,"work_id":"c817ca8c-ec08-4b14-84fd-9976a44f695e","year":2011},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.614530Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:ba5b1034e403a381fa13ccf39ed27c5f68f9cd40dac21eeb30ec68812b874ded","observation_id":"3b1385a5-79cd-4210-beb4-735cba5ee821","resolution":{"observed_at":"2026-08-12T15:22:00.814765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.795458Z","title":"A study of the boundary graph classes for colorability problems","venue":null,"work_id":"631af69b-44a1-4b68-b325-9d5b064f83ff","year":2013},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.618185Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:f9cb1bc9a7cb1630a024a807633130b17bdde19fd073ff51330ffa9354444f3b","observation_id":"6adfba48-a61e-4e8a-bc76-54879a81ecb6","resolution":{"observed_at":"2026-08-12T15:22:00.799847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.779418Z","title":"Boundary graph classes for some maximum induced subgraph problems","venue":null,"work_id":"1ae99e0e-ad07-457c-96d8-ee54a4177769","year":2014},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.621929Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:0fb0616a88e408348ce9e0f31a8828f3b0346a22fc5bead5404deb7f60a38eaf","observation_id":"a55174e6-21ab-4d54-94b0-8d19c897e253","resolution":{"observed_at":"2026-08-12T15:22:00.786430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.762865Z","title":"Classes of graphs critical for the edge list-ranking problem","venue":null,"work_id":"995e1fe1-6616-4a1f-b58e-7af12bba5965","year":2014},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.625388Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:5a6afbdec21886e2296f9c9126e63665243f06c69829e8f789a07aea48f7bdab","observation_id":"50ae7999-5616-4147-8f1f-d931a794ca3f","resolution":{"observed_at":"2026-08-12T15:22:00.767999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.750216Z","title":"The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices","venue":null,"work_id":"33457ad1-73ad-4a1d-ae87-78e4fef82553","year":2014},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.628687Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:886c7667d1cd56b210dc902229a1740f9589a8f69e5b99246a0f098d8a96bf5f","observation_id":"718fcc5a-0929-48ec-87dc-741f5e1ae793","resolution":{"observed_at":"2026-08-12T15:22:00.754870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.732925Z","title":"A complexity dichotomy and a new boundary class for the dominating set problem","venue":null,"work_id":"5609cca5-7923-4749-9bac-d3e150200ac0","year":2016},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.632282Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:9e60114c0b2a3a005c93ee15ca22f49492770eb345aee334c16ef3cfe833dd1a","observation_id":"4d9e0d77-edbb-4162-bd11-d2787660e761","resolution":{"observed_at":"2026-08-12T15:22:00.739146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.719868Z","title":"Boundary classes for graph problems involving non-local properties","venue":null,"work_id":"daa9a48a-a9fb-4d34-a811-d9188b168cea","year":2017},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.636145Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:1d8d4a361594587ab8d4143f8acc97acf30d9e8c368030390578d38504880014","observation_id":"ce522f8e-d414-47ef-892d-ffb1a6417878","resolution":{"observed_at":"2026-08-12T15:22:00.724092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.705458Z","title":"Role colouring graphs in hereditary classes","venue":null,"work_id":"b23cf487-c825-423b-9c5a-c731d1c7637f","year":2021},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.640237Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:90188189e9489696ec617a4af0cce94efee5c94284b5fa1bcffd40c04d68e92d","observation_id":"09f8618d-829e-4d11-a4a7-c4aa71e6d1fb","resolution":{"observed_at":"2026-08-12T15:22:00.711252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:22:00.644868Z","title":"Introduction to the Theory of Computation","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.644868Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:bf149e04ef0ab6e5e936ff6ce58c490ea2d9c2905716e00238aaffd4a71b8e13","observation_id":"84b38e82-2e08-46b8-9ba7-97ef7ebb6502","resolution":{"observed_at":"2026-08-12T15:22:00.644868Z","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-12T15:22:00.681220Z","title":"Introduction to Graph Theory","venue":null,"work_id":"9b98bcba-69dd-404c-ae57-1e20b40b873d","year":2001},"citing_paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T15:22:00.649615Z"},"links":{"citing_paper":"/paper/2411.14553"},"observation_digest":"sha256:516c39429040765a955c65d1a597f5af33018199c8ae84741db071809a711cdf","observation_id":"ac6e945c-edf8-46ed-8729-33318fb32b48","resolution":{"observed_at":"2026-08-12T15:22:00.686520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2411.14553","last_updated":"2025-08-08T08:11:59Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T15:06:56.524857Z","submitted_at":"2024-11-21T19:49:33Z","title":"Reducibility among NP-Hard graph problems and boundary classes"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":21},"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 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2411.14553."}