{"as_of":"2026-08-07T08:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17e16dc7996f4b94c16665c952167504196b6a35ce83a4f2994410ee38bc3e87","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-05T05:49:44.984059Z","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-07-06T22:18:02.768240Z","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:ae61d053a2fe3713c72ebefb50892f5f40e019b52fe6b7c8b311c34292220615","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T05:49:44.984059Z","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:dc2be34d33b493858eca994eb5ef349092f6f30b41014ea673c17b6920081590","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-05T05:49:44.984059Z","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-07T03:03:30.395220Z","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:df388c2361644f9bc408d42a819ee88d5b444eec6c659b0d2e82410d56f9b88b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":[],"paper":{"arxiv_id":"2505.18508","last_updated":"2025-05-24T05:07:01Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-05T05:49:44.984059Z","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":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2505.18508."}