{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5SGFIDNHTUJZCAPEKWNNLWYQXY","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":"6fa32a8dd3eeb79469dbed337061e5b1b7a0d9dc904112b52facf49ec1a4992b","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-24T21:12:43Z","title_canon_sha256":"7b0c63f92e88379a8df226a15ca311b5a7d22db3921fe635962b0b4f0dff4f4a"},"schema_version":"1.0","source":{"id":"1110.5355","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5355","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5355v3","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5355","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"pith_short_12","alias_value":"5SGFIDNHTUJZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5SGFIDNHTUJZCAPE","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5SGFIDNH","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:4e2a362b7996638182ce9c7a779e00e70d421c1d4e28cf664fcac90d199369b9","target":"graph","created_at":"2026-05-18T04:02:01Z","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"},"paper":{"abstract_excerpt":"Finding the maximum clique is a known NP-Complete problem and it is also hard to approximate. This work proposes two efficient algorithms to obtain it. Nevertheless, the first one is able to fins the maximum for some special cases, while the second one has its execution time bounded by the number of cliques that each vertex belongs to.","authors_text":"Jos\\'e Ignacio Alvarez-Hamelin","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-24T21:12:43Z","title":"Is it possible to find the maximum clique in general graphs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5355","kind":"arxiv","version":3},"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:12d26e28539b3cb647fa0f5eaa292e683f1719788638f81dc67c3de6d3970527","target":"record","created_at":"2026-05-18T04:02:01Z","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":"6fa32a8dd3eeb79469dbed337061e5b1b7a0d9dc904112b52facf49ec1a4992b","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-24T21:12:43Z","title_canon_sha256":"7b0c63f92e88379a8df226a15ca311b5a7d22db3921fe635962b0b4f0dff4f4a"},"schema_version":"1.0","source":{"id":"1110.5355","kind":"arxiv","version":3}},"canonical_sha256":"ec8c540da79d139101e4559ad5db10be30cc9a1844d495ac4b5a04d2fae15dc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec8c540da79d139101e4559ad5db10be30cc9a1844d495ac4b5a04d2fae15dc6","first_computed_at":"2026-05-18T04:02:01.705329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:01.705329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GNTgUtp7io2q8XxYaOvZUjxk2K1+8o86Kf46XWB5gSYrAWenmfgIlBFQzQpEnksLzc3/bkhLX/1ygu2JeUeVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:01.706103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5355","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12d26e28539b3cb647fa0f5eaa292e683f1719788638f81dc67c3de6d3970527","sha256:4e2a362b7996638182ce9c7a779e00e70d421c1d4e28cf664fcac90d199369b9"],"state_sha256":"5734bc56cfa450f03b6d5c9a32699a95f85b5c45e6cfeeaba866f3406c19361e"}