{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SHZQH36RCVVVOI4NWYRMAEU4Y3","short_pith_number":"pith:SHZQH36R","schema_version":"1.0","canonical_sha256":"91f303efd1156b57238db622c0129cc6fdadcc01f2934c02f111f2cd4810f7ef","source":{"kind":"arxiv","id":"2606.01826","version":1},"attestation_state":"computed","paper":{"title":"Revisiting the Quantum-Guided Cluster Algorithm: Improvements and Numerical Experiments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter J. Eder, Sarah Braun","submitted_at":"2026-06-01T07:41:46Z","abstract_excerpt":"We study correlation-guided cluster algorithms for solving the Max-Cut problem that iteratively try to improve solutions by updating clusters of nodes. Building on the recently proposed quantum-guided cluster algorithm (QGCA) [arXiv:2508.10656], which leverages precomputed two-point correlations to guide collective updates, we extend the cluster construction by incorporating next-nearest-neighbor (NNN) information. We evaluate this extension across different correlation sources on random regular graphs and non-degenerate tile-planted instances. Notably, we observe particularly strong performan"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.01826","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-01T07:41:46Z","cross_cats_sorted":[],"title_canon_sha256":"7dd1f357e0b9e11bb6b5f8339860cf5b06c2127de3eb5896268f646c91b27db3","abstract_canon_sha256":"234131bbb0d86ce948ab82c2b1a6bdbe594792b16774f2a31a7c67c0bbf06c66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:57.917060Z","signature_b64":"Mc1NVT/CmLBGpn0VznKipzU9/R/B2ta7iyl3zCFVC8WLlU5dzDM9yXQ1N3zFmcAiCJwKSkIKfbDdi/EmyKUhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f303efd1156b57238db622c0129cc6fdadcc01f2934c02f111f2cd4810f7ef","last_reissued_at":"2026-06-02T02:04:57.916717Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:57.916717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting the Quantum-Guided Cluster Algorithm: Improvements and Numerical Experiments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter J. Eder, Sarah Braun","submitted_at":"2026-06-01T07:41:46Z","abstract_excerpt":"We study correlation-guided cluster algorithms for solving the Max-Cut problem that iteratively try to improve solutions by updating clusters of nodes. Building on the recently proposed quantum-guided cluster algorithm (QGCA) [arXiv:2508.10656], which leverages precomputed two-point correlations to guide collective updates, we extend the cluster construction by incorporating next-nearest-neighbor (NNN) information. We evaluate this extension across different correlation sources on random regular graphs and non-degenerate tile-planted instances. Notably, we observe particularly strong performan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01826","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01826/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.01826","created_at":"2026-06-02T02:04:57.916781+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01826v1","created_at":"2026-06-02T02:04:57.916781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01826","created_at":"2026-06-02T02:04:57.916781+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHZQH36RCVVV","created_at":"2026-06-02T02:04:57.916781+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHZQH36RCVVVOI4N","created_at":"2026-06-02T02:04:57.916781+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHZQH36R","created_at":"2026-06-02T02:04:57.916781+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05169","citing_title":"Ising-Machine-Assisted Large Neighborhood Search with Flexibly Tunable Subproblem Size","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3","json":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3.json","graph_json":"https://pith.science/api/pith-number/SHZQH36RCVVVOI4NWYRMAEU4Y3/graph.json","events_json":"https://pith.science/api/pith-number/SHZQH36RCVVVOI4NWYRMAEU4Y3/events.json","paper":"https://pith.science/paper/SHZQH36R"},"agent_actions":{"view_html":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3","download_json":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3.json","view_paper":"https://pith.science/paper/SHZQH36R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01826&json=true","fetch_graph":"https://pith.science/api/pith-number/SHZQH36RCVVVOI4NWYRMAEU4Y3/graph.json","fetch_events":"https://pith.science/api/pith-number/SHZQH36RCVVVOI4NWYRMAEU4Y3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/action/storage_attestation","attest_author":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/action/author_attestation","sign_citation":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/action/citation_signature","submit_replication":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/action/replication_record"}},"created_at":"2026-06-02T02:04:57.916781+00:00","updated_at":"2026-06-02T02:04:57.916781+00:00"}