{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SHZQH36RCVVVOI4NWYRMAEU4Y3","short_pith_number":"pith:SHZQH36R","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"},"canonical_sha256":"91f303efd1156b57238db622c0129cc6fdadcc01f2934c02f111f2cd4810f7ef","source":{"kind":"arxiv","id":"2606.01826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01826","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01826v1","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01826","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"SHZQH36RCVVV","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"SHZQH36RCVVVOI4N","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"SHZQH36R","created_at":"2026-06-02T02:04:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SHZQH36RCVVVOI4NWYRMAEU4Y3","target":"record","payload":{"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"},"canonical_sha256":"91f303efd1156b57238db622c0129cc6fdadcc01f2934c02f111f2cd4810f7ef","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"},"source_kind":"arxiv","source_id":"2606.01826","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qoU8yUpPOlnBosT9jWO9QvwSuH7IVkrdwDYwcUU1J1fMvhkJbuGW/yv36q0QZsnQHNVixZrifnfhNNH20cXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:48:58.431935Z"},"content_sha256":"990c67d7c50a106b1f71f365543b141416022584a53e52f3412f5ca6de4ac781","schema_version":"1.0","event_id":"sha256:990c67d7c50a106b1f71f365543b141416022584a53e52f3412f5ca6de4ac781"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SHZQH36RCVVVOI4NWYRMAEU4Y3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yF9Ot+/HlJ7vZ83TY+kEVV7dj8wBBcWAcU98h4j1HPYYWTjM9R5FkdeD9TV3ED9EUhJSa59m5hKjfXi/CLiQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:48:58.432567Z"},"content_sha256":"95de0783a0d04089818c95b460b2ff42abc9c233e904170b208b5a8155d13548","schema_version":"1.0","event_id":"sha256:95de0783a0d04089818c95b460b2ff42abc9c233e904170b208b5a8155d13548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/bundle.json","state_url":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T07:48:58Z","links":{"resolver":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3","bundle":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/bundle.json","state":"https://pith.science/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHZQH36RCVVVOI4NWYRMAEU4Y3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SHZQH36RCVVVOI4NWYRMAEU4Y3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"234131bbb0d86ce948ab82c2b1a6bdbe594792b16774f2a31a7c67c0bbf06c66","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-01T07:41:46Z","title_canon_sha256":"7dd1f357e0b9e11bb6b5f8339860cf5b06c2127de3eb5896268f646c91b27db3"},"schema_version":"1.0","source":{"id":"2606.01826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01826","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01826v1","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01826","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"SHZQH36RCVVV","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"SHZQH36RCVVVOI4N","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"SHZQH36R","created_at":"2026-06-02T02:04:57Z"}],"graph_snapshots":[{"event_id":"sha256:95de0783a0d04089818c95b460b2ff42abc9c233e904170b208b5a8155d13548","target":"graph","created_at":"2026-06-02T02:04:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.01826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Peter J. Eder, Sarah Braun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-01T07:41:46Z","title":"Revisiting the Quantum-Guided Cluster Algorithm: Improvements and Numerical Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01826","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:990c67d7c50a106b1f71f365543b141416022584a53e52f3412f5ca6de4ac781","target":"record","created_at":"2026-06-02T02:04:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"234131bbb0d86ce948ab82c2b1a6bdbe594792b16774f2a31a7c67c0bbf06c66","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-01T07:41:46Z","title_canon_sha256":"7dd1f357e0b9e11bb6b5f8339860cf5b06c2127de3eb5896268f646c91b27db3"},"schema_version":"1.0","source":{"id":"2606.01826","kind":"arxiv","version":1}},"canonical_sha256":"91f303efd1156b57238db622c0129cc6fdadcc01f2934c02f111f2cd4810f7ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91f303efd1156b57238db622c0129cc6fdadcc01f2934c02f111f2cd4810f7ef","first_computed_at":"2026-06-02T02:04:57.916717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:57.916717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mc1NVT/CmLBGpn0VznKipzU9/R/B2ta7iyl3zCFVC8WLlU5dzDM9yXQ1N3zFmcAiCJwKSkIKfbDdi/EmyKUhCw==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:57.917060Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:990c67d7c50a106b1f71f365543b141416022584a53e52f3412f5ca6de4ac781","sha256:95de0783a0d04089818c95b460b2ff42abc9c233e904170b208b5a8155d13548"],"state_sha256":"3db74c8d8f79048426edec719155c1f3916bd0b83a1ee293122d8f997e0d4452"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDEeRl3dh9RSIE6d5b8jv1GEpxL35aXHJUVcUPlkgC0dNRyUS6v5oudKV/oZLDP4xvefioa4st2ef2rHdI1lDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:48:58.438191Z","bundle_sha256":"49c203a774d569a3faea84a639dcd446b5c73de946175057bf28ddbcffd03afa"}}