{"as_of":"2026-08-13T06:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c5ba3e054035efbce78bb4317326e0b2946cdc03c7cf12f6e6c748e11fbc2c8","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:51:27.531869Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.13985/citation-record","integrity":"/paper/2411.13985/integrity","json":"/paper/2411.13985/citation-record.json","paper":"/paper/2411.13985"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.359299Z","title":"Ramos, and Mary Czerwinski","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.359299Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:9ded9f058eee26856e09935b266e595e2798208d21218c616621a72b822d4723","observation_id":"d5a0a2c9-8477-4e06-a68d-854e5eae673d","resolution":{"observed_at":"2026-08-12T15:51:27.359299Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.368159Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.368159Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:fb561b8c825d57a7b9a6517a9e05c1aab625c2c427014df6348c75d5b08ea785","observation_id":"2f2f77c7-a587-4fc3-92ce-79c9360374ab","resolution":{"observed_at":"2026-08-12T15:51:27.368159Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.373676Z","title":"The complexity of recognizing geometric hypergraphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.373676Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:5b4971b81d5dc55cadb575161e4d7da9d86bbb4f188d40092db82bcda1d5080c","observation_id":"5a5012bd-7044-43b2-b178-680c7a0df066","resolution":{"observed_at":"2026-08-12T15:51:27.373676Z","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":"10.1016/j.jda.2011.12.009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.889117Z","title":"Path-based supports for hypergraphs","venue":null,"work_id":"65c5d55f-8967-4169-9d5c-d2dbadc2994b","year":2012},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.379166Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:8fe573d4a22b3e20d72eef551884199b373a9a1610f1fe979add2922fd0f1109","observation_id":"9e6e6ba9-1fb6-4ddc-8a1c-bf2dfdfc94df","resolution":{"observed_at":"2026-08-12T15:51:27.893592Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00237","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.874801Z","title":"van Kreveld, Henk Meijer, Bettina Speckmann, and Kevin Verbeek","venue":null,"work_id":"f18385a5-5622-45a9-a5ff-98a888e2bea8","year":2011},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.385364Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:392b6d2a454c0ee7b9ab99fdca8559d7955534432241031584440ee29e5c393c","observation_id":"3ef438a7-ed8e-4de9-b7d2-51111fd88e33","resolution":{"observed_at":"2026-08-12T15:51:27.879175Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00499","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.860704Z","title":"Short plane supports for spatial hypergraphs","venue":null,"work_id":"3de7d1da-1e5d-48a5-add1-df7a87540a37","year":2019},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.390075Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:d38e2928da74f51453eaf609fdabcaad7627d4232b6a462c24c3914d5f8c837b","observation_id":"40affeda-9139-4aac-be72-9e2f50c056be","resolution":{"observed_at":"2026-08-12T15:51:27.865822Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/110832033","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.846844Z","title":"Computing the girth of a planar graph in linear time","venue":null,"work_id":"7f78279a-a03b-4ff3-8808-7c6d0c92244d","year":2013},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.395921Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:d02bf075d27457e14eb43eb21594a770797b4e7e67d64378a0e605cbc2d46669","observation_id":"a86c91ce-f032-48c0-aba5-bc12b6dd22f1","resolution":{"observed_at":"2026-08-12T15:51:27.851505Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:28.245826Z","title":"Geometry revisited , volume 19","venue":null,"work_id":"46435fd5-9756-49ed-8cfd-490b331d575f","year":1967},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.400996Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:18003cf35cf6b86333b7c7df5f7b2e01adcf2b0781697c81e1f9f2af5bf1e66d","observation_id":"b3269c8e-0ea8-4ff6-94b6-4f39d2230c23","resolution":{"observed_at":"2026-08-12T15:51:28.250906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-006-0157-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.832836Z","title":"Representations by contact and intersection of segments","venue":null,"work_id":"223163f0-a5e0-41e1-97dc-475d848d1314","year":2007},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.405911Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:6ccf1787efbba8a3cc98c2b3936fb1fd1d59f66e44ef91a9176feed9bd69e663","observation_id":"8aa42f15-9f3c-4704-91f5-16ddea35e3c9","resolution":{"observed_at":"2026-08-12T15:51:27.837506Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:27.410047Z","title":"Representation of planar hypergraphs by contacts of triangles","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.410047Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:615121754e22c0c2bdd2b3c28a1215002508b1ab101f7db418702d6ba32bbb77","observation_id":"474c2811-22aa-48a7-9894-d06809a421a0","resolution":{"observed_at":"2026-08-12T15:51:27.410047Z","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-12T15:51:28.231241Z","title":"Representing hypergraphs by point-line incidences","venue":null,"work_id":"18cb04e9-6f52-4ca8-8716-8a93994e3000","year":2024},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.416015Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:efdba6599735e03002c4cf1277229f4314cc88d27b8d297b72982488fa0cb817","observation_id":"2fa78ba2-e1ad-44e9-9fc3-e23c157a0aae","resolution":{"observed_at":"2026-08-12T15:51:28.236501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:27.420802Z","title":"Kobourov, Debajyoti Mondal, and Martin N \\\" o llenburg","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.420802Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:d2d72de2774763b22a29a6b123b96b7320b36b0952eb89e0286b37d7ddc5bac8","observation_id":"6f23b642-9031-4f8d-a58c-760eb698287d","resolution":{"observed_at":"2026-08-12T15:51:27.420802Z","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":"7290.14972","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:28.162108Z","title":"Testing bipartiteness of geometric intersection graphs","venue":null,"work_id":"dd5cf744-2822-4c25-ab9d-9b41073e6097","year":2009},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.426047Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:ce1cd3acd41a098de6dde0aa2e9cd6533a475a55e61dfc1871ee6276322a4ad5","observation_id":"cb6ac493-c953-4776-84f8-3c318eae5485","resolution":{"observed_at":"2026-08-12T15:51:28.170818Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/dmtcs.11676","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.799773Z","title":"Hypergraph representation via axis-aligned point-subspace cover","venue":null,"work_id":"f3a3be1e-9880-4774-b3da-d03bccd311be","year":2025},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.430790Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:7de5a156853c9ae2ad9a30f9fe42f812e2912032527c57369c947005941cf858","observation_id":"d85d4e03-68ed-4744-912c-52a1f1fd72f6","resolution":{"observed_at":"2026-08-12T15:51:27.805508Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:28.217871Z","title":"Embeddings of configurations","venue":null,"work_id":"8d946f6c-f36f-4286-825d-1e831746ba16","year":2015},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.437796Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:0ec39092758f22d45fe405d8497544ced686651752ccf17942afefb80187a5b1","observation_id":"eb6d07ef-8309-4480-b5ef-abe17c15cd04","resolution":{"observed_at":"2026-08-12T15:51:28.222568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:27.442369Z","title":"Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, and Alexander Wolff","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.442369Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:36f3516e36a567ddfa14852a8b7c4f0461f1db4bac1303e841d470d5836289d8","observation_id":"fc335989-d5f6-44bb-8646-ef42c229cd15","resolution":{"observed_at":"2026-08-12T15:51:27.442369Z","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":"10.1016/s0378-3758(99)00124-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.774265Z","title":null,"venue":null,"work_id":"cc0641f7-bc7a-43f6-9d3b-c01ff6a6233c","year":2000},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.447500Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:aacad386dc8055bd06640923fbcc486c688c049f1f219827f2646c85e343bf08","observation_id":"db0f2a45-0bf9-4eed-b5d1-907b3fc65e9e","resolution":{"observed_at":"2026-08-12T15:51:27.778706Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejc.2007.12.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.761364Z","title":"A planar linear hypergraph whose edges cannot be represented as straight line segments","venue":null,"work_id":"0f09b8fe-1b49-49a5-887d-e4ffa62dc7e5","year":2009},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.453890Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:6b9aa8d01b8333c8a44b37c0e8992a59eeb917ecda7a15ff4bb163808a1bce65","observation_id":"d0318412-54e4-4289-b774-3238f334107e","resolution":{"observed_at":"2026-08-12T15:51:27.765657Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0021810","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.744612Z","title":"The drawing of configurations","venue":null,"work_id":"334be4e6-4191-4453-a18f-156f3428acc4","year":1995},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.458575Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:c274192c6d870662896c55bd932cd32943ef731dbf170ac4c85076ab2377ee66","observation_id":"a927816b-70b6-4550-a316-0bac2bc98ec6","resolution":{"observed_at":"2026-08-12T15:51:27.748675Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0012-365x(96)00327-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.729903Z","title":"Configurations and their realization","venue":null,"work_id":"1e9bc9cd-c8cd-4cd0-ab42-8086200b832f","year":1997},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.464738Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:c8ed69ed1feb3177a503bb0f9062a50acb066915d2f08e2c1f37b93a51bfeb31","observation_id":"28b21871-358f-4697-8fe5-27e07c3ea923","resolution":{"observed_at":"2026-08-12T15:51:27.735300Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:28.206577Z","title":"Configurations of Points and Lines","venue":null,"work_id":"59980f79-ba43-4c7f-8230-cd1431a0155c","year":2009},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.470561Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:00516aa263c06c01fa5d2e7ee0a1996ff737528af3cf9704200d567423e039cb","observation_id":"ea8a55ff-a550-4e16-995c-6fc96c0af881","resolution":{"observed_at":"2026-08-12T15:51:28.210592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:27.475673Z","title":"Kobourov, and Martin N \\\" o llenburg","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.475673Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:5652fe1f07cc8e22f34e9df212774b1553ee9197e560be49e1088f8c94bfe7e8","observation_id":"e85aa5e5-9409-4b31-b37f-e9b0fbd9ccf5","resolution":{"observed_at":"2026-08-12T15:51:27.475673Z","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":"10.1002/jgt.3190110306","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.703921Z","title":"Johnson and Henry O","venue":null,"work_id":"067b53e2-c983-44e3-93ee-57cda84f26ee","year":1987},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.480349Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:79e4b6e1e427fd0d12554adbf89a5a425b75805aff23700595016e87c7b9d745","observation_id":"029e4e12-e2ad-4380-8b45-9d6a30f4387d","resolution":{"observed_at":"2026-08-12T15:51:27.715994Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00046","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.688601Z","title":"Embedding vertices at points: Few bends suffice for planar graphs","venue":null,"work_id":"04bb30bd-e34a-4a0e-a147-b8f5e00a0e62","year":2002},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.484602Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:600f184d1d859b4b51e8202df6c20b41b9ab25a0832b7c41f87eebdf80e8a4f2","observation_id":"f143134d-151c-44b3-8347-b72cd134863d","resolution":{"observed_at":"2026-08-12T15:51:27.693407Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/dmtcs.10810","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.661591Z","title":"Representing matroids over the reals is \\( \\) \\( r \\) -complete","venue":null,"work_id":"dddd3f23-86e9-4b24-bd0d-da4fe80ba15f","year":2024},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.489886Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:50b7a9ea028df013f1498d5d7e297d15fc4da3dceee2dbbc3ec8737e1fa5055a","observation_id":"2b021594-ce69-4194-a81a-c94a7d5595ce","resolution":{"observed_at":"2026-08-12T15:51:27.670566Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:28.193287Z","title":"The application of determining sets to projective configurations","venue":null,"work_id":"dc5cc48a-9359-450b-ae7c-a548620906ea","year":1999},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.494936Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:dd80ee1086399c6ac824cbd5543e8643eb314c45dfbee1d78bc4eea21ecd11d4","observation_id":"57fead0a-4ce0-4da9-b514-fb82512dd91b","resolution":{"observed_at":"2026-08-12T15:51:28.198228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2636","last_updated":"2014-06-10T17:20:49Z","snapshot_observed_at":"2026-08-04T11:09:58.611910Z","submitted_at":"2014-06-10T17:20:49Z","title":"Intersection graphs of segments and $\\exists\\mathbb{R}$","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2636","snapshot_observed_at":"2026-08-12T15:51:27.499429Z","title":"Intersection graphs of segments and R","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.499429Z"},"links":{"cited_paper":"/paper/1406.2636","citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:000e19d80a5b1fefebd0d10b01a9ae5441b406301808a40d4bc70339cdb42c0c","observation_id":"2be49700-62b1-4571-816e-bada689a70f0","resolution":{"observed_at":"2026-08-12T15:51:27.499429Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.504076Z","title":"McConnell and Jeremy P","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.504076Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:83196efbf560933516cde08e68c1604340ffde0af2aa4f3a33fadb89d3e93c07","observation_id":"98dbbdd4-e15e-4262-92da-2d1633551809","resolution":{"observed_at":"2026-08-12T15:51:27.504076Z","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":"10.1080/00207169008803875","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.611919Z","title":"How to draw a hypergraph","venue":null,"work_id":"c638352b-09be-469f-bfca-fc2aba67c13e","year":1990},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.508518Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:38f99d3578aba0154b9d5f3bb1be8efd32c594320f6ce00ca6ec0311a13c3365","observation_id":"3a157061-2208-41fe-b57a-96d7762cc283","resolution":{"observed_at":"2026-08-12T15:51:27.620247Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:27.512560Z","title":"Complexity of some geometric and topological problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.512560Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:6e66ae9faec698c1464035a6fb44b7ef8f63b9c1f5182b8817454b8d64d7c62a","observation_id":"51bb7961-715b-4d8a-b130-6d724890c5da","resolution":{"observed_at":"2026-08-12T15:51:27.512560Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.517225Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.517225Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:fd5c295be0e3628b8cd3e08363b8543eb68e25c045e7cbd4c55277b1cac3bcdf","observation_id":"c667b6ca-3132-4602-869d-6c185ce8e5a6","resolution":{"observed_at":"2026-08-12T15:51:27.517225Z","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-12T15:51:28.180760Z","title":"\\\"U ber die Construction der Configurationen \\(n_3\\)","venue":null,"work_id":"a5705e29-e146-42a4-b45c-8cb6baf29bc4","year":null},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.522596Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:6365d14c9abd5ef7719cdffd5020c17ae2d65c27cbfb66537d025d2e1963731e","observation_id":"0b98936b-8e8b-480d-ae93-be21a20a32fe","resolution":{"observed_at":"2026-08-12T15:51:28.185015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539792235487","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:51:27.567903Z","title":"Swaminathan and Donald K","venue":null,"work_id":"eb9f6eda-ffae-4786-9f04-432255b9f646","year":1994},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.527315Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:ab78ca27882e4402c5026dd885bd66a34a7c2dabf5738fb2077ec10b7cffbe63","observation_id":"59693faf-bad5-4830-a30a-9c3ebf3ffc00","resolution":{"observed_at":"2026-08-12T15:51:27.574038Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:51:27.531869Z","title":"Kobourov, and Martin N \\\" o llenburg","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences","version":4},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T15:51:27.531869Z"},"links":{"citing_paper":"/paper/2411.13985"},"observation_digest":"sha256:e4d751e50241efbd318af7cc0f473606a2b2386022b0ab9f2d7c34251b804ca0","observation_id":"6867b323-a2ac-45b4-8cd0-afaaf685ce4a","resolution":{"observed_at":"2026-08-12T15:51:27.531869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.13985","last_updated":"2026-07-26T12:01:10Z","latest_version":4,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-12T15:37:56.121632Z","submitted_at":"2024-11-21T09:48:38Z","title":"Representing Hypergraphs by Point-Line Incidences"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":15,"verified_fuzzy":6},"total_outbound_references":34},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2411.13985."}