{"as_of":"2026-08-20T07:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55ed46e2c56d48ab23e8d9f656685e12dc1ea8a3be855d64dcecbbdf2a3d5e52","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:46:01.822633Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T18:53:50.364696Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1505.03068","last_updated":"2015-05-09T16:58:16Z","snapshot_observed_at":"2026-08-20T01:59:58.253374Z","submitted_at":"2015-05-09T16:58:16Z","title":"Solving maximum cut problems by simulated annealing","version":1},"cited_work":{"arxiv_id":"1505.03068","doi":null,"metadata_source":"pith","pith_arxiv_id":"1505.03068","snapshot_observed_at":"2026-08-11T18:53:50.364696Z","title":"Solving maximum cut problems by simulated annealing","venue":"math.OC","work_id":"3ae0190e-c68f-4a39-9323-6c3648af584b","year":2015},"citing_paper":{"arxiv_id":"2412.07460","last_updated":"2024-12-10T12:28:08Z","snapshot_observed_at":"2026-08-14T00:24:11.682440Z","submitted_at":"2024-12-10T12:28:08Z","title":"Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T18:53:49.740598Z"},"links":{"cited_paper":"/paper/1505.03068","citing_paper":"/paper/2412.07460"},"observation_digest":"sha256:1facb8f6ebc462e17791f141a615017d140a40e10b114184a659b0b812c2ea2c","observation_id":"5c1c9338-c8b5-49f0-ae3f-adb16bcb48ed","resolution":{"observed_at":"2026-08-11T18:53:50.371056Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1505.03068","last_updated":"2015-05-09T16:58:16Z","snapshot_observed_at":"2026-08-20T01:59:58.253374Z","submitted_at":"2015-05-09T16:58:16Z","title":"Solving maximum cut problems by simulated annealing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.03068","snapshot_observed_at":"2026-08-15T19:46:01.822633Z","title":"Solving maximum cut problems by simulated annealing","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.15196","last_updated":"2025-06-24T14:48:12Z","snapshot_observed_at":"2026-08-17T10:07:56.386477Z","submitted_at":"2025-06-18T07:20:01Z","title":"HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T19:46:01.822633Z"},"links":{"cited_paper":"/paper/1505.03068","citing_paper":"/paper/2506.15196"},"observation_digest":"sha256:cca5d865e6d530b74c15b881453e165e642fb899dd484ca6cecadbd70aa6a02f","observation_id":"52a81912-dafe-40b9-98ca-11d36a684b15","resolution":{"observed_at":"2026-08-15T19:46:01.822633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1505.03068/citation-record","integrity":"/paper/1505.03068/integrity","json":"/paper/1505.03068/citation-record.json","paper":"/paper/1505.03068"},"outbound":[],"paper":{"arxiv_id":"1505.03068","last_updated":"2015-05-09T16:58:16Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-20T01:59:58.253374Z","submitted_at":"2015-05-09T16:58:16Z","title":"Solving maximum cut problems by simulated annealing"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1505.03068."}