{"as_of":"2026-08-16T10:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:60bbac60c428c0d2957815c3eef69d62710eccba4aa77b5f10fc2f00633aa80b","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-14T13:16:51.858184Z","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-16T06:30:59.297886+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/1908.05983/citation-record","integrity":"/paper/1908.05983/integrity","json":"/paper/1908.05983/citation-record.json","paper":"/paper/1908.05983"},"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-14T13:16:52.221674Z","title":"Aharoni and D","venue":null,"work_id":"4820b0f5-3d00-4742-a120-4c9c74362790","year":2017},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.752315Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:183ca6c90527bdf1e386d71cb24ee2182e23e0b06ad3376c8e4cfc48b7c84fbf","observation_id":"a1f555ae-0848-457c-ba6a-df0d8f8b6a6a","resolution":{"observed_at":"2026-08-14T13:16:52.225934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.205805Z","title":"Alon and C","venue":null,"work_id":"630d075d-ea9f-4c0a-ac93-ae3efaca1fb9","year":2016},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.758720Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:1f053c05580bcfdb82d85b1622413cde97758ea23cb7147c545df73ef2cb98ab","observation_id":"403e9100-34da-4eef-8775-7e6a1dd1323c","resolution":{"observed_at":"2026-08-14T13:16:52.210897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.189168Z","title":"Bennett, S","venue":null,"work_id":"70039f53-d0b6-4cf3-b1ff-2e9437fe580c","year":2019},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.764857Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:c89bc21e682afa5baef7fafa3cd84dbb9a3e2997f0a49bd95914cc8a4d2be198","observation_id":"27069dba-51f8-4214-a69c-87763388b187","resolution":{"observed_at":"2026-08-14T13:16:52.194494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.172601Z","title":"Bollob´ as, On genaralized graphs, Acta Math","venue":null,"work_id":"c42bce6d-3632-441a-909d-c25c6445cd3e","year":1965},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.769968Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:9f3abda97307d6746400a1834780b3e48b3c5cbb9211b5b044a8ec258ddb44b5","observation_id":"698dc6b8-d32e-4b11-b45d-51bcbc5e7a4f","resolution":{"observed_at":"2026-08-14T13:16:52.178611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.156565Z","title":"Bollob´ as, D","venue":null,"work_id":"eff4825c-35d9-43bf-8cdb-1fc21a82be2e","year":1976},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.775434Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:c9820dbc725ff12fb6aeb94e75c1fe4ddffd384b017d7cbed1a04ad61a9ff045","observation_id":"1ed23f87-8f90-41b7-9f80-a95067b3baea","resolution":{"observed_at":"2026-08-14T13:16:52.161720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.141328Z","title":"De Silva, K","venue":null,"work_id":"f33d6b95-b707-4e3a-a529-3e89ec9665a6","year":2018},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.781403Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:23e84e917cc7ba0738a135dfe6aa5237505f48d32157d67d93548f121b247d28","observation_id":"895d6619-d9a3-477d-a6dc-e8b1a3c8f4d1","resolution":{"observed_at":"2026-08-14T13:16:52.145749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.126488Z","title":"Erd˝ os, A problem on independent r-tuples, Ann","venue":null,"work_id":"3e12b205-90bd-4f03-af2c-96f749f7f419","year":1965},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.787110Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:708ec258295465296ac340df9789d13e4bebc270e9afd3040dcde0b8df5fd077","observation_id":"e985064e-af5f-4d94-b7b7-70e282749f9d","resolution":{"observed_at":"2026-08-14T13:16:52.131603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.110475Z","title":"Frankl, An extremal problem for two families of sets, E uropean J","venue":null,"work_id":"cfa84922-d622-4419-98df-f31aa29606c9","year":1982},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.792380Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:680aa6c0f5664e3918672848db1c63e4d3b2b63818154e893cf0a84f6283b03c","observation_id":"c3e2970b-0aa9-4fe1-b475-031a666a0698","resolution":{"observed_at":"2026-08-14T13:16:52.115499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.094170Z","title":"Frankl, The shifting technique in extremal set theory , Surv","venue":null,"work_id":"6c240f53-70ac-42f3-a18c-54746a00509c","year":1987},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.797730Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:4afadc44361db5ef7584df6b1b42b8995695ffa4a38cb2f6bf0e9bd62f20d2b9","observation_id":"7c2bb250-5752-4709-b939-dd91d441cc0d","resolution":{"observed_at":"2026-08-14T13:16:52.100158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.077702Z","title":"Frankl, V","venue":null,"work_id":"1aa45884-e4de-41c1-8a14-10c5a4acfcbc","year":2012},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.802867Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:2cebd098c1f106b9dbe02b24669595f95de69125b773565a7cddffa674e49f69","observation_id":"e5ee8e68-8cf1-4697-abc2-2c165fea81e9","resolution":{"observed_at":"2026-08-14T13:16:52.083372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.061588Z","title":"Frankl, Improved bounds for Erd˝ os’ matching conjecture, J","venue":null,"work_id":"8a462e0f-ec89-4a3b-94ec-6ef26757ae50","year":2013},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.807274Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:fb0c553585006213eb3ed20c42e9f9c84840a854dbcb96ad4b497d7ec71469a9","observation_id":"20ea1031-4d3c-4022-898a-b5f3a26822a8","resolution":{"observed_at":"2026-08-14T13:16:52.066833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.045028Z","title":"Frankl, On the maximum number of edges in a hypergraph with given matching number, Discrete Appl","venue":null,"work_id":"c3282738-fda4-4609-ad8f-1549c9d7472e","year":2017},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.812021Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:279942c8404d69d847d983df354ee8874dd517e39bd5fb91f1f42136a603184e","observation_id":"08af1b35-bc89-41c0-b326-12b5d636fe30","resolution":{"observed_at":"2026-08-14T13:16:52.050377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.029383Z","title":"Glebov, B","venue":null,"work_id":"7673b847-14d6-4d1e-95f4-0734abc0c2d6","year":2014},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.816502Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:00620b2ff9fea0a42d8c94c95cfa931b97efbbf83b93a87163001ae652d9c20c","observation_id":"7eb80012-3b4b-4e1b-9695-570511cfd0c9","resolution":{"observed_at":"2026-08-14T13:16:52.034493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01812","last_updated":"2021-11-21T14:30:05Z","snapshot_observed_at":"2026-08-14T16:20:44.744753Z","submitted_at":"2019-06-05T03:46:27Z","title":"Tur\\'an number of disjoint triangles in 4-partite graphs","version":4},"cited_work":{"arxiv_id":"1906.01812","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.01812","snapshot_observed_at":"2026-08-14T13:16:51.910102Z","title":"Tur\\'an number of disjoint triangles in 4-partite graphs","venue":"math.CO","work_id":"7891fbee-5fb7-4a85-99da-5b025282da89","year":2019},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.821317Z"},"links":{"cited_paper":"/paper/1906.01812","citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:955d5c4820c9074c83734eddd6be3432d9da5a1b328f7cce32be9f0a447fdb7f","observation_id":"053e2a35-4631-4347-976a-9fbd4668bb47","resolution":{"observed_at":"2026-08-14T13:16:51.917534Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:52.012686Z","title":"Keevash, Hypergraph Tur´ an problems, Surv","venue":null,"work_id":"bcfec820-0ce0-4ce1-bec0-b356122fa92b","year":2011},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.826618Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:068e4b84dab4a831c7337a3d15d191b4fc33f8206892e3733775d6505e1657f1","observation_id":"4a85c59e-b865-459c-8da8-e3663477615a","resolution":{"observed_at":"2026-08-14T13:16:52.018513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:51.831755Z","title":"Ma and Y","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.831755Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:f8c14446b01e26e7011a290bd83c553a7ed6db0adc2dc8cc25d708d23ddcb065","observation_id":"ca029831-c9a4-4a02-9c2a-8d4b97569059","resolution":{"observed_at":"2026-08-14T13:16:51.831755Z","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-14T13:16:51.994845Z","title":"Mantel, Problem 28, Wiskundige Opgaven 10 (1907) 60– 61","venue":null,"work_id":"5333bfe2-2d59-41c5-826a-d9d1d2c0f242","year":1907},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.837081Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:a9ef42b31a58c0224282cf72f5a1216e7d69fe8753a74a22d621ab9ecc62b890","observation_id":"5a56c750-34ae-48b8-9ae9-6ca1d935bdd0","resolution":{"observed_at":"2026-08-14T13:16:51.999810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:51.977960Z","title":"Sidorenko, What we know and what we do not know about Tu r´ an numbers, Graphs Combin","venue":null,"work_id":"d79abdb1-e70b-4f2b-a93f-8854903a7543","year":1995},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.842068Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:1219a20198ffd72419816c8952f4e5e850bda2b915bcf52788c01526b8571737","observation_id":"d9506f06-b65e-462b-a77e-a5f5747d79be","resolution":{"observed_at":"2026-08-14T13:16:51.983348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:51.962388Z","title":"Tur´ an, On an extremal problem in graph theory, (Hung arian), Mat","venue":null,"work_id":"1932ae97-49b2-47e7-9dc6-0a9c1ca44aed","year":1941},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.846928Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:c9c12d91e856d9aa7c83cfc5eb75f39405ade105f78dc6b732b376dd8206c2fc","observation_id":"aac6fa4b-5c89-4d22-b77d-3649607ac95b","resolution":{"observed_at":"2026-08-14T13:16:51.967238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:51.945938Z","title":"Zykov, On some properties of linear complexes, Mat","venue":null,"work_id":"0aeefea3-839d-4ee2-952c-d03b23cb2cd6","year":1949},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.851504Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:d6077c71795be996dc2c04a903d497696d533d974542ed65222e1abc0c93d410","observation_id":"f00710ac-5778-41c0-96ca-ffd272842a2b","resolution":{"observed_at":"2026-08-14T13:16:51.950949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:16:51.929431Z","title":"For any u ∈ V (G) and S ⊂ V (G), let d(u, S ) be the number of neighbors of u in S","venue":null,"work_id":"3d7be7fd-b6e5-4fd2-a75d-73321f744aa7","year":null},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.858184Z"},"links":{"citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:d2ce5d66e6ec0e18999fe6509c14c454bf76b44be2e1476677a61097e2bcf5d3","observation_id":"033228b8-59b5-4050-8783-3ec05e45f465","resolution":{"observed_at":"2026-08-14T13:16:51.934648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T03:37:31.988015Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:1908.05983."}