{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JTIJLTTJJWGGBRLLP4CG2QLL7V","short_pith_number":"pith:JTIJLTTJ","canonical_record":{"source":{"id":"2411.13817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-21T03:48:03Z","cross_cats_sorted":[],"title_canon_sha256":"4f7bb171c8abbc8a404914c0f00cf0254353885eb45c7029cc84d5a9f6244dff","abstract_canon_sha256":"b37d71e74c1381eb047aac5adceaff6961c0908ce1dc1221a45ee749fc812566"},"schema_version":"1.0"},"canonical_sha256":"4cd095ce694d8c60c56b7f046d416bfd689bcb28b76ca05e4e6844ae3cad1582","source":{"kind":"arxiv","id":"2411.13817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13817","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13817v1","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13817","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"JTIJLTTJJWGG","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"pith_short_16","alias_value":"JTIJLTTJJWGGBRLL","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"pith_short_8","alias_value":"JTIJLTTJ","created_at":"2026-07-05T09:38:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JTIJLTTJJWGGBRLLP4CG2QLL7V","target":"record","payload":{"canonical_record":{"source":{"id":"2411.13817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-21T03:48:03Z","cross_cats_sorted":[],"title_canon_sha256":"4f7bb171c8abbc8a404914c0f00cf0254353885eb45c7029cc84d5a9f6244dff","abstract_canon_sha256":"b37d71e74c1381eb047aac5adceaff6961c0908ce1dc1221a45ee749fc812566"},"schema_version":"1.0"},"canonical_sha256":"4cd095ce694d8c60c56b7f046d416bfd689bcb28b76ca05e4e6844ae3cad1582","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:37.517271Z","signature_b64":"qexYFxeSLE9/p0D6m1OjM57LiEaU9IH/th5OTe0k2anXEKp8ypg4dAKjxUH30FW4K5Dvfv1vUzRcaAeWPDKzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cd095ce694d8c60c56b7f046d416bfd689bcb28b76ca05e4e6844ae3cad1582","last_reissued_at":"2026-07-05T09:38:37.516857Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:37.516857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.13817","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-07-05T09:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"riZk4hFN8ZI7kf3qN2UowiiXJmFFFQFGx7wGWNp4GbgSoy3qou4JS7wiLwGE5u8h6UsAgCyNp2C9lFmqKTnEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:18:11.540714Z"},"content_sha256":"9be987823453a715ae4d7923e2336a3fcf3504f27d1265f7a6d337d75f375c8d","schema_version":"1.0","event_id":"sha256:9be987823453a715ae4d7923e2336a3fcf3504f27d1265f7a6d337d75f375c8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JTIJLTTJJWGGBRLLP4CG2QLL7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Boyu Ruan, Jianzhong Qi, Junhao Gan, Sibo Wang, Zhifeng Bao, Zhuowei Zhao","submitted_at":"2024-11-21T03:48:03Z","abstract_excerpt":"We study structural clustering on graphs in dynamic scenarios, where the graphs can be updated by arbitrary insertions or deletions of edges/vertices. The goal is to efficiently compute structural clustering results for any clustering parameters $\\epsilon$ and $\\mu$ given on the fly, for arbitrary graph update patterns, and for all typical similarity measurements. Specifically, we adopt the idea of update affordability and propose an a-lot-simpler yet more efficient (both theoretically and practically) algorithm (than state of the art), named VD-STAR to handle graph updates. First, with a theo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13817","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/2411.13817/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-05T09:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iz8TbmQSqhYFMRiC+n6GF0Ci+muJl0Rtzq8NXhBo6dV8AdilcVWV3apMUOUE6WvN8KXU4KI3+ioPsANLDGvQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:18:11.541713Z"},"content_sha256":"f3b1863ad0688e1ad21377f74c78ce1d1e5c52a0cb254e4773a8e20cf25c566e","schema_version":"1.0","event_id":"sha256:f3b1863ad0688e1ad21377f74c78ce1d1e5c52a0cb254e4773a8e20cf25c566e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTIJLTTJJWGGBRLLP4CG2QLL7V/bundle.json","state_url":"https://pith.science/pith/JTIJLTTJJWGGBRLLP4CG2QLL7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTIJLTTJJWGGBRLLP4CG2QLL7V/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-13T06:18:11Z","links":{"resolver":"https://pith.science/pith/JTIJLTTJJWGGBRLLP4CG2QLL7V","bundle":"https://pith.science/pith/JTIJLTTJJWGGBRLLP4CG2QLL7V/bundle.json","state":"https://pith.science/pith/JTIJLTTJJWGGBRLLP4CG2QLL7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTIJLTTJJWGGBRLLP4CG2QLL7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JTIJLTTJJWGGBRLLP4CG2QLL7V","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":"b37d71e74c1381eb047aac5adceaff6961c0908ce1dc1221a45ee749fc812566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-21T03:48:03Z","title_canon_sha256":"4f7bb171c8abbc8a404914c0f00cf0254353885eb45c7029cc84d5a9f6244dff"},"schema_version":"1.0","source":{"id":"2411.13817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13817","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13817v1","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13817","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"JTIJLTTJJWGG","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"pith_short_16","alias_value":"JTIJLTTJJWGGBRLL","created_at":"2026-07-05T09:38:37Z"},{"alias_kind":"pith_short_8","alias_value":"JTIJLTTJ","created_at":"2026-07-05T09:38:37Z"}],"graph_snapshots":[{"event_id":"sha256:f3b1863ad0688e1ad21377f74c78ce1d1e5c52a0cb254e4773a8e20cf25c566e","target":"graph","created_at":"2026-07-05T09:38:37Z","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/2411.13817/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study structural clustering on graphs in dynamic scenarios, where the graphs can be updated by arbitrary insertions or deletions of edges/vertices. The goal is to efficiently compute structural clustering results for any clustering parameters $\\epsilon$ and $\\mu$ given on the fly, for arbitrary graph update patterns, and for all typical similarity measurements. Specifically, we adopt the idea of update affordability and propose an a-lot-simpler yet more efficient (both theoretically and practically) algorithm (than state of the art), named VD-STAR to handle graph updates. First, with a theo","authors_text":"Boyu Ruan, Jianzhong Qi, Junhao Gan, Sibo Wang, Zhifeng Bao, Zhuowei Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13817","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:9be987823453a715ae4d7923e2336a3fcf3504f27d1265f7a6d337d75f375c8d","target":"record","created_at":"2026-07-05T09:38:37Z","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":"b37d71e74c1381eb047aac5adceaff6961c0908ce1dc1221a45ee749fc812566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-21T03:48:03Z","title_canon_sha256":"4f7bb171c8abbc8a404914c0f00cf0254353885eb45c7029cc84d5a9f6244dff"},"schema_version":"1.0","source":{"id":"2411.13817","kind":"arxiv","version":1}},"canonical_sha256":"4cd095ce694d8c60c56b7f046d416bfd689bcb28b76ca05e4e6844ae3cad1582","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cd095ce694d8c60c56b7f046d416bfd689bcb28b76ca05e4e6844ae3cad1582","first_computed_at":"2026-07-05T09:38:37.516857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:37.516857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qexYFxeSLE9/p0D6m1OjM57LiEaU9IH/th5OTe0k2anXEKp8ypg4dAKjxUH30FW4K5Dvfv1vUzRcaAeWPDKzCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:37.517271Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.13817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9be987823453a715ae4d7923e2336a3fcf3504f27d1265f7a6d337d75f375c8d","sha256:f3b1863ad0688e1ad21377f74c78ce1d1e5c52a0cb254e4773a8e20cf25c566e"],"state_sha256":"3425def5332f585517303a0f6e19feefbacac2fd4bbce03c58f2b5c838969beb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4qWu6MT30rIeYhNV8mxSBfPKS9kgP0/6xqzhAB4cWlBf5cxoU0/Qn+ev8VmJqagegl3rgvsvRhvOkPDhLpLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T06:18:11.547458Z","bundle_sha256":"04968a4dccd91a456f602488bd43748426b95ce6dc26b2f72bbf681b053df08c"}}