{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FQEEVPM47BAS2PZSQRKGKIZUXJ","short_pith_number":"pith:FQEEVPM4","canonical_record":{"source":{"id":"1305.6228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-05-27T14:13:11Z","cross_cats_sorted":["cond-mat.dis-nn","cs.SI"],"title_canon_sha256":"c6cf15fae4bcc5ecc6b01e3273ef0bcaf923125935705e91a4bbbc23ffaa08ec","abstract_canon_sha256":"0b6c499031e701192dd0583f4eb99548feb72310a5e0c20adc569cd4a568b0f1"},"schema_version":"1.0"},"canonical_sha256":"2c084abd9cf8412d3f328454652334ba66f53a49f062dbe33ca8d761001ae721","source":{"kind":"arxiv","id":"1305.6228","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6228","created_at":"2026-05-18T03:02:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6228v3","created_at":"2026-05-18T03:02:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6228","created_at":"2026-05-18T03:02:17Z"},{"alias_kind":"pith_short_12","alias_value":"FQEEVPM47BAS","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FQEEVPM47BAS2PZS","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FQEEVPM4","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FQEEVPM47BAS2PZSQRKGKIZUXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-05-27T14:13:11Z","cross_cats_sorted":["cond-mat.dis-nn","cs.SI"],"title_canon_sha256":"c6cf15fae4bcc5ecc6b01e3273ef0bcaf923125935705e91a4bbbc23ffaa08ec","abstract_canon_sha256":"0b6c499031e701192dd0583f4eb99548feb72310a5e0c20adc569cd4a568b0f1"},"schema_version":"1.0"},"canonical_sha256":"2c084abd9cf8412d3f328454652334ba66f53a49f062dbe33ca8d761001ae721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:17.593306Z","signature_b64":"ravuy8aZGjqO5agbw0v8DxjaqO38eNpVe2oz+yc5vvBPttAvR0ZbHKcVWmfFAO2u0jegDK9xmjoOc4TFPtjWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c084abd9cf8412d3f328454652334ba66f53a49f062dbe33ca8d761001ae721","last_reissued_at":"2026-05-18T03:02:17.592563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:17.592563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6228","source_version":3,"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-18T03:02:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hl/HRa1rMQN0gfxK0hcS5tKJ7Sljr3cmkmqQl6Cvj96Si6ThOm3D0ejfM3Ra34xojff6DUKvu66+Tk6ea/n9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:35:34.348454Z"},"content_sha256":"392e5853abcd6e178b5bf5a939f19a0c5e5ef7c7cab0a1bc881e039ca2292098","schema_version":"1.0","event_id":"sha256:392e5853abcd6e178b5bf5a939f19a0c5e5ef7c7cab0a1bc881e039ca2292098"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FQEEVPM47BAS2PZSQRKGKIZUXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting hierarchical and overlapping network communities using locally optimal modularity changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Michael J. Barber","submitted_at":"2013-05-27T14:13:11Z","abstract_excerpt":"Agglomerative clustering is a well established strategy for identifying communities in networks. Communities are successively merged into larger communities, coarsening a network of actors into a more manageable network of communities. The order in which merges should occur is not in general clear, necessitating heuristics for selecting pairs of communities to merge. We describe a hierarchical clustering algorithm based on a local optimality property. For each edge in the network, we associate the modularity change for merging the communities it links. For each community vertex, we call the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6228","kind":"arxiv","version":3},"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-18T03:02:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2tblyPocCPrbVOqNrvtEjbSh1aazVHx7VMe9nwfnzMATLlue/0W35p4rO6elqnGexRKFbJKo7iQJ9Yq+nGbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:35:34.348796Z"},"content_sha256":"3b1ab4880c7e6f55223f143b04274dbbdc60b57df93710895eacc76a76b5a065","schema_version":"1.0","event_id":"sha256:3b1ab4880c7e6f55223f143b04274dbbdc60b57df93710895eacc76a76b5a065"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQEEVPM47BAS2PZSQRKGKIZUXJ/bundle.json","state_url":"https://pith.science/pith/FQEEVPM47BAS2PZSQRKGKIZUXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQEEVPM47BAS2PZSQRKGKIZUXJ/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-03T03:35:34Z","links":{"resolver":"https://pith.science/pith/FQEEVPM47BAS2PZSQRKGKIZUXJ","bundle":"https://pith.science/pith/FQEEVPM47BAS2PZSQRKGKIZUXJ/bundle.json","state":"https://pith.science/pith/FQEEVPM47BAS2PZSQRKGKIZUXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQEEVPM47BAS2PZSQRKGKIZUXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FQEEVPM47BAS2PZSQRKGKIZUXJ","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":"0b6c499031e701192dd0583f4eb99548feb72310a5e0c20adc569cd4a568b0f1","cross_cats_sorted":["cond-mat.dis-nn","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-05-27T14:13:11Z","title_canon_sha256":"c6cf15fae4bcc5ecc6b01e3273ef0bcaf923125935705e91a4bbbc23ffaa08ec"},"schema_version":"1.0","source":{"id":"1305.6228","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6228","created_at":"2026-05-18T03:02:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6228v3","created_at":"2026-05-18T03:02:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6228","created_at":"2026-05-18T03:02:17Z"},{"alias_kind":"pith_short_12","alias_value":"FQEEVPM47BAS","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FQEEVPM47BAS2PZS","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FQEEVPM4","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:3b1ab4880c7e6f55223f143b04274dbbdc60b57df93710895eacc76a76b5a065","target":"graph","created_at":"2026-05-18T03:02:17Z","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":"Agglomerative clustering is a well established strategy for identifying communities in networks. Communities are successively merged into larger communities, coarsening a network of actors into a more manageable network of communities. The order in which merges should occur is not in general clear, necessitating heuristics for selecting pairs of communities to merge. We describe a hierarchical clustering algorithm based on a local optimality property. For each edge in the network, we associate the modularity change for merging the communities it links. For each community vertex, we call the pr","authors_text":"Michael J. Barber","cross_cats":["cond-mat.dis-nn","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-05-27T14:13:11Z","title":"Detecting hierarchical and overlapping network communities using locally optimal modularity changes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6228","kind":"arxiv","version":3},"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:392e5853abcd6e178b5bf5a939f19a0c5e5ef7c7cab0a1bc881e039ca2292098","target":"record","created_at":"2026-05-18T03:02:17Z","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":"0b6c499031e701192dd0583f4eb99548feb72310a5e0c20adc569cd4a568b0f1","cross_cats_sorted":["cond-mat.dis-nn","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-05-27T14:13:11Z","title_canon_sha256":"c6cf15fae4bcc5ecc6b01e3273ef0bcaf923125935705e91a4bbbc23ffaa08ec"},"schema_version":"1.0","source":{"id":"1305.6228","kind":"arxiv","version":3}},"canonical_sha256":"2c084abd9cf8412d3f328454652334ba66f53a49f062dbe33ca8d761001ae721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c084abd9cf8412d3f328454652334ba66f53a49f062dbe33ca8d761001ae721","first_computed_at":"2026-05-18T03:02:17.592563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:17.592563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ravuy8aZGjqO5agbw0v8DxjaqO38eNpVe2oz+yc5vvBPttAvR0ZbHKcVWmfFAO2u0jegDK9xmjoOc4TFPtjWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:17.593306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6228","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:392e5853abcd6e178b5bf5a939f19a0c5e5ef7c7cab0a1bc881e039ca2292098","sha256:3b1ab4880c7e6f55223f143b04274dbbdc60b57df93710895eacc76a76b5a065"],"state_sha256":"f39e28eec23604c4a95ac587b736e8fbcb0816ee94e51182bffdef4d9d463783"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6tOgGkKD62Ud+y6AZ1Se+lO86FIaBDF6fD+yaVutPPx5hSqpF6kJEzJcJkDmxQqXSLDEAY2gP3GjUil3naDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:35:34.350712Z","bundle_sha256":"cbcdf1ed8d4787aba58d2f1155b903fe0a1052fc551ba60c3c040015db0d8622"}}