{"as_of":"2026-08-13T01:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cfe7e706e5bfa811e03e28724daec623f4f756648a848f7cd2888f15acaebdb","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:01:39.644611Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"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.17596/citation-record","integrity":"/paper/2411.17596/integrity","json":"/paper/2411.17596/citation-record.json","paper":"/paper/2411.17596"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:39.524194Z","title":"An exact method for the minimum feedback arc set problem","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.524194Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:6901ffebb7db99117f54c48edda2a59e040fab1862e5c8eb81d5a662b2d4fc5f","observation_id":"fe4ca281-4c6c-44fd-8dfb-0bd42b99d95b","resolution":{"observed_at":"2026-08-12T12:01:39.524194Z","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-12T12:01:40.175849Z","title":"Graph drawing: algorithms for the visual- ization of graphs","venue":null,"work_id":"dc8f87a0-aaa9-479e-b17c-c84f24377e5d","year":1998},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.529194Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:0ff66bea66e8a0539747ccc3150dc516041fbc187b94e30fddfc34affa52b625","observation_id":"62972aa0-6d93-4d92-9a25-4b78eb6ce491","resolution":{"observed_at":"2026-08-12T12:01:40.179801Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:40.162943Z","title":"Pfetsch, LUNCH mjdvmppegArceecrossy uzl roundabout CRGoneguilucand weberknecht 0 100 200 300 Time (s) Figure 10: PACE results of the parameterized track","venue":null,"work_id":"6942c73d-e89e-4849-9ea7-ec610dd00ed7","year":2024},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.533450Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:956184a2dd0e9407de507e2be09a10af0965b417cb6de4536b259f2e6be12896","observation_id":"5f466061-e960-4cd9-b997-ace1a709be35","resolution":{"observed_at":"2026-08-12T12:01:40.167370Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:40.151099Z","title":"On the cutwidth and the topological bandwid th of a tree","venue":null,"work_id":"21825d6f-3b20-4a74-97a6-a7020c48691b","year":1985},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.538516Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:78877ff6d65592f6cab0f4610badd1f0f94bfe588461dbd2b508101b4f540770","observation_id":"0df089ba-2928-4a25-b043-0cc80481cd55","resolution":{"observed_at":"2026-08-12T12:01:40.155144Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:40.139025Z","title":"Crossing numbers and cutwidths","venue":null,"work_id":"a5da2419-3247-4033-b3a5-8cb1373822a4","year":2003},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.542922Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:ea1a8697a3fca3e5a97f8586899b925d7831deac7e8a673017339d176325d80d","observation_id":"a1bf8e3c-330b-464d-81a9-3dcb5912560a","resolution":{"observed_at":"2026-08-12T12:01:40.143048Z","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":"2306.15339","last_updated":"2023-06-27T09:49:31Z","snapshot_observed_at":"2026-07-06T15:47:11.292762Z","submitted_at":"2023-06-27T09:49:31Z","title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.15339","snapshot_observed_at":"2026-08-12T12:01:39.547372Z","title":"A note on the complexity of one-sided c ross- ing minimization of trees","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.547372Z"},"links":{"cited_paper":"/paper/2306.15339","citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:cb7309eeb73306c93bde7e0711e984bbc390caa48876253a1924cf198d5d3494","observation_id":"618d674d-5d77-40ac-9dba-4d841750ce12","resolution":{"observed_at":"2026-08-12T12:01:39.547372Z","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-12T12:01:40.127426Z","title":"A fixed-parameter approach to 2-layer planarizat ion","venue":null,"work_id":"c1cf6cc7-e2c7-4f46-a9f6-a8f1012b39b1","year":2006},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.552430Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:9a025781b7245e535584802d661aed93a09661a28cee83ee682638cf4b34676c","observation_id":"700e707f-824e-4646-911e-7300fa07e4c4","resolution":{"observed_at":"2026-08-12T12:01:40.131445Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:40.115222Z","title":"On the parameterized complexity of layered graph draw - ing","venue":null,"work_id":"1ad41bdf-c155-44b9-862f-2f2b1c69d275","year":2008},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.556373Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:8fa77dab32792283e30e5c97058753673fceb8a64e46f82f9817706f1d5c09db","observation_id":"2ce972c9-e6e9-4101-b29b-019e15c1d091","resolution":{"observed_at":"2026-08-12T12:01:40.119444Z","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-12T12:01:39.560776Z","title":"Fi xed parameter algorithms for one-sided crossing minimization re- visited","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.560776Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:5f0eb8e26bde81740a40d941bce9fff2d25eeda6388a5ae781d0bcd303cd0399","observation_id":"eb54924b-3d95-4acb-9f14-a8b3f228abb3","resolution":{"observed_at":"2026-08-12T12:01:39.560776Z","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-12T12:01:40.102775Z","title":"Edge crossings in dr aw- ings of bipartite graphs","venue":null,"work_id":"9cd17852-b934-42fa-a251-87c2c3700b1e","year":1994},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.565427Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:5f6262b44a47deffcfd2604caf9d6caae8fea90ba94ad95ece4b9cf43dfe0a13","observation_id":"03c04805-9bc5-48d2-a90f-a8a0a73daef1","resolution":{"observed_at":"2026-08-12T12:01:40.107089Z","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-12T12:01:39.569475Z","title":"A cut- ting plane algorithm for the linear ordering problem","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.569475Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:c844016fe423338b11426dac6abca49deba83a21758c1cfadd5dc77b0ca0b67d","observation_id":"692ca5f1-0a7d-40bd-baa9-135e4fb4c520","resolution":{"observed_at":"2026-08-12T12:01:39.569475Z","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-12T12:01:39.573823Z","title":"Integer Linear Programming in Computational Biology: Overview of ILP, and New Results for Traveling Sale s- man Problems in Biology , pages 373–404","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.573823Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:142809f9b0d02d65f5fcb682d0bd3a8defdc1ad6f9515510d6f7741ec651b324","observation_id":"878bb097-3757-4dc5-b7f6-db4db7aab69c","resolution":{"observed_at":"2026-08-12T12:01:39.573823Z","resolver_source":null,"status":"malformed_identifier"},"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-12T12:01:40.090022Z","title":"2-layer straightlin e crossing minimization: Performance of exact and heuristic algorith ms","venue":null,"work_id":"748fcece-00ed-446e-a13a-501f2e49e616","year":2002},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.578203Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:85713033da28de5d75d8cd8984c94e9a7f74aa116689296b6d55d155ac8ee272","observation_id":"78ed844a-f99a-4888-8d77-76a86c475cf6","resolution":{"observed_at":"2026-08-12T12:01:40.094169Z","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-12T12:01:39.582094Z","title":"A fast and simple 9 subexponential fixed parameter algorithm for one-sided cro ss- ing minimization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.582094Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:f9aea1877b4e70723fccd1eb618ec537f0d7a90495983de8b4e7c4ea5fe94454","observation_id":"31ab83aa-e4f7-4345-96a8-ebec08902a49","resolution":{"observed_at":"2026-08-12T12:01:39.582094Z","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-12T12:01:40.077469Z","title":"Recent developments in kernelization : A survey","venue":null,"work_id":"6ad7ed8b-4595-4d62-baf7-422c49e5ec47","year":2014},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.586236Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:f03607d5782acedbd24cd66fdd859c1df1a965cb24e51b4eaf8b1f0b4822b3f9","observation_id":"b6c0e158-9e74-454d-9bd1-8c52730e55ff","resolution":{"observed_at":"2026-08-12T12:01:40.081189Z","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.1016/j.ejor.2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:39.742600Z","title":"DePuy, and Gary E","venue":null,"work_id":"32b3c9b7-8453-425b-b0f1-82309663985d","year":2007},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.590082Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:6ae0f6ff1710027ae49f9ea603e23a99e6d946e85cf9fd2096afb4f9c6a3742c","observation_id":"0bb5bc37-1de9-4e1d-b725-614f238b9334","resolution":{"observed_at":"2026-08-12T12:01:39.747055Z","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-12T12:01:40.064975Z","title":"Smac3: A versatile bayesian optimization package for hyperparameter optimiz a- tion","venue":null,"work_id":"caa3dc07-2033-4a59-9d53-ce6a1376d332","year":2022},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.594493Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:73a90cf22bacd7d90a44580770671b40df11bad82f04e4d3bd5ff46b024d65c0","observation_id":"b774243d-ac47-4914-88a6-5a89d51a769b","resolution":{"observed_at":"2026-08-12T12:01:40.069305Z","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/3-540-46648","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:39.728606Z","title":"Us- ing sifting for k -layer straightline crossing minimizatio n","venue":null,"work_id":"0ef9ad73-8fa5-4e76-af8a-0ccf9324af90","year":1999},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.598486Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:01f02220b88f41039b9dfe368421f3ce451cd053308ceae53ede4fc667c11ca4","observation_id":"842d34bb-ff5e-4187-8a2c-37360672d927","resolution":{"observed_at":"2026-08-12T12:01:39.732945Z","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.2004.10.042","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:39.715093Z","title":"On the one-sided crossing minimiza tion in a bipartite graph with large degrees","venue":null,"work_id":"670c1e06-ab0c-4f31-9d00-61e7962cc9dc","year":2005},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.602589Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:5341c6bc69985147bd9645b6810710c855423c995638451bc2d779126e538a17","observation_id":"828dfa68-0a26-482a-b181-cd9338f8f22e","resolution":{"observed_at":"2026-08-12T12:01:39.719889Z","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-12T12:01:40.052180Z","title":"An improved bound on the one-sided m in- imum crossing number in two-layered drawings","venue":null,"work_id":"1a203617-b2eb-489f-bde7-a1019534ecb4","year":2005},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.606309Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:ca6ac8774ae66bb2374778077d9aa5d9f89d7fd13ea731a5867ece117a9c111e","observation_id":"93c340bb-8b7d-42a1-8493-6e9fedf84536","resolution":{"observed_at":"2026-08-12T12:01:40.056287Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:40.039486Z","title":"Topics in computer-aided design: P art i","venue":null,"work_id":"041e341e-550e-4798-bc5a-2976e832175f","year":1973},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.610632Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:62d6d20090ff7ee46109a8834258a28ee9bf7aabebff672a46805bddc7cecd7b","observation_id":"08ee9c7a-0a1d-4897-8540-b28e73eb3069","resolution":{"observed_at":"2026-08-12T12:01:40.043977Z","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-12T12:01:39.614824Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.614824Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:5e28ca66bdc825153bc4652722cfba0415b74cc1200e2f3ac92524f305cba220","observation_id":"e87af6be-6963-4206-a5e3-cf76b1562d33","resolution":{"observed_at":"2026-08-12T12:01:39.614824Z","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-12T12:01:40.026673Z","title":"VLSI placement and global routing using simulated annealing, volume 54","venue":null,"work_id":"7cf893b4-fe73-41e8-9610-8223c44d6e87","year":2012},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.619105Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:4fb9e5a313589bfd733cb5f187840bb5bdfdc6797968ae431145eb0814c17dc9","observation_id":"6f21d2ec-a04d-4657-aeba-2216c0d0d3f3","resolution":{"observed_at":"2026-08-12T12:01:40.031007Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:40.013909Z","title":"Heuristics, experimental subjects, and treatment evaluat ion in bigraph crossing minimization","venue":null,"work_id":"f2ef6925-dddd-41ca-bf03-f172bdf5b429","year":2001},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.623319Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:806a80f3a35436a3f5df8325dd8c8a1cf6a10bf3e7ec32743e1957caf5df19a5","observation_id":"bc0ccb3b-191e-4a7e-b668-51b75f76146e","resolution":{"observed_at":"2026-08-12T12:01:40.018339Z","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-12T12:01:39.627405Z","title":"Met hods for visual understanding of hierarchical system structure s","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.627405Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:5cbe437d3db1a36051c53114d8db512820a017c8c9623dcf44f694ddecc03fbc","observation_id":"87efb3bf-773f-4600-9358-685dfc07d928","resolution":{"observed_at":"2026-08-12T12:01:39.627405Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0377-221","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:39.701215Z","title":"Optimization engineering techniques for t he exact solution of np-hard combinatorial optimization problems","venue":null,"work_id":"dfbcdecb-ae13-428a-a17f-72dfccf31c86","year":2000},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.632285Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:c77f061d8e61abc8fd64171b6835fbba54a55aee9dc96862eedf81a1a95d20dd","observation_id":"bfdd7124-2564-4269-bae4-eea61a9942dc","resolution":{"observed_at":"2026-08-12T12:01:39.706795Z","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-12T12:01:40.000214Z","title":"W addle and Ashok Malhotra","venue":null,"work_id":"c434936f-8bfa-43ba-bc41-286545d1d9b5","year":1999},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.636369Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:9054e269fae7ca37b9abd3d8321b0618f1e9fe2db03a56073bd0a5b371daf2e9","observation_id":"4e0997ba-958a-460b-9812-0c875f38067d","resolution":{"observed_at":"2026-08-12T12:01:40.004550Z","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/3-540-46648-7_6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:39.672802Z","title":null,"venue":null,"work_id":"997c5962-d2b3-4853-ae8f-334bd3163008","year":null},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.644611Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:42258cdc3a54d1cc34719838341577eedc5f3ee75ec54a8fc50c20097b1222e3","observation_id":"6ed9936e-9c90-4c1c-996e-3793a26d8883","resolution":{"observed_at":"2026-08-12T12:01:39.678260Z","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","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:01:39.687700Z","title":null,"venue":null,"work_id":"130c4b57-7c5d-44cc-b3e6-31c88d46e4dc","year":null},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.640152Z"},"links":{"citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:b8b25dffa2e792a2e0762919a302462083482fd720dcadf71a7e9cb2f16b810a","observation_id":"60d5baf2-7626-4eba-8631-74f320349c54","resolution":{"observed_at":"2026-08-12T12:01:39.692081Z","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"}}],"paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":6,"verified_fuzzy":15},"total_outbound_references":29},"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 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2411.17596."}