{"as_of":"2026-08-19T11:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5864aaf6a4c0b64314d31949a0b7b9300b8e898a3e534fa4b55b058c14be49f8","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:58:25.873223Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2412.05146/citation-record","integrity":"/paper/2412.05146/integrity","json":"/paper/2412.05146/citation-record.json","paper":"/paper/2412.05146"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:58:26.380643Z","title":null,"venue":null,"work_id":"ffa4b923-7210-43a7-8f0d-59695ec56bf4","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.675375Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:5384eec0aaebd7c0410064873f7263d7c1a944b3cf6b23559079450761220e5d","observation_id":"daa80034-d903-4fbe-b5d4-406e41b73923","resolution":{"observed_at":"2026-08-11T20:58:26.385412Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.084985Z","title":null,"venue":null,"work_id":"29acb902-e426-4a24-8421-756b6d1e579c","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.833948Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:e3ae567eecc1ee448d4083a79ec1b043187d5a1bf45e5d9861bd72d21ad511ee","observation_id":"bdec9f0a-9ccf-401d-b8f2-623163531d7a","resolution":{"observed_at":"2026-08-11T20:58:26.090200Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.17452","last_updated":"2024-04-26T14:47:40Z","snapshot_observed_at":"2026-08-19T08:31:34.513003Z","submitted_at":"2024-04-26T14:47:40Z","title":"A Continuous Relaxation for Discrete Bayesian Optimization","version":1},"cited_work":{"arxiv_id":"2404.17452","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.17452","snapshot_observed_at":"2026-08-11T20:58:26.027094Z","title":"A Continuous Relaxation for Discrete Bayesian Optimization","venue":"cs.LG","work_id":"318c50b9-d404-46c4-b9e6-a709720d7acb","year":2024},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.472606Z"},"links":{"cited_paper":"/paper/2404.17452","citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:4e49a2055bfb4fd7965896ad3af918ad73158493c6d7f5fa52fca2bbca5bb7d0","observation_id":"3d10aab3-39d1-46ef-94a5-c512d6a0cc3f","resolution":{"observed_at":"2026-08-11T20:58:26.035175Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.793121Z","title":"Lemma B.3","venue":null,"work_id":"f0e4240b-9077-4a59-958a-8ae741529f06","year":1991},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.604780Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:88437f53c2c717940efc465a0df0aff099ca650ded77fcbdf6bc5af31538e01c","observation_id":"5eb045ce-2938-4429-a914-5ecdf85d2e8a","resolution":{"observed_at":"2026-08-11T20:58:26.808240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.479897Z","title":null,"venue":null,"work_id":"e0b3a898-3c2b-465a-bda5-4f03d6e1b773","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.624786Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:feb2be63b84c52712559958b1dcd139c69f69cb90e2afd2db02597d0f5912288","observation_id":"3bed70e3-f6ed-4951-bd34-d127d843ec9c","resolution":{"observed_at":"2026-08-11T20:58:26.526288Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.463835Z","title":null,"venue":null,"work_id":"9dea42ae-520f-44f9-8360-addf1f2cabe8","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.637185Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:d6a077b392259a8d282cc3420662321714ec5fb7ff3de4443f1ead67860c35bc","observation_id":"a6ca9f4c-8207-4768-a4d4-c7b9aed69796","resolution":{"observed_at":"2026-08-11T20:58:26.469014Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.678590Z","title":null,"venue":null,"work_id":"0a42ca9e-9522-4895-83bf-08d2b5b2eaba","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.609993Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:b8bb7bf32d93b5a2a07911211cb54201b24d5a4c2e8a60780fd35793f7ba1e97","observation_id":"c177b2be-e20d-42c2-8e16-37fdcaa18b93","resolution":{"observed_at":"2026-08-11T20:58:26.763900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.067671Z","title":null,"venue":null,"work_id":"90f85eaf-d7e2-4cf5-b0a9-363098653e85","year":1903},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.873223Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:5969cdf47280e4d585e11ec95304ac27691b430e30746fa10062e6a38462ad37","observation_id":"98f578a0-ac5a-4202-beb7-0b8a9c127987","resolution":{"observed_at":"2026-08-11T20:58:26.073221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.268142Z","title":null,"venue":null,"work_id":"50c539a9-3994-417a-9ba1-ec512018ff9f","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.685416Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:8b949213c59d8c908885e8b08c8a5cea5f267b4991d685ed8016c98c5cf87d08","observation_id":"ca6fdaf3-e6ef-4481-886a-0214dae9f7f0","resolution":{"observed_at":"2026-08-11T20:58:26.323231Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.344094Z","title":null,"venue":null,"work_id":"4f1ca256-1c53-4622-b424-c0d7061bcc10","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.680467Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:61fe0cd50962c3694375258b49660aa354f219a0f3e4286093ffa38b8b106be8","observation_id":"bdfe1441-bb1f-46d2-9339-7d389940c559","resolution":{"observed_at":"2026-08-11T20:58:26.364687Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.177751Z","title":null,"venue":null,"work_id":"59e1a109-b12c-4b1b-b2f7-58b0acb65770","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.690385Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:840e31d800d64f6b2bb6d2dd5bd25cb9cdcc99e0733423b1d29db60fe3a6c886","observation_id":"3b261ed1-e24a-4c20-b0fb-076b92ca8c4c","resolution":{"observed_at":"2026-08-11T20:58:26.232921Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.570014Z","title":null,"venue":null,"work_id":"0ad288bd-0cf1-4b27-bdba-dbb3976c0fa9","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.615186Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:0c76a5c5a7a1a995a8a9b6120d1840112a34424e56518bd6349b5c5fd7cfc7dc","observation_id":"72c0bf10-b293-461d-9ef0-b204c27dd96b","resolution":{"observed_at":"2026-08-11T20:58:26.617273Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.446314Z","title":"Instance |V| |E| GW MD PI-GNN Genetic BQP ECO-DQN ANYCSP MOH LPI ROS-vanilla R OS Obj","venue":null,"work_id":"04680b5f-c18a-451f-a407-2c7572bc6f3d","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.650121Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:f6e0ce25a473b9fc5228d900d54d1efcd8faa724e4b56cbc274a77a3731b26da","observation_id":"56829406-82d7-490f-83dd-5e8f0e576735","resolution":{"observed_at":"2026-08-11T20:58:26.452121Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.102650Z","title":"Instance |V| |E| MD Genetic BQP ANYCSP MOH ROS-vanilla ROS Obj","venue":null,"work_id":"91342a60-2404-4aa1-8b19-db025ecc2d1c","year":2000},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":160,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.748003Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:f46c2166ff54d81cbd438bf418f2f66d79be8a7cd2c967575af96066f2347660","observation_id":"451be68d-775b-4ba0-a4e5-6a8b6aa8df20","resolution":{"observed_at":"2026-08-11T20:58:26.138835Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.398551Z","title":null,"venue":null,"work_id":"44315e08-8cf8-4e3a-baad-8b5a9afda136","year":1961},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":282,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.670105Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:6be9d06a8ca6ddc55765d9e07204244bae2e836536d5c626ab928c2711d64021","observation_id":"cc4e9ae0-952c-42a1-a86e-b6f591bc93ac","resolution":{"observed_at":"2026-08-11T20:58:26.403397Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.430708Z","title":null,"venue":null,"work_id":"3c4b6441-db77-4951-9269-c14eacaf5a0a","year":2017},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":307,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.659611Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:92b9255c8e88c9f3b1e298bf397987cc677f595e09e143088e5691c28e8a062e","observation_id":"3fb6aa17-5a83-462e-9eae-f4f7bd18c2a7","resolution":{"observed_at":"2026-08-11T20:58:26.435422Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.414352Z","title":null,"venue":null,"work_id":"9e742e74-c8c3-4a0e-ac72-ea81eb9b6b7e","year":null},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":456,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.664740Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:d7a9ee577e4a462193309ef1cca697970753ed0ae8963a16fac5b4261fa6a96a","observation_id":"dfb4f7b5-50f9-494b-b438-653a7b19a22e","resolution":{"observed_at":"2026-08-11T20:58:26.419400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.919041Z","title":"Khalil, E., Dai, H., Zhang, Y ., Dilkina, B., and Song, L","venue":null,"work_id":"131ea663-882a-46f8-b776-c0231bc8b781","year":2001},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":1972,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.421400Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:473c403ce42dbb63090850d4eca13d27d08e4ddf1e8edf10334a462a5e11ed54","observation_id":"d5783e78-0fa6-4a01-a69f-d07a1829713a","resolution":{"observed_at":"2026-08-11T20:58:26.924818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.850222Z","title":"However, t heir reliance on large-scale semidefinite programming limi ts practical scalability and makes them less effective on mode rn large-scale instances","venue":null,"work_id":"af5e749e-cb75-4db3-b514-b765bedc0f98","year":1997},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.589727Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:62e7d39bf24912ea0e04a2f2e3beedc00a880a8b22b50786af7e79b0ac8b2c04","observation_id":"88aade93-2dae-4b4d-911b-29001c87ae50","resolution":{"observed_at":"2026-08-11T20:58:26.859594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.834980Z","title":"These methods often e xhibit poor objective consistency and limited generalization","venue":null,"work_id":"b0fd53c5-c48a-4441-8b88-82dc5572dc8a","year":2024},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.597897Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:f42aedb3056e7121f50012d3fb5406c0421b1bd71c0d28a4e80379cb20181cf3","observation_id":"1305a866-d5ff-4921-98c4-efbd33685731","resolution":{"observed_at":"2026-08-11T20:58:26.839748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.886020Z","title":"Data clustering and visualization with recursive goemans-williamson maxcut algorithm","venue":null,"work_id":"54b26b41-1d17-4e52-b1d5-b053fe3984b6","year":2023},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.437634Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:19e06f14c50a4bbb974430956a3de2f4a2d0dc43f089140dbd1afb5e06a0e2ad","observation_id":"7b14720e-5f8e-43c4-bacb-b7aacd3a8ab5","resolution":{"observed_at":"2026-08-11T20:58:26.891286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.902066Z","title":"S., and Falout- sos, C","venue":null,"work_id":"2c0b7e36-e6eb-4d8f-b4ed-e7c9afca4535","year":2016},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.426453Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:1954208ffc1c672d90db00eef6ac3ea9e7afd5eaaad8b407d617ecc93c9f2dab","observation_id":"4ddcd161-94fe-4a65-808f-ae12e5524e84","resolution":{"observed_at":"2026-08-11T20:58:26.908013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11897","last_updated":"2024-06-14T19:44:23Z","snapshot_observed_at":"2026-08-19T03:01:38.252875Z","submitted_at":"2024-06-14T19:44:23Z","title":"A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11897","snapshot_observed_at":"2026-08-11T20:58:25.538427Z","title":"and Kuhnle, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.538427Z"},"links":{"cited_paper":"/paper/2406.11897","citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:91c073fc57a01d23b115c48f3d18091e3bf7e5aa7ef878395535a2de26c684e8","observation_id":"187d7803-8136-472d-a312-c62fd5b02759","resolution":{"observed_at":"2026-08-11T20:58:25.538427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14105","last_updated":"2022-05-27T17:13:10Z","snapshot_observed_at":"2026-08-19T06:01:56.259609Z","submitted_at":"2022-05-27T17:13:10Z","title":"Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14105","snapshot_observed_at":"2026-08-11T20:58:25.408554Z","title":"D., Parsonson, C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.408554Z"},"links":{"cited_paper":"/paper/2205.14105","citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:21e6d34132e733868ec7baa45e9699bd2da73aafeb889d2023c92acb94484096","observation_id":"f2d1d54d-c965-4ffc-87d1-06d1d723444f","resolution":{"observed_at":"2026-08-11T20:58:25.408554Z","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-11T20:58:26.935191Z","title":"Gasse, M., Bowly, S., Cappart, Q., Charfreitag, J., Charlin , L., Chételat, D., Chmiela, A., Dumouchelle, J., Gleixner, A., Kazachkov, A","venue":null,"work_id":"605b2834-6e63-47c1-a8a9-1f4375f32200","year":2021},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.415170Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:432137f617d60a661e0e7424e319e03c266cb18fed5976741dba65087ed2ca67","observation_id":"afd504aa-99a0-4cba-86ac-9d908ce1c5b2","resolution":{"observed_at":"2026-08-11T20:58:26.940071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T20:58:26.870510Z","title":"Seminal SDP-based methods, such as Goemans-Williamson (Goemans & Williamson,","venue":null,"work_id":"02d970f2-7b8a-465a-8914-7b1d0082a6c0","year":2013},"citing_paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T20:58:25.584850Z"},"links":{"citing_paper":"/paper/2412.05146"},"observation_digest":"sha256:ddbc19d77918869f4380813870928a4aa270ebce8e5842c48d14e31b2e1a2401","observation_id":"2458546e-5ee2-486a-9ab4-999298a04b77","resolution":{"observed_at":"2026-08-11T20:58:26.875659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.05146","last_updated":"2025-06-11T17:32:17Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T14:12:58.215021Z","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":5,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":26},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2412.05146."}