{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OXR2KTUOYV5JOHBOUAJXTNN7QI","short_pith_number":"pith:OXR2KTUO","schema_version":"1.0","canonical_sha256":"75e3a54e8ec57a971c2ea01379b5bf823d803e7f1d0cb4d2c6468d240f322f72","source":{"kind":"arxiv","id":"1801.00202","version":1},"attestation_state":"computed","paper":{"title":"Efficiently Enumerating all Maximal Cliques with Bit-Parallelism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Darren Strash, Jorge Artieda, Pablo San Segundo","submitted_at":"2017-12-30T22:29:04Z","abstract_excerpt":"The maximal clique enumeration (MCE) problem has numerous applications in biology, chemistry, sociology, and graph modeling. Though this problem is well studied, most current research focuses on finding solutions in large sparse graphs or very dense graphs, while sacrificing efficiency on the most difficult medium-density benchmark instances that are representative of data sets often encountered in practice. We show that techniques that have been successfully applied to the maximum clique problem give significant speed gains over the state-of-the-art MCE algorithms on these instances. Specific"},"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":"1801.00202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-30T22:29:04Z","cross_cats_sorted":[],"title_canon_sha256":"c073266caf6ae2d5faf81059fd4efae51325ccf917c72942c44d7a634ff66165","abstract_canon_sha256":"b580b20046304ac90c02a0389ceab96be18d186dc5711089d5552785aa07638c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:59.088692Z","signature_b64":"0rm7PaPqK27vva9oyEuwOe0rfv2572pm2pFCpew2HYoLDUki35jdS5llVyKDCM0oQHy5+McQdIDUuzr0N7RGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e3a54e8ec57a971c2ea01379b5bf823d803e7f1d0cb4d2c6468d240f322f72","last_reissued_at":"2026-05-18T00:26:59.088071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:59.088071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Enumerating all Maximal Cliques with Bit-Parallelism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Darren Strash, Jorge Artieda, Pablo San Segundo","submitted_at":"2017-12-30T22:29:04Z","abstract_excerpt":"The maximal clique enumeration (MCE) problem has numerous applications in biology, chemistry, sociology, and graph modeling. Though this problem is well studied, most current research focuses on finding solutions in large sparse graphs or very dense graphs, while sacrificing efficiency on the most difficult medium-density benchmark instances that are representative of data sets often encountered in practice. We show that techniques that have been successfully applied to the maximum clique problem give significant speed gains over the state-of-the-art MCE algorithms on these instances. Specific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00202","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":""},"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":"1801.00202","created_at":"2026-05-18T00:26:59.088166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00202v1","created_at":"2026-05-18T00:26:59.088166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00202","created_at":"2026-05-18T00:26:59.088166+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXR2KTUOYV5J","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXR2KTUOYV5JOHBO","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXR2KTUO","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI","json":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI.json","graph_json":"https://pith.science/api/pith-number/OXR2KTUOYV5JOHBOUAJXTNN7QI/graph.json","events_json":"https://pith.science/api/pith-number/OXR2KTUOYV5JOHBOUAJXTNN7QI/events.json","paper":"https://pith.science/paper/OXR2KTUO"},"agent_actions":{"view_html":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI","download_json":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI.json","view_paper":"https://pith.science/paper/OXR2KTUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00202&json=true","fetch_graph":"https://pith.science/api/pith-number/OXR2KTUOYV5JOHBOUAJXTNN7QI/graph.json","fetch_events":"https://pith.science/api/pith-number/OXR2KTUOYV5JOHBOUAJXTNN7QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI/action/storage_attestation","attest_author":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI/action/author_attestation","sign_citation":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI/action/citation_signature","submit_replication":"https://pith.science/pith/OXR2KTUOYV5JOHBOUAJXTNN7QI/action/replication_record"}},"created_at":"2026-05-18T00:26:59.088166+00:00","updated_at":"2026-05-18T00:26:59.088166+00:00"}