{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QL4MTIFSJSDRVTLE3PLU6AZ75X","short_pith_number":"pith:QL4MTIFS","schema_version":"1.0","canonical_sha256":"82f8c9a0b24c871acd64dbd74f033fedd6689b882efb80329f61647c1b5c7d3c","source":{"kind":"arxiv","id":"1303.4699","version":1},"attestation_state":"computed","paper":{"title":"Discovering link communities in complex networks by exploiting link dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bo Yang, Dayou Liu, Di Jin, Dongxiao He, Weixiongzhang","submitted_at":"2013-03-19T19:05:00Z","abstract_excerpt":"Discovery of communities in complex networks is a fundamental data analysis problem with applications in various domains. Most of the existing approaches have focused on discovering communities of nodes, while recent studies have shown great advantages and utilities of the knowledge of communities of links in networks. From this new perspective, we propose a link dynamics based algorithm, called UELC, for identifying link communities of networks. In UELC, the stochastic process of a link-node-link random walk is employed to unfold an embedded bipartition structure of links in a network. The lo"},"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.4699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-19T19:05:00Z","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"title_canon_sha256":"51fed1859d43f13507e4e95cf743a37741118cd13768228b9c84bed509a388e7","abstract_canon_sha256":"40b0431005a51ec41ee3598ec4d4b079ca7db39e829b832bad5ed09232552e96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:26.467305Z","signature_b64":"b9g8GKXcXun/x6j/CLjtGuQdTE1UfrCHg5YXJHioEV5v2dbHdde6I/5FyaM5n3d3C987pW3F4s98CeKc9vY1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82f8c9a0b24c871acd64dbd74f033fedd6689b882efb80329f61647c1b5c7d3c","last_reissued_at":"2026-05-18T03:30:26.466487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:26.466487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering link communities in complex networks by exploiting link dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bo Yang, Dayou Liu, Di Jin, Dongxiao He, Weixiongzhang","submitted_at":"2013-03-19T19:05:00Z","abstract_excerpt":"Discovery of communities in complex networks is a fundamental data analysis problem with applications in various domains. Most of the existing approaches have focused on discovering communities of nodes, while recent studies have shown great advantages and utilities of the knowledge of communities of links in networks. From this new perspective, we propose a link dynamics based algorithm, called UELC, for identifying link communities of networks. In UELC, the stochastic process of a link-node-link random walk is employed to unfold an embedded bipartition structure of links in a network. The lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4699","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.4699","created_at":"2026-05-18T03:30:26.466632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4699v1","created_at":"2026-05-18T03:30:26.466632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4699","created_at":"2026-05-18T03:30:26.466632+00:00"},{"alias_kind":"pith_short_12","alias_value":"QL4MTIFSJSDR","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QL4MTIFSJSDRVTLE","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QL4MTIFS","created_at":"2026-05-18T12:27:57.521954+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/QL4MTIFSJSDRVTLE3PLU6AZ75X","json":"https://pith.science/pith/QL4MTIFSJSDRVTLE3PLU6AZ75X.json","graph_json":"https://pith.science/api/pith-number/QL4MTIFSJSDRVTLE3PLU6AZ75X/graph.json","events_json":"https://pith.science/api/pith-number/QL4MTIFSJSDRVTLE3PLU6AZ75X/events.json","paper":"https://pith.science/paper/QL4MTIFS"},"agent_actions":{"view_html":"https://pith.science/pith/QL4MTIFSJSDRVTLE3PLU6AZ75X","download_json":"https://pith.science/pith/QL4MTIFSJSDRVTLE3PLU6AZ75X.json","view_paper":"https://pith.science/paper/QL4MTIFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4699&json=true","fetch_graph":"https://pith.science/api/pith-number/QL4MTIFSJSDRVTLE3PLU6AZ75X/graph.json","fetch_events":"https://pith.science/api/pith-number/QL4MTIFSJSDRVTLE3PLU6AZ75X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QL4MTIFSJSDRVTLE3PLU6AZ75X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QL4MTIFSJSDRVTLE3PLU6AZ75X/action/storage_attestation","attest_author":"https://pith.science/pith/QL4MTIFSJSDRVTLE3PLU6AZ75X/action/author_attestation","sign_citation":"https://pith.science/pith/QL4MTIFSJSDRVTLE3PLU6AZ75X/action/citation_signature","submit_replication":"https://pith.science/pith/QL4MTIFSJSDRVTLE3PLU6AZ75X/action/replication_record"}},"created_at":"2026-05-18T03:30:26.466632+00:00","updated_at":"2026-05-18T03:30:26.466632+00:00"}