{"as_of":"2026-08-16T23:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6e47376a0ce3a005120760f89410fc4b32d4a3c5dcae4c4f22aec552001d123","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-14T13:08:50.034068Z","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-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.06333/citation-record","integrity":"/paper/1908.06333/integrity","json":"/paper/1908.06333/citation-record.json","paper":"/paper/1908.06333"},"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:08:51.068677Z","title":null,"venue":null,"work_id":"7f070496-f9b4-4884-94c8-48114a166036","year":2000},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.732177Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:c3abb91979379ec7f70d008fc96b3eecf1e3b3ca3fdfd733f73a0df3310284d4","observation_id":"e0947ab5-b644-47a0-ac6d-9d4072c2e767","resolution":{"observed_at":"2026-08-14T13:08:51.078763Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1709.04079","last_updated":"2018-12-02T02:13:36Z","snapshot_observed_at":"2026-08-14T20:33:48.179145Z","submitted_at":"2017-09-12T22:51:33Z","title":"On the number of linear hypergraphs of large girth","version":2},"cited_work":{"arxiv_id":"1709.04079","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.04079","snapshot_observed_at":"2026-08-14T13:08:50.139121Z","title":"On the number of linear hypergraphs of large girth","venue":"math.CO","work_id":"62d04b4f-b670-4088-9b51-f245c4b905fd","year":2017},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.764573Z"},"links":{"cited_paper":"/paper/1709.04079","citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:a0d5bf5eb18d1d8765ecffbcae2d1b32a74c88ef2f653f7539bfc45ed965b83e","observation_id":"ed26d3ce-03d7-4d1e-8f89-dacdb7979bee","resolution":{"observed_at":"2026-08-14T13:08:50.250621Z","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:08:51.042946Z","title":"Blinovsky and C","venue":null,"work_id":"a71d3c66-1807-48c2-a01a-891b4598eb8a","year":2016},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.787716Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:ec4a3a94e8e2da9ca5848a5f0f4c99bef18f09d57422a2d2f4c1d184d3f4daf7","observation_id":"8d976abf-05c7-4e5d-acc6-5cf2a535f10e","resolution":{"observed_at":"2026-08-14T13:08:51.049451Z","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:08:51.011486Z","title":"Blinovsky and C","venue":null,"work_id":"2fdbd85c-23a3-4acf-9218-0ba8eb37cb22","year":2016},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.803820Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:29ba443aaabad3ac8bea7863e54813b5033b4e3e36265bc7aa05f917742177b5","observation_id":"0f5765f5-5714-42f2-9f54-3947e5c05648","resolution":{"observed_at":"2026-08-14T13:08:51.022098Z","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:08:50.965441Z","title":"Chernoff, A measure of asymptotic efficiency for tests of a hypothesis bases on the sum of observations","venue":null,"work_id":"e90ec674-ab3a-4477-a826-fbc88cfe52df","year":1952},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.854700Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:b2c70b245cc9f91d4b337629f4396a868cf68b3fb5610a8a348878d815438da2","observation_id":"51964219-6c63-41f9-b5e0-c85b7e8efcbb","resolution":{"observed_at":"2026-08-14T13:08:50.976096Z","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:08:50.906634Z","title":"Dudek, A","venue":null,"work_id":"512c9839-a506-4f5e-ac28-920e85ae4e44","year":2013},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.884526Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:2d5cb64bfd2f112d6ba91b750d460c85ebe9233fc37379fb8f02f1ecfd3a4b33","observation_id":"cbbe39d3-700f-4989-8ec9-71849c217d24","resolution":{"observed_at":"2026-08-14T13:08:50.943070Z","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:08:50.853369Z","title":null,"venue":null,"work_id":"369e673b-3316-4f37-8e59-79297ee2a58e","year":1996},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.899260Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:76a5d85058fc21a8ddbdb5de9e7ef68586e751ddb2af9f5e774a16626204db00","observation_id":"1a2e1962-2487-4fd7-bf2c-593194c90dec","resolution":{"observed_at":"2026-08-14T13:08:50.864383Z","resolver_source":"raw_fallback","status":"unresolved"},"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:08:50.795661Z","title":"Greenhill, B","venue":null,"work_id":"61a3f0af-a58c-4767-ae02-41571e738ecc","year":2006},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.909100Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:8ad9b86322995eb83d4611e1d572f999d71bdc5d42834f48cf16a104d650679a","observation_id":"52dfac4f-cf3e-4b09-b26b-72274072b167","resolution":{"observed_at":"2026-08-14T13:08:50.827770Z","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:08:50.645685Z","title":"Greenhill and B","venue":null,"work_id":"d59ca438-4edf-4eea-be8f-93de6bd6cb19","year":2008},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.918037Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:27cec804423462da64a985afb46822eab7667fbd751e3ef4297aac1a645242d4","observation_id":"a8049692-662c-406a-9801-9df6d2dbcc5e","resolution":{"observed_at":"2026-08-14T13:08:50.699885Z","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:08:50.502924Z","title":"Greenhill and B","venue":null,"work_id":"d500a42b-226f-411c-a1cd-629f813eadf7","year":2013},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:49.929495Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:5ee4fabfacc16efa21cb6f9a76a2dfcf47ceae0ad290f2d8a308f2845c9d5982","observation_id":"64f5f938-d56f-41d9-9c35-f01c24555554","resolution":{"observed_at":"2026-08-14T13:08:50.610082Z","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:08:50.303319Z","title":"R¨ odl, On a packing and covering problem,Eur","venue":null,"work_id":"caae49c4-c9c0-4d66-b810-766bb5a93aeb","year":1985},"citing_paper":{"arxiv_id":"1908.06333","last_updated":"2019-08-17T18:47:55Z","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:08:50.034068Z"},"links":{"citing_paper":"/paper/1908.06333"},"observation_digest":"sha256:a3bd4684f4326b67d1bce5e6483cf23650a7de06203b05df2bd3495e92665277","observation_id":"2fd62d24-237b-409d-a14f-b0768477ab9d","resolution":{"observed_at":"2026-08-14T13:08:50.444514Z","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.06333","last_updated":"2019-08-17T18:47:55Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T19:33:07.537882Z","submitted_at":"2019-08-17T18:47:55Z","title":"Asymptotic enumeration of linear hypergraphs with given number of vertices and edges"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"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-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 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:1908.06333."}