{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KJS5JIHD4ZQ42LZTMQE2MCL3KW","short_pith_number":"pith:KJS5JIHD","schema_version":"1.0","canonical_sha256":"5265d4a0e3e661cd2f336409a6097b558bd917c25d46ebf741797556ecc49ad2","source":{"kind":"arxiv","id":"1310.6780","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.6780","created_at":"2026-05-18T02:39:38.281501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6780v3","created_at":"2026-05-18T02:39:38.281501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6780","created_at":"2026-05-18T02:39:38.281501+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJS5JIHD4ZQ4","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJS5JIHD4ZQ42LZT","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJS5JIHD","created_at":"2026-05-18T12:27:49.015174+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/KJS5JIHD4ZQ42LZTMQE2MCL3KW","json":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW.json","graph_json":"https://pith.science/api/pith-number/KJS5JIHD4ZQ42LZTMQE2MCL3KW/graph.json","events_json":"https://pith.science/api/pith-number/KJS5JIHD4ZQ42LZTMQE2MCL3KW/events.json","paper":"https://pith.science/paper/KJS5JIHD"},"agent_actions":{"view_html":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW","download_json":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW.json","view_paper":"https://pith.science/paper/KJS5JIHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6780&json=true","fetch_graph":"https://pith.science/api/pith-number/KJS5JIHD4ZQ42LZTMQE2MCL3KW/graph.json","fetch_events":"https://pith.science/api/pith-number/KJS5JIHD4ZQ42LZTMQE2MCL3KW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/action/storage_attestation","attest_author":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/action/author_attestation","sign_citation":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/action/citation_signature","submit_replication":"https://pith.science/pith/KJS5JIHD4ZQ42LZTMQE2MCL3KW/action/replication_record"}},"created_at":"2026-05-18T02:39:38.281501+00:00","updated_at":"2026-05-18T02:39:38.281501+00:00"}