{"as_of":"2026-08-12T20:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17bab5b1c31819cb46193d027c6136799badb9d80b49545f28f35a325c23a999","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T21:54:09.918644Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"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/2607.24182/citation-record","integrity":"/paper/2607.24182/integrity","json":"/paper/2607.24182/citation-record.json","paper":"/paper/2607.24182"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0925-7721(01)00069-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On embedding an outer-planar graph in a point set , year =","venue":"Computational Geometry","work_id":"07adda1d-d06d-43df-94bb-9e8ccc0cd823","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:08.498378Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:b48040851fab9515d8b5930c759fb477b8a6a31bc543a46c2f38ab3b4e7102d6","observation_id":"a3c47c57-4c2e-48e8-9b73-782ab2f7326a","resolution":{"observed_at":"2026-07-31T21:55:50.800333Z","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.00132","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planar embeddability of the vertices of a graph using a fixed point set is NP-hard , year =","venue":"Journal of Graph Algorithms and Applications","work_id":"627b9a48-a880-4df7-aba3-8e874585c57b","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:08.568789Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:a5fae3abaea2d3dd4fd29105ba4675f8246cf4512a5044b6996d40c13cefe3fb","observation_id":"2a9054a2-ca1c-4879-b6f8-8f45d765bcdc","resolution":{"observed_at":"2026-07-31T21:55:50.785444Z","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-07-31T21:54:08.662947Z","title":"The point-set embeddability problem for plane graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:08.662947Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:d82d10a567c08988f12a0ee53c20acb61eb6690083f5e1db7506f59d952e5c5c","observation_id":"c4518ff9-df06-41fc-bc3c-5600fdd3277c","resolution":{"observed_at":"2026-07-31T21:54:08.662947Z","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.1007/978-3-642-28076-4_16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Hardness of Point-Set Embeddability , year =","venue":"Lecture notes in computer science","work_id":"f579edb9-20e4-4140-bbac-a7b0046b0d10","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:08.723927Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:a335a00016d8484b970dc1a864f57657b80da27a54bcb0c40453b9aff72f2e79","observation_id":"5a559910-6592-49fa-a222-a6ca62fb1822","resolution":{"observed_at":"2026-07-31T21:55:50.771157Z","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/978-3-540-70904-6_31","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":", booktitle =","venue":"Lecture notes in computer science","work_id":"25228f49-cc95-4ed8-8fc2-48bbf6acb375","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:08.817504Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:fd8c9603212265b9f9c0bacacd6df7896ee5d6ac8fe3e2454ed4a50037cf7df3","observation_id":"4f512f26-130d-4ef1-a0aa-c16754f352a2","resolution":{"observed_at":"2026-07-31T21:55:50.756694Z","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/s00453-008-9255-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge , year =","venue":"Algorithmica","work_id":"7adc3379-3bbb-4375-8fa3-3cd8c7cce566","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:08.883677Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:6b9bf57b27ba1ecca1dfabd188c13fc8dd78bcb890b8bf18305fa9e0b1218e1f","observation_id":"e4c30936-8e61-4a09-ac63-0fc7101327c4","resolution":{"observed_at":"2026-07-31T21:55:50.742464Z","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/978-3-642-36763-2_26","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Liotta, Giuseppe and Mchedlidze, Tamara and Nishat, Rahnuma Islam , booktitle =","venue":"Lecture notes in computer science","work_id":"c0748679-5cd3-4c35-92ac-b68430e2e764","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:08.949935Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:19b3b5534e84de94bcaf1471448c57de87fe063225ecd57e756fb8153af960a0","observation_id":"b583a8d1-9684-4457-9e05-a52126a07bdb","resolution":{"observed_at":"2026-07-31T21:55:50.700646Z","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/978-3-540-73951-7_10","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Drawing Colored Graphs on Colored Points , year =","venue":"Lecture notes in computer science","work_id":"e2df200d-32fd-4de3-bbdd-5755cc24cbcc","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.048976Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:284800ff02c82438955e9b26e5eb9e585c573a61eca832d9cde11bf0363ba6b8","observation_id":"f1cd64c9-bc04-46ba-ac56-17729efd507a","resolution":{"observed_at":"2026-07-31T21:55:50.684917Z","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.tcs.2008.08.004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Drawing colored graphs on colored points , year =","venue":"Theoretical Computer Science","work_id":"757fb634-f3bd-4261-9414-1d38535beb29","year":2008},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.055149Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:5a53d6a91e415770a8759cc1f7b98ef3e22cef6b5b1813f4d4368485b44a685d","observation_id":"3b62bbc1-b05d-4037-832a-e6e6f29ea1b8","resolution":{"observed_at":"2026-07-31T21:55:50.670523Z","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/11618058_11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How to Embed a Path onto Two Sets of Points , year =","venue":"Lecture notes in computer science","work_id":"b3e9cdbc-4184-4acc-8af1-23282d90414c","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.195944Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:bf8fe06c2543e2259f29f19bb7d8cc8176af2a4565256c07a32227644bfbe85e","observation_id":"bb33ae2c-1158-4c9d-9d79-bc4f674d2727","resolution":{"observed_at":"2026-07-31T21:55:50.578352Z","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/0012-365x(90)90276-n","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simple alternating path problem , year =","venue":"Discrete Mathematics","work_id":"aea30748-387e-4dec-a22b-c2c9dcac31d4","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.307541Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:0dcaa0a9bb93fbde7ab05589b5064751df0a47ddf876deba881c4cdbdca02ef6","observation_id":"3841c731-30a8-46cf-960e-7571e96f6554","resolution":{"observed_at":"2026-07-31T21:55:50.563106Z","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/bfb0021791","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimal algorithms to embed trees in a point set , year =","venue":"Lecture notes in computer science","work_id":"386228e3-9f26-4ab5-9f28-5dcbd2df14a7","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.455722Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:27b2ec98591814ecff22f385668a951c48b6c413e23b6489941b554033e95a3f","observation_id":"8d80900e-1fa3-4880-938a-5b4bf7bde287","resolution":{"observed_at":"2026-07-31T21:55:50.547509Z","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-07-31T21:54:09.581737Z","title":"Testing Planarity of Partially Embedded Graphs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.581737Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:1611b3b75ff304b847d6fa30df3daaedaae2190eddd2bb617c5b6ac715616445","observation_id":"6e9dac4e-c85b-451c-b3d1-bfb6df5af2a2","resolution":{"observed_at":"2026-07-31T21:54:09.581737Z","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-07-31T21:54:09.696733Z","title":"On Extending a Partial Straight-Line Drawing , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.696733Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:821f8301edfbd8fefd8c157d38cb4798f26e021ac571e2bd08e2b457625daf92","observation_id":"09f1fe66-ca9e-4a65-9f1a-07a025cae6a7","resolution":{"observed_at":"2026-07-31T21:54:09.696733Z","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.1007/s00453-015-0018-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Extending Convex Partial Drawings of Graphs , year =","venue":"Algorithmica","work_id":"caaefc67-c49a-4163-9e0f-42e32822f25f","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.765277Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:0b815596e88e4b197a90d0ecf5411cff592d161efae226b3d8021060a53e574a","observation_id":"a68b6059-b19d-485c-a5bf-73400806c75e","resolution":{"observed_at":"2026-07-31T21:55:50.519650Z","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":{"arxiv_id":"2407.18006","last_updated":"2024-07-25T13:02:06Z","snapshot_observed_at":"2026-08-12T14:05:17.846023Z","submitted_at":"2024-07-25T13:02:06Z","title":"The Existential Theory of the Reals as a Complexity Class: A Compendium","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18006","snapshot_observed_at":"2026-07-31T21:54:09.802975Z","title":"2024 , copyright =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.802975Z"},"links":{"cited_paper":"/paper/2407.18006","citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:d8d943857a1b950a7dc1081004a1c5965051fe50df0fe8b75277f9402eb13d7a","observation_id":"e7e3799b-6101-4c68-b5bd-88d8a569656d","resolution":{"observed_at":"2026-07-31T21:54:09.802975Z","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.1007/978-3-540-77537-9_14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Point-Set Embedding of Trees with Edge Constraints , year =","venue":"Lecture notes in computer science","work_id":"87e3f4de-0931-4fb0-ae34-33f6324b31eb","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.806292Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:b41d7999f14d0d8453a4502dbd669985a3bb6000ccf7fa2b6d1e9c30e77252c7","observation_id":"babd81f2-9407-49d8-a0b0-bee1a1478648","resolution":{"observed_at":"2026-07-31T21:55:50.311378Z","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.comgeo.2009.01.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":", journal =","venue":"Computational Geometry","work_id":"34e36d67-930a-474d-b521-8320742ac766","year":2009},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.809391Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:f3caacaa15108317f44edc737b506ccd56be61a07b37d7633cf7a15f83c1f48e","observation_id":"61076cb5-d332-45cb-8069-9b8ec7098d9d","resolution":{"observed_at":"2026-07-31T21:55:49.959498Z","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/3-540-46648-7_17","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Embedding Vertices at Points: Few Bends Suffice for Planar Graphs , year =","venue":"Lecture notes in computer science","work_id":"8fe20b33-fd11-4d46-afa1-b08267f734ff","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.813639Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:c5e296db57afff520b3fee87ea63ab476735637681af705e5cd3779a57790282","observation_id":"fad02f07-3d1b-4660-b970-f49ef125f9f3","resolution":{"observed_at":"2026-07-31T21:55:49.709759Z","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/pl00007258","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Embedding Planar Graphs at Fixed Vertex Locations , year =","venue":"Graphs and Combinatorics","work_id":"5bb4bc98-d9fa-4858-8a4c-3b6b37684365","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.816345Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:18207baa36c8cc453df1c6f86762b7b0fe1f7661891b1c95962c76f5ce75d3f6","observation_id":"1964f081-2905-4588-bfd5-d40c05ae93f3","resolution":{"observed_at":"2026-07-31T21:55:49.415117Z","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/978-3-642-00219-9_35","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Constrained Point-Set Embeddability of Planar Graphs , year =","venue":"Lecture notes in computer science","work_id":"3bef22bc-9c09-4c23-ae44-b28c734b7ff3","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.819161Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:cd2fd3707be517f76fcea9c6412594ba744dfa73ef3eedfd705c3206af92d4db","observation_id":"83a0e9ee-619a-4e48-ab32-7158607fbecb","resolution":{"observed_at":"2026-07-31T21:55:49.161469Z","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/978-3-030-04414-5_28","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Complexity of Drawing a Graph in a Polygonal Region , year =","venue":"Lecture notes in computer science","work_id":"8ba896bd-bb2f-4a12-b7e7-443c5eb4e967","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.821976Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:2f002225d9865756bc28e334592ff70e0ae6f3b315f8a063f06a473a67ce52bd","observation_id":"a1035652-e461-4b63-9bee-e3d9700ecd4e","resolution":{"observed_at":"2026-07-31T21:55:49.009707Z","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/978-3-319-73915-1_32","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Colored Point-Set Embeddings of Acyclic Graphs , year =","venue":"Lecture notes in computer science","work_id":"36fd6fa7-d82d-42a0-bf7a-edb6353ffbf4","year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.824956Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:18e4038f1f87f7a269c82f2a21431a7ac80cdc40d8e407550957af48a7f8b5c0","observation_id":"ba52f188-a505-45c9-ad35-86e4f34bbb17","resolution":{"observed_at":"2026-07-31T21:55:48.898574Z","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-07-31T21:54:09.827599Z","title":"On Embedding a Graph on Two Sets of Points , journal =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.827599Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:91b05bd9488d53cfba9b315b02c7513c13d3cdcc5ba9be56e6e9d6d6e4ae3d0b","observation_id":"8bf6a73d-59dc-4547-9846-ef9f4f1b39ef","resolution":{"observed_at":"2026-07-31T21:54:09.827599Z","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-07-31T21:54:09.830322Z","title":"2012 , isbn =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.830322Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:76bdbe84ac626018fa09b2b66e34b4fc91fd5105a243c588eb8678c6f33a25ae","observation_id":"3191558f-821d-4623-831f-faa8909158cc","resolution":{"observed_at":"2026-07-31T21:54:09.830322Z","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-07-31T21:54:09.833208Z","title":"Balanced Independent and Dominating Sets on Colored Interval Graphs , booktitle =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.833208Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:9ea7f44efa1e8de657d0d84662d319c9a0a45a5c08734ddc2b42f04afaabfed4","observation_id":"d6a67264-9858-4679-aef6-97a71a143731","resolution":{"observed_at":"2026-07-31T21:54:09.833208Z","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-07-31T21:54:09.836190Z","title":"1998 , publisher =","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.836190Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:ca03b5e8271631dee1f505871c74291a11c0a95eff2e5169c9ef2f2cc22fc909","observation_id":"9f1a378f-5173-4f15-a37b-44dc97d67b4d","resolution":{"observed_at":"2026-07-31T21:54:09.836190Z","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-07-31T21:54:09.838975Z","title":"van Kreveld and Mark H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.838975Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:73a98756e8c4792d55b3f985b794e5f68894b21cc4ee9dd37f0a8e44b27027d7","observation_id":"9d054ca0-fca2-44e6-810e-6875b9b2b0b1","resolution":{"observed_at":"2026-07-31T21:54:09.838975Z","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-07-31T21:54:09.841834Z","title":"Algorithms for Reporting and Counting Geometric Intersections , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.841834Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:b521f0a344e55e16a2815071051508ebf36ccb4ee4ac4e7fd5c4a6bf66bbeb9f","observation_id":"53ae3cac-0380-4254-8222-49b5088d0cbf","resolution":{"observed_at":"2026-07-31T21:54:09.841834Z","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-07-31T21:54:09.844466Z","title":"Kanj and Ge Xia , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.844466Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:29cc81710cff68f6b09108bdbdb1095088981562fa756a09335dc5ce2b4ea3f3","observation_id":"a5290732-d88e-44fe-a67b-b6738d7a7926","resolution":{"observed_at":"2026-07-31T21:54:09.844466Z","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-07-31T21:54:09.846876Z","title":"and Karp, Richard M","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.846876Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:ee0ce40c6d077520a57093047431b196f9f8f9820743732755c330e40734480b","observation_id":"9a857313-1226-4744-af76-67c7bd83b211","resolution":{"observed_at":"2026-07-31T21:54:09.846876Z","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-07-31T21:54:09.849407Z","title":"Fomin and Lukasz Kowalik and Daniel Lokshtanov and D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.849407Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:30653b37ecfc5410529c8f0a34d92b5d6bf47b78c3f35b6d35fc61853bbc0fa3","observation_id":"0749f782-92cd-4817-9e46-f61827949f69","resolution":{"observed_at":"2026-07-31T21:54:09.849407Z","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-07-31T21:54:09.851977Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.851977Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:2e3039a56f33dac6be167bd22d754bbe897b89e4e2b9302eac78f6f009ebef1b","observation_id":"bc460272-0f5e-444e-a4a4-693271c080ee","resolution":{"observed_at":"2026-07-31T21:54:09.851977Z","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-07-31T21:54:09.854802Z","title":"2001 , publisher=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.854802Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:3b8089f88689583d467174b03bb6afe7f7c25def03a0d655c445b48c5d4ec1b9","observation_id":"7585e2dc-7e7a-466c-8ecb-7c6a68f4775d","resolution":{"observed_at":"2026-07-31T21:54:09.854802Z","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-07-31T21:54:09.857947Z","title":"Optimal Binary Space Partitions in the Plane","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.857947Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:d16a4360794b7594c073931705ec19001ebb483b31567d8fe87592b295650a1e","observation_id":"8ac69385-cd6a-4e61-986c-b89be704666a","resolution":{"observed_at":"2026-07-31T21:54:09.857947Z","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-07-31T21:54:09.860610Z","title":"American Mathematical Monthly , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.860610Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:fe07ae631de5f6f7f5570a1f72e159a5b5dc37f91f22176a629b6e04eccb8f6c","observation_id":"1fa3745c-80c4-4fdc-b828-ffaf2fc56249","resolution":{"observed_at":"2026-07-31T21:54:09.860610Z","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-07-31T21:54:09.863352Z","title":"Straight Line Embeddings of Planar Graphs on Point Sets , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.863352Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:733b0cde139e9591730284d60f80a44d83e6fb1fd6374e8f5cfa9c0f7750673a","observation_id":"6dae370c-5b9b-4982-bb7f-d8d2dae4b0e9","resolution":{"observed_at":"2026-07-31T21:54:09.863352Z","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-07-31T21:54:09.865881Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.865881Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:0cf355c0ce87d74fbdb160208c5f8ce5d8fa1021a9db015b453da7b02993323b","observation_id":"bb3b6a40-f13b-47c3-927c-0c4063ddf35d","resolution":{"observed_at":"2026-07-31T21:54:09.865881Z","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-07-31T21:54:09.868278Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.868278Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:d4c7883d429a71af8931bd6ab8239805ff7ae028e7c6f01891258513c51fbd7d","observation_id":"0da06765-5a36-4c35-9fde-d3522b49dd1e","resolution":{"observed_at":"2026-07-31T21:54:09.868278Z","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-07-31T21:54:09.870924Z","title":"Bannister and Zhanpeng Cheng and William E","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.870924Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:ed2656630bd61cef6d8259ba13bdb4ca7619c01e9e4fb98bbb1275ece58dd151","observation_id":"9987d3d6-1d4b-412a-a828-de28930b76dc","resolution":{"observed_at":"2026-07-31T21:54:09.870924Z","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-07-31T21:54:09.873656Z","title":"How to draw a planar graph on a grid , journal =","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.873656Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:7c8d12f927d37c7df97c3ea8993f8661b0870c2551cdbb974ede5dc0a77966b6","observation_id":"99c09cac-3321-44dd-a53b-08b5f8192241","resolution":{"observed_at":"2026-07-31T21:54:09.873656Z","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-07-31T21:54:09.876492Z","title":"Embedding Planar Graphs on the Grid , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.876492Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:e1d67c7b5cdbfce658496f4e6e8184a379d7472f042c6ccf096d03afc7a924a9","observation_id":"982500e8-c865-4905-8400-801c748ce58e","resolution":{"observed_at":"2026-07-31T21:54:09.876492Z","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-07-31T21:54:09.878918Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.878918Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:e8bd5fc0433229781b4b0ff468891f23d8042abfaffd863ebf7f04a07e7d6c8c","observation_id":"06afb605-3873-4183-8ef1-2774553aa83d","resolution":{"observed_at":"2026-07-31T21:54:09.878918Z","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-07-31T21:54:09.881261Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.881261Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:f84bfc853bb1fe8d2cc65174de15f6549b9557612c422aec7ff19635aa081890","observation_id":"8a824df1-5175-4f97-b66f-6d000fe974ed","resolution":{"observed_at":"2026-07-31T21:54:09.881261Z","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-07-31T21:54:09.883672Z","title":"On the curve complexity of 3-colored point-set embeddings , journal =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.883672Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:bc6b5e7aee82ad4f882efb71196ea270ce7b93aaa8ad2bd79a2d42cb39f22b94","observation_id":"df93772f-b173-4e5a-a80a-27873729c944","resolution":{"observed_at":"2026-07-31T21:54:09.883672Z","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-07-31T21:54:09.885943Z","title":"2-colored point-set embeddings of partial 2-trees , journal =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.885943Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:f44f9588ab8b4a49eb18a24a558c691d216a7d87441c3568ddd546d104e951ec","observation_id":"13145c22-0b77-48e1-a117-9b1c3232abb2","resolution":{"observed_at":"2026-07-31T21:54:09.885943Z","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-07-31T21:54:09.888202Z","title":"Chambers and David Eppstein and Michael T","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.888202Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:9a3f6387fa3f4ff4ba15de9a9a186013a4b7203bb59ca84a416d6309f06be9c7","observation_id":"e54d0f6f-d20f-47d4-86a0-a4972ac88ef6","resolution":{"observed_at":"2026-07-31T21:54:09.888202Z","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-07-31T21:54:09.891173Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.891173Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:d3c690cac87a0f60a676aab9bf23409cc9a089af3975a5536ba3de453417676b","observation_id":"3786bdc3-53fa-406d-b188-c1765edc401d","resolution":{"observed_at":"2026-07-31T21:54:09.891173Z","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-07-31T21:54:09.893644Z","title":"Automata, Languages, and Programming (ICALP'20) , Year =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.893644Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:de888923592a86ddfa57a501c6d7871767c5d8d478cb3b5cb9936d9264883f87","observation_id":"5b65f124-2be5-455e-ad1a-3a178fe3e2e4","resolution":{"observed_at":"2026-07-31T21:54:09.893644Z","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-07-31T21:54:09.896311Z","title":"and Ganian, Robert and Nöllenburg, Martin , Title =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.896311Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:0f622aabe2f45fb8aa101ef7a1f7c18c3fbb25508ac6a6ae491d77d9f5a3ce65","observation_id":"8b0de905-f776-4259-9629-2efafabd45c4","resolution":{"observed_at":"2026-07-31T21:54:09.896311Z","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-07-31T21:54:09.898643Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.898643Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:06834bcb85fa75e4136ba0c848f5a6d530e337a4d920a896b084db056fda8719","observation_id":"37a76599-46cb-4a12-bb01-5ce8a4327e19","resolution":{"observed_at":"2026-07-31T21:54:09.898643Z","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-07-31T21:54:09.900936Z","title":"Efficient","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.900936Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:f050dd16f8965869fcc5ce4a9c1df0a7ed92797bc0cf123d939a57f5768832aa","observation_id":"a8e9ec55-39f0-4abf-9c94-0c620bd0f22c","resolution":{"observed_at":"2026-07-31T21:54:09.900936Z","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-07-31T21:54:09.903162Z","title":"Graham , title =","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.903162Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:9c1cd1e220969cd9e4ca22b9e4ece08029f978b459522f8d054d8f79d2f0d40b","observation_id":"3b549899-96ce-4677-b666-f489d0edf38d","resolution":{"observed_at":"2026-07-31T21:54:09.903162Z","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-07-31T21:54:09.905834Z","title":"Mitchell , title =","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.905834Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:5c00aee9647494b9b1b5c81c9c2baeb856f275d41b6fc8fbeb5d8c24ccb037d4","observation_id":"9efe90cd-df03-41b1-a278-ecef3d6ec2ca","resolution":{"observed_at":"2026-07-31T21:54:09.905834Z","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-07-31T21:54:09.908454Z","title":"and Ganian, Robert and Nöllenburg, Martin , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.908454Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:51c890d429732709d45fecfcf62a6bc9b5083751313fc0991e108e6ecb77bee7","observation_id":"d0540090-49f6-45d3-b62c-1a076c773d9a","resolution":{"observed_at":"2026-07-31T21:54:09.908454Z","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-07-31T21:54:09.911003Z","title":"Computational Geometry (SoCG'23) , Year =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.911003Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:f1b7c582aaf0569f35efc3d4989aebb226da14c3925b4c066d628e7cea0ee2cc","observation_id":"4d220125-1811-497f-83bf-7909b2b01edc","resolution":{"observed_at":"2026-07-31T21:54:09.911003Z","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-07-31T21:54:09.913528Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.913528Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:3fe6b527cc33b38c9621d35bf41059849a1e6f284ddbdf24dfe88c6f15872652","observation_id":"849f5671-e347-4dd8-bee8-0140b8ed2eba","resolution":{"observed_at":"2026-07-31T21:54:09.913528Z","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-07-31T21:54:09.916241Z","title":"and Klemz, Boris and Ganian, Robert and Nöllenburg, Martin and Sieper, Marie Diana , Title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.916241Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:e5e01ad0dce7dd41d7fb72d87ef6916b3f7aab4b8137726ebd5b8ce558434b92","observation_id":"763440b5-5db7-4bb2-a104-dff4ab8e0992","resolution":{"observed_at":"2026-07-31T21:54:09.916241Z","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-07-31T21:54:09.918644Z","title":"Fink and Robert Ganian and Martin N","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-31T21:54:09.918644Z"},"links":{"citing_paper":"/paper/2607.24182"},"observation_digest":"sha256:126fd879f68060598a716f6b020f293a479b60d0d17ea59db5dd45a46ba16c07","observation_id":"30b5810b-f8d3-4011-a4ec-b99abcc9e124","resolution":{"observed_at":"2026-07-31T21:54:09.918644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24182","last_updated":"2026-07-27T09:04:34Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-07T17:26:34.898948Z","submitted_at":"2026-07-27T09:04:34Z","title":"Point Set Embeddability with List Constraints"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":40,"verified_exact":19,"verified_fuzzy":0},"total_outbound_references":59},"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 12 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2607.24182."}