{"as_of":"2026-08-15T07:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17ed5ffd47d9f8807b607dc46b6e45fb84c0581096a73122161dadf16fb431c7","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:34:34.357137Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T19:44:00.781847Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T20:10:07.190531Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"cited_work":{"arxiv_id":"2505.18508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.18508","snapshot_observed_at":"2026-07-04T20:10:07.190531Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut = 14060)","venue":null,"work_id":"2fe06dd9-0c87-4132-a18c-f68abbdcdfa3","year":2025},"citing_paper":{"arxiv_id":"2508.17655","last_updated":"2026-02-12T08:44:51Z","snapshot_observed_at":"2026-08-11T17:46:26.775734Z","submitted_at":"2025-08-25T04:31:57Z","title":"Edge-of-chaos enhanced quantum-inspired algorithm for combinatorial optimization","version":5},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-18T22:05:36.182680Z"},"links":{"cited_paper":"/paper/2505.18508","citing_paper":"/paper/2508.17655"},"observation_digest":"sha256:ba42278f558da3fc5dfb45e34e047286743e0d00a86fe1cec6f83114b8c0c194","observation_id":"12077c7a-85cf-4c71-8a05-cf1ee516a588","resolution":{"observed_at":"2026-05-18T22:06:51.589061Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.18508","snapshot_observed_at":"2026-07-12T19:44:00.781847Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060),","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.30355","last_updated":"2026-06-01T03:59:44Z","snapshot_observed_at":"2026-07-12T19:44:00.422537Z","submitted_at":"2026-04-16T17:42:58Z","title":"Cosm: Collective Switched Motion for Fast and Accurate Sparse Ising Optimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-12T19:44:00.781847Z"},"links":{"cited_paper":"/paper/2505.18508","citing_paper":"/paper/2605.30355"},"observation_digest":"sha256:a147ad2fa0bacc7d83275875dbedfc82ab9d73dc0e5d78a6495b70e7762fe9fe","observation_id":"c0a993f1-345b-40f0-93c8-761717030983","resolution":{"observed_at":"2026-07-12T19:44:00.781847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"cited_work":{"arxiv_id":"2505.18508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.18508","snapshot_observed_at":"2026-07-04T20:10:07.190531Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut = 14060)","venue":null,"work_id":"2fe06dd9-0c87-4132-a18c-f68abbdcdfa3","year":2025},"citing_paper":{"arxiv_id":"2606.25313","last_updated":"2026-06-24T02:26:33Z","snapshot_observed_at":"2026-08-11T17:37:54.786129Z","submitted_at":"2026-06-24T02:26:33Z","title":"Programmable Probabilistic Computer with 1,000,000 p-bits","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-25T20:44:30.520336Z"},"links":{"cited_paper":"/paper/2505.18508","citing_paper":"/paper/2606.25313"},"observation_digest":"sha256:d5eb57317525db9e3edc59d0a17a28d16138a67a3e21ea9e79a016a9c82e1514","observation_id":"ef7962d5-a408-408a-8fd7-bf7ff1cf79da","resolution":{"observed_at":"2026-07-04T20:10:07.192133Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.18508/citation-record","integrity":"/paper/2505.18508/integrity","json":"/paper/2505.18508/citation-record.json","paper":"/paper/2505.18508"},"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-07T14:34:34.627627Z","title":"Retrieved April 2025","venue":null,"work_id":"a7801c36-39a8-49ce-9ac3-6c14c5927edd","year":2025},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.266495Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:a57c2cc22c356a8701ecbf9f912ba174323714ed4e20de504c5fd990d75a9da4","observation_id":"904e7aac-f83d-45bc-9a90-7ed8149b9311","resolution":{"observed_at":"2026-08-07T14:34:34.632102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.618495Z","title":"Mixed linear and semidefinite programming for combinatorial and quadratic optimization,","venue":null,"work_id":"f5695086-b165-48e1-81c9-b9529c46464b","year":1999},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.270459Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:b3df07a9fc5a792979255c7c95cce3d8060af089fc836210145dbfe7f55c7088","observation_id":"84ddfa5d-af6a-44a8-8cb0-84dc9df8df53","resolution":{"observed_at":"2026-08-07T14:34:34.621821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.609256Z","title":"Solving Sparse Semidefinite Programs Using the Dual Scaling Algorithm with an Iterative Solver,","venue":null,"work_id":"50097315-7e88-4039-bef4-05650f634efa","year":2000},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.275025Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:ab920d8fb7ee63c5a42b571f1096b1171c70ce5d07b6f565206fef8b246dcd0b","observation_id":"d3ae96f8-c881-411f-97ad-8e93ca52beb1","resolution":{"observed_at":"2026-08-07T14:34:34.612618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.598847Z","title":"Spinto: High -performance energy minimization in spin glasses,","venue":null,"work_id":"812b6d89-196d-42e4-9dc8-1e63607b7aae","year":2010},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.279373Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:dd1d63302a868d5393cb430a4a83cba85bdb06852ea22ddbc228c1257ec34591","observation_id":"2176935c-9d67-4aae-8964-5142700b796d","resolution":{"observed_at":"2026-08-07T14:34:34.603369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.588213Z","title":"Rank-two relaxation heuristics for MAX CUT and other binary quadratic programs ,","venue":null,"work_id":"27f2691b-ca73-4ca8-aade-9df5df6f370d","year":2002},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.283605Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:4b0ba0c039e1ade75389eb7b3f4fb9badb6c7fe77d761db2653372f079a21d53","observation_id":"92508780-7042-46f5-af51-f95497b07a99","resolution":{"observed_at":"2026-08-07T14:34:34.592390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.576839Z","title":"Performance of quantum annealing inspired algorithms for combinatorial optimization problems,","venue":null,"work_id":"8636dc7e-adec-4f4c-b2b5-cb80e650f7e5","year":2024},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.287207Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:1dd41709bbbf2460871a9bdeb7f8ea1255c81921de3564554b5341fa375865dd","observation_id":"c890479c-7f2d-4edf-9b03-ff718a6838bb","resolution":{"observed_at":"2026-08-07T14:34:34.581137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.566171Z","title":"Breakout Local Search for the Max -Cut problem,","venue":null,"work_id":"4cdb3ab7-7289-4292-bc79-ed225d00dd11","year":2013},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.290793Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:3c275205d4709b5341dba8a9baf73f39a6518fd661dd1f3fb4d7c87737666560","observation_id":"62814a91-5876-4323-af56-295591baa2d0","resolution":{"observed_at":"2026-08-07T14:34:34.569997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.556361Z","title":"Ising machines as hardware solvers of combinatorial optimization problems,","venue":null,"work_id":"a339fcc9-8285-45f6-a9af-b3e928e2fb35","year":2022},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.294918Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:32bdc075fe9d825516d84cb70b0ee2a9116cd8758925ed7ad4393d798484671e","observation_id":"ab7d82a8-9dec-4830-a05b-ef9bf17c41aa","resolution":{"observed_at":"2026-08-07T14:34:34.560579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.546421Z","title":"High -performance combinatorial optimization based on classical mechanics,","venue":null,"work_id":"da61e787-6997-4276-9128-8318e88ecc0a","year":2021},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.299336Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:57bce581ba53737f81c9ade95666294306264858cb77a9e260107181ac7d7c06","observation_id":"2d3aaa2f-46e3-460b-abc8-8fe3be15d183","resolution":{"observed_at":"2026-08-07T14:34:34.550533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.09275","last_updated":"2023-11-15T17:59:06Z","snapshot_observed_at":"2026-08-14T07:11:21.740942Z","submitted_at":"2023-11-15T17:59:06Z","title":"Improved Sparse Ising Optimization","version":1},"cited_work":{"arxiv_id":"2311.09275","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.09275","snapshot_observed_at":"2026-08-07T14:34:34.432111Z","title":"Improved Sparse Ising Optimization","venue":"cs.LG","work_id":"9d65b3d8-2506-43c5-bce3-4287afe7c700","year":2023},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.303405Z"},"links":{"cited_paper":"/paper/2311.09275","citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:aac59fc2167c40685902b677bfd1634832f8c9f509dfbd2679432a15c05c6030","observation_id":"58143ec1-28cc-4873-a00f-a1096c232e83","resolution":{"observed_at":"2026-08-07T14:34:34.435293Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.536417Z","title":"McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems ,","venue":null,"work_id":"01b92f18-8754-46be-a7e9-0e913616b503","year":2022},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.307169Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:c470df78804c7bf0e6f13512c479dbf5db49a8425475d3a99a7d2bf105df6fc1","observation_id":"4dc1a265-2079-47cf-a3f7-a572705c3ba4","resolution":{"observed_at":"2026-08-07T14:34:34.539970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.525994Z","title":"Faster exact solution of sparse MaxCut and QUBO problems ,","venue":null,"work_id":"d0e2e1d8-4bce-4b53-ba75-dc9852f54f09","year":2023},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.311201Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:32b7f6dc2ba3495eb63e8de55b9e1ca32504b3c497a2afc4d892e507aad4a7d0","observation_id":"8121ad67-caf4-40a4-bbc5-466d6740d033","resolution":{"observed_at":"2026-08-07T14:34:34.529706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.12594","last_updated":"2023-06-20T22:32:13Z","snapshot_observed_at":"2026-08-13T11:55:44.301598Z","submitted_at":"2023-04-25T06:02:23Z","title":"Analog Iterative Machine (AIM): using light to solve quadratic optimization problems with mixed variables","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.12594","snapshot_observed_at":"2026-08-07T14:34:34.315153Z","title":"Analog Iterative Machine (AIM): using light to solve quadratic optimization problems with mixed variables,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.315153Z"},"links":{"cited_paper":"/paper/2304.12594","citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:c972f0ca87dcf1f14f3f9be9879c8d8964b34e91c45fa20d6260dfcf4a32b506","observation_id":"79bae63e-8d8f-4ea3-bc1c-3a941edd22ce","resolution":{"observed_at":"2026-08-07T14:34:34.315153Z","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-07T14:34:34.515993Z","title":"Team s of Global Equilibrium Search Algorithms for Solving the Weighted Maximum Cut Problem in Parallel,","venue":null,"work_id":"bbcf3ba2-0ada-442b-a41b-a08000b7c8bc","year":2015},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.319898Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:1faf076516533de45fa44f60a19a53cb8d6a57b518aa97ebaa4445353bcf23ba","observation_id":"7273cc30-3a12-42c4-8c36-95e6f41d38b5","resolution":{"observed_at":"2026-08-07T14:34:34.520129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.506328Z","title":"On the emerging potential of quantum annealing hardware for combinatorial optimization ,","venue":null,"work_id":"f5763987-7dda-418c-b781-aeb0560b932d","year":2024},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.323716Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:cc823c61830d2b38e6668f5180f4ac340982019e3eb20c4d6b8fab0404115a71","observation_id":"743bb135-cc98-4cef-8e22-44314dc8958b","resolution":{"observed_at":"2026-08-07T14:34:34.509914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16990","last_updated":"2024-05-01T19:47:16Z","snapshot_observed_at":"2026-08-13T00:21:57.812052Z","submitted_at":"2024-04-25T19:20:44Z","title":"Record Acceleration of the Two-Dimensional Ising Model Using High-Performance Wafer Scale Engine","version":2},"cited_work":{"arxiv_id":"2404.16990","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.16990","snapshot_observed_at":"2026-08-07T14:34:34.409636Z","title":"Record Acceleration of the Two-Dimensional Ising Model Using High-Performance Wafer Scale Engine","venue":"cs.AR","work_id":"86a91881-94c6-4461-9b5a-9e9adef049c5","year":2024},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.328673Z"},"links":{"cited_paper":"/paper/2404.16990","citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:bff270c67652ed1a6f5c0d3643a623124dc994407988de0def09c37b7656d64e","observation_id":"9abe6a96-1366-45fd-870d-39acc6fe6890","resolution":{"observed_at":"2026-08-07T14:34:34.414050Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.494737Z","title":"Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension,","venue":null,"work_id":"7cdf7d5b-8f33-4a31-b868-bd7c5fd06b2b","year":2015},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.332418Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:b63e40d79e27fc18a444045761af655d6edfb6a20a3fbaa2c48c2cf70ea109ff","observation_id":"2b880221-0409-4669-aac4-ef3f5530d934","resolution":{"observed_at":"2026-08-07T14:34:34.499258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.482841Z","title":"Physics -Inspired Optimization for Quadratic Uncon strained Problems Using a Digital Annealer,","venue":null,"work_id":"21be8342-0740-4be1-805f-427fb513be69","year":2019},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.335529Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:17d09295c60c1e8aedf836a69e4d7f8893f9f89288d0fed9c1b580fa6532f083","observation_id":"689dcb98-b467-4975-8adb-daa520e108b4","resolution":{"observed_at":"2026-08-07T14:34:34.487258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.473267Z","title":"Scaling Advantage in Approximate Optimization with Quantum Annealing,","venue":null,"work_id":"b775906f-724a-42f5-a8f4-f44368892586","year":2025},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.339001Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:2bf0395a816168af82a002c394824fece9b0823beba8cf0a1711ace6535d9a4d","observation_id":"7cbeac15-fc7b-4a5c-927f-0eaf38131937","resolution":{"observed_at":"2026-08-07T14:34:34.476578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15427","last_updated":"2025-09-02T18:03:22Z","snapshot_observed_at":"2026-08-09T15:42:04.933007Z","submitted_at":"2025-03-19T17:08:55Z","title":"Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15427","snapshot_observed_at":"2026-08-07T14:34:34.342699Z","title":"Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.342699Z"},"links":{"cited_paper":"/paper/2503.15427","citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:1f60265572fd5a2c0071289ffe135b81ca044fb1f4108f787d45e5382208fca5","observation_id":"6c2e6c07-4797-4a63-860e-c9c576d284e3","resolution":{"observed_at":"2026-08-07T14:34:34.342699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01177","last_updated":"2025-06-02T19:00:46Z","snapshot_observed_at":"2026-08-07T17:34:51.882000Z","submitted_at":"2025-03-03T04:50:53Z","title":"Scalable Connectivity for Ising Machines: Dense to Sparse","version":3},"cited_work":{"arxiv_id":"2503.01177","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.01177","snapshot_observed_at":"2026-08-07T14:34:34.385912Z","title":"Scalable Connectivity for Ising Machines: Dense to Sparse","venue":"cs.ET","work_id":"18e26f9b-c6ac-4f24-9e35-a91d2440de4b","year":2025},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.347133Z"},"links":{"cited_paper":"/paper/2503.01177","citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:592e910b8f826c4b2c60ec23da11798d8528f4878c7d78e64de9ce40c450bb64","observation_id":"64047ecc-0b0c-4e81-98e8-75ec2e6bd8be","resolution":{"observed_at":"2026-08-07T14:34:34.391584Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.463590Z","title":"Shylo and O.V","venue":null,"work_id":"4a694628-2eee-4c88-a30b-13a9ebfbf0d1","year":2017},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.350655Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:c832b700bf1ebaf2b1008cee423b18791d51efc9f613db93c14268c3c99c8fe2","observation_id":"6a869584-7598-4565-971b-e1c2b0078db5","resolution":{"observed_at":"2026-08-07T14:34:34.467128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.452306Z","title":"A memetic algorithm based on edge- state learning for max-cut,","venue":null,"work_id":"3bdeb895-6f99-442a-bf37-f2fe10d63e0a","year":2022},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.353837Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:4f7a282f6f01bc5dcf280f6441b232fa90a7002d662861b6ae2f09a6ac17c150","observation_id":"1f4d9db6-adcc-4932-96c3-5acf4a8d7e77","resolution":{"observed_at":"2026-08-07T14:34:34.456732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T14:34:34.442157Z","title":"A multiple search operator heuristic for the max- k-cut problem,","venue":null,"work_id":"e1f6f133-dec5-409b-91f8-f63bf21b6f26","year":2017},"citing_paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:34:34.357137Z"},"links":{"citing_paper":"/paper/2505.18508"},"observation_digest":"sha256:ae7b83a600eb175149e5a18572b29c08a3e13afeba0cb3c8d11e51be6adfb90f","observation_id":"6071282a-56bf-40c5-bdbf-7f77d760161b","resolution":{"observed_at":"2026-08-07T14:34:34.446153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T04:45:24.261456Z","submitted_at":"2025-05-24T05:07:01Z","title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":3,"verified_fuzzy":19},"total_outbound_references":24},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 3 inbound Pith citation observations for arXiv:2505.18508."}