{"as_of":"2026-08-20T08:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f87e02b9c8bda6a00201b57601f41b43c3ce51728c9be75e3de38694e2f41f5d","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-01T02:32:27.256827Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2606.31873/citation-record","integrity":"/paper/2606.31873/integrity","json":"/paper/2606.31873/citation-record.json","paper":"/paper/2606.31873"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2019.02.030","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast exact algorithms for some connectivity problems parameterized by clique-width , journal =","venue":"Theoretical Computer Science","work_id":"e670fe31-5e7c-4728-8be0-7d415e9280c1","year":2019},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:ad4dff8d9ba89abfa35fafa2c3a43214245c275b1aac6db5a4b482167e80af1b","observation_id":"4b8e4340-dda1-4746-815b-2ccaaa8904bf","resolution":{"observed_at":"2026-07-01T02:35:15.806975Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:09.789251+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:09.789251+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-019-00663-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1007/S00453-019-00663-9","venue":"Algorithmica","work_id":"36d7d49d-5f11-421d-9607-3f6eae6d4db3","year":2023},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:a18bf4013bb237f28f3a72e6476ada138f92c888ac504e17360448aabb25fe19","observation_id":"f08cf39b-e640-471c-ae03-a700156a4604","resolution":{"observed_at":"2026-07-01T02:35:15.827259Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2023.11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"4 Hans L","venue":"arXiv (Cornell University)","work_id":"31f6d6ef-5cac-41e5-b259-f88bc9c39d79","year":2023},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:a27470a81a6f12e349cfa08a3eb8ef50820d4b75302b5dcaa8ae4dce78083bc3","observation_id":"24e339b4-d2cb-46bc-b4d7-b5a9731e3388","resolution":{"observed_at":"2026-07-01T02:35:15.816162Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno","venue":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","work_id":"b4fc9e91-7fe2-4ebf-8b5d-fdb12379e17e","year":2014},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:f1601471c25ff8034c1610345bea33df011b35388b13f270bea29764a435e6a8","observation_id":"d831939f-2ced-43d6-8eac-b15754e5d603","resolution":{"observed_at":"2026-07-01T02:35:15.814607Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2025.13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"6 NarekBojikianandStefanKratsch","venue":"ArXiv.org","work_id":"458df781-4d65-49fd-81b5-519fcd130eca","year":2025},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:9bde1853891aa04512c812492fe2452085f40f1d99632cd1fcfdc09ca9996283","observation_id":"0eb3d8c6-d2c0-4cab-b8ee-1c33447d0dfb","resolution":{"observed_at":"2026-07-01T02:35:15.817784Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2024.29","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"7 Narek Bojikian and Stefan Kratsch","venue":"arXiv (Cornell University)","work_id":"011bfa30-1c42-4ea1-b0bf-efca9facf680","year":2024},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:e7b84c849a0c9ea2841e6f94842446b87e1cc7c2a9f0799af7073bb763b2cb99","observation_id":"aba28c97-fcab-4a06-9b9a-1be90ae38493","resolution":{"observed_at":"2026-07-01T02:35:15.808944Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ipec.2025.19","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"8 Narek Bojikian and Stefan Kratsch","venue":"arXiv (Cornell University)","work_id":"68655f89-4855-4f43-aa71-21abce9298ef","year":2025},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:4d3b6ab3a9613dd9e96bd23ab9fb83133894915450ac2687b6f7bf0dcf5625c6","observation_id":"f7375f55-f540-4ab0-a574-250878c6f9b1","resolution":{"observed_at":"2026-07-01T02:35:15.802668Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2512","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T06:55:28.507620Z","title":"Mathematical framing for different agent strategies","venue":null,"work_id":"722a33a4-c559-4a7d-89b3-de3b2178dc38","year":2025},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:00b43421856839528cf1146758238a73e074d3e9603c30af96891f4d0c24bd11","observation_id":"7505389e-a9de-410d-beb1-13e7050d435e","resolution":{"observed_at":"2026-07-01T02:35:15.823925Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-20T14:22:21.575176+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T14:22:21.575176+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2023.35","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"10 Bruno Courcelle, Johann A","venue":"arXiv (Cornell University)","work_id":"1b33896a-514d-4f32-bf0e-0beaa708d899","year":2023},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:dc2b82a8cf70e292338f8fe7750a9ce4c70ef74f1387ab5f0df4331b50d9eabd","observation_id":"e349ae54-3a79-4448-9637-89caf170249f","resolution":{"observed_at":"2026-07-01T02:35:15.812347Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s002249910009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Makowsky, and Udi Rotics","venue":"Theory of Computing Systems","work_id":"ae7b5a1b-0cca-413f-a366-73f0f44e886b","year":2000},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:4dd6a0b2bcf7374151993b6bdc6f5ad34a00436cd6fa77d96037b4641beba03f","observation_id":"6f54be7e-02d9-490f-87e4-8007c323af43","resolution":{"observed_at":"2026-07-01T02:35:15.821548Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-10T19:49:13.918945+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T19:49:13.918945+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-21275-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T15:17:21.616227Z","title":"6 Josep Díaz, Olli Pottonen, Maria J","venue":null,"work_id":"cc8dcfd4-029e-42d3-9ba1-999221a6d688","year":2015},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:525e0e538a42a61b387c98abb866e438e46c3125ab263149bd7fd8994f9c762a","observation_id":"9cfecfab-4684-4e82-8c8a-887c972bc275","resolution":{"observed_at":"2026-07-01T02:35:15.830263Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.829959+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.829959+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-54423-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Springer, 2014.doi:10.1007/978-3-642-54423-1\\ _7","venue":"Lecture notes in computer science","work_id":"2b776664-7661-4e01-bf7b-5fc5a6a742ed","year":2014},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:0d12543e49496cae522fa71e802e3c6fc0f148e18c026faa08aabe366c28b6cb","observation_id":"79c407b3-5618-42a2-924f-43256472a6d0","resolution":{"observed_at":"2026-07-01T02:35:15.810532Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2017.14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"17 Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, and Kirill Simonov","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"8a87d8fd-a580-432f-adbf-379abc95ddb4","year":2017},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:bebf007e57ee71d42e805b7b4758c5d42eeb025c5241798a341f322dc2b7cb66","observation_id":"611b94cd-ac79-4008-9116-0b510989c13f","resolution":{"observed_at":"2026-07-01T02:35:15.825756Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-023-10132-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"21 Ojvind Johansson","venue":"Theory of Computing Systems","work_id":"306327c7-e535-4742-a84f-d9de07fd0139","year":null},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:e712a8a3b01e22580208cbbe791335b4f47f2a51afcc807cba6a3fa5eb522b9c","observation_id":"3e3a43f2-8086-4503-97b8-254b7fc478ec","resolution":{"observed_at":"2026-07-01T02:35:15.819357Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0166-218x(02)00198-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"23 Daniel Kobler and Udi Rotics","venue":"Discrete Applied Mathematics","work_id":"e88d942d-c399-44af-b9a1-587f63c21c11","year":2020},"citing_paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-01T02:32:27.256827Z"},"links":{"citing_paper":"/paper/2606.31873"},"observation_digest":"sha256:ee35f24ed353724aa23fc50d66d799aa707a7ad28ae4bfb7c0238db475284f83","observation_id":"7754434e-688d-4c8a-b0f5-5cc262b86ecf","resolution":{"observed_at":"2026-07-01T02:35:15.805490Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.31873","last_updated":"2026-06-30T15:57:21Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T06:22:37.204984Z","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":0,"verified_exact":12,"verified_fuzzy":0},"total_outbound_references":15},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2606.31873."}