{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:J5VZSJCJJ4FLPBGK4FHSDXOSSH","short_pith_number":"pith:J5VZSJCJ","schema_version":"1.0","canonical_sha256":"4f6b9924494f0ab784cae14f21ddd291e30bb4db0bc8d0ac08b33892b2717dca","source":{"kind":"arxiv","id":"1407.4989","version":1},"attestation_state":"computed","paper":{"title":"A framework for community detection in heterogeneous multi-relational networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ken Wakita, Tsuyoshi Murata, Weichu Liu, Xin Liu","submitted_at":"2014-07-15T01:42:59Z","abstract_excerpt":"There has been a surge of interest in community detection in homogeneous single-relational networks which contain only one type of nodes and edges. However, many real-world systems are naturally described as heterogeneous multi-relational networks which contain multiple types of nodes and edges. In this paper, we propose a new method for detecting communities in such networks. Our method is based on optimizing the composite modularity, which is a new modularity proposed for evaluating partitions of a heterogeneous multi-relational network into communities. Our method is parameter-free, scalabl"},"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":"1407.4989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-07-15T01:42:59Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"9f3cd6ebd26f3991372244df9a70333f6ee49ecb30c671d6445b53f50bbd8b10","abstract_canon_sha256":"c6fb6ada2568eca633c7ca94fad8eef774bb2b0487f8126b9926307f1a766e9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:22.188941Z","signature_b64":"P3pKGEHmzZ50BRdogRaHxcQQXxfFoXIkZ3rlkH9y/KS3TRcNSuQBl72QyZ/XuPCA3Ecp137Qs+sjZTykkKltDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f6b9924494f0ab784cae14f21ddd291e30bb4db0bc8d0ac08b33892b2717dca","last_reissued_at":"2026-05-18T02:47:22.188277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:22.188277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A framework for community detection in heterogeneous multi-relational networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ken Wakita, Tsuyoshi Murata, Weichu Liu, Xin Liu","submitted_at":"2014-07-15T01:42:59Z","abstract_excerpt":"There has been a surge of interest in community detection in homogeneous single-relational networks which contain only one type of nodes and edges. However, many real-world systems are naturally described as heterogeneous multi-relational networks which contain multiple types of nodes and edges. In this paper, we propose a new method for detecting communities in such networks. Our method is based on optimizing the composite modularity, which is a new modularity proposed for evaluating partitions of a heterogeneous multi-relational network into communities. Our method is parameter-free, scalabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4989","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":"1407.4989","created_at":"2026-05-18T02:47:22.188393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4989v1","created_at":"2026-05-18T02:47:22.188393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4989","created_at":"2026-05-18T02:47:22.188393+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5VZSJCJJ4FL","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5VZSJCJJ4FLPBGK","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5VZSJCJ","created_at":"2026-05-18T12:28:33.132498+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/J5VZSJCJJ4FLPBGK4FHSDXOSSH","json":"https://pith.science/pith/J5VZSJCJJ4FLPBGK4FHSDXOSSH.json","graph_json":"https://pith.science/api/pith-number/J5VZSJCJJ4FLPBGK4FHSDXOSSH/graph.json","events_json":"https://pith.science/api/pith-number/J5VZSJCJJ4FLPBGK4FHSDXOSSH/events.json","paper":"https://pith.science/paper/J5VZSJCJ"},"agent_actions":{"view_html":"https://pith.science/pith/J5VZSJCJJ4FLPBGK4FHSDXOSSH","download_json":"https://pith.science/pith/J5VZSJCJJ4FLPBGK4FHSDXOSSH.json","view_paper":"https://pith.science/paper/J5VZSJCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4989&json=true","fetch_graph":"https://pith.science/api/pith-number/J5VZSJCJJ4FLPBGK4FHSDXOSSH/graph.json","fetch_events":"https://pith.science/api/pith-number/J5VZSJCJJ4FLPBGK4FHSDXOSSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5VZSJCJJ4FLPBGK4FHSDXOSSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5VZSJCJJ4FLPBGK4FHSDXOSSH/action/storage_attestation","attest_author":"https://pith.science/pith/J5VZSJCJJ4FLPBGK4FHSDXOSSH/action/author_attestation","sign_citation":"https://pith.science/pith/J5VZSJCJJ4FLPBGK4FHSDXOSSH/action/citation_signature","submit_replication":"https://pith.science/pith/J5VZSJCJJ4FLPBGK4FHSDXOSSH/action/replication_record"}},"created_at":"2026-05-18T02:47:22.188393+00:00","updated_at":"2026-05-18T02:47:22.188393+00:00"}