{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D7SAY5T54ET7O4FAHTNPQ3DQ56","short_pith_number":"pith:D7SAY5T5","schema_version":"1.0","canonical_sha256":"1fe40c767de127f770a03cdaf86c70efaac1269f27a28dba02cb9409033116c2","source":{"kind":"arxiv","id":"1303.2221","version":1},"attestation_state":"computed","paper":{"title":"Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Nikolai Nefedov, Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong","submitted_at":"2013-03-09T15:31:48Z","abstract_excerpt":"Relationships between entities in datasets are often of multiple nature, like geographical distance, social relationships, or common interests among people in a social network, for example. This information can naturally be modeled by a set of weighted and undirected graphs that form a global multilayer graph, where the common vertex set represents the entities and the edges on different layers capture the similarities of the entities in term of the different modalities. In this paper, we address the problem of analyzing multi-layer graphs and propose methods for clustering the vertices by eff"},"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":"1303.2221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-09T15:31:48Z","cross_cats_sorted":["cs.CV","cs.SI","stat.ML"],"title_canon_sha256":"ed674b55328f59c6f3217a1419fd18a7e5f904e9d3c42999c738607d945d5d34","abstract_canon_sha256":"29fbe0ce6eb101bcdae2ea1dec62922aa7c9a85b1012eb9cf04cf1e24250b533"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:40.136111Z","signature_b64":"lZBXXQrMCF+8ZiLt+2ckY7uTIzsEM1OFnyblnaig6O28Jck8cUHrx4FIlhX+viBbvAIF2XEi089E+lL3hriCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fe40c767de127f770a03cdaf86c70efaac1269f27a28dba02cb9409033116c2","last_reissued_at":"2026-05-18T01:34:40.135213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:40.135213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Nikolai Nefedov, Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong","submitted_at":"2013-03-09T15:31:48Z","abstract_excerpt":"Relationships between entities in datasets are often of multiple nature, like geographical distance, social relationships, or common interests among people in a social network, for example. This information can naturally be modeled by a set of weighted and undirected graphs that form a global multilayer graph, where the common vertex set represents the entities and the edges on different layers capture the similarities of the entities in term of the different modalities. In this paper, we address the problem of analyzing multi-layer graphs and propose methods for clustering the vertices by eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2221","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":"1303.2221","created_at":"2026-05-18T01:34:40.135372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2221v1","created_at":"2026-05-18T01:34:40.135372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2221","created_at":"2026-05-18T01:34:40.135372+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7SAY5T54ET7","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7SAY5T54ET7O4FA","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7SAY5T5","created_at":"2026-05-18T12:27:40.988391+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/D7SAY5T54ET7O4FAHTNPQ3DQ56","json":"https://pith.science/pith/D7SAY5T54ET7O4FAHTNPQ3DQ56.json","graph_json":"https://pith.science/api/pith-number/D7SAY5T54ET7O4FAHTNPQ3DQ56/graph.json","events_json":"https://pith.science/api/pith-number/D7SAY5T54ET7O4FAHTNPQ3DQ56/events.json","paper":"https://pith.science/paper/D7SAY5T5"},"agent_actions":{"view_html":"https://pith.science/pith/D7SAY5T54ET7O4FAHTNPQ3DQ56","download_json":"https://pith.science/pith/D7SAY5T54ET7O4FAHTNPQ3DQ56.json","view_paper":"https://pith.science/paper/D7SAY5T5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2221&json=true","fetch_graph":"https://pith.science/api/pith-number/D7SAY5T54ET7O4FAHTNPQ3DQ56/graph.json","fetch_events":"https://pith.science/api/pith-number/D7SAY5T54ET7O4FAHTNPQ3DQ56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7SAY5T54ET7O4FAHTNPQ3DQ56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7SAY5T54ET7O4FAHTNPQ3DQ56/action/storage_attestation","attest_author":"https://pith.science/pith/D7SAY5T54ET7O4FAHTNPQ3DQ56/action/author_attestation","sign_citation":"https://pith.science/pith/D7SAY5T54ET7O4FAHTNPQ3DQ56/action/citation_signature","submit_replication":"https://pith.science/pith/D7SAY5T54ET7O4FAHTNPQ3DQ56/action/replication_record"}},"created_at":"2026-05-18T01:34:40.135372+00:00","updated_at":"2026-05-18T01:34:40.135372+00:00"}