{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WE7ZE5RZI5LNNUK7LLM4JQ3XUU","short_pith_number":"pith:WE7ZE5RZ","schema_version":"1.0","canonical_sha256":"b13f9276394756d6d15f5ad9c4c377a527342c17338102181b71343a3e77e11f","source":{"kind":"arxiv","id":"1407.5924","version":1},"attestation_state":"computed","paper":{"title":"Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Elena Marchiori, Twan van Laarhoven","submitted_at":"2014-07-22T16:21:59Z","abstract_excerpt":"Many graph clustering quality functions suffer from a resolution limit, the inability to find small clusters in large graphs. So called resolution-limit-free quality functions do not have this limit. This property was previously introduced for hard clustering, that is, graph partitioning.\n  We investigate the resolution-limit-free property in the context of Non-negative Matrix Factorization (NMF) for hard and soft graph clustering. To use NMF in the hard clustering setting, a common approach is to assign each node to its highest membership cluster. We show that in this case symmetric NMF is no"},"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.5924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-22T16:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"69cd387d684d62c75fd26d5755b01b47a2e5d96b1d1709942edd7512cd7f72d5","abstract_canon_sha256":"7626efc98732f8adaa4343a443a787ecec71164987228051a4ba477b686ce18c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:06.385341Z","signature_b64":"O0Xk/QxMN/saRQNLc7B85GR/GhV77SObENv9bmr6h0MLsepuFDD5oTzlGGw05vKJWXgHzOXpekU2Js4LhtbXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b13f9276394756d6d15f5ad9c4c377a527342c17338102181b71343a3e77e11f","last_reissued_at":"2026-05-18T02:47:06.384939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:06.384939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Elena Marchiori, Twan van Laarhoven","submitted_at":"2014-07-22T16:21:59Z","abstract_excerpt":"Many graph clustering quality functions suffer from a resolution limit, the inability to find small clusters in large graphs. So called resolution-limit-free quality functions do not have this limit. This property was previously introduced for hard clustering, that is, graph partitioning.\n  We investigate the resolution-limit-free property in the context of Non-negative Matrix Factorization (NMF) for hard and soft graph clustering. To use NMF in the hard clustering setting, a common approach is to assign each node to its highest membership cluster. We show that in this case symmetric NMF is no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5924","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.5924","created_at":"2026-05-18T02:47:06.385001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5924v1","created_at":"2026-05-18T02:47:06.385001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5924","created_at":"2026-05-18T02:47:06.385001+00:00"},{"alias_kind":"pith_short_12","alias_value":"WE7ZE5RZI5LN","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WE7ZE5RZI5LNNUK7","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WE7ZE5RZ","created_at":"2026-05-18T12:28:54.890064+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/WE7ZE5RZI5LNNUK7LLM4JQ3XUU","json":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU.json","graph_json":"https://pith.science/api/pith-number/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/graph.json","events_json":"https://pith.science/api/pith-number/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/events.json","paper":"https://pith.science/paper/WE7ZE5RZ"},"agent_actions":{"view_html":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU","download_json":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU.json","view_paper":"https://pith.science/paper/WE7ZE5RZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5924&json=true","fetch_graph":"https://pith.science/api/pith-number/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/graph.json","fetch_events":"https://pith.science/api/pith-number/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/action/storage_attestation","attest_author":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/action/author_attestation","sign_citation":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/action/citation_signature","submit_replication":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/action/replication_record"}},"created_at":"2026-05-18T02:47:06.385001+00:00","updated_at":"2026-05-18T02:47:06.385001+00:00"}