{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:46OLGOABYKCVPRRO2OGCCLHB7D","short_pith_number":"pith:46OLGOAB","canonical_record":{"source":{"id":"1303.1741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-07T16:43:30Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"479af6967999e9e165614c88499729daf16436b0c96a42a0c3df05120fd7d3db","abstract_canon_sha256":"04c423327341299d0c02ae18826e879b02cf5bae7fd06925dcf2552a36fac2e0"},"schema_version":"1.0"},"canonical_sha256":"e79cb33801c28557c62ed38c212ce1f8d03a97da11ffc2172f4781a5ebb9ca18","source":{"kind":"arxiv","id":"1303.1741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1741","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1741v1","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1741","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"pith_short_12","alias_value":"46OLGOABYKCV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"46OLGOABYKCVPRRO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"46OLGOAB","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:46OLGOABYKCVPRRO2OGCCLHB7D","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-07T16:43:30Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"479af6967999e9e165614c88499729daf16436b0c96a42a0c3df05120fd7d3db","abstract_canon_sha256":"04c423327341299d0c02ae18826e879b02cf5bae7fd06925dcf2552a36fac2e0"},"schema_version":"1.0"},"canonical_sha256":"e79cb33801c28557c62ed38c212ce1f8d03a97da11ffc2172f4781a5ebb9ca18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:33.259104Z","signature_b64":"xb1VTSAveSFe8QoMUqnU888rEirbo+9+erOtLWNhuCKwc/XSnkSCbZz2mVELxlNFNWTklBCvfuER6gGwuPtdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e79cb33801c28557c62ed38c212ce1f8d03a97da11ffc2172f4781a5ebb9ca18","last_reissued_at":"2026-05-18T03:31:33.258537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:33.258537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1741","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-18T03:31:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sbn2PDyENsUCtjjgR+c2LopRzBS5uXL0ljWGcUL4Eds+RSaE6JjICL+D6aldIEyJSMXq6SHbnz3venpOzwGFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:20:39.577774Z"},"content_sha256":"ebd3fa2e545718167371fc0eaf37ab7ba2c22703771a1afb6952826b9fe0d120","schema_version":"1.0","event_id":"sha256:ebd3fa2e545718167371fc0eaf37ab7ba2c22703771a1afb6952826b9fe0d120"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:46OLGOABYKCVPRRO2OGCCLHB7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing community detection using a network weighting strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alessandro Provetti, Emilio Ferrara, Giacomo Fiumara, Pasquale De Meo","submitted_at":"2013-03-07T16:43:30Z","abstract_excerpt":"A community within a network is a group of vertices densely connected to each other but less connected to the vertices outside. The problem of detecting communities in large networks plays a key role in a wide range of research areas, e.g. Computer Science, Biology and Sociology. Most of the existing algorithms to find communities count on the topological features of the network and often do not scale well on large, real-life instances.\n  In this article we propose a strategy to enhance existing community detection algorithms by adding a pre-processing step in which edges are weighted accordin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1741","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-18T03:31:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaFA6zJpP0BCoz3tR/5Dzc4+jRx5Lgg8So+ShD58zB+ZJOgdJvMGw22Ai3Ja7McPjZ6YliXQwT2JeShqEe8lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:20:39.578495Z"},"content_sha256":"73adc62ddeb654533c6278ddf901b689afa8193e0b8d95f2cda02945c23a65ac","schema_version":"1.0","event_id":"sha256:73adc62ddeb654533c6278ddf901b689afa8193e0b8d95f2cda02945c23a65ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46OLGOABYKCVPRRO2OGCCLHB7D/bundle.json","state_url":"https://pith.science/pith/46OLGOABYKCVPRRO2OGCCLHB7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46OLGOABYKCVPRRO2OGCCLHB7D/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-05-25T16:20:39Z","links":{"resolver":"https://pith.science/pith/46OLGOABYKCVPRRO2OGCCLHB7D","bundle":"https://pith.science/pith/46OLGOABYKCVPRRO2OGCCLHB7D/bundle.json","state":"https://pith.science/pith/46OLGOABYKCVPRRO2OGCCLHB7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46OLGOABYKCVPRRO2OGCCLHB7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:46OLGOABYKCVPRRO2OGCCLHB7D","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":"04c423327341299d0c02ae18826e879b02cf5bae7fd06925dcf2552a36fac2e0","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-07T16:43:30Z","title_canon_sha256":"479af6967999e9e165614c88499729daf16436b0c96a42a0c3df05120fd7d3db"},"schema_version":"1.0","source":{"id":"1303.1741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1741","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1741v1","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1741","created_at":"2026-05-18T03:31:33Z"},{"alias_kind":"pith_short_12","alias_value":"46OLGOABYKCV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"46OLGOABYKCVPRRO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"46OLGOAB","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:73adc62ddeb654533c6278ddf901b689afa8193e0b8d95f2cda02945c23a65ac","target":"graph","created_at":"2026-05-18T03:31:33Z","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":"A community within a network is a group of vertices densely connected to each other but less connected to the vertices outside. The problem of detecting communities in large networks plays a key role in a wide range of research areas, e.g. Computer Science, Biology and Sociology. Most of the existing algorithms to find communities count on the topological features of the network and often do not scale well on large, real-life instances.\n  In this article we propose a strategy to enhance existing community detection algorithms by adding a pre-processing step in which edges are weighted accordin","authors_text":"Alessandro Provetti, Emilio Ferrara, Giacomo Fiumara, Pasquale De Meo","cross_cats":["cs.DS","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-07T16:43:30Z","title":"Enhancing community detection using a network weighting strategy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1741","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:ebd3fa2e545718167371fc0eaf37ab7ba2c22703771a1afb6952826b9fe0d120","target":"record","created_at":"2026-05-18T03:31:33Z","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":"04c423327341299d0c02ae18826e879b02cf5bae7fd06925dcf2552a36fac2e0","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-03-07T16:43:30Z","title_canon_sha256":"479af6967999e9e165614c88499729daf16436b0c96a42a0c3df05120fd7d3db"},"schema_version":"1.0","source":{"id":"1303.1741","kind":"arxiv","version":1}},"canonical_sha256":"e79cb33801c28557c62ed38c212ce1f8d03a97da11ffc2172f4781a5ebb9ca18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e79cb33801c28557c62ed38c212ce1f8d03a97da11ffc2172f4781a5ebb9ca18","first_computed_at":"2026-05-18T03:31:33.258537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:33.258537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xb1VTSAveSFe8QoMUqnU888rEirbo+9+erOtLWNhuCKwc/XSnkSCbZz2mVELxlNFNWTklBCvfuER6gGwuPtdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:33.259104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebd3fa2e545718167371fc0eaf37ab7ba2c22703771a1afb6952826b9fe0d120","sha256:73adc62ddeb654533c6278ddf901b689afa8193e0b8d95f2cda02945c23a65ac"],"state_sha256":"ff50848064cd9c5c5b6607a36163a1af69dcac19094caae6b65a569d445de349"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUevzkagkmXCPsSypcziEq6HeuTaStwW0UiXjH9JFJOReIjT1ISgo/owDwMH3Y2O8iUnIUTDPVjbaeEQuG0CDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:20:39.582582Z","bundle_sha256":"aa575929cabf2f3f73427d90939a9befe0c8c341a8a3d9f492c1e6533c066091"}}