{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L2S5J37HQCYSCITMPIYZLGAVBP","short_pith_number":"pith:L2S5J37H","schema_version":"1.0","canonical_sha256":"5ea5d4efe780b121226c7a319598150bfdd9e9212ee5298a47b4531c3b312731","source":{"kind":"arxiv","id":"2605.26235","version":1},"attestation_state":"computed","paper":{"title":"Scalable Algorithm for Dynamic Quasi-clique Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Can Wang, Chenhao Ma, Hao Wu, Jingbang Chen, Weinuo Li, Yingli Zhou, Yixiang Fang","submitted_at":"2026-05-25T18:02:55Z","abstract_excerpt":"Identifying dense subgraphs known as quasi-cliques is pivotal in numerous graph mining tasks across domains such as social networks, biology, and e-commerce. While prior work has developed efficient algorithms for quasi-clique detection in static graphs, real-world networks are inherently dynamic, where edges appear and disappear continuously. This renders static methods inefficient and ill-suited for real-time analysis. In this paper, we initiate the study of the Dynamic Maximum Quasi-Clique Problem (DMQCP), which aims to maintain and update the largest quasi-clique in a graph under streaming"},"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":"2605.26235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-05-25T18:02:55Z","cross_cats_sorted":[],"title_canon_sha256":"1a3a4fdff392f15db901f3bfdc40a7881bd03745c8b14dbc9ad517262ccc8ae3","abstract_canon_sha256":"f09e14fc7a21e410b2319d039e8855e5ab0cc9b25ff05048a8be4a37e4785521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T00:04:30.004818Z","signature_b64":"L6olcuQyUnYW72DDYlU/dWkwD2NUugAgJSDJChRGxpc5Gxs5aTrHDEdSWDFJf+yH/2MgomZ8dXMBf1NkrtuYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ea5d4efe780b121226c7a319598150bfdd9e9212ee5298a47b4531c3b312731","last_reissued_at":"2026-05-27T00:04:30.003674Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T00:04:30.003674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Algorithm for Dynamic Quasi-clique Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Can Wang, Chenhao Ma, Hao Wu, Jingbang Chen, Weinuo Li, Yingli Zhou, Yixiang Fang","submitted_at":"2026-05-25T18:02:55Z","abstract_excerpt":"Identifying dense subgraphs known as quasi-cliques is pivotal in numerous graph mining tasks across domains such as social networks, biology, and e-commerce. While prior work has developed efficient algorithms for quasi-clique detection in static graphs, real-world networks are inherently dynamic, where edges appear and disappear continuously. This renders static methods inefficient and ill-suited for real-time analysis. In this paper, we initiate the study of the Dynamic Maximum Quasi-Clique Problem (DMQCP), which aims to maintain and update the largest quasi-clique in a graph under streaming"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26235","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.26235/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":"2605.26235","created_at":"2026-05-27T00:04:30.004229+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26235v1","created_at":"2026-05-27T00:04:30.004229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26235","created_at":"2026-05-27T00:04:30.004229+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2S5J37HQCYS","created_at":"2026-05-27T00:04:30.004229+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2S5J37HQCYSCITM","created_at":"2026-05-27T00:04:30.004229+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2S5J37H","created_at":"2026-05-27T00:04:30.004229+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/L2S5J37HQCYSCITMPIYZLGAVBP","json":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP.json","graph_json":"https://pith.science/api/pith-number/L2S5J37HQCYSCITMPIYZLGAVBP/graph.json","events_json":"https://pith.science/api/pith-number/L2S5J37HQCYSCITMPIYZLGAVBP/events.json","paper":"https://pith.science/paper/L2S5J37H"},"agent_actions":{"view_html":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP","download_json":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP.json","view_paper":"https://pith.science/paper/L2S5J37H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26235&json=true","fetch_graph":"https://pith.science/api/pith-number/L2S5J37HQCYSCITMPIYZLGAVBP/graph.json","fetch_events":"https://pith.science/api/pith-number/L2S5J37HQCYSCITMPIYZLGAVBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/action/storage_attestation","attest_author":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/action/author_attestation","sign_citation":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/action/citation_signature","submit_replication":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/action/replication_record"}},"created_at":"2026-05-27T00:04:30.004229+00:00","updated_at":"2026-05-27T00:04:30.004229+00:00"}