{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EIBOK7F6JIKBH6XLDTXZDRRWTH","short_pith_number":"pith:EIBOK7F6","schema_version":"1.0","canonical_sha256":"2202e57cbe4a1413faeb1cef91c63699f60e6e8623bb8271a49e4f4f60eaf1ac","source":{"kind":"arxiv","id":"2403.09742","version":1},"attestation_state":"computed","paper":{"title":"A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.DS","cs.LG","math.OC","quant-ph"],"primary_cat":"cs.AI","authors_text":"Bogdan Zavalnij, Lorenzo Buffoni, Raffaele Marino","submitted_at":"2024-03-13T20:12:05Z","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."},"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":"2403.09742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-03-13T20:12:05Z","cross_cats_sorted":["cond-mat.dis-nn","cs.DS","cs.LG","math.OC","quant-ph"],"title_canon_sha256":"0276e9a666592a172b17007b164e0d8b58f246ad2ff5ae6ec3a0a859aebf2aba","abstract_canon_sha256":"f8251265769aea9b240037f8403303f42b22e6a0507e8401b353c4dcb29a2345"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:24.341698Z","signature_b64":"NaRi4HzyLweIuh9P3Q1fUmQDuOUckhUfXdUXI3tk9vzxEzVrXFiPlz/t9xTmR8hA5rcvQ5rtMQXT5SqmZcWlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2202e57cbe4a1413faeb1cef91c63699f60e6e8623bb8271a49e4f4f60eaf1ac","last_reissued_at":"2026-07-05T07:56:24.341178Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:24.341178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.DS","cs.LG","math.OC","quant-ph"],"primary_cat":"cs.AI","authors_text":"Bogdan Zavalnij, Lorenzo Buffoni, Raffaele Marino","submitted_at":"2024-03-13T20:12:05Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09742","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/2403.09742/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":"2403.09742","created_at":"2026-07-05T07:56:24.341238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09742v1","created_at":"2026-07-05T07:56:24.341238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09742","created_at":"2026-07-05T07:56:24.341238+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIBOK7F6JIKB","created_at":"2026-07-05T07:56:24.341238+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIBOK7F6JIKBH6XL","created_at":"2026-07-05T07:56:24.341238+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIBOK7F6","created_at":"2026-07-05T07:56:24.341238+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.27522","citing_title":"Displaced Gaussian Boson Sampling for enhanced max-clique search","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2504.07204","citing_title":"Rounding the Lov\\'asz Theta Function with a Value Function Approximation","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH","json":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH.json","graph_json":"https://pith.science/api/pith-number/EIBOK7F6JIKBH6XLDTXZDRRWTH/graph.json","events_json":"https://pith.science/api/pith-number/EIBOK7F6JIKBH6XLDTXZDRRWTH/events.json","paper":"https://pith.science/paper/EIBOK7F6"},"agent_actions":{"view_html":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH","download_json":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH.json","view_paper":"https://pith.science/paper/EIBOK7F6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09742&json=true","fetch_graph":"https://pith.science/api/pith-number/EIBOK7F6JIKBH6XLDTXZDRRWTH/graph.json","fetch_events":"https://pith.science/api/pith-number/EIBOK7F6JIKBH6XLDTXZDRRWTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH/action/storage_attestation","attest_author":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH/action/author_attestation","sign_citation":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH/action/citation_signature","submit_replication":"https://pith.science/pith/EIBOK7F6JIKBH6XLDTXZDRRWTH/action/replication_record"}},"created_at":"2026-07-05T07:56:24.341238+00:00","updated_at":"2026-07-05T07:56:24.341238+00:00"}