{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X7NJDOCYMJJX4XA6A74LPW5I3N","short_pith_number":"pith:X7NJDOCY","schema_version":"1.0","canonical_sha256":"bfda91b85862537e5c1e07f8b7dba8db6b863a1bcd5680f772e16ff6d1872b6a","source":{"kind":"arxiv","id":"1804.04566","version":2},"attestation_state":"computed","paper":{"title":"Latent Geometry Inspired Graph Dissimilarities Enhance Affinity Propagation Community Detection in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Muscoloni, Carlo Vittorio Cannistraci","submitted_at":"2018-04-12T15:23:39Z","abstract_excerpt":"Affinity propagation is one of the most effective unsupervised pattern recognition algorithms for data clustering in high-dimensional feature space. However, the numerous attempts to test its performance for community detection in complex networks have been attaining results very far from the state of the art methods such as Infomap and Louvain. Yet, all these studies agreed that the crucial problem is to convert the unweighted network topology in a 'smart-enough' node dissimilarity matrix that is able to properly address the message passing procedure behind affinity propagation clustering. He"},"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":"1804.04566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-12T15:23:39Z","cross_cats_sorted":["cs.SI","physics.soc-ph","stat.ML"],"title_canon_sha256":"cda79d397f4260aa0a580eca055ef321c9d4c0898a596073aabb0265ec8a67c4","abstract_canon_sha256":"bd20549e432020da9e0e8e082c7c35744d5c7d035c561a480b4f357b463348d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:56.084019Z","signature_b64":"cw8JDXVYmb1Qa3zB9ppszEc+jctf7+zhtJvA/0sf//FPTopfXHDM+EYk7qfsyycUyl3+37Y01VtylzGbDkK3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfda91b85862537e5c1e07f8b7dba8db6b863a1bcd5680f772e16ff6d1872b6a","last_reissued_at":"2026-05-18T00:06:56.083525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:56.083525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latent Geometry Inspired Graph Dissimilarities Enhance Affinity Propagation Community Detection in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Muscoloni, Carlo Vittorio Cannistraci","submitted_at":"2018-04-12T15:23:39Z","abstract_excerpt":"Affinity propagation is one of the most effective unsupervised pattern recognition algorithms for data clustering in high-dimensional feature space. However, the numerous attempts to test its performance for community detection in complex networks have been attaining results very far from the state of the art methods such as Infomap and Louvain. Yet, all these studies agreed that the crucial problem is to convert the unweighted network topology in a 'smart-enough' node dissimilarity matrix that is able to properly address the message passing procedure behind affinity propagation clustering. He"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04566","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.04566","created_at":"2026-05-18T00:06:56.083611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04566v2","created_at":"2026-05-18T00:06:56.083611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04566","created_at":"2026-05-18T00:06:56.083611+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7NJDOCYMJJX","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7NJDOCYMJJX4XA6","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7NJDOCY","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00025","citing_title":"Angular separability of data clusters or network communities in geometrical space and its relevance to hyperbolic embedding","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N","json":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N.json","graph_json":"https://pith.science/api/pith-number/X7NJDOCYMJJX4XA6A74LPW5I3N/graph.json","events_json":"https://pith.science/api/pith-number/X7NJDOCYMJJX4XA6A74LPW5I3N/events.json","paper":"https://pith.science/paper/X7NJDOCY"},"agent_actions":{"view_html":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N","download_json":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N.json","view_paper":"https://pith.science/paper/X7NJDOCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04566&json=true","fetch_graph":"https://pith.science/api/pith-number/X7NJDOCYMJJX4XA6A74LPW5I3N/graph.json","fetch_events":"https://pith.science/api/pith-number/X7NJDOCYMJJX4XA6A74LPW5I3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N/action/storage_attestation","attest_author":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N/action/author_attestation","sign_citation":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N/action/citation_signature","submit_replication":"https://pith.science/pith/X7NJDOCYMJJX4XA6A74LPW5I3N/action/replication_record"}},"created_at":"2026-05-18T00:06:56.083611+00:00","updated_at":"2026-05-18T00:06:56.083611+00:00"}