{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WE7ZE5RZI5LNNUK7LLM4JQ3XUU","short_pith_number":"pith:WE7ZE5RZ","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"},"canonical_sha256":"b13f9276394756d6d15f5ad9c4c377a527342c17338102181b71343a3e77e11f","source":{"kind":"arxiv","id":"1407.5924","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WE7ZE5RZI5LNNUK7LLM4JQ3XUU","target":"record","payload":{"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"},"canonical_sha256":"b13f9276394756d6d15f5ad9c4c377a527342c17338102181b71343a3e77e11f","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"},"source_kind":"arxiv","source_id":"1407.5924","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FJAXf9D21hoCVEN9ZpmoPrYcV2DPMpSB8UtzOrTNwleShJt34euC2w8116H0m+2E7yRoJG5FAdAEyi3VeuXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:19:26.915466Z"},"content_sha256":"94e3b4fd79346673b44eeec2c08f26db2c085fa5b4a9cde1ad33dd57e43ed88c","schema_version":"1.0","event_id":"sha256:94e3b4fd79346673b44eeec2c08f26db2c085fa5b4a9cde1ad33dd57e43ed88c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WE7ZE5RZI5LNNUK7LLM4JQ3XUU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTVPZIg5K3e3q6d4dOusHqCv1XWlrLWxU7qzoKFBnTZmD15ZFI2w0mqUbJlPzlD01thSX+5HCcE4gQurSZ7GBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:19:26.915841Z"},"content_sha256":"4cafca873148640a07098d90acd17deeb1be8f00496c461fe8fe2b927e7d1bf3","schema_version":"1.0","event_id":"sha256:4cafca873148640a07098d90acd17deeb1be8f00496c461fe8fe2b927e7d1bf3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/bundle.json","state_url":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T23:19:26Z","links":{"resolver":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU","bundle":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/bundle.json","state":"https://pith.science/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WE7ZE5RZI5LNNUK7LLM4JQ3XUU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eqdjt87ISBT0lMIhrbD2m9rioH0+Plb6c306XeNTLBUTYNBXUQ8er2tiTrgDsv5ITpw4AZI7FMiYtFzHMTrlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:19:26.917890Z","bundle_sha256":"ae0c982c91747f111aab65caf7afd934e82fede9be5bd43dabc6076c7f76f672"}}