{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:URSTSGGJBAESU527HFENQ3OVTF","short_pith_number":"pith:URSTSGGJ","schema_version":"1.0","canonical_sha256":"a4653918c908092a775f3948d86dd59952385c3ae30c9142f3a444e64101d6f3","source":{"kind":"arxiv","id":"2311.00279","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Maximal Clique Enumeration via Graph Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Hong Cheng, Weiguo Zheng, Wen Deng","submitted_at":"2023-11-01T04:05:01Z","abstract_excerpt":"As a fundamental task in graph data management, maximal clique enumeration (MCE) has attracted extensive attention from both academic and industrial communities due to its wide range of applications. However, MCE is very challenging as the number of maximal cliques may grow exponentially with the number of vertices. The state-of-the-art methods adopt a recursive paradigm to enumerate maximal cliques exhaustively, suffering from a large amount of redundant computation. In this paper, we propose a novel reduction-based framework for MCE, namely RMCE, that aims to reduce the search space and mini"},"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":"2311.00279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-11-01T04:05:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"191c53658af04eb295a8dcbb2d64d6f5a4a5cdc0a6548bedf3f6f8250fe370ae","abstract_canon_sha256":"51af1e3a1f208c9899fbe0ec84651cf582f3585801af35697420c2344118304d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:14.061381Z","signature_b64":"KDjLkyM9k4Uj/3bpdhIF8BX6ZJsGfla1aHRWHcFKaAd8FkjkXNRAdLTJbayb64d9hQNr8Rwsx9mxqIjOKNVwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4653918c908092a775f3948d86dd59952385c3ae30c9142f3a444e64101d6f3","last_reissued_at":"2026-07-05T07:08:14.060724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:14.060724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Maximal Clique Enumeration via Graph Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Hong Cheng, Weiguo Zheng, Wen Deng","submitted_at":"2023-11-01T04:05:01Z","abstract_excerpt":"As a fundamental task in graph data management, maximal clique enumeration (MCE) has attracted extensive attention from both academic and industrial communities due to its wide range of applications. However, MCE is very challenging as the number of maximal cliques may grow exponentially with the number of vertices. The state-of-the-art methods adopt a recursive paradigm to enumerate maximal cliques exhaustively, suffering from a large amount of redundant computation. In this paper, we propose a novel reduction-based framework for MCE, namely RMCE, that aims to reduce the search space and mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00279","kind":"arxiv","version":2},"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/2311.00279/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":"2311.00279","created_at":"2026-07-05T07:08:14.060826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.00279v2","created_at":"2026-07-05T07:08:14.060826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00279","created_at":"2026-07-05T07:08:14.060826+00:00"},{"alias_kind":"pith_short_12","alias_value":"URSTSGGJBAES","created_at":"2026-07-05T07:08:14.060826+00:00"},{"alias_kind":"pith_short_16","alias_value":"URSTSGGJBAESU527","created_at":"2026-07-05T07:08:14.060826+00:00"},{"alias_kind":"pith_short_8","alias_value":"URSTSGGJ","created_at":"2026-07-05T07:08:14.060826+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.01439","citing_title":"TurboReg: TurboClique for Robust and Efficient Point Cloud Registration","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF","json":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF.json","graph_json":"https://pith.science/api/pith-number/URSTSGGJBAESU527HFENQ3OVTF/graph.json","events_json":"https://pith.science/api/pith-number/URSTSGGJBAESU527HFENQ3OVTF/events.json","paper":"https://pith.science/paper/URSTSGGJ"},"agent_actions":{"view_html":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF","download_json":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF.json","view_paper":"https://pith.science/paper/URSTSGGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.00279&json=true","fetch_graph":"https://pith.science/api/pith-number/URSTSGGJBAESU527HFENQ3OVTF/graph.json","fetch_events":"https://pith.science/api/pith-number/URSTSGGJBAESU527HFENQ3OVTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/action/storage_attestation","attest_author":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/action/author_attestation","sign_citation":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/action/citation_signature","submit_replication":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/action/replication_record"}},"created_at":"2026-07-05T07:08:14.060826+00:00","updated_at":"2026-07-05T07:08:14.060826+00:00"}