{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PJHMJVMWGZFK2A7GF2VFG3YIDC","short_pith_number":"pith:PJHMJVMW","schema_version":"1.0","canonical_sha256":"7a4ec4d596364aad03e62eaa536f0818af369eedf6a8559dbe0985555c2309d4","source":{"kind":"arxiv","id":"1604.00491","version":1},"attestation_state":"computed","paper":{"title":"Communities unfolding in multislice networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Alessandro Longheu, Giuseppe Mangioni, Michele Malgeri, Vincenza Carchiolo","submitted_at":"2016-04-02T11:54:23Z","abstract_excerpt":"Discovering communities in complex networks helps to understand the behaviour of the network. Some works in this promising research area exist, but communities uncovering in time-dependent and/or multiplex networks has not deeply investigated yet. In this paper, we propose a communities detection approach for multislice networks based on modularity optimization. We first present a method to reduce the network size that still preserves modularity. Then we introduce an algorithm that approximates modularity optimization (as usually adopted) for multislice networks, thus finding communities. The "},"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":"1604.00491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-04-02T11:54:23Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"2d29f8c898326fb9dd4ee65035f0d354e96459fb85da915e6a939c43aedee81e","abstract_canon_sha256":"14857f2cfea51d27152757d492be85475c971ef654659d78de8a4df1f8a9b87a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:49.495926Z","signature_b64":"BnwUEsO/G5S36k1Vdzh0CBC9mnyFfMOr8YY2yYpdiYaYLfWouk+0+AZ7CVYlivZLSSot1USTshoDgJTCpp/FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a4ec4d596364aad03e62eaa536f0818af369eedf6a8559dbe0985555c2309d4","last_reissued_at":"2026-05-18T01:17:49.495238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:49.495238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communities unfolding in multislice networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Alessandro Longheu, Giuseppe Mangioni, Michele Malgeri, Vincenza Carchiolo","submitted_at":"2016-04-02T11:54:23Z","abstract_excerpt":"Discovering communities in complex networks helps to understand the behaviour of the network. Some works in this promising research area exist, but communities uncovering in time-dependent and/or multiplex networks has not deeply investigated yet. In this paper, we propose a communities detection approach for multislice networks based on modularity optimization. We first present a method to reduce the network size that still preserves modularity. Then we introduce an algorithm that approximates modularity optimization (as usually adopted) for multislice networks, thus finding communities. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00491","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":"1604.00491","created_at":"2026-05-18T01:17:49.495333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00491v1","created_at":"2026-05-18T01:17:49.495333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00491","created_at":"2026-05-18T01:17:49.495333+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJHMJVMWGZFK","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJHMJVMWGZFK2A7G","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJHMJVMW","created_at":"2026-05-18T12:30:39.010887+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/PJHMJVMWGZFK2A7GF2VFG3YIDC","json":"https://pith.science/pith/PJHMJVMWGZFK2A7GF2VFG3YIDC.json","graph_json":"https://pith.science/api/pith-number/PJHMJVMWGZFK2A7GF2VFG3YIDC/graph.json","events_json":"https://pith.science/api/pith-number/PJHMJVMWGZFK2A7GF2VFG3YIDC/events.json","paper":"https://pith.science/paper/PJHMJVMW"},"agent_actions":{"view_html":"https://pith.science/pith/PJHMJVMWGZFK2A7GF2VFG3YIDC","download_json":"https://pith.science/pith/PJHMJVMWGZFK2A7GF2VFG3YIDC.json","view_paper":"https://pith.science/paper/PJHMJVMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00491&json=true","fetch_graph":"https://pith.science/api/pith-number/PJHMJVMWGZFK2A7GF2VFG3YIDC/graph.json","fetch_events":"https://pith.science/api/pith-number/PJHMJVMWGZFK2A7GF2VFG3YIDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJHMJVMWGZFK2A7GF2VFG3YIDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJHMJVMWGZFK2A7GF2VFG3YIDC/action/storage_attestation","attest_author":"https://pith.science/pith/PJHMJVMWGZFK2A7GF2VFG3YIDC/action/author_attestation","sign_citation":"https://pith.science/pith/PJHMJVMWGZFK2A7GF2VFG3YIDC/action/citation_signature","submit_replication":"https://pith.science/pith/PJHMJVMWGZFK2A7GF2VFG3YIDC/action/replication_record"}},"created_at":"2026-05-18T01:17:49.495333+00:00","updated_at":"2026-05-18T01:17:49.495333+00:00"}