{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:L2S5J37HQCYSCITMPIYZLGAVBP","short_pith_number":"pith:L2S5J37H","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"},"canonical_sha256":"5ea5d4efe780b121226c7a319598150bfdd9e9212ee5298a47b4531c3b312731","source":{"kind":"arxiv","id":"2605.26235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26235","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26235v1","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26235","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"L2S5J37HQCYS","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"L2S5J37HQCYSCITM","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"L2S5J37H","created_at":"2026-05-27T00:04:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:L2S5J37HQCYSCITMPIYZLGAVBP","target":"record","payload":{"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"},"canonical_sha256":"5ea5d4efe780b121226c7a319598150bfdd9e9212ee5298a47b4531c3b312731","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"},"source_kind":"arxiv","source_id":"2605.26235","source_version":1,"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-27T00:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeXV57jPWt0muRxOcIt+3EIagJaVwTqEERSeekW79Lw1cQ7H7TeKH38t0BF9j2T+4Dyqc7boBOjMqCdTQ7uvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:36:33.632139Z"},"content_sha256":"e11aa2c72599f4169f384f5b8f9a451fa6d55d26f52ab5953c22b87e864d9e04","schema_version":"1.0","event_id":"sha256:e11aa2c72599f4169f384f5b8f9a451fa6d55d26f52ab5953c22b87e864d9e04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:L2S5J37HQCYSCITMPIYZLGAVBP","target":"graph","payload":{"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"},"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-27T00:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJMMZKXU620d3d7IpGrFPsv98unrrwEjH9T1w86zQmf2/s7hq9lwjP028VcjB3AuZKiAULXaTUSITzkyvGsNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:36:33.632850Z"},"content_sha256":"bfa43842c1ae5839c8422042509db349a6e0b8537cd814229157c9af61f33331","schema_version":"1.0","event_id":"sha256:bfa43842c1ae5839c8422042509db349a6e0b8537cd814229157c9af61f33331"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/bundle.json","state_url":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2S5J37HQCYSCITMPIYZLGAVBP/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-30T14:36:33Z","links":{"resolver":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP","bundle":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/bundle.json","state":"https://pith.science/pith/L2S5J37HQCYSCITMPIYZLGAVBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2S5J37HQCYSCITMPIYZLGAVBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:L2S5J37HQCYSCITMPIYZLGAVBP","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":"f09e14fc7a21e410b2319d039e8855e5ab0cc9b25ff05048a8be4a37e4785521","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-05-25T18:02:55Z","title_canon_sha256":"1a3a4fdff392f15db901f3bfdc40a7881bd03745c8b14dbc9ad517262ccc8ae3"},"schema_version":"1.0","source":{"id":"2605.26235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26235","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26235v1","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26235","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"L2S5J37HQCYS","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"L2S5J37HQCYSCITM","created_at":"2026-05-27T00:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"L2S5J37H","created_at":"2026-05-27T00:04:30Z"}],"graph_snapshots":[{"event_id":"sha256:bfa43842c1ae5839c8422042509db349a6e0b8537cd814229157c9af61f33331","target":"graph","created_at":"2026-05-27T00:04:30Z","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/2605.26235/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Can Wang, Chenhao Ma, Hao Wu, Jingbang Chen, Weinuo Li, Yingli Zhou, Yixiang Fang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-05-25T18:02:55Z","title":"Scalable Algorithm for Dynamic Quasi-clique Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26235","kind":"arxiv","version":1},"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:e11aa2c72599f4169f384f5b8f9a451fa6d55d26f52ab5953c22b87e864d9e04","target":"record","created_at":"2026-05-27T00:04:30Z","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":"f09e14fc7a21e410b2319d039e8855e5ab0cc9b25ff05048a8be4a37e4785521","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-05-25T18:02:55Z","title_canon_sha256":"1a3a4fdff392f15db901f3bfdc40a7881bd03745c8b14dbc9ad517262ccc8ae3"},"schema_version":"1.0","source":{"id":"2605.26235","kind":"arxiv","version":1}},"canonical_sha256":"5ea5d4efe780b121226c7a319598150bfdd9e9212ee5298a47b4531c3b312731","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ea5d4efe780b121226c7a319598150bfdd9e9212ee5298a47b4531c3b312731","first_computed_at":"2026-05-27T00:04:30.003674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T00:04:30.003674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L6olcuQyUnYW72DDYlU/dWkwD2NUugAgJSDJChRGxpc5Gxs5aTrHDEdSWDFJf+yH/2MgomZ8dXMBf1NkrtuYAw==","signature_status":"signed_v1","signed_at":"2026-05-27T00:04:30.004818Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e11aa2c72599f4169f384f5b8f9a451fa6d55d26f52ab5953c22b87e864d9e04","sha256:bfa43842c1ae5839c8422042509db349a6e0b8537cd814229157c9af61f33331"],"state_sha256":"5bd24348cf01a5db8023f8a357251f7b8594fef919133081b16391c2a92207d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ut+20RBXwXxPz1ooXZkPvxvVxafYitvJGOnOFHGRQGiVk8SYdWJzdQC63MlQk1AS3LmJxUT6XRQXQRXlp1UFBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:36:33.636103Z","bundle_sha256":"cbc1cc5b64650f3e0cc48cb6c0dab536f4791dad1a3c6c1df35243f2a8c760a7"}}