{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:URSTSGGJBAESU527HFENQ3OVTF","short_pith_number":"pith:URSTSGGJ","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"},"canonical_sha256":"a4653918c908092a775f3948d86dd59952385c3ae30c9142f3a444e64101d6f3","source":{"kind":"arxiv","id":"2311.00279","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00279","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00279v2","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00279","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"URSTSGGJBAES","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_16","alias_value":"URSTSGGJBAESU527","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_8","alias_value":"URSTSGGJ","created_at":"2026-07-05T07:08:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:URSTSGGJBAESU527HFENQ3OVTF","target":"record","payload":{"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"},"canonical_sha256":"a4653918c908092a775f3948d86dd59952385c3ae30c9142f3a444e64101d6f3","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"},"source_kind":"arxiv","source_id":"2311.00279","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egdA3XLFUnUFjAFN2XZ7a7zqVdbniibKME261jOUSH/AbNsCs52O+vZWn+KLHV7TyAoqOLKptuptaNruD9VrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:28:16.046535Z"},"content_sha256":"e0f92fda8c671e371cef80acf986849e3d1280a9a3f0eab9d02102e5c7243e9a","schema_version":"1.0","event_id":"sha256:e0f92fda8c671e371cef80acf986849e3d1280a9a3f0eab9d02102e5c7243e9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:URSTSGGJBAESU527HFENQ3OVTF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8AhZk/0HyV1VsGqOFgg52JX6oe6f9up/zujglghFtbLrCabIuBkjS8ZLerwWBPNIdbb8HTJm7XrMZLzFqe6zCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:28:16.047066Z"},"content_sha256":"abcb736211b69abf27332dd1090b771cacf9eca2484a31c924ddb27a0f5fa402","schema_version":"1.0","event_id":"sha256:abcb736211b69abf27332dd1090b771cacf9eca2484a31c924ddb27a0f5fa402"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/bundle.json","state_url":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URSTSGGJBAESU527HFENQ3OVTF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T18:28:16Z","links":{"resolver":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF","bundle":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/bundle.json","state":"https://pith.science/pith/URSTSGGJBAESU527HFENQ3OVTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URSTSGGJBAESU527HFENQ3OVTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:URSTSGGJBAESU527HFENQ3OVTF","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":"51af1e3a1f208c9899fbe0ec84651cf582f3585801af35697420c2344118304d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-11-01T04:05:01Z","title_canon_sha256":"191c53658af04eb295a8dcbb2d64d6f5a4a5cdc0a6548bedf3f6f8250fe370ae"},"schema_version":"1.0","source":{"id":"2311.00279","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.00279","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"2311.00279v2","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00279","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"URSTSGGJBAES","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_16","alias_value":"URSTSGGJBAESU527","created_at":"2026-07-05T07:08:14Z"},{"alias_kind":"pith_short_8","alias_value":"URSTSGGJ","created_at":"2026-07-05T07:08:14Z"}],"graph_snapshots":[{"event_id":"sha256:abcb736211b69abf27332dd1090b771cacf9eca2484a31c924ddb27a0f5fa402","target":"graph","created_at":"2026-07-05T07:08:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.00279/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hong Cheng, Weiguo Zheng, Wen Deng","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-11-01T04:05:01Z","title":"Accelerating Maximal Clique Enumeration via Graph Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00279","kind":"arxiv","version":2},"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:e0f92fda8c671e371cef80acf986849e3d1280a9a3f0eab9d02102e5c7243e9a","target":"record","created_at":"2026-07-05T07:08:14Z","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":"51af1e3a1f208c9899fbe0ec84651cf582f3585801af35697420c2344118304d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-11-01T04:05:01Z","title_canon_sha256":"191c53658af04eb295a8dcbb2d64d6f5a4a5cdc0a6548bedf3f6f8250fe370ae"},"schema_version":"1.0","source":{"id":"2311.00279","kind":"arxiv","version":2}},"canonical_sha256":"a4653918c908092a775f3948d86dd59952385c3ae30c9142f3a444e64101d6f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4653918c908092a775f3948d86dd59952385c3ae30c9142f3a444e64101d6f3","first_computed_at":"2026-07-05T07:08:14.060724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:08:14.060724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KDjLkyM9k4Uj/3bpdhIF8BX6ZJsGfla1aHRWHcFKaAd8FkjkXNRAdLTJbayb64d9hQNr8Rwsx9mxqIjOKNVwBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:08:14.061381Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.00279","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0f92fda8c671e371cef80acf986849e3d1280a9a3f0eab9d02102e5c7243e9a","sha256:abcb736211b69abf27332dd1090b771cacf9eca2484a31c924ddb27a0f5fa402"],"state_sha256":"d3dbeca0a38beae50f82a5393f3dfa9197031c9a101a0a60b17927126c2151c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sj9vTKdrBmoywfZlT9wVLeYBZWRtk7XfpiYgEMX5d9WOLtuBANkM1uL6eCKE2EkRLOZwbXrA6xW59IedJOm9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:28:16.052223Z","bundle_sha256":"85d4a91861fbd70cc0049d745a3f51df12f0f7f7a0eef502598b9b86b8076cd9"}}