{"as_of":"2026-08-24T02:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6c317aaad6250168935d7307bffda64fdc6bd9891f6fcb8c5079650885f6243","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:43:07.126243Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T07:14:46.418798Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T07:17:29.263064Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"cited_work":{"arxiv_id":"2505.14386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14386","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gerbner and S","venue":null,"work_id":"4acc57a5-8562-468d-923b-77283b4122da","year":2025},"citing_paper":{"arxiv_id":"2605.01768","last_updated":"2026-05-12T16:16:41Z","snapshot_observed_at":"2026-08-12T22:44:15.587975Z","submitted_at":"2026-05-03T08:02:11Z","title":"Hypergraph extensions of the Alon--Frankl Theorem and rainbow Tur\\'an problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-09T17:30:02.514261Z"},"links":{"cited_paper":"/paper/2505.14386","citing_paper":"/paper/2605.01768"},"observation_digest":"sha256:a1290b3d06d74a2773b08837f82cf423ccf0fb1029842ba366032b024f09b4dd","observation_id":"bfe6065f-0d18-428a-b12d-6294f2d5c4d7","resolution":{"observed_at":"2026-05-11T16:21:06.636814Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"cited_work":{"arxiv_id":"2505.14386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14386","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gerbner and S","venue":null,"work_id":"4acc57a5-8562-468d-923b-77283b4122da","year":2025},"citing_paper":{"arxiv_id":"2605.01768","last_updated":"2026-05-12T16:16:41Z","snapshot_observed_at":"2026-08-12T22:44:15.587975Z","submitted_at":"2026-05-03T08:02:11Z","title":"Hypergraph extensions of the Alon--Frankl Theorem and rainbow Tur\\'an problems","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T07:14:46.418798Z"},"links":{"cited_paper":"/paper/2505.14386","citing_paper":"/paper/2605.01768"},"observation_digest":"sha256:8ebe36b83420bcdc0369097ecad2ff315a7329137a7b9fd530782736234bbded","observation_id":"d08ba8de-34d1-4dce-9882-979fb7d801af","resolution":{"observed_at":"2026-05-13T07:17:29.266262Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.14386/citation-record","integrity":"/paper/2505.14386/integrity","json":"/paper/2505.14386/citation-record.json","paper":"/paper/2505.14386"},"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-07T15:43:10.576743Z","title":"Aharoni, E","venue":null,"work_id":"70c3a07d-150a-4f18-8e8d-fc1b2636e4ee","year":2019},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:04.888650Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:f62d89b88c3ca44d1847a587163e4208a0a05d432c9cf965eec3b068194e88ae","observation_id":"e1c16a00-f0c0-4005-880e-e85becdf8e45","resolution":{"observed_at":"2026-08-07T15:43:10.722910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:10.309356Z","title":"Aharoni, M","venue":null,"work_id":"bbb9de0b-5914-4e39-9284-0986bcb00cdc","year":2020},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:04.968654Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:9052e680a17a3aa63bcdce2c4f43f020bced1bff181641fabfc15695e3eddbb7","observation_id":"805e6b26-04a4-41aa-bca8-58184c2a8180","resolution":{"observed_at":"2026-08-07T15:43:10.407796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:10.082474Z","title":"Aharoni, and D","venue":null,"work_id":"5baed2ec-7398-46d3-8700-89db60c2dbf3","year":2011},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:05.081092Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:521338462150f204bacb71b24f716bb0017663250bf635282412d23dbae726a4","observation_id":"99025ca3-d09f-431f-968e-5feb79b6e7c8","resolution":{"observed_at":"2026-08-07T15:43:10.172135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:09.894350Z","title":"Alon, and P","venue":null,"work_id":"07f11eee-7907-4387-8406-5a735710288c","year":2024},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:05.244860Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:44ca626e0aff85ff7b758db40c1079379a943ad83726e017e26501ffea27c3ea","observation_id":"e3e34774-611c-443a-9eea-3031640be9c0","resolution":{"observed_at":"2026-08-07T15:43:10.001881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:09.710487Z","title":"Chv´ atal, and D","venue":null,"work_id":"3eee6697-f3c6-44c5-9c06-cb98e5a5a619","year":1976},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:05.372108Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:4933cfbf6b99b1b602275975dd5a5447f3c07ab9965012a0943915a62d591e47","observation_id":"cf4abf00-647b-4a5e-a7c7-9d0ed267271b","resolution":{"observed_at":"2026-08-07T15:43:09.796851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:09.413005Z","title":"Erd˝ os, Extremal problems in graph theory, In Theory of graphs and its applications, Proc","venue":null,"work_id":"a547b343-f73e-4931-8fcd-1a3b17e0475f","year":1964},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:05.457666Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:a5eae5d82969ff295ee1ad2e735094c2c82e34f4d0c615ec7d2162561a03305c","observation_id":"612bee3a-3fe6-42f6-97cb-07af4e9cafbe","resolution":{"observed_at":"2026-08-07T15:43:09.534733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:09.213786Z","title":"Erd˝ os, and T","venue":null,"work_id":"ee3b9210-c988-4cf7-93bf-74a2e759b2fe","year":1959},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:05.552724Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:2f90dc7a68a55e3e5f269568c938e99525b17b20b0f9a37bdf40cc670420e228","observation_id":"2307dd60-4495-4667-862d-c621f29a7740","resolution":{"observed_at":"2026-08-07T15:43:09.283036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:08.979643Z","title":"Falgas-Ravry, K","venue":null,"work_id":"fb378b53-3d22-432f-82ed-d04bab3e04e1","year":2024},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:05.684400Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:ebf567be83abb05622a84181c5c8bf6a2e12d45a07ad5ea39df772e4c6f21ddf","observation_id":"60474f14-c929-4103-9de5-980fd4603556","resolution":{"observed_at":"2026-08-07T15:43:09.112171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07768","last_updated":"2022-03-15T10:41:30Z","snapshot_observed_at":"2026-08-16T17:14:29.072247Z","submitted_at":"2022-03-15T10:41:30Z","title":"Graphs without rainbow triangles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07768","snapshot_observed_at":"2026-08-07T15:43:05.916619Z","title":"Frankl, Graphs without rainbow triangles, arXiv preprint, arX iv:2203.07768","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:05.916619Z"},"links":{"cited_paper":"/paper/2203.07768","citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:7cde1b4feff63a3f3cfa06763b653be92a62f62bcad6729daf4adfa0757ed8d9","observation_id":"ba076c46-2445-4c3e-b949-7538c5bc5018","resolution":{"observed_at":"2026-08-07T15:43:05.916619Z","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-07T15:43:08.730756Z","title":"F¨ uredi, and M","venue":null,"work_id":"475be0f1-9656-4745-97f4-b0e67c16ffa8","year":2013},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:06.055075Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:ddb20ce473cb1b84b140539486a191070b4744e2fd4357e8689f0da4b4427c3e","observation_id":"4fe92f2a-6038-46d1-90ae-41ba9c9fad77","resolution":{"observed_at":"2026-08-07T15:43:08.822250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:08.538247Z","title":"Gerbner, On Tur´ an problems with bounded matching number , J","venue":null,"work_id":"a3f0c13c-d45f-4cf2-a94f-ee65560e7398","year":2023},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:06.239737Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:548cfa8242ffe2fe4a849f13d3a841b9979d3faf26e0c776c558c336783c162f","observation_id":"dcea90ad-6d16-4433-bcd1-c5be7c59e0f9","resolution":{"observed_at":"2026-08-07T15:43:08.634741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:08.302849Z","title":null,"venue":null,"work_id":"b7c72175-7353-4de7-b6ff-821540a2f0b1","year":2024},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:06.340503Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:bd1a0f4c96fce1e71aad84cf6502073393147aa38384bb616d93f06f0d0b0e15","observation_id":"b092f9c4-d4a2-4836-94df-81b955e5b174","resolution":{"observed_at":"2026-08-07T15:43:08.446432Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:08.070009Z","title":"Keevash, D","venue":null,"work_id":"a7676ea4-842d-4ab8-9fd8-e5fb230c23fb","year":2007},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:06.549700Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:1440bc760df78d7296a6a491d331b7f9399747d7b90e7252b99613178afb0988","observation_id":"2b40f51e-acf4-44da-8f6d-fd8cf932a3f6","resolution":{"observed_at":"2026-08-07T15:43:08.196397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:07.861844Z","title":"Keevash, M","venue":null,"work_id":"39a3cf1b-dc84-46bf-88c5-f69ce3eaa2fd","year":2004},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:06.728601Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:f92bb5fbab29ce7d789c78ad409b9fb57c88abc933c3bbbd8f644306d404290d","observation_id":"84ec300b-296a-4cea-9f87-9f635b0ac688","resolution":{"observed_at":"2026-08-07T15:43:07.989467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T15:43:07.655594Z","title":"K˝ ov´ ari, V","venue":null,"work_id":"1f26fb95-e409-45e2-aa87-6270efce51c4","year":1954},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:06.866690Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:9f4cfb4b476dca8c46d9c21146f7c04d1b38b84e4d74a2297705bb5ef5856893","observation_id":"9ced5bc0-6019-4f87-ba2b-0448d1328dc7","resolution":{"observed_at":"2026-08-07T15:43:07.764508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01121","last_updated":"2026-04-14T09:41:42Z","snapshot_observed_at":"2026-08-20T15:56:14.400935Z","submitted_at":"2024-12-02T04:47:44Z","title":"Transversal Structures in Graph Systems: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01121","snapshot_observed_at":"2026-08-07T15:43:06.975682Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:06.975682Z"},"links":{"cited_paper":"/paper/2412.01121","citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:9d21262bd37f62b5ab6c57144688e122c80b35448264c1f0b39fd5c186523905","observation_id":"9e4f46a4-eebb-4185-b067-debcd57fe38a","resolution":{"observed_at":"2026-08-07T15:43:06.975682Z","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-07T15:43:07.396327Z","title":"Tur´ an, Egy gr´ afelm´ eleti sz´ els˝ o´ ert´ ekfeladatr´ ol,Mat","venue":null,"work_id":"9c40a907-3bd0-45d1-ae81-fa499d28cdc1","year":1941},"citing_paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:07.126243Z"},"links":{"citing_paper":"/paper/2505.14386"},"observation_digest":"sha256:06ce51a741f5038abf45e418442e440774025a138c05fb4f981bac89ddb84d77","observation_id":"36f101cf-89af-4042-b487-cee9b94dd890","resolution":{"observed_at":"2026-08-07T15:43:07.552664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14386","last_updated":"2025-05-20T14:07:43Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-08T07:34:27.856286Z","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":17},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 2 inbound Pith citation observations for arXiv:2505.14386."}