{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KJS5JIHD4ZQ42LZTMQE2MCL3KW","short_pith_number":"pith:KJS5JIHD","canonical_record":{"source":{"id":"1310.6780","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-24T21:29:44Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"e5d5d9db4daff9d90737b755543b647e749594c9ed5b7be781f7deb282a572ee","abstract_canon_sha256":"732192f8434259aa69adf2ecbf7b51838ab49824012bfefba4c074a143148647"},"schema_version":"1.0"},"canonical_sha256":"5265d4a0e3e661cd2f336409a6097b558bd917c25d46ebf741797556ecc49ad2","source":{"kind":"arxiv","id":"1310.6780","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6780","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6780v3","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6780","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"KJS5JIHD4ZQ4","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KJS5JIHD4ZQ42LZT","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KJS5JIHD","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KJS5JIHD4ZQ42LZTMQE2MCL3KW","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6780","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-24T21:29:44Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"e5d5d9db4daff9d90737b755543b647e749594c9ed5b7be781f7deb282a572ee","abstract_canon_sha256":"732192f8434259aa69adf2ecbf7b51838ab49824012bfefba4c074a143148647"},"schema_version":"1.0"},"canonical_sha256":"5265d4a0e3e661cd2f336409a6097b558bd917c25d46ebf741797556ecc49ad2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:38.281864Z","signature_b64":"+Px2bpFWkuWWjfMG9VIczGBOSvAOu0Y5oph7DD9ijPxBqd7ZvEaEsdcOsLQ29CxPqOsJqG56pRkN/KaHqBX7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5265d4a0e3e661cd2f336409a6097b558bd917c25d46ebf741797556ecc49ad2","last_reissued_at":"2026-05-18T02:39:38.281427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:38.281427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6780","source_version":3,"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-05-18T02:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P32ff17OApCHFjkGYFHGFtyrMfYMCO2WyPAVGKo7l4dfBVXx5P9wohpD2+Gt3K6ONkmRrjCgn/CSVrPtC4eVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:13:09.551073Z"},"content_sha256":"0eb0e4458ba7dd4aa9f0f015727b11be147a50ad3f9f8a174b22bb4739dc74f8","schema_version":"1.0","event_id":"sha256:0eb0e4458ba7dd4aa9f0f015727b11be147a50ad3f9f8a174b22bb4739dc74f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KJS5JIHD4ZQ42LZTMQE2MCL3KW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining Maximal Cliques from an Uncertain Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura","submitted_at":"2013-10-24T21:29:44Z","abstract_excerpt":"We consider mining dense substructures (maximal cliques) from an uncertain graph, which is a probability distribution on a set of deterministic graphs. For parameter 0 < {\\alpha} < 1, we present a precise definition of an {\\alpha}-maximal clique in an uncertain graph. We present matching upper and lower bounds on the number of {\\alpha}-maximal cliques possible within an uncertain graph. We present an algorithm to enumerate {\\alpha}-maximal cliques in an uncertain graph whose worst-case runtime is near-optimal, and an experimental evaluation showing the practical utility of the algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6780","kind":"arxiv","version":3},"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"},"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-05-18T02:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lE4bnTQPNwMyfZFMVYAe40niYwvXSzempW+mAva2Oko9fevMDBbEhnnXCSZjHKU62HDyN27IaaDIHLRbSfIcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:13:09.551433Z"},"content_sha256":"1a37f26105b830fdb45a7f7139348df33c8f5207fa75168c94ceb77d57d6fe8b","schema_version":"1.0","event_id":"sha256:1a37f26105b830fdb45a7f7139348df33c8f5207fa75168c94ceb77d57d6fe8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/bundle.json","state_url":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/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-05-20T21:13:09Z","links":{"resolver":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW","bundle":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/bundle.json","state":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KJS5JIHD4ZQ42LZTMQE2MCL3KW","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":"732192f8434259aa69adf2ecbf7b51838ab49824012bfefba4c074a143148647","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-24T21:29:44Z","title_canon_sha256":"e5d5d9db4daff9d90737b755543b647e749594c9ed5b7be781f7deb282a572ee"},"schema_version":"1.0","source":{"id":"1310.6780","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6780","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6780v3","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6780","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"KJS5JIHD4ZQ4","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KJS5JIHD4ZQ42LZT","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KJS5JIHD","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:1a37f26105b830fdb45a7f7139348df33c8f5207fa75168c94ceb77d57d6fe8b","target":"graph","created_at":"2026-05-18T02:39:38Z","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":"We consider mining dense substructures (maximal cliques) from an uncertain graph, which is a probability distribution on a set of deterministic graphs. For parameter 0 < {\\alpha} < 1, we present a precise definition of an {\\alpha}-maximal clique in an uncertain graph. We present matching upper and lower bounds on the number of {\\alpha}-maximal cliques possible within an uncertain graph. We present an algorithm to enumerate {\\alpha}-maximal cliques in an uncertain graph whose worst-case runtime is near-optimal, and an experimental evaluation showing the practical utility of the algorithm.","authors_text":"Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-24T21:29:44Z","title":"Mining Maximal Cliques from an Uncertain Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6780","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:0eb0e4458ba7dd4aa9f0f015727b11be147a50ad3f9f8a174b22bb4739dc74f8","target":"record","created_at":"2026-05-18T02:39:38Z","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":"732192f8434259aa69adf2ecbf7b51838ab49824012bfefba4c074a143148647","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-24T21:29:44Z","title_canon_sha256":"e5d5d9db4daff9d90737b755543b647e749594c9ed5b7be781f7deb282a572ee"},"schema_version":"1.0","source":{"id":"1310.6780","kind":"arxiv","version":3}},"canonical_sha256":"5265d4a0e3e661cd2f336409a6097b558bd917c25d46ebf741797556ecc49ad2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5265d4a0e3e661cd2f336409a6097b558bd917c25d46ebf741797556ecc49ad2","first_computed_at":"2026-05-18T02:39:38.281427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:38.281427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Px2bpFWkuWWjfMG9VIczGBOSvAOu0Y5oph7DD9ijPxBqd7ZvEaEsdcOsLQ29CxPqOsJqG56pRkN/KaHqBX7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:38.281864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6780","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eb0e4458ba7dd4aa9f0f015727b11be147a50ad3f9f8a174b22bb4739dc74f8","sha256:1a37f26105b830fdb45a7f7139348df33c8f5207fa75168c94ceb77d57d6fe8b"],"state_sha256":"3d928181c24c1044000e05bedc326de39f0310db28cb429be6bec2aea4d3d939"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8xHZuPBvjkO56YuEEMJYISNzPMZLYj+fLBmbyEqhaknfjOaxm8xtifudGy55bOWnvyMVr9gH1EQr+bF+4PGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T21:13:09.553445Z","bundle_sha256":"8461d35837a377aaeb248b5663e8a3d036257ad1de59f9a672c39b6e92e48a84"}}