{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:JCQEOKETWLVRG6HK5WV72YPYGR","short_pith_number":"pith:JCQEOKET","canonical_record":{"source":{"id":"1009.1318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-07T14:57:15Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"28e05a375e68705c820a474519c27d42a0433fe609239499fef85d0a4ea6353f","abstract_canon_sha256":"191b66130a0214010b75c3037655fc4c13ea867509bc918f072cd41c54fa055c"},"schema_version":"1.0"},"canonical_sha256":"48a0472893b2eb1378eaedabfd61f83445d179995c1407efe175a89497043a6f","source":{"kind":"arxiv","id":"1009.1318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1318","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1318v1","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1318","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"pith_short_12","alias_value":"JCQEOKETWLVR","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JCQEOKETWLVRG6HK","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JCQEOKET","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:JCQEOKETWLVRG6HK5WV72YPYGR","target":"record","payload":{"canonical_record":{"source":{"id":"1009.1318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-07T14:57:15Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"28e05a375e68705c820a474519c27d42a0433fe609239499fef85d0a4ea6353f","abstract_canon_sha256":"191b66130a0214010b75c3037655fc4c13ea867509bc918f072cd41c54fa055c"},"schema_version":"1.0"},"canonical_sha256":"48a0472893b2eb1378eaedabfd61f83445d179995c1407efe175a89497043a6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:15.735829Z","signature_b64":"oHU/I28BtiOrQpyQQBJ9vZKCSiuG/YRXJJYTptO3iu5FXOpILcxc/ub0NQPlX0E3vx7qrPMnN43oqGTXmKycCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48a0472893b2eb1378eaedabfd61f83445d179995c1407efe175a89497043a6f","last_reissued_at":"2026-05-18T04:41:15.735390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:15.735390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.1318","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-18T04:41:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLx3imbErQSCXGa9CX3WKvsqwubHx4bGmYJMwaigSD8GjFP+Xrzwxqq5tu8G80eFmqHUEAzSDanaaF+AnKcmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:51:25.607466Z"},"content_sha256":"5c3258b22562785de78e5fc1d5cd9dd9c2b09a331d1e5e08a91437b9b38381e2","schema_version":"1.0","event_id":"sha256:5c3258b22562785de78e5fc1d5cd9dd9c2b09a331d1e5e08a91437b9b38381e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:JCQEOKETWLVRG6HK5WV72YPYGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ML","authors_text":"Fabrice Rossi, Nathalie Villa-Vialaneix","submitted_at":"2010-09-07T14:57:15Z","abstract_excerpt":"This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topographic graph clustering provides an alternative to more classical solutions in which a standard graph clustering method is applied to build a simpler graph that is then represented with a graph layout algorithm. A comparative study on four real world graphs ranging from 34 to 1 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1318","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-18T04:41:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W15WHwyeD14AFgH7+mh2rTqbiGAr1EQcL/HWTvo9k6pQxIctv8zmWYIzQMjde+ELdlj/KkpnNQ5Snxn35ACSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:51:25.607798Z"},"content_sha256":"587629d59a6d4ee76418c9905635bd73ff89357026565b0322d19d7f6591a2e0","schema_version":"1.0","event_id":"sha256:587629d59a6d4ee76418c9905635bd73ff89357026565b0322d19d7f6591a2e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCQEOKETWLVRG6HK5WV72YPYGR/bundle.json","state_url":"https://pith.science/pith/JCQEOKETWLVRG6HK5WV72YPYGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCQEOKETWLVRG6HK5WV72YPYGR/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-27T04:51:25Z","links":{"resolver":"https://pith.science/pith/JCQEOKETWLVRG6HK5WV72YPYGR","bundle":"https://pith.science/pith/JCQEOKETWLVRG6HK5WV72YPYGR/bundle.json","state":"https://pith.science/pith/JCQEOKETWLVRG6HK5WV72YPYGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCQEOKETWLVRG6HK5WV72YPYGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:JCQEOKETWLVRG6HK5WV72YPYGR","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":"191b66130a0214010b75c3037655fc4c13ea867509bc918f072cd41c54fa055c","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-07T14:57:15Z","title_canon_sha256":"28e05a375e68705c820a474519c27d42a0433fe609239499fef85d0a4ea6353f"},"schema_version":"1.0","source":{"id":"1009.1318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1318","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1318v1","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1318","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"pith_short_12","alias_value":"JCQEOKETWLVR","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JCQEOKETWLVRG6HK","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JCQEOKET","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:587629d59a6d4ee76418c9905635bd73ff89357026565b0322d19d7f6591a2e0","target":"graph","created_at":"2026-05-18T04:41:15Z","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":"This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topographic graph clustering provides an alternative to more classical solutions in which a standard graph clustering method is applied to build a simpler graph that is then represented with a graph layout algorithm. A comparative study on four real world graphs ranging from 34 to 1 1","authors_text":"Fabrice Rossi, Nathalie Villa-Vialaneix","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-07T14:57:15Z","title":"Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1318","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:5c3258b22562785de78e5fc1d5cd9dd9c2b09a331d1e5e08a91437b9b38381e2","target":"record","created_at":"2026-05-18T04:41:15Z","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":"191b66130a0214010b75c3037655fc4c13ea867509bc918f072cd41c54fa055c","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-07T14:57:15Z","title_canon_sha256":"28e05a375e68705c820a474519c27d42a0433fe609239499fef85d0a4ea6353f"},"schema_version":"1.0","source":{"id":"1009.1318","kind":"arxiv","version":1}},"canonical_sha256":"48a0472893b2eb1378eaedabfd61f83445d179995c1407efe175a89497043a6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48a0472893b2eb1378eaedabfd61f83445d179995c1407efe175a89497043a6f","first_computed_at":"2026-05-18T04:41:15.735390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:15.735390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oHU/I28BtiOrQpyQQBJ9vZKCSiuG/YRXJJYTptO3iu5FXOpILcxc/ub0NQPlX0E3vx7qrPMnN43oqGTXmKycCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:15.735829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c3258b22562785de78e5fc1d5cd9dd9c2b09a331d1e5e08a91437b9b38381e2","sha256:587629d59a6d4ee76418c9905635bd73ff89357026565b0322d19d7f6591a2e0"],"state_sha256":"1b082c6a4a5af8dda44a83619d4518f58e4c85ac74bae7b015193ec8c37ae1d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lL/r0czwAK3WrKIQraCmChoYxS6fpOeHA4NPIFCHkU9PY9sX/4PU483NUG5YdRcSUfQMvY8dwDlQyDk2dbP9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:51:25.609614Z","bundle_sha256":"6eadf50f0e4b6dea43af2848d3260f2582c60fd3c4b26b5e44a6abd9dd978694"}}