{"as_of":"2026-08-11T17:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d71ee472a73e299507dc4b1bf9faf68ea8ded2772e2dca14f4c6bffaf1ba18cf","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:45:45.216676Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2412.19461/citation-record","integrity":"/paper/2412.19461/integrity","json":"/paper/2412.19461/citation-record.json","paper":"/paper/2412.19461"},"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-11T00:45:45.370470Z","title":"Alon and J","venue":null,"work_id":"4292fb02-763a-4d7e-9bf5-ab0eb504748e","year":2016},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.175231Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:5281276d4853bc48b27531e6282cb203f645be8d8437fdb681940b054d4e90c3","observation_id":"230edaa4-1876-47d1-8507-d707305723e3","resolution":{"observed_at":"2026-08-11T00:45:45.373844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T00:45:45.361069Z","title":"Chv´ atal","venue":null,"work_id":"255cc394-9d2c-45c5-942a-56db0e18d14e","year":1977},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.180297Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:3bab2fb2e6147145662221a837da3f04be6efbf1516eabaac9dad294ecd906bc","observation_id":"aa705fd2-871f-4f90-813c-7ec1874bb284","resolution":{"observed_at":"2026-08-11T00:45:45.364359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T00:45:45.350182Z","title":"Cooper and D","venue":null,"work_id":"fa0fbf30-155c-4f31-8477-97e4788f8c1b","year":2017},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.184559Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:7a01b327c11f24cc73f1734b4a4e4b30605f3f843dd7e1500bda1e0004a4c366","observation_id":"bcade9a2-b893-4038-8d60-069932d847cb","resolution":{"observed_at":"2026-08-11T00:45:45.353910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T00:45:45.338287Z","title":null,"venue":null,"work_id":"e198fc0c-b085-44e1-bf4d-867e1b84b78c","year":1964},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.188384Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:4f4c8ca850bc493a0d9d3d4a69762c47e33df59579f0af78c56b5a381a37ceb4","observation_id":"aba4820c-f347-4325-9c49-984da43b4eb3","resolution":{"observed_at":"2026-08-11T00:45:45.342194Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T00:45:45.325320Z","title":"Frankl and Z","venue":null,"work_id":"5ca3b36d-29fd-4b43-b1e8-96d3481778dd","year":1987},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.192277Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:b1527018d6772f6cbc06c5c1112c60fadcb901643bcb917d222e314ac4934646","observation_id":"819ab88a-606f-4b8e-84b4-d15ba587fcbf","resolution":{"observed_at":"2026-08-11T00:45:45.329905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1505.03210","last_updated":"2015-05-13T01:36:19Z","snapshot_observed_at":"2026-07-06T04:17:41.920060Z","submitted_at":"2015-05-13T01:36:19Z","title":"Tur\\'an numbers of hypergraph trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.03210","snapshot_observed_at":"2026-08-11T00:45:45.196150Z","title":"F¨ uredi and T","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.196150Z"},"links":{"cited_paper":"/paper/1505.03210","citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:5bbecd0b684d087b6d5cf40674653893d4a2a6b786d41c5297fce1092a160d38","observation_id":"d0cc13d9-ea58-4c94-a875-8221ad9d3b4a","resolution":{"observed_at":"2026-08-11T00:45:45.196150Z","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-11T00:45:45.312874Z","title":"F¨ uredi, T","venue":null,"work_id":"21415f64-87ac-4b38-aaad-5b5f0fa3ad3b","year":2019},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.200785Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:f432576f2501ad98d310d71868e60fdbb5f393701f729c5dfe5f0ce95ce9e39b","observation_id":"171296ff-f1a0-401f-8214-6467f7071826","resolution":{"observed_at":"2026-08-11T00:45:45.317139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T00:45:45.301107Z","title":"F¨ uredi, T","venue":null,"work_id":"d573b8aa-1d5a-4ab7-9d43-6fda0ae9e79c","year":2020},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.204815Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:8e4c735e9e9efd3b9607a37180ad3f37bdc4ff4faac906a443f505251cbfcdf7","observation_id":"a466e311-419d-43de-a186-ff9ae8d0c943","resolution":{"observed_at":"2026-08-11T00:45:45.305057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T00:45:45.288330Z","title":"F¨ uredi, T","venue":null,"work_id":"0c95440a-233d-429b-bac4-ba4979713a9e","year":2020},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.208847Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:6df53342576fb1d97c9a73bbe7415f7fd4305b1bba926299b33bcb518c39667e","observation_id":"2cbf2b97-9e9f-47aa-b640-604100babe4e","resolution":{"observed_at":"2026-08-11T00:45:45.292549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T00:45:45.275887Z","title":null,"venue":null,"work_id":"2d2063aa-6d51-4cbe-b298-5d9ecc3b9907","year":1986},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.212834Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:88917c3508877c9785f9b64d12ebcea9682cd1e8e0ec5bcb0b73dd8b51d5195b","observation_id":"d2cf06d8-eee5-483f-8da7-7a1603910272","resolution":{"observed_at":"2026-08-11T00:45:45.279897Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T00:45:45.262292Z","title":"R¨ odl and E.ˇSinajov´ a","venue":null,"work_id":"f68acd56-9c9d-4d90-ad3d-6745496f8d72","year":1994},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.216676Z"},"links":{"citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:32d542f2c7fedf47d5e50706c4424288e4625d7cd1567b96e6609379fd78a77e","observation_id":"a0604074-48a8-421c-b323-c5cce3f8cec7","resolution":{"observed_at":"2026-08-11T00:45:45.267260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":11},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2412.19461."}