{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5QVWFQ4HNPWF5GQ232EUYNXTL3","short_pith_number":"pith:5QVWFQ4H","schema_version":"1.0","canonical_sha256":"ec2b62c3876bec5e9a1ade894c36f35ec53d182c327db15cfc1c20b0509d94b1","source":{"kind":"arxiv","id":"1801.03618","version":2},"attestation_state":"computed","paper":{"title":"On approximate equivalence of modularity, D and non-negative matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Chao Yan, Hui-Min Cheng, Xianjun Yin, Zhenhai Chang, Zhong-Yuan Zhang","submitted_at":"2018-01-11T02:51:10Z","abstract_excerpt":"Community structures detection is one of the fundamental problems in complex network analysis towards understanding the topology structures of the network and the functions of it. Nonnegative matrix factorization (NMF) is a widely used method for community detection, and modularity Q and modularity density D are criteria to evaluate the quality of community structures. In this paper, we establish the connections between Q, D and NMF for the first time. Q maximization can be approximately reformulated under the framework of NMF with Frobenius norm, especially when $n$ is large, and D maximizati"},"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":"1801.03618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-11T02:51:10Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"7a6db1f170e4758161aef1867ca5b868d1b2df14192b2442a010ff8776f4825f","abstract_canon_sha256":"ad0f99be7717cce04b4be8a4671aaaf2d56592e093c1a7718264470e715343dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:33.377088Z","signature_b64":"T3W9InqsnlGT3v+b4vRgjMTrYeaGK+Jf6RCYrbWCVvHHP8+8LAVdvoQtk3/HjfUZYjOjl+TuVgRc84YE2m7jCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec2b62c3876bec5e9a1ade894c36f35ec53d182c327db15cfc1c20b0509d94b1","last_reissued_at":"2026-05-18T00:25:33.376308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:33.376308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On approximate equivalence of modularity, D and non-negative matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Chao Yan, Hui-Min Cheng, Xianjun Yin, Zhenhai Chang, Zhong-Yuan Zhang","submitted_at":"2018-01-11T02:51:10Z","abstract_excerpt":"Community structures detection is one of the fundamental problems in complex network analysis towards understanding the topology structures of the network and the functions of it. Nonnegative matrix factorization (NMF) is a widely used method for community detection, and modularity Q and modularity density D are criteria to evaluate the quality of community structures. In this paper, we establish the connections between Q, D and NMF for the first time. Q maximization can be approximately reformulated under the framework of NMF with Frobenius norm, especially when $n$ is large, and D maximizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03618","kind":"arxiv","version":2},"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":"1801.03618","created_at":"2026-05-18T00:25:33.376435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03618v2","created_at":"2026-05-18T00:25:33.376435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03618","created_at":"2026-05-18T00:25:33.376435+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QVWFQ4HNPWF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QVWFQ4HNPWF5GQ2","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QVWFQ4H","created_at":"2026-05-18T12:32:08.215937+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/5QVWFQ4HNPWF5GQ232EUYNXTL3","json":"https://pith.science/pith/5QVWFQ4HNPWF5GQ232EUYNXTL3.json","graph_json":"https://pith.science/api/pith-number/5QVWFQ4HNPWF5GQ232EUYNXTL3/graph.json","events_json":"https://pith.science/api/pith-number/5QVWFQ4HNPWF5GQ232EUYNXTL3/events.json","paper":"https://pith.science/paper/5QVWFQ4H"},"agent_actions":{"view_html":"https://pith.science/pith/5QVWFQ4HNPWF5GQ232EUYNXTL3","download_json":"https://pith.science/pith/5QVWFQ4HNPWF5GQ232EUYNXTL3.json","view_paper":"https://pith.science/paper/5QVWFQ4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03618&json=true","fetch_graph":"https://pith.science/api/pith-number/5QVWFQ4HNPWF5GQ232EUYNXTL3/graph.json","fetch_events":"https://pith.science/api/pith-number/5QVWFQ4HNPWF5GQ232EUYNXTL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QVWFQ4HNPWF5GQ232EUYNXTL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QVWFQ4HNPWF5GQ232EUYNXTL3/action/storage_attestation","attest_author":"https://pith.science/pith/5QVWFQ4HNPWF5GQ232EUYNXTL3/action/author_attestation","sign_citation":"https://pith.science/pith/5QVWFQ4HNPWF5GQ232EUYNXTL3/action/citation_signature","submit_replication":"https://pith.science/pith/5QVWFQ4HNPWF5GQ232EUYNXTL3/action/replication_record"}},"created_at":"2026-05-18T00:25:33.376435+00:00","updated_at":"2026-05-18T00:25:33.376435+00:00"}