{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:K7H546YGXTLKSWTIWG3S5AKNSE","short_pith_number":"pith:K7H546YG","canonical_record":{"source":{"id":"cond-mat/0308217","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2003-08-11T21:21:03Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"3b53f65d67d7155785ac3aca51981796eb7fdd70223a35da4d059cef02c31260","abstract_canon_sha256":"7ceba22c21c4d977fde4f761e24d63048de24ac286f731d95bbe2956db4790a3"},"schema_version":"1.0"},"canonical_sha256":"57cfde7b06bcd6a95a68b1b72e814d91027bb1576e0b5bfbd02e46022265ec23","source":{"kind":"arxiv","id":"cond-mat/0308217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0308217","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0308217v1","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0308217","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"K7H546YGXTLK","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"pith_short_16","alias_value":"K7H546YGXTLKSWTI","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"pith_short_8","alias_value":"K7H546YG","created_at":"2026-07-04T16:39:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:K7H546YGXTLKSWTIWG3S5AKNSE","target":"record","payload":{"canonical_record":{"source":{"id":"cond-mat/0308217","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2003-08-11T21:21:03Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"3b53f65d67d7155785ac3aca51981796eb7fdd70223a35da4d059cef02c31260","abstract_canon_sha256":"7ceba22c21c4d977fde4f761e24d63048de24ac286f731d95bbe2956db4790a3"},"schema_version":"1.0"},"canonical_sha256":"57cfde7b06bcd6a95a68b1b72e814d91027bb1576e0b5bfbd02e46022265ec23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:39:18.243076Z","signature_b64":"zKOpeGwzlvRKvhdE2aKC1KTHakbsHK2oPK8afqXLHQnyi7oyxniP78Wq7C+1R1QCrRIUbA8InFy1i1VKt6A+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57cfde7b06bcd6a95a68b1b72e814d91027bb1576e0b5bfbd02e46022265ec23","last_reissued_at":"2026-07-04T16:39:18.242527Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:39:18.242527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cond-mat/0308217","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-07-04T16:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"malfAUdGSuQ7s/LxELrCzU64s70mxEe8ESm4znKYDMocm7DDqdpMWm5kYr2ODNDxl04PoVZTNN7xy6EF6nzvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:52:26.861529Z"},"content_sha256":"01ca11bdca995728bff70dc60eb529c5507cdde50c59dc495990040efedcbaed","schema_version":"1.0","event_id":"sha256:01ca11bdca995728bff70dc60eb529c5507cdde50c59dc495990040efedcbaed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:K7H546YGXTLKSWTIWG3S5AKNSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding and evaluating 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":"2003-08-11T21:21:03Z","abstract_excerpt":"We propose and study a set of algorithms for discovering community structure in networks -- natural divisions of network nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative removal of edges from the network to split it into communities, the edges removed being identified using one of a number of possible \"betweenness\" measures, and second, these measures are, crucially, recalculated after each removal. We also propose a measure for the strength of the community structure found by our algorithms, which gives us an objective met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0308217","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cond-mat/0308217/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T16:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JO6AmP3vD9mZcuoZkuPlA+JxxI6wrPCAOIrTF42ogaGzKwSyRVSOaDMajzmAhaCqaN30GTE16L0oXHkv1o+/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:52:26.862369Z"},"content_sha256":"d608ced86bb6277e0ffd7241103b1451e2b75cb9f67ede3edd394a8b54dae41d","schema_version":"1.0","event_id":"sha256:d608ced86bb6277e0ffd7241103b1451e2b75cb9f67ede3edd394a8b54dae41d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7H546YGXTLKSWTIWG3S5AKNSE/bundle.json","state_url":"https://pith.science/pith/K7H546YGXTLKSWTIWG3S5AKNSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7H546YGXTLKSWTIWG3S5AKNSE/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-08-14T12:52:26Z","links":{"resolver":"https://pith.science/pith/K7H546YGXTLKSWTIWG3S5AKNSE","bundle":"https://pith.science/pith/K7H546YGXTLKSWTIWG3S5AKNSE/bundle.json","state":"https://pith.science/pith/K7H546YGXTLKSWTIWG3S5AKNSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7H546YGXTLKSWTIWG3S5AKNSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:K7H546YGXTLKSWTIWG3S5AKNSE","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":"7ceba22c21c4d977fde4f761e24d63048de24ac286f731d95bbe2956db4790a3","cross_cats_sorted":["cond-mat.dis-nn"],"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2003-08-11T21:21:03Z","title_canon_sha256":"3b53f65d67d7155785ac3aca51981796eb7fdd70223a35da4d059cef02c31260"},"schema_version":"1.0","source":{"id":"cond-mat/0308217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0308217","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0308217v1","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0308217","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"K7H546YGXTLK","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"pith_short_16","alias_value":"K7H546YGXTLKSWTI","created_at":"2026-07-04T16:39:18Z"},{"alias_kind":"pith_short_8","alias_value":"K7H546YG","created_at":"2026-07-04T16:39:18Z"}],"graph_snapshots":[{"event_id":"sha256:d608ced86bb6277e0ffd7241103b1451e2b75cb9f67ede3edd394a8b54dae41d","target":"graph","created_at":"2026-07-04T16:39:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cond-mat/0308217/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose and study a set of algorithms for discovering community structure in networks -- natural divisions of network nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative removal of edges from the network to split it into communities, the edges removed being identified using one of a number of possible \"betweenness\" measures, and second, these measures are, crucially, recalculated after each removal. We also propose a measure for the strength of the community structure found by our algorithms, which gives us an objective met","authors_text":"M. E. J. Newman, M. Girvan","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2003-08-11T21:21:03Z","title":"Finding and evaluating community structure in networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0308217","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:01ca11bdca995728bff70dc60eb529c5507cdde50c59dc495990040efedcbaed","target":"record","created_at":"2026-07-04T16:39:18Z","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":"7ceba22c21c4d977fde4f761e24d63048de24ac286f731d95bbe2956db4790a3","cross_cats_sorted":["cond-mat.dis-nn"],"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2003-08-11T21:21:03Z","title_canon_sha256":"3b53f65d67d7155785ac3aca51981796eb7fdd70223a35da4d059cef02c31260"},"schema_version":"1.0","source":{"id":"cond-mat/0308217","kind":"arxiv","version":1}},"canonical_sha256":"57cfde7b06bcd6a95a68b1b72e814d91027bb1576e0b5bfbd02e46022265ec23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57cfde7b06bcd6a95a68b1b72e814d91027bb1576e0b5bfbd02e46022265ec23","first_computed_at":"2026-07-04T16:39:18.242527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T16:39:18.242527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zKOpeGwzlvRKvhdE2aKC1KTHakbsHK2oPK8afqXLHQnyi7oyxniP78Wq7C+1R1QCrRIUbA8InFy1i1VKt6A+Cw==","signature_status":"signed_v1","signed_at":"2026-07-04T16:39:18.243076Z","signed_message":"canonical_sha256_bytes"},"source_id":"cond-mat/0308217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01ca11bdca995728bff70dc60eb529c5507cdde50c59dc495990040efedcbaed","sha256:d608ced86bb6277e0ffd7241103b1451e2b75cb9f67ede3edd394a8b54dae41d"],"state_sha256":"d8d090aa422e16555114e0fe3d9fd30b7381846af4f1c7509473d6ab9d1afe69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vxmfy/gLrYGFrIYpnM3aRpo95AcDGYgxicxelJvLH9kaeq/mXCuO5LtBKw/2HiZxAVuaVYC0rrrma8keumslBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T12:52:26.867867Z","bundle_sha256":"6a4942bd6b0ffc675c2a41de3abd0f9f19614eb60e0609cc4fb17ebefdff1505"}}