{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WE7ZE5RZI5LNNUK7LLM4JQ3XUU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7626efc98732f8adaa4343a443a787ecec71164987228051a4ba477b686ce18c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-22T16:21:59Z","title_canon_sha256":"69cd387d684d62c75fd26d5755b01b47a2e5d96b1d1709942edd7512cd7f72d5"},"schema_version":"1.0","source":{"id":"1407.5924","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5924","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5924v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5924","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"WE7ZE5RZI5LN","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WE7ZE5RZI5LNNUK7","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WE7ZE5RZ","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:4cafca873148640a07098d90acd17deeb1be8f00496c461fe8fe2b927e7d1bf3","target":"graph","created_at":"2026-05-18T02:47:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Elena Marchiori, Twan van Laarhoven","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-22T16:21:59Z","title":"Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5924","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:94e3b4fd79346673b44eeec2c08f26db2c085fa5b4a9cde1ad33dd57e43ed88c","target":"record","created_at":"2026-05-18T02:47:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7626efc98732f8adaa4343a443a787ecec71164987228051a4ba477b686ce18c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-22T16:21:59Z","title_canon_sha256":"69cd387d684d62c75fd26d5755b01b47a2e5d96b1d1709942edd7512cd7f72d5"},"schema_version":"1.0","source":{"id":"1407.5924","kind":"arxiv","version":1}},"canonical_sha256":"b13f9276394756d6d15f5ad9c4c377a527342c17338102181b71343a3e77e11f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b13f9276394756d6d15f5ad9c4c377a527342c17338102181b71343a3e77e11f","first_computed_at":"2026-05-18T02:47:06.384939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:06.384939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O0Xk/QxMN/saRQNLc7B85GR/GhV77SObENv9bmr6h0MLsepuFDD5oTzlGGw05vKJWXgHzOXpekU2Js4LhtbXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:06.385341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5924","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94e3b4fd79346673b44eeec2c08f26db2c085fa5b4a9cde1ad33dd57e43ed88c","sha256:4cafca873148640a07098d90acd17deeb1be8f00496c461fe8fe2b927e7d1bf3"],"state_sha256":"ab2cbe14d1936dc68f6573d87d87d4d0f2b721d7a86041921cd39f4488107e5f"}