{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:U4II7RNNGQ2RICDE2LYOH7S5R6","short_pith_number":"pith:U4II7RNN","canonical_record":{"source":{"id":"cond-mat/0210146","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2002-10-07T22:50:33Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"6c3f7e1d276d423caefb3faab14b966bf134185d4a0db168e386c04924d0a6d6","abstract_canon_sha256":"254689ba5ab6861d0f077978362ccac54798f9269638e556103139637ee3a03c"},"schema_version":"1.0"},"canonical_sha256":"a7108fc5ad3435140864d2f0e3fe5d8f99bba93a4075d1bd465285bf6f33d569","source":{"kind":"arxiv","id":"cond-mat/0210146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0210146","created_at":"2026-05-18T01:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0210146v1","created_at":"2026-05-18T01:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0210146","created_at":"2026-05-18T01:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"U4II7RNNGQ2R","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"U4II7RNNGQ2RICDE","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"U4II7RNN","created_at":"2026-05-18T12:25:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:U4II7RNNGQ2RICDE2LYOH7S5R6","target":"record","payload":{"canonical_record":{"source":{"id":"cond-mat/0210146","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2002-10-07T22:50:33Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"6c3f7e1d276d423caefb3faab14b966bf134185d4a0db168e386c04924d0a6d6","abstract_canon_sha256":"254689ba5ab6861d0f077978362ccac54798f9269638e556103139637ee3a03c"},"schema_version":"1.0"},"canonical_sha256":"a7108fc5ad3435140864d2f0e3fe5d8f99bba93a4075d1bd465285bf6f33d569","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:02.731709Z","signature_b64":"/Ty05EpKoC9GIpOyM62aL+MNnuT0aj7v7Sjr40d8fB+xezgfZAGZtok79+o5jZggm5r9qMkwMTuk8+XAK9PPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7108fc5ad3435140864d2f0e3fe5d8f99bba93a4075d1bd465285bf6f33d569","last_reissued_at":"2026-05-18T01:40:02.731129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:02.731129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cond-mat/0210146","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-18T01:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSGks98bh7rVJabeyl423CbYzLQi6WJt4e0ho/EHNV/z8GwVU5o28fnEZHXdGpCdBTBJX2z/Ot1KyEhgVKMtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:28:33.577528Z"},"content_sha256":"992e31a86fedacac6c13325a46f56ac81b0de842b7accd52c9f691bced9ab609","schema_version":"1.0","event_id":"sha256:992e31a86fedacac6c13325a46f56ac81b0de842b7accd52c9f691bced9ab609"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:U4II7RNNGQ2RICDE2LYOH7S5R6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixing patterns and community structure in networks","license":"","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"M. E. J. Newman, M. Girvan","submitted_at":"2002-10-07T22:50:33Z","abstract_excerpt":"Common experience suggests that many networks might possess community structure - division of vertices into groups, with a higher density of edges within groups than between them. Here we describe a new computer algorithm that detects structure of this kind. We apply the algorithm to a number of real-world networks and show that they do indeed possess non-trivial community structure. We suggest a possible explanation for this structure in the mechanism of assortative mixing, which is the preferential association of network vertices with others that are like them in some way. We show by simulat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0210146","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-18T01:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEffbmxsoPEut6OgLjsUSuPuUtvawEllqlF0JW4q8S8F9/1ypN/7B8Neyj02NQRLK4HhYQSwamwDw4Lz+xc1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:28:33.577878Z"},"content_sha256":"e6ed7bd2c4e3cd73549a27ba9051593c681246ee0cd5f63ab5172176b97b55b2","schema_version":"1.0","event_id":"sha256:e6ed7bd2c4e3cd73549a27ba9051593c681246ee0cd5f63ab5172176b97b55b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4II7RNNGQ2RICDE2LYOH7S5R6/bundle.json","state_url":"https://pith.science/pith/U4II7RNNGQ2RICDE2LYOH7S5R6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4II7RNNGQ2RICDE2LYOH7S5R6/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-04T18:28:33Z","links":{"resolver":"https://pith.science/pith/U4II7RNNGQ2RICDE2LYOH7S5R6","bundle":"https://pith.science/pith/U4II7RNNGQ2RICDE2LYOH7S5R6/bundle.json","state":"https://pith.science/pith/U4II7RNNGQ2RICDE2LYOH7S5R6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4II7RNNGQ2RICDE2LYOH7S5R6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:U4II7RNNGQ2RICDE2LYOH7S5R6","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":"254689ba5ab6861d0f077978362ccac54798f9269638e556103139637ee3a03c","cross_cats_sorted":["cond-mat.dis-nn"],"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2002-10-07T22:50:33Z","title_canon_sha256":"6c3f7e1d276d423caefb3faab14b966bf134185d4a0db168e386c04924d0a6d6"},"schema_version":"1.0","source":{"id":"cond-mat/0210146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0210146","created_at":"2026-05-18T01:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0210146v1","created_at":"2026-05-18T01:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0210146","created_at":"2026-05-18T01:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"U4II7RNNGQ2R","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"U4II7RNNGQ2RICDE","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"U4II7RNN","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:e6ed7bd2c4e3cd73549a27ba9051593c681246ee0cd5f63ab5172176b97b55b2","target":"graph","created_at":"2026-05-18T01:40:02Z","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":"Common experience suggests that many networks might possess community structure - division of vertices into groups, with a higher density of edges within groups than between them. Here we describe a new computer algorithm that detects structure of this kind. We apply the algorithm to a number of real-world networks and show that they do indeed possess non-trivial community structure. We suggest a possible explanation for this structure in the mechanism of assortative mixing, which is the preferential association of network vertices with others that are like them in some way. We show by simulat","authors_text":"M. E. J. Newman, M. Girvan","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2002-10-07T22:50:33Z","title":"Mixing patterns and community structure in networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0210146","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:992e31a86fedacac6c13325a46f56ac81b0de842b7accd52c9f691bced9ab609","target":"record","created_at":"2026-05-18T01:40:02Z","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":"254689ba5ab6861d0f077978362ccac54798f9269638e556103139637ee3a03c","cross_cats_sorted":["cond-mat.dis-nn"],"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2002-10-07T22:50:33Z","title_canon_sha256":"6c3f7e1d276d423caefb3faab14b966bf134185d4a0db168e386c04924d0a6d6"},"schema_version":"1.0","source":{"id":"cond-mat/0210146","kind":"arxiv","version":1}},"canonical_sha256":"a7108fc5ad3435140864d2f0e3fe5d8f99bba93a4075d1bd465285bf6f33d569","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7108fc5ad3435140864d2f0e3fe5d8f99bba93a4075d1bd465285bf6f33d569","first_computed_at":"2026-05-18T01:40:02.731129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:40:02.731129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Ty05EpKoC9GIpOyM62aL+MNnuT0aj7v7Sjr40d8fB+xezgfZAGZtok79+o5jZggm5r9qMkwMTuk8+XAK9PPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:40:02.731709Z","signed_message":"canonical_sha256_bytes"},"source_id":"cond-mat/0210146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:992e31a86fedacac6c13325a46f56ac81b0de842b7accd52c9f691bced9ab609","sha256:e6ed7bd2c4e3cd73549a27ba9051593c681246ee0cd5f63ab5172176b97b55b2"],"state_sha256":"fe3865bf42f2a95c67aea2fd7fe331f6ceca2741a62492903e81a201798ebc56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9UEf8Z3BcxCn9oHGHOrFdY5Lw0R20B1vVhw5tkKHDtQa1d+0hrn3IJ7eDcMjb47qMlU7eM02udo8wbthBRWNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:28:33.579881Z","bundle_sha256":"8cb9588da81405dada994fd53c3463ccc67fbbc0b0098081f271ef5347f89318"}}