{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I3N5QJNZL3SDRF6YQUDUABN6PG","short_pith_number":"pith:I3N5QJNZ","canonical_record":{"source":{"id":"1308.3383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-08-15T13:22:24Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"971e2c0e4d53ca1fc063c7ba8431d39c0c57cc08fcdadd0a5f8feb8c39e5601b","abstract_canon_sha256":"fe9bf8bae36c327423eead690859af47aafe1fae73d98e2a306ba2c78c42ce4b"},"schema_version":"1.0"},"canonical_sha256":"46dbd825b95ee43897d885074005be798aaba029bd40bddaea57d42c7ead4128","source":{"kind":"arxiv","id":"1308.3383","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3383","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3383v2","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3383","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"I3N5QJNZL3SD","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I3N5QJNZL3SDRF6Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I3N5QJNZ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I3N5QJNZL3SDRF6YQUDUABN6PG","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-08-15T13:22:24Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"971e2c0e4d53ca1fc063c7ba8431d39c0c57cc08fcdadd0a5f8feb8c39e5601b","abstract_canon_sha256":"fe9bf8bae36c327423eead690859af47aafe1fae73d98e2a306ba2c78c42ce4b"},"schema_version":"1.0"},"canonical_sha256":"46dbd825b95ee43897d885074005be798aaba029bd40bddaea57d42c7ead4128","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:07.770807Z","signature_b64":"XghECrrjpIWUcWZhS2q9ckATRUCpRRSUpS6jzTx8g6KDV+iMw2CdE/ZrLuRHCLnbX42t3jxWBuxCblq/eglFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46dbd825b95ee43897d885074005be798aaba029bd40bddaea57d42c7ead4128","last_reissued_at":"2026-05-18T02:47:07.770417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:07.770417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3383","source_version":2,"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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivUPbS6hUVy+9c2jhX1WtGzCm256eYCTqzH2Du76vKeEptGBJRzYH3/RvM61+r8CniDXoyoxP8L/enR6pOruAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:54:56.923739Z"},"content_sha256":"51dab90be1e920699782fcdde5e25e7d56046fef87f1298a4df373b588436e49","schema_version":"1.0","event_id":"sha256:51dab90be1e920699782fcdde5e25e7d56046fef87f1298a4df373b588436e49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I3N5QJNZL3SDRF6YQUDUABN6PG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Axioms for graph clustering quality functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Elena Marchiori, Twan van Laarhoven","submitted_at":"2013-08-15T13:22:24Z","abstract_excerpt":"We investigate properties that intuitively ought to be satisfied by graph clustering quality functions, that is, functions that assign a score to a clustering of a graph. Graph clustering, also known as network community detection, is often performed by optimizing such a function. Two axioms tailored for graph clustering quality functions are introduced, and the four axioms introduced in previous work on distance based clustering are reformulated and generalized for the graph setting. We show that modularity, a standard quality function for graph clustering, does not satisfy all of these six p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3383","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"},"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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzmWQ5gHe5kCq9LSxrLMiGDYpiyJrkwjogy7wpv3rZsqftlfGotJfMjT6/oz2Ysejh4X8kocHzG+lcsrJAmqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:54:56.924103Z"},"content_sha256":"bdf9cf6114e30d951c643336b2b3dd406daa1d5b107520e88a27b650ba7fb078","schema_version":"1.0","event_id":"sha256:bdf9cf6114e30d951c643336b2b3dd406daa1d5b107520e88a27b650ba7fb078"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3N5QJNZL3SDRF6YQUDUABN6PG/bundle.json","state_url":"https://pith.science/pith/I3N5QJNZL3SDRF6YQUDUABN6PG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3N5QJNZL3SDRF6YQUDUABN6PG/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-03T07:54:56Z","links":{"resolver":"https://pith.science/pith/I3N5QJNZL3SDRF6YQUDUABN6PG","bundle":"https://pith.science/pith/I3N5QJNZL3SDRF6YQUDUABN6PG/bundle.json","state":"https://pith.science/pith/I3N5QJNZL3SDRF6YQUDUABN6PG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3N5QJNZL3SDRF6YQUDUABN6PG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I3N5QJNZL3SDRF6YQUDUABN6PG","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":"fe9bf8bae36c327423eead690859af47aafe1fae73d98e2a306ba2c78c42ce4b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-08-15T13:22:24Z","title_canon_sha256":"971e2c0e4d53ca1fc063c7ba8431d39c0c57cc08fcdadd0a5f8feb8c39e5601b"},"schema_version":"1.0","source":{"id":"1308.3383","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3383","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3383v2","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3383","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"I3N5QJNZL3SD","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I3N5QJNZL3SDRF6Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I3N5QJNZ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:bdf9cf6114e30d951c643336b2b3dd406daa1d5b107520e88a27b650ba7fb078","target":"graph","created_at":"2026-05-18T02:47:07Z","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":"We investigate properties that intuitively ought to be satisfied by graph clustering quality functions, that is, functions that assign a score to a clustering of a graph. Graph clustering, also known as network community detection, is often performed by optimizing such a function. Two axioms tailored for graph clustering quality functions are introduced, and the four axioms introduced in previous work on distance based clustering are reformulated and generalized for the graph setting. We show that modularity, a standard quality function for graph clustering, does not satisfy all of these six p","authors_text":"Elena Marchiori, Twan van Laarhoven","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-08-15T13:22:24Z","title":"Axioms for graph clustering quality functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3383","kind":"arxiv","version":2},"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:51dab90be1e920699782fcdde5e25e7d56046fef87f1298a4df373b588436e49","target":"record","created_at":"2026-05-18T02:47:07Z","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":"fe9bf8bae36c327423eead690859af47aafe1fae73d98e2a306ba2c78c42ce4b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-08-15T13:22:24Z","title_canon_sha256":"971e2c0e4d53ca1fc063c7ba8431d39c0c57cc08fcdadd0a5f8feb8c39e5601b"},"schema_version":"1.0","source":{"id":"1308.3383","kind":"arxiv","version":2}},"canonical_sha256":"46dbd825b95ee43897d885074005be798aaba029bd40bddaea57d42c7ead4128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46dbd825b95ee43897d885074005be798aaba029bd40bddaea57d42c7ead4128","first_computed_at":"2026-05-18T02:47:07.770417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:07.770417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XghECrrjpIWUcWZhS2q9ckATRUCpRRSUpS6jzTx8g6KDV+iMw2CdE/ZrLuRHCLnbX42t3jxWBuxCblq/eglFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:07.770807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3383","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51dab90be1e920699782fcdde5e25e7d56046fef87f1298a4df373b588436e49","sha256:bdf9cf6114e30d951c643336b2b3dd406daa1d5b107520e88a27b650ba7fb078"],"state_sha256":"804bc12a5b724c85fcb33d54735a91e74f70458f5004de7525189a8ba2736d4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+LqwB2LMI9M4A6IaP8v91AM1rOh+WM7LAc4oywC5lpYX2E/MAhPvj7A8NgZjUB8nBzIRqF995f571463d8TBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:54:56.926309Z","bundle_sha256":"29f4cc500870be9300b508e5db30d07c8c0945f8709eb5d0a7b6d451a3107229"}}