{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DLSMBIK3MJP2M5TQPC76RPNJSR","short_pith_number":"pith:DLSMBIK3","schema_version":"1.0","canonical_sha256":"1ae4c0a15b625fa6767078bfe8bda99451f1d7091d41264e8625e178a6a70699","source":{"kind":"arxiv","id":"1703.08590","version":2},"attestation_state":"computed","paper":{"title":"Efficiently Clustering Very Large Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri","submitted_at":"2017-03-24T20:32:42Z","abstract_excerpt":"Attributed graphs model real networks by enriching their nodes with attributes accounting for properties. Several techniques have been proposed for partitioning these graphs into clusters that are homogeneous with respect to both semantic attributes and to the structure of the graph. However, time and space complexities of state of the art algorithms limit their scalability to medium-sized graphs. We propose SToC (for Semantic-Topological Clustering), a fast and scalable algorithm for partitioning large attributed graphs. The approach is robust, being compatible both with categorical and with "},"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":"1703.08590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-24T20:32:42Z","cross_cats_sorted":["cs.DM","physics.soc-ph"],"title_canon_sha256":"85d96f8b32fd3bcea4a9103f62f2faba304040bf666abf226cfe3367665a5fd6","abstract_canon_sha256":"23601f205b5e9df911d0b0a4cd6fe0312573b1f6d4622722578a2df1e6ec0960"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:38.795684Z","signature_b64":"T0HBDpqF0Zg6SX5Uf8e2yKAlQw+s9iQCNWtTJVayJVh/1tM1BAIUMqaHcrNIQSmShvsLpQFIxz76W4KuFs6XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ae4c0a15b625fa6767078bfe8bda99451f1d7091d41264e8625e178a6a70699","last_reissued_at":"2026-05-18T00:36:38.795183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:38.795183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Clustering Very Large Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alessandro Baroni, Alessio Conte, Maurizio Patrignani, Salvatore Ruggieri","submitted_at":"2017-03-24T20:32:42Z","abstract_excerpt":"Attributed graphs model real networks by enriching their nodes with attributes accounting for properties. Several techniques have been proposed for partitioning these graphs into clusters that are homogeneous with respect to both semantic attributes and to the structure of the graph. However, time and space complexities of state of the art algorithms limit their scalability to medium-sized graphs. We propose SToC (for Semantic-Topological Clustering), a fast and scalable algorithm for partitioning large attributed graphs. The approach is robust, being compatible both with categorical and with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08590","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":"1703.08590","created_at":"2026-05-18T00:36:38.795262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08590v2","created_at":"2026-05-18T00:36:38.795262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08590","created_at":"2026-05-18T00:36:38.795262+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLSMBIK3MJP2","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLSMBIK3MJP2M5TQ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLSMBIK3","created_at":"2026-05-18T12:31:10.602751+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/DLSMBIK3MJP2M5TQPC76RPNJSR","json":"https://pith.science/pith/DLSMBIK3MJP2M5TQPC76RPNJSR.json","graph_json":"https://pith.science/api/pith-number/DLSMBIK3MJP2M5TQPC76RPNJSR/graph.json","events_json":"https://pith.science/api/pith-number/DLSMBIK3MJP2M5TQPC76RPNJSR/events.json","paper":"https://pith.science/paper/DLSMBIK3"},"agent_actions":{"view_html":"https://pith.science/pith/DLSMBIK3MJP2M5TQPC76RPNJSR","download_json":"https://pith.science/pith/DLSMBIK3MJP2M5TQPC76RPNJSR.json","view_paper":"https://pith.science/paper/DLSMBIK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08590&json=true","fetch_graph":"https://pith.science/api/pith-number/DLSMBIK3MJP2M5TQPC76RPNJSR/graph.json","fetch_events":"https://pith.science/api/pith-number/DLSMBIK3MJP2M5TQPC76RPNJSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLSMBIK3MJP2M5TQPC76RPNJSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLSMBIK3MJP2M5TQPC76RPNJSR/action/storage_attestation","attest_author":"https://pith.science/pith/DLSMBIK3MJP2M5TQPC76RPNJSR/action/author_attestation","sign_citation":"https://pith.science/pith/DLSMBIK3MJP2M5TQPC76RPNJSR/action/citation_signature","submit_replication":"https://pith.science/pith/DLSMBIK3MJP2M5TQPC76RPNJSR/action/replication_record"}},"created_at":"2026-05-18T00:36:38.795262+00:00","updated_at":"2026-05-18T00:36:38.795262+00:00"}