{"as_of":"2026-08-16T13:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9205d83095b94bacdd17345ebe9cbad46ece191d9f32602cec43b7c161dd482e","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:57:05.046615Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"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.04654/citation-record","integrity":"/paper/1908.04654/integrity","json":"/paper/1908.04654/citation-record.json","paper":"/paper/1908.04654"},"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:57:05.258333Z","title":"Aichholzer","venue":null,"work_id":"a5641d1f-cb5f-4c9b-812b-1ca9c0d138a5","year":null},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:04.986199Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:7a9872628a9c71047517c23ff9606e8bf6be41f07a0f4899f450235eba10ef1b","observation_id":"1e9aacba-3a7f-46b2-b97a-5a501bcaa54f","resolution":{"observed_at":"2026-08-14T13:57:05.261492Z","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:57:05.249972Z","title":"Aichholzer, F","venue":null,"work_id":"a5e34628-7bfb-421d-a0c0-dbcc7ef70b38","year":2002},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:04.989692Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:38fb10b49ab23c83690d4dda7daabfc2f0c9f2f4e0fc6795cb0df6c32b34f979","observation_id":"f5f01072-b265-44fa-9640-03eba4a5fa31","resolution":{"observed_at":"2026-08-14T13:57:05.253085Z","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:57:05.239798Z","title":"Akiyama and N","venue":null,"work_id":"fe62e927-422a-4ccf-aced-b6c4250037fb","year":1989},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:04.992586Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:5b48161ab5044169c9997d9dfd9df702667ef1ef10de213d26db478300293070","observation_id":"6ed08394-879b-41ac-89de-1059cba5cde5","resolution":{"observed_at":"2026-08-14T13:57:05.243732Z","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:57:05.230945Z","title":"Anshu, R","venue":null,"work_id":"364424ee-df3b-47f0-9d5f-a2684d068965","year":2017},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:04.995606Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:cae560bfa44b14d088386c88198b0d4d8a2fafbb08ad3e61ba0f946d40a5c8f2","observation_id":"2cc9ed9c-99fb-4ca8-b097-08d842ba4c9a","resolution":{"observed_at":"2026-08-14T13:57:05.234019Z","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:57:05.222278Z","title":null,"venue":null,"work_id":"e0d1f9a5-32a3-4f24-897f-cff76a87b060","year":2016},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:04.998563Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:32d65e536fb75d5855820dd18349aefbafc55ed07aaeefa34309d378b588ab74","observation_id":"4f89929e-74fe-4c62-a24b-2b0736d55871","resolution":{"observed_at":"2026-08-14T13:57:05.225387Z","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:57:05.213999Z","title":null,"venue":null,"work_id":"de498ac5-3e32-42ba-9143-3fd6261b2e6d","year":1973},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.001420Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:6b6e0c82e97f598941824c7070826cdb3406fd895a08339927c2757ef7201274","observation_id":"ac16c0b0-019b-452e-b8ac-b0989517866f","resolution":{"observed_at":"2026-08-14T13:57:05.216846Z","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:57:05.206150Z","title":"Bisztriczky and V","venue":null,"work_id":"2389c4b1-7619-4393-ae26-1b7bc52ffc60","year":1994},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.004773Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:dffbecb30373887fc9e9ea21167fd759f6afa535b315fe56f1c8fbe8dbe4a991","observation_id":"d092af0b-6762-4200-bb55-45022e817479","resolution":{"observed_at":"2026-08-14T13:57:05.209446Z","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:57:05.197438Z","title":null,"venue":null,"work_id":"add6c1a8-1a6d-4f75-9ab8-0ab022782d6a","year":1996},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.007971Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:63a4540218834899d729b6ea5c6909e3553dd95bc00e0301f91c1114c7adf093","observation_id":"050e7f51-79f3-44b8-98ec-d779577ab982","resolution":{"observed_at":"2026-08-14T13:57:05.200735Z","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:57:05.186743Z","title":null,"venue":null,"work_id":"13377222-e181-4393-9e4f-8c8ddd6201b2","year":1956},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.010541Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:1d7679d6cafe9d59b42342b8e32ba99a08c21aaf9e4853ff5b5a6c49b19f87c0","observation_id":"f5025e6c-519d-4eea-a5b6-f9e028022de1","resolution":{"observed_at":"2026-08-14T13:57:05.190972Z","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":"1806.02574","last_updated":"2019-10-28T09:20:35Z","snapshot_observed_at":"2026-08-14T19:06:33.534736Z","submitted_at":"2018-06-07T09:20:26Z","title":"$k$-Sets and Rectilinear Crossings in Complete Uniform Hypergraphs","version":5},"cited_work":{"arxiv_id":"1806.02574","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.02574","snapshot_observed_at":"2026-08-14T13:57:05.074311Z","title":"$k$-Sets and Rectilinear Crossings in Complete Uniform Hypergraphs","venue":"math.CO","work_id":"ac632ad4-4729-44de-8d53-bc068dfe3ae2","year":2018},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.013637Z"},"links":{"cited_paper":"/paper/1806.02574","citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:ee24ddd7d6e3dbde4eb2360be6335287a633691f9d67e9624b38c1c4f5ee34bb","observation_id":"9241088d-4796-4dda-9139-362f899f327c","resolution":{"observed_at":"2026-08-14T13:57:05.079729Z","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:57:05.175782Z","title":"Gr¨ unbaum","venue":null,"work_id":"a1597495-ad64-4784-846b-2178ad03153f","year":2003},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.017045Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:c9ee4833b6ce705e97aee765b390961ef29377e927ffbdd9581f0d991dcb60a4","observation_id":"5d49914d-39af-4e2b-99c0-9b682057dfb3","resolution":{"observed_at":"2026-08-14T13:57:05.179907Z","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:57:05.165859Z","title":"Matouˇ sek","venue":null,"work_id":"69676845-9f00-48f0-a40e-1a06d78cfff2","year":2002},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.020102Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:ea904d7c226f53cf1a416eb1e8d43a58a7f6dfa41e19a8f1dfaa6d5aa5f1dc1c","observation_id":"96cadaf6-3749-4dc6-a318-01c57923cc29","resolution":{"observed_at":"2026-08-14T13:57:05.168762Z","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:57:05.156018Z","title":"Lov´ asz","venue":null,"work_id":"682742f6-d143-4702-b617-a55585347141","year":1973},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.023714Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:9e58d01b662dc2a4485a2a4932165e551a24cb965cc42e0d247c5a63b59574db","observation_id":"88267427-0dc4-4524-af7c-463d0eb5deff","resolution":{"observed_at":"2026-08-14T13:57:05.160356Z","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:57:05.143914Z","title":null,"venue":null,"work_id":"52af9539-dc58-4346-a60e-29c22a52800a","year":1964},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.026880Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:0bc52c18d511c3570d99b20cc6484c278512239877ec6667596a675b2d00fad2","observation_id":"5fa62a8d-e04d-4b57-b5df-33d74a36dc5e","resolution":{"observed_at":"2026-08-14T13:57:05.149355Z","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:57:05.134284Z","title":"Schaefer","venue":null,"work_id":"c5f5e32d-a3c8-44c9-baf7-e74a200cdc48","year":2013},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.030015Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:43e0e739d73969541f1e5a61e7e624be0100a811ac17a1b0fb10046095db628f","observation_id":"80eba5de-500c-4c25-9885-68274cce3b0e","resolution":{"observed_at":"2026-08-14T13:57:05.137810Z","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:57:05.123888Z","title":"Verbitsky","venue":null,"work_id":"dbe67961-71b4-44d2-ae7d-41f031d64d8f","year":2008},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.033066Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:f037f6cd7d2261e9b3620b1c3504c9c13092c27f1aac92dcac64c103bb1aa8e5","observation_id":"1df779c7-e16f-4e5e-9aab-3d44d23aed28","resolution":{"observed_at":"2026-08-14T13:57:05.127409Z","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:57:05.114108Z","title":"p o i n t _ s e t _ h e x . txt","venue":null,"work_id":"25891771-7521-42cb-b535-aba46d08539c","year":1995},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.036063Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:d5960b461cb993b2d1c59a35b8977be50f1f6338df7618104b4d419482e597c4","observation_id":"db0eaaaa-8bf5-4e0f-9081-fc668bae9e01","resolution":{"observed_at":"2026-08-14T13:57:05.117350Z","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:57:05.096451Z","title":"a l l _ p o i n t _ s e t s . txt","venue":null,"work_id":"a27ed33c-6264-4e28-9029-289516346878","year":null},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.043445Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:3ca87ed63c62774b379cd344a6043c86f17d867330d7b64f57e72b1453b8841e","observation_id":"cf3d3206-a1f6-4582-8fd8-4a644b86303c","resolution":{"observed_at":"2026-08-14T13:57:05.099106Z","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:57:05.086496Z","title":"run . mod","venue":null,"work_id":"a0f22c86-001a-42e5-a528-1068fafcf8a9","year":null},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.046615Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:d3ce501a845feffee88a83543ee133e8c43fcec71462d247289f60e411294234","observation_id":"e36bd656-1ca9-4f74-ba12-00b3637fb9c8","resolution":{"observed_at":"2026-08-14T13:57:05.090034Z","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:57:05.104413Z","title":"def run () : # # Reading the file and saving it as a list of strings with open (","venue":null,"work_id":"68bf254c-da63-4777-8c9a-de8fac93cadf","year":null},"citing_paper":{"arxiv_id":"1908.04654","last_updated":"2023-09-20T14:56:51Z","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","version":6},"reference_index":177,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:05.040059Z"},"links":{"citing_paper":"/paper/1908.04654"},"observation_digest":"sha256:4a6eefbf21201dba2ca0edadb31378318eb452348ca631511b2b273f021f5ae0","observation_id":"cd0cec8e-156f-44b9-a139-8ed75308848e","resolution":{"observed_at":"2026-08-14T13:57:05.107889Z","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.04654","last_updated":"2023-09-20T14:56:51Z","latest_version":6,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T06:29:48.302754Z","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":14},"total_outbound_references":20},"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 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.04654."}