{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EIBOK7F6JIKBH6XLDTXZDRRWTH","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":"f8251265769aea9b240037f8403303f42b22e6a0507e8401b353c4dcb29a2345","cross_cats_sorted":["cond-mat.dis-nn","cs.DS","cs.LG","math.OC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-03-13T20:12:05Z","title_canon_sha256":"0276e9a666592a172b17007b164e0d8b58f246ad2ff5ae6ec3a0a859aebf2aba"},"schema_version":"1.0","source":{"id":"2403.09742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.09742","created_at":"2026-07-05T07:56:24Z"},{"alias_kind":"arxiv_version","alias_value":"2403.09742v1","created_at":"2026-07-05T07:56:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09742","created_at":"2026-07-05T07:56:24Z"},{"alias_kind":"pith_short_12","alias_value":"EIBOK7F6JIKB","created_at":"2026-07-05T07:56:24Z"},{"alias_kind":"pith_short_16","alias_value":"EIBOK7F6JIKBH6XL","created_at":"2026-07-05T07:56:24Z"},{"alias_kind":"pith_short_8","alias_value":"EIBOK7F6","created_at":"2026-07-05T07:56:24Z"}],"graph_snapshots":[{"event_id":"sha256:bdb2538cdcab8c6045003869fd14df2caa723ae7054513393afa9f9f808c6138","target":"graph","created_at":"2026-07-05T07:56:24Z","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/2403.09742/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This manuscript provides a comprehensive review of the Maximum Clique Problem, a computational problem that involves finding subsets of vertices in a graph that are all pairwise adjacent to each other. The manuscript covers in a simple way classical algorithms for solving the problem and includes a review of recent developments in graph neural networks and quantum algorithms. The review concludes with benchmarks for testing classical as well as new learning, and quantum algorithms.","authors_text":"Bogdan Zavalnij, Lorenzo Buffoni, Raffaele Marino","cross_cats":["cond-mat.dis-nn","cs.DS","cs.LG","math.OC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-03-13T20:12:05Z","title":"A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09742","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:1ed245c55836cfd7fd3b1ffb66d3a2c6538e929b20ec9958c3b8e4ec41137e1a","target":"record","created_at":"2026-07-05T07:56:24Z","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":"f8251265769aea9b240037f8403303f42b22e6a0507e8401b353c4dcb29a2345","cross_cats_sorted":["cond-mat.dis-nn","cs.DS","cs.LG","math.OC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-03-13T20:12:05Z","title_canon_sha256":"0276e9a666592a172b17007b164e0d8b58f246ad2ff5ae6ec3a0a859aebf2aba"},"schema_version":"1.0","source":{"id":"2403.09742","kind":"arxiv","version":1}},"canonical_sha256":"2202e57cbe4a1413faeb1cef91c63699f60e6e8623bb8271a49e4f4f60eaf1ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2202e57cbe4a1413faeb1cef91c63699f60e6e8623bb8271a49e4f4f60eaf1ac","first_computed_at":"2026-07-05T07:56:24.341178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:56:24.341178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NaRi4HzyLweIuh9P3Q1fUmQDuOUckhUfXdUXI3tk9vzxEzVrXFiPlz/t9xTmR8hA5rcvQ5rtMQXT5SqmZcWlBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:56:24.341698Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.09742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ed245c55836cfd7fd3b1ffb66d3a2c6538e929b20ec9958c3b8e4ec41137e1a","sha256:bdb2538cdcab8c6045003869fd14df2caa723ae7054513393afa9f9f808c6138"],"state_sha256":"e74cc4ca09ea78d6985bf3ec8cf520b53ba077e5d334be933918d6244dd63fa6"}