{"as_of":"2026-08-06T15:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f1cfc7ed263aa8aea3dd7848c84831c296398f5fa7bff1f37db364f90d7c90e","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T17:22:32.413097Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2606.01425/citation-record","integrity":"/paper/2606.01425/integrity","json":"/paper/2606.01425/citation-record.json","paper":"/paper/2606.01425"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:22:32.413097Z","title":"Mixed discrete- continuous heuristic generative planning based on flow tubes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:a15eca61fbffc51326152e3cac2bc836b6efcce32679313cd8a207471210e731","observation_id":"4a470cd3-511a-42d4-ae38-de4f84b80cc8","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Efficient de- sign optimization over mixed-combinatorial spaces enabled by graph- learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:f6fd248b9b6404f727cbb95e927bcad705a088bd01f1a51e4ab689e41f1fa9e6","observation_id":"8675ba5b-0959-4875-9078-71c460c9f4fd","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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.2514/1.a35812","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Concurrent design optimization of tether-net system and actions for reliable space-debris capture,","venue":"Journal of Spacecraft and Rockets","work_id":"c962475f-24db-43c3-8985-3837070e628c","year":null},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:4441d3eb5d71797dbdd0e1f9cd9c6f7bd74734573fd4bbcc71e4f9fb81b28019","observation_id":"13f28ec6-7798-4d0f-833f-a40f11728e12","resolution":{"observed_at":"2026-06-28T17:42:25.702493Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1934.2024","doi":"10.1080/02331934.2024.2358086","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A fast smoothing Newton method for bilevel hyperparameter optimization for SVC with Logistic loss","venue":"Optimization","work_id":"5957dc06-1647-4c29-9c75-7348d61c01fc","year":2024},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:d572c24ca6202a56bd9c1b9d281a78dcf98ba53f2c7e7930c868a9437f18b20b","observation_id":"6e642d57-c12b-4877-a77a-b0d415ba5cb1","resolution":{"observed_at":"2026-06-28T17:42:25.704960Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-28T17:22:32.413097Z","title":"Efficient concurrent design of the morphology of unmanned aerial systems and their collective-search behavior,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:6f1125c151da67c421dd645345e9845fc217ea037ced343457e1341a43c92a59","observation_id":"46c31d02-8965-4d27-a1b1-918f1d5e9d27","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.04598","last_updated":"2019-07-05T19:00:53Z","snapshot_observed_at":"2026-08-04T14:31:15.474746Z","submitted_at":"2019-03-11T20:46:47Z","title":"Graph Colouring Meets Deep Learning: Effective Graph Neural Network Models for Combinatorial Problems","version":2},"cited_work":{"arxiv_id":"1903.04598","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1903.04598","snapshot_observed_at":"2026-07-01T21:16:14.085199Z","title":"Graph colouring meets deep learning: Effective graph neural network models for combinatorial problems,","venue":null,"work_id":"91ac27b4-f78f-4016-998f-9c98591c8c6d","year":1903},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"cited_paper":"/paper/1903.04598","citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:ba18e4a155febd11de9e435986108c5850b4e82c03a6f51dc60dd10f9c58f9ca","observation_id":"ff828537-5ee5-4312-bfd1-6173fa10431d","resolution":{"observed_at":"2026-07-01T21:16:14.086773Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7912.374793","doi":"10.1145/3747912.3747933","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Review of combinatorial optimization methods in the intelligent era,","venue":null,"work_id":"45caeb1f-62e5-4f4a-ab0f-e7f1d611e164","year":2025},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:429fd0cf4b728947afc2bdab25562e10f806aa40ab3c09af562d80bb16ea3af4","observation_id":"1b7abfda-abe1-4c36-b152-d91a1e06c253","resolution":{"observed_at":"2026-06-28T17:42:25.710062Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-28T17:22:32.413097Z","title":"Bayesian optimization over mixed type inputs with encoding methods,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:42859be7e6b649a7ea43d7dc289327969cb40080b3f91ce6bba23f06fa996278","observation_id":"d5d2c69f-8a4c-4e4d-83df-829b07d3af18","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Mixed integer programming modeling for the satellite three-dimensional com- ponent assignment and layout optimization problem,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:d065b3eb3763f132a41297f25e802b6963acd095e07ecce83280bbf7397d6d02","observation_id":"401e421d-2a0b-4ef6-bad1-57a50a64f3d9","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Efficient partition of integer optimization problems with one-hot encoding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:d1d986dbbe70c4b79b780140c211ab23061fc564029be1ed11f2b4a3a8767755","observation_id":"be3516b4-3e62-40c0-ac62-43e786634ae8","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Nowak,Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (International Series of Numerical Mathemat- ics)","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:b62160969819135bc6482dadb2d911b48c7cbe322b87ee910d6c9cab34161da4","observation_id":"f026a539-8c35-46ef-b0fc-da95e0df5baa","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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":"ro/2018036","doi":"10.1051/ro/2018036","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Undecidability and hardness in mixed-integer nonlinear programming,","venue":"RAIRO - Operations Research","work_id":"1580a255-ea06-4e54-88f6-ad52da33500d","year":2019},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:fd08d078338b9495b11641bbf39af9712b1db44d4894bae8cc5cb2080ea6e689","observation_id":"7fef0125-7e5f-4ff8-b162-8f06800029c4","resolution":{"observed_at":"2026-06-28T17:42:25.706646Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7935.00065","doi":"10.1111/0824-7935.00065","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pattern databases,","venue":"Computational Intelligence","work_id":"387e634e-32f2-41d5-a49f-2b88e55d561a","year":1998},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:05001169723745958788270488ba3352da1de1d45a149626c196edd76a2369fe","observation_id":"fe7248cc-05ef-4025-a163-ede11bb2bd65","resolution":{"observed_at":"2026-06-28T17:42:25.692245Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-28T17:22:32.413097Z","title":"Combinatorial optimization with policy adaptation using latent space search,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:c0520d3b0cca67c6871fe3b62367b3fc99d349efc9e8354345504c335db8091a","observation_id":"50a43c50-9528-4b40-b6e5-f76c9242e4c6","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"State abstraction in maxq hierarchical reinforcement learning,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:fb4d1858d1b01132a9cf5de6a0d469030f437b73019b09483e3d856569ae57b5","observation_id":"a2bc9e01-21ed-4005-90b4-7361ebed9098","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:fe29ef0794d51bb65f2935a0ad40eae12afc381a3332de9a6f34550f1f371a67","observation_id":"4a75c792-f1e8-40b3-8a36-98d39a16ed61","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Categorical reparameterization with gumbel-softmax,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:9dd41b70e3c0486cf9b7e41a405a8a05a70b754624bb045778d7fee4889d3a76","observation_id":"bf95313e-a80e-4745-ae79-35a8aec0d309","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07041","last_updated":"2025-02-28T05:33:02Z","snapshot_observed_at":"2026-07-06T17:42:49.471518Z","submitted_at":"2024-03-11T16:26:06Z","title":"Ant Colony Sampling with GFlowNets for Combinatorial Optimization","version":4},"cited_work":{"arxiv_id":"2403.07041","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.07041","snapshot_observed_at":"2026-07-01T21:16:14.082557Z","title":"Ant colony sampling with gflownets for combinatorial optimization,","venue":null,"work_id":"c7bf81cb-c5f2-4eda-9b6d-17c9fc2aa162","year":2025},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"cited_paper":"/paper/2403.07041","citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:58b31b852e410e1578e6af91f3cf14f54367edd4dc047a6ddd16f7ea2198681d","observation_id":"fedc07f8-2034-4f1c-a2f9-19c6719041ed","resolution":{"observed_at":"2026-07-01T21:16:14.084061Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-28T17:22:32.413097Z","title":"Learning to allocate time-bound and dynamic tasks to multiple robots using covariant attention neural net- works,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:76997a3a9d0dd66799cd3840e3f06c08367690975e5e8826ddec70293193787e","observation_id":"49cd41ff-e909-4a81-b763-1ba5a7d0ab82","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Learning scalable policies over graphs for multi-robot task allocation using capsule attention net- works,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:517ee290cf699db3e9782c0f363110997b7c7b6f0b4597998e32af3447c26ecb","observation_id":"62f16098-3d43-4061-8a2b-59244be4d390","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Real-time outage management in active distribution networks using reinforcement learning over graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:7dd2d0e23fcc87663ccd339bacffd101a940258a28c9173f1655702e16d2c1f8","observation_id":"bffcd417-1bce-48bf-b0f5-f3c3cb402218","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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/s10107-010-0419-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL https: //doi.org/10.1007/s10107-010-0419-x","venue":"Mathematical Programming","work_id":"0552607d-4c65-4b7f-b7e7-0bf3a1c89569","year":2011},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:1cfdd28ad8b560178fa8df7a00d8719f6db366d6d833fae7f558d8d1c526e88a","observation_id":"a26116a1-5284-430a-9b5f-5317209ffc03","resolution":{"observed_at":"2026-06-28T17:42:25.712993Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-28T17:22:32.413097Z","title":"A tutorial on energy-based learning,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:b4785357c4ed5ca35518dc06fdb1169a306879598df49ea738201fa2547fb223","observation_id":"2621e334-190d-4053-9831-8a8796e2f447","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Crane,Discrete Differential Geometry: An Applied Introduction,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:68cf849715ee88c9f78e8e504cecca260c3a284112f8b64474b5702a25ee1e40","observation_id":"71048579-045b-47d3-8ebf-5888f42ebcb3","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Available: https://www.cs.cmu.edu/ ∼kmcrane/Projects/ DDG/paper.pdf","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:ad5ab6eb7b7eebf96542005fec83ca7205de2e2750514d13727b2b4b98610be4","observation_id":"2e1feba7-3829-4478-8150-b40eaf55ccf1","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Discrete exterior calculus,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:8575a861db318f122caa13dc5b40f6f310a1fba69ec889cc5cca55255318f578","observation_id":"2ced69af-3cfa-46a7-8a4d-364d6cb15f4d","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1011.1716","last_updated":"2011-09-06T14:08:48Z","snapshot_observed_at":"2026-07-06T02:18:50.902452Z","submitted_at":"2010-11-08T06:41:43Z","title":"Least Squares Ranking on Graphs","version":4},"cited_work":{"arxiv_id":"1011.1716","doi":null,"metadata_source":"pith","pith_arxiv_id":"1011.1716","snapshot_observed_at":"2026-07-01T21:16:14.084916Z","title":"Least Squares Ranking on Graphs","venue":"cs.NA","work_id":"d064cfe2-f8f7-44a3-9b77-a23aeff55963","year":2010},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"cited_paper":"/paper/1011.1716","citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:54d3d486a733363f80e22c4a65888dde0ca5c85ca2358e92625d8d6111ca3e18","observation_id":"2a8056de-7178-4161-b0f3-d6c113438cb8","resolution":{"observed_at":"2026-07-01T21:16:14.086142Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1021/acs.jcim.1c00670","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pairwise difference regression: A machine learning meta-algorithm for improved prediction and uncertainty quantification in chemical search,","venue":"Journal of Chemical Information and Modeling","work_id":"e9576924-7b98-4523-8d63-a74bc1ca9920","year":2021},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:0c7c9e27adef0db7de3c11961fb518a44fd06cea82ff2bdd05d43b90fd099db2","observation_id":"54b1fc22-f2a7-4dd1-9b84-88922baae09d","resolution":{"observed_at":"2026-06-28T17:42:25.700604Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-28T17:22:32.413097Z","title":"A mixed- discrete particle swarm optimization algorithm with explicit diversity- preservation,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:bac5523f9ac57ef2c7445ad4b73259d4fdff971414ab74ca05eb337cef59ece1","observation_id":"82b1afd1-2947-4ef8-9204-ef7174d2bdd4","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Convex minlp test problems with non-separable nonlinear functions,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:91889ac94982a610317abe2d0a5f167b8541da19fbda2b2f444c0bfb21eee017","observation_id":"b08f0020-e0dd-4613-8705-e7a48f576d41","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","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-06-28T17:22:32.413097Z","title":"Madhu, F","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T17:22:32.413097Z"},"links":{"citing_paper":"/paper/2606.01425"},"observation_digest":"sha256:70712b3bd9491107ecd39bf57a539ce4e382f8d5719d0661a51c57014b8a77d3","observation_id":"c3f698b3-032c-48d6-ac68-99b59ac5c60f","resolution":{"observed_at":"2026-06-28T17:22:32.413097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.01425","last_updated":"2026-05-31T19:54:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:41:58.121923Z","submitted_at":"2026-05-31T19:54:34Z","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":21,"verified_exact":8,"verified_fuzzy":0},"total_outbound_references":31},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2606.01425."}