{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KZTGAAPNNMOTRNVQMTTD3HRDN6","short_pith_number":"pith:KZTGAAPN","schema_version":"1.0","canonical_sha256":"56666001ed6b1d38b6b064e63d9e236fb974a8d78c959b1b603252c084314c7b","source":{"kind":"arxiv","id":"1701.00568","version":1},"attestation_state":"computed","paper":{"title":"Versatility of nodal affiliation to communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","q-bio.QM"],"primary_cat":"physics.soc-ph","authors_text":"Edward Bullmore, Franti\\v{s}ek V\\'a\\v{s}a, Jakob Seidlitz, Maxwell Shinn, Petra E. V\\'ertes, Rafael Romero-Garcia","submitted_at":"2017-01-03T02:39:21Z","abstract_excerpt":"Graph theoretical analysis of the community structure of networks attempts to identify the communities (or modules) to which each node affiliates. However, this is in most cases an ill-posed problem, as the affiliation of a node to a single community is often ambiguous. Previous solutions have attempted to identify all of the communities to which each node affiliates. Instead of taking this approach, we introduce versatility, $V$, as a novel metric of nodal affiliation: $V \\sim 0$ means that a node is consistently assigned to a specific community; $V \\gg 0$ means it is inconsistently assigned "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.00568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-01-03T02:39:21Z","cross_cats_sorted":["cs.SI","q-bio.QM"],"title_canon_sha256":"2cd27b99ecc631facb53986e9055d069a0ef94f73b5becc58fd90c1396eb75f8","abstract_canon_sha256":"c1070cec544efa8f35f1618678bea048cae595993ed53f29e3c34512e5675449"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:37.730422Z","signature_b64":"gcK5b+1RBrRZnf5dJhf9cptOJ2bGs3T2lzIU4oxYN/Bpoeq5ZUeWBkoUcCb9suFkKY2EElV3UClkIY3EaUnPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56666001ed6b1d38b6b064e63d9e236fb974a8d78c959b1b603252c084314c7b","last_reissued_at":"2026-05-18T00:41:37.729775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:37.729775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Versatility of nodal affiliation to communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","q-bio.QM"],"primary_cat":"physics.soc-ph","authors_text":"Edward Bullmore, Franti\\v{s}ek V\\'a\\v{s}a, Jakob Seidlitz, Maxwell Shinn, Petra E. V\\'ertes, Rafael Romero-Garcia","submitted_at":"2017-01-03T02:39:21Z","abstract_excerpt":"Graph theoretical analysis of the community structure of networks attempts to identify the communities (or modules) to which each node affiliates. However, this is in most cases an ill-posed problem, as the affiliation of a node to a single community is often ambiguous. Previous solutions have attempted to identify all of the communities to which each node affiliates. Instead of taking this approach, we introduce versatility, $V$, as a novel metric of nodal affiliation: $V \\sim 0$ means that a node is consistently assigned to a specific community; $V \\gg 0$ means it is inconsistently assigned "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00568","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.00568","created_at":"2026-05-18T00:41:37.729859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00568v1","created_at":"2026-05-18T00:41:37.729859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00568","created_at":"2026-05-18T00:41:37.729859+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZTGAAPNNMOT","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZTGAAPNNMOTRNVQ","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZTGAAPN","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6","json":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6.json","graph_json":"https://pith.science/api/pith-number/KZTGAAPNNMOTRNVQMTTD3HRDN6/graph.json","events_json":"https://pith.science/api/pith-number/KZTGAAPNNMOTRNVQMTTD3HRDN6/events.json","paper":"https://pith.science/paper/KZTGAAPN"},"agent_actions":{"view_html":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6","download_json":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6.json","view_paper":"https://pith.science/paper/KZTGAAPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00568&json=true","fetch_graph":"https://pith.science/api/pith-number/KZTGAAPNNMOTRNVQMTTD3HRDN6/graph.json","fetch_events":"https://pith.science/api/pith-number/KZTGAAPNNMOTRNVQMTTD3HRDN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6/action/storage_attestation","attest_author":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6/action/author_attestation","sign_citation":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6/action/citation_signature","submit_replication":"https://pith.science/pith/KZTGAAPNNMOTRNVQMTTD3HRDN6/action/replication_record"}},"created_at":"2026-05-18T00:41:37.729859+00:00","updated_at":"2026-05-18T00:41:37.729859+00:00"}