{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WY5ZS5CMJ34225QTEOTLLFNMAJ","short_pith_number":"pith:WY5ZS5CM","schema_version":"1.0","canonical_sha256":"b63b99744c4ef9ad761323a6b595ac026020a91a39eb9355ccf78530a076c55a","source":{"kind":"arxiv","id":"1303.2643","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.2643","created_at":"2026-05-18T03:31:18.381767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2643v1","created_at":"2026-05-18T03:31:18.381767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2643","created_at":"2026-05-18T03:31:18.381767+00:00"},{"alias_kind":"pith_short_12","alias_value":"WY5ZS5CMJ342","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"WY5ZS5CMJ34225QT","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"WY5ZS5CM","created_at":"2026-05-18T12:28:06.772260+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/WY5ZS5CMJ34225QTEOTLLFNMAJ","json":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ.json","graph_json":"https://pith.science/api/pith-number/WY5ZS5CMJ34225QTEOTLLFNMAJ/graph.json","events_json":"https://pith.science/api/pith-number/WY5ZS5CMJ34225QTEOTLLFNMAJ/events.json","paper":"https://pith.science/paper/WY5ZS5CM"},"agent_actions":{"view_html":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ","download_json":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ.json","view_paper":"https://pith.science/paper/WY5ZS5CM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2643&json=true","fetch_graph":"https://pith.science/api/pith-number/WY5ZS5CMJ34225QTEOTLLFNMAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WY5ZS5CMJ34225QTEOTLLFNMAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/action/storage_attestation","attest_author":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/action/author_attestation","sign_citation":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/action/citation_signature","submit_replication":"https://pith.science/pith/WY5ZS5CMJ34225QTEOTLLFNMAJ/action/replication_record"}},"created_at":"2026-05-18T03:31:18.381767+00:00","updated_at":"2026-05-18T03:31:18.381767+00:00"}