{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MOTECW2SQAEYBIW5XJ2CNXRNMR","short_pith_number":"pith:MOTECW2S","canonical_record":{"source":{"id":"1402.6508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-26T12:10:33Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"4d4487020313a8ad947c6e914986bf71aebcd78673f1a67d413fa284d0cdac86","abstract_canon_sha256":"b6b2d19069af76ad17c4fb63ab70d05b6c33bb431fc4e6fa5304cff8707cd7fc"},"schema_version":"1.0"},"canonical_sha256":"63a6415b52800980a2ddba7426de2d646f132d962e8231bd4e3dee0a04917f32","source":{"kind":"arxiv","id":"1402.6508","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6508","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6508v2","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6508","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"MOTECW2SQAEY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MOTECW2SQAEYBIW5","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MOTECW2S","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MOTECW2SQAEYBIW5XJ2CNXRNMR","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-26T12:10:33Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"4d4487020313a8ad947c6e914986bf71aebcd78673f1a67d413fa284d0cdac86","abstract_canon_sha256":"b6b2d19069af76ad17c4fb63ab70d05b6c33bb431fc4e6fa5304cff8707cd7fc"},"schema_version":"1.0"},"canonical_sha256":"63a6415b52800980a2ddba7426de2d646f132d962e8231bd4e3dee0a04917f32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:43.101990Z","signature_b64":"qOiPjStVMvlq6mKPqbaH5ntAKDW76Pq6csfnE/nKZPzKjaZeJLU67Quru0KTEbfU1SBnY+cyEG+G/m0H+42sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63a6415b52800980a2ddba7426de2d646f132d962e8231bd4e3dee0a04917f32","last_reissued_at":"2026-05-18T02:57:43.101397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:43.101397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6508","source_version":2,"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-18T02:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IvT2PAB1fD+v/GrEIMWq9R0X23liFJEij6Lf19qLPHRE5Nhmdd9ULb/vLlguKHWkisuMHdHrhXRlDSdbcrS+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:37:13.086080Z"},"content_sha256":"1357adc48aef921a30f1e0881ec644304ec6fa259e7a5fdb806f0fccacd2e64d","schema_version":"1.0","event_id":"sha256:1357adc48aef921a30f1e0881ec644304ec6fa259e7a5fdb806f0fccacd2e64d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MOTECW2SQAEYBIW5XJ2CNXRNMR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Considerations about multistep community detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Angelo Corallo, Antonio A. Gentile, Cristian Bisconti, Laura Fortunato","submitted_at":"2014-02-26T12:10:33Z","abstract_excerpt":"The problem and implications of community detection in networks have raised a huge attention, for its important applications in both natural and social sciences. A number of algorithms has been developed to solve this problem, addressing either speed optimization or the quality of the partitions calculated. In this paper we propose a multi-step procedure bridging the fastest, but less accurate algorithms (coarse clustering), with the slowest, most effective ones (refinement). By adopting heuristic ranking of the nodes, and classifying a fraction of them as `critical', a refinement step can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6508","kind":"arxiv","version":2},"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-18T02:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ac/tyRbFFksPvnXHUXv0BCS8gxkkeUbdmvvijOaSK/qXbhMlmx6gkdpsUnenJd7oVNhZcBvQa73HcjrT/cc2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:37:13.086561Z"},"content_sha256":"3e90dd22ca35657ada857e79ac6d41cfa8835478f9c6cb84ea55aab19298a766","schema_version":"1.0","event_id":"sha256:3e90dd22ca35657ada857e79ac6d41cfa8835478f9c6cb84ea55aab19298a766"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOTECW2SQAEYBIW5XJ2CNXRNMR/bundle.json","state_url":"https://pith.science/pith/MOTECW2SQAEYBIW5XJ2CNXRNMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOTECW2SQAEYBIW5XJ2CNXRNMR/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-24T20:37:13Z","links":{"resolver":"https://pith.science/pith/MOTECW2SQAEYBIW5XJ2CNXRNMR","bundle":"https://pith.science/pith/MOTECW2SQAEYBIW5XJ2CNXRNMR/bundle.json","state":"https://pith.science/pith/MOTECW2SQAEYBIW5XJ2CNXRNMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOTECW2SQAEYBIW5XJ2CNXRNMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MOTECW2SQAEYBIW5XJ2CNXRNMR","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":"b6b2d19069af76ad17c4fb63ab70d05b6c33bb431fc4e6fa5304cff8707cd7fc","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-26T12:10:33Z","title_canon_sha256":"4d4487020313a8ad947c6e914986bf71aebcd78673f1a67d413fa284d0cdac86"},"schema_version":"1.0","source":{"id":"1402.6508","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6508","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6508v2","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6508","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"MOTECW2SQAEY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MOTECW2SQAEYBIW5","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MOTECW2S","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:3e90dd22ca35657ada857e79ac6d41cfa8835478f9c6cb84ea55aab19298a766","target":"graph","created_at":"2026-05-18T02:57:43Z","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":"The problem and implications of community detection in networks have raised a huge attention, for its important applications in both natural and social sciences. A number of algorithms has been developed to solve this problem, addressing either speed optimization or the quality of the partitions calculated. In this paper we propose a multi-step procedure bridging the fastest, but less accurate algorithms (coarse clustering), with the slowest, most effective ones (refinement). By adopting heuristic ranking of the nodes, and classifying a fraction of them as `critical', a refinement step can be ","authors_text":"Angelo Corallo, Antonio A. Gentile, Cristian Bisconti, Laura Fortunato","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-26T12:10:33Z","title":"Considerations about multistep community detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6508","kind":"arxiv","version":2},"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:1357adc48aef921a30f1e0881ec644304ec6fa259e7a5fdb806f0fccacd2e64d","target":"record","created_at":"2026-05-18T02:57:43Z","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":"b6b2d19069af76ad17c4fb63ab70d05b6c33bb431fc4e6fa5304cff8707cd7fc","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-26T12:10:33Z","title_canon_sha256":"4d4487020313a8ad947c6e914986bf71aebcd78673f1a67d413fa284d0cdac86"},"schema_version":"1.0","source":{"id":"1402.6508","kind":"arxiv","version":2}},"canonical_sha256":"63a6415b52800980a2ddba7426de2d646f132d962e8231bd4e3dee0a04917f32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63a6415b52800980a2ddba7426de2d646f132d962e8231bd4e3dee0a04917f32","first_computed_at":"2026-05-18T02:57:43.101397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:43.101397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOiPjStVMvlq6mKPqbaH5ntAKDW76Pq6csfnE/nKZPzKjaZeJLU67Quru0KTEbfU1SBnY+cyEG+G/m0H+42sCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:43.101990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6508","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1357adc48aef921a30f1e0881ec644304ec6fa259e7a5fdb806f0fccacd2e64d","sha256:3e90dd22ca35657ada857e79ac6d41cfa8835478f9c6cb84ea55aab19298a766"],"state_sha256":"18125f9bfbf81a4fdb52009d60d0d2adbe11104e2d91a8e4238d182caf06b59a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F65c6T9BbDaE2lLw4AmztWTc+0mgjwbRqxYEFuie7DUd7+D6zG+8w4EEirSHSZMzy9XETtQbjSqX3ShEVaTHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:37:13.089127Z","bundle_sha256":"aa9448a196cb7d8add66dd9215a40c21fceec9f1738bf8f1dd09833acdf83ec2"}}