{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4FJK3P3DNC2IAE7ZT4F2YQVBRS","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":"c2f6b5c86f63a692f1a7e24020c144395caa2df1d4cd87fd1d64a06dcd58ddd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T12:54:44Z","title_canon_sha256":"fbc7e31d68989b9686cd49f34e6e8a44407530a45c74eab5573ec0f69c66d96d"},"schema_version":"1.0","source":{"id":"1407.1209","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1209","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1209v3","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1209","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"4FJK3P3DNC2I","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4FJK3P3DNC2IAE7Z","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4FJK3P3D","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:527478ae44c3a8e8a81f74655f7a472962ef0d40dd634e74d015b461187f978d","target":"graph","created_at":"2026-05-18T02:00:59Z","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 clique of maximum cardinality in an arbitrary graph is an NP-Hard problem that has many applications, which has motivated studies to solve it exactly despite its difficulty. The great majority of algorithms proposed in the literature are based on the Branch and Bound method. In this paper, we propose an exact algorithm for the maximum clique problem based on the Russian Dolls Search method. When compared to Branch and Bound, the main difference of the Russian Dolls method is that the nodes of its search tree correspond to decision subproblems, instead of the optimization subproblem","authors_text":"Bertrand Le Cun, Diego Delle Donne, Philippe Michelon, Ricardo C. Corr\\^ea, Thierry Mautor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T12:54:44Z","title":"A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1209","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:bd7d03dd9b1a46e4c2a8849edfd09b211b989593a5234faee67f8399bdea2b76","target":"record","created_at":"2026-05-18T02:00:59Z","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":"c2f6b5c86f63a692f1a7e24020c144395caa2df1d4cd87fd1d64a06dcd58ddd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T12:54:44Z","title_canon_sha256":"fbc7e31d68989b9686cd49f34e6e8a44407530a45c74eab5573ec0f69c66d96d"},"schema_version":"1.0","source":{"id":"1407.1209","kind":"arxiv","version":3}},"canonical_sha256":"e152adbf6368b48013f99f0bac42a18cbc3809c9807db54bba0fe26f22357b53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e152adbf6368b48013f99f0bac42a18cbc3809c9807db54bba0fe26f22357b53","first_computed_at":"2026-05-18T02:00:59.016266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:59.016266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1gDZQhcSBBPxM4UbliY7GKMCrXrfX7kPqb27i9KSCsTzRV+DBMxJrC5oT5rwZC+6qp2WO+Nc0dVw0ydtwN6/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:59.016974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1209","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd7d03dd9b1a46e4c2a8849edfd09b211b989593a5234faee67f8399bdea2b76","sha256:527478ae44c3a8e8a81f74655f7a472962ef0d40dd634e74d015b461187f978d"],"state_sha256":"b36944a405e2efff3f22533de8778ecd85d4a792f21e2a0916b172d869a2a825"}