{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WY5ZS5CMJ34225QTEOTLLFNMAJ","short_pith_number":"pith:WY5ZS5CM","canonical_record":{"source":{"id":"1303.2643","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T19:52:48Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"44228af9c6841d4f95092982d26eed002ec7f3e270f4de1d7bc1697b6d3f2f99","abstract_canon_sha256":"6d3dc7170062192cf7757b32974c1c4d00f5a3b4a34c6f1d68979e6682416cf7"},"schema_version":"1.0"},"canonical_sha256":"b63b99744c4ef9ad761323a6b595ac026020a91a39eb9355ccf78530a076c55a","source":{"kind":"arxiv","id":"1303.2643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2643","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2643v1","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2643","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"WY5ZS5CMJ342","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WY5ZS5CMJ34225QT","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WY5ZS5CM","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WY5ZS5CMJ34225QTEOTLLFNMAJ","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2643","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T19:52:48Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"44228af9c6841d4f95092982d26eed002ec7f3e270f4de1d7bc1697b6d3f2f99","abstract_canon_sha256":"6d3dc7170062192cf7757b32974c1c4d00f5a3b4a34c6f1d68979e6682416cf7"},"schema_version":"1.0"},"canonical_sha256":"b63b99744c4ef9ad761323a6b595ac026020a91a39eb9355ccf78530a076c55a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:18.382189Z","signature_b64":"lJEMUNzorIIr4dqKjIxpK5w4EMcsMit05Y0JX5efu0XGQAghpP9J9zdngy6rGXA69Qr8ReL6NQpcZPS8rOU3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b63b99744c4ef9ad761323a6b595ac026020a91a39eb9355ccf78530a076c55a","last_reissued_at":"2026-05-18T03:31:18.381693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:18.381693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2643","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-18T03:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPD5VKUDSMMuXJHqD+Vp0E0SZjf/Lr2xsnRIzzNspNFTtnJkxyha7idn+yGdq1os/EN3BzWadcn+fY5K2lcqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:45:39.562626Z"},"content_sha256":"c98050e34df15573b62695ab2b03694bc63828b899f78cee33a571740b5cfb27","schema_version":"1.0","event_id":"sha256:c98050e34df15573b62695ab2b03694bc63828b899f78cee33a571740b5cfb27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WY5ZS5CMJ34225QTEOTLLFNMAJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revealing Cluster Structure of Graph by Path Following Replicator Dynamic","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Hairong Liu, Longin Jan Latecki, Shuicheng Yan","submitted_at":"2013-03-11T19:52:48Z","abstract_excerpt":"In this paper, we propose a path following replicator dynamic, and investigate its potentials in uncovering the underlying cluster structure of a graph. The proposed dynamic is a generalization of the discrete replicator dynamic. The replicator dynamic has been successfully used to extract dense clusters of graphs; however, it is often sensitive to the degree distribution of a graph, and usually biased by vertices with large degrees, thus may fail to detect the densest cluster. To overcome this problem, we introduce a dynamic parameter, called path parameter, into the evolution process. The pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2643","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":""},"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-18T03:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3j3dKp23DxHqmkJI3WdFIqc8DnsCdsz5LAk+Z5vSQFA4X5IjafhyCvQLx5ilzFKlcdaQWbZ1DuNlMCyNAz7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:45:39.563019Z"},"content_sha256":"1b8772b9933c21f7e65ce77c7bc1b746c752cddbb98760d1cfb915ac8a122c2f","schema_version":"1.0","event_id":"sha256:1b8772b9933c21f7e65ce77c7bc1b746c752cddbb98760d1cfb915ac8a122c2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/bundle.json","state_url":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/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-21T21:45:39Z","links":{"resolver":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ","bundle":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/bundle.json","state":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WY5ZS5CMJ34225QTEOTLLFNMAJ","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":"6d3dc7170062192cf7757b32974c1c4d00f5a3b4a34c6f1d68979e6682416cf7","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T19:52:48Z","title_canon_sha256":"44228af9c6841d4f95092982d26eed002ec7f3e270f4de1d7bc1697b6d3f2f99"},"schema_version":"1.0","source":{"id":"1303.2643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2643","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2643v1","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2643","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"WY5ZS5CMJ342","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WY5ZS5CMJ34225QT","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WY5ZS5CM","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:1b8772b9933c21f7e65ce77c7bc1b746c752cddbb98760d1cfb915ac8a122c2f","target":"graph","created_at":"2026-05-18T03:31:18Z","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":"In this paper, we propose a path following replicator dynamic, and investigate its potentials in uncovering the underlying cluster structure of a graph. The proposed dynamic is a generalization of the discrete replicator dynamic. The replicator dynamic has been successfully used to extract dense clusters of graphs; however, it is often sensitive to the degree distribution of a graph, and usually biased by vertices with large degrees, thus may fail to detect the densest cluster. To overcome this problem, we introduce a dynamic parameter, called path parameter, into the evolution process. The pa","authors_text":"Hairong Liu, Longin Jan Latecki, Shuicheng Yan","cross_cats":["cs.GT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T19:52:48Z","title":"Revealing Cluster Structure of Graph by Path Following Replicator Dynamic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2643","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:c98050e34df15573b62695ab2b03694bc63828b899f78cee33a571740b5cfb27","target":"record","created_at":"2026-05-18T03:31:18Z","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":"6d3dc7170062192cf7757b32974c1c4d00f5a3b4a34c6f1d68979e6682416cf7","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-11T19:52:48Z","title_canon_sha256":"44228af9c6841d4f95092982d26eed002ec7f3e270f4de1d7bc1697b6d3f2f99"},"schema_version":"1.0","source":{"id":"1303.2643","kind":"arxiv","version":1}},"canonical_sha256":"b63b99744c4ef9ad761323a6b595ac026020a91a39eb9355ccf78530a076c55a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b63b99744c4ef9ad761323a6b595ac026020a91a39eb9355ccf78530a076c55a","first_computed_at":"2026-05-18T03:31:18.381693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:18.381693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lJEMUNzorIIr4dqKjIxpK5w4EMcsMit05Y0JX5efu0XGQAghpP9J9zdngy6rGXA69Qr8ReL6NQpcZPS8rOU3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:18.382189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c98050e34df15573b62695ab2b03694bc63828b899f78cee33a571740b5cfb27","sha256:1b8772b9933c21f7e65ce77c7bc1b746c752cddbb98760d1cfb915ac8a122c2f"],"state_sha256":"349b9c5bd263ed42c472b9f0c39c487147fc7efbc25af59f5e0f614d6edd762e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spjTRCmrR5JgMqMJnHVBNkfuYTyYYIx/F9zkZdBuufHUqQSQyjx/sR+gDj3705DLW7+QLsyNnZvFqz6CLEnbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T21:45:39.575417Z","bundle_sha256":"61de4059b8c7de30ec32ac0b38aa058d95435f9bb170f6c61008c216ae2f80f6"}}