{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3YCTU5FOU6UIAUBXFAI7NBZINI","short_pith_number":"pith:3YCTU5FO","schema_version":"1.0","canonical_sha256":"de053a74aea7a88050372811f687286a24509dbad15ab33aba3b9846b0f63004","source":{"kind":"arxiv","id":"2405.00636","version":3},"attestation_state":"computed","paper":{"title":"Robustness of graph embedding methods for community detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Pablo Moriano, Ramakrishnan Kannan, Zhi-Feng Wei","submitted_at":"2024-05-01T17:04:20Z","abstract_excerpt":"This study investigates the robustness of graph embedding methods for community detection in the face of network perturbations, specifically edge deletions. Graph embedding techniques, which represent nodes as low-dimensional vectors, are widely used for various graph machine learning tasks due to their ability to capture structural properties of networks effectively. However, the impact of perturbations on the performance of these methods remains relatively understudied. The research considers state-of-the-art graph embedding methods from two families: matrix factorization (e.g., LE, LLE, HOP"},"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":"2405.00636","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2024-05-01T17:04:20Z","cross_cats_sorted":["cs.LG","cs.SI","physics.data-an"],"title_canon_sha256":"d5e20aac79cc2b1b0131b2ba06244dbdc5fc7eef0b2029fb48981f1c476108ed","abstract_canon_sha256":"be68d553a6577c5988e0bd59d06f0f610087e7671b5dbbbd8082cb237ec4302d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:11.687415Z","signature_b64":"h4rOAwqIiPBsAhHHTYT55AbUZcdRYXMW871gVSkZ0Y6BPBiCQtx4iDntbRELWvJlRW6ZPk5xlLPTF3G7fv4SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de053a74aea7a88050372811f687286a24509dbad15ab33aba3b9846b0f63004","last_reissued_at":"2026-07-05T11:47:11.686898Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:11.686898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness of graph embedding methods for community detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Pablo Moriano, Ramakrishnan Kannan, Zhi-Feng Wei","submitted_at":"2024-05-01T17:04:20Z","abstract_excerpt":"This study investigates the robustness of graph embedding methods for community detection in the face of network perturbations, specifically edge deletions. Graph embedding techniques, which represent nodes as low-dimensional vectors, are widely used for various graph machine learning tasks due to their ability to capture structural properties of networks effectively. However, the impact of perturbations on the performance of these methods remains relatively understudied. The research considers state-of-the-art graph embedding methods from two families: matrix factorization (e.g., LE, LLE, HOP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00636","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.00636/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.00636","created_at":"2026-07-05T11:47:11.686962+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.00636v3","created_at":"2026-07-05T11:47:11.686962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00636","created_at":"2026-07-05T11:47:11.686962+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YCTU5FOU6UI","created_at":"2026-07-05T11:47:11.686962+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YCTU5FOU6UIAUBX","created_at":"2026-07-05T11:47:11.686962+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YCTU5FO","created_at":"2026-07-05T11:47:11.686962+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.24662","citing_title":"Community detection robustness of graph neural networks","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI","json":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI.json","graph_json":"https://pith.science/api/pith-number/3YCTU5FOU6UIAUBXFAI7NBZINI/graph.json","events_json":"https://pith.science/api/pith-number/3YCTU5FOU6UIAUBXFAI7NBZINI/events.json","paper":"https://pith.science/paper/3YCTU5FO"},"agent_actions":{"view_html":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI","download_json":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI.json","view_paper":"https://pith.science/paper/3YCTU5FO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.00636&json=true","fetch_graph":"https://pith.science/api/pith-number/3YCTU5FOU6UIAUBXFAI7NBZINI/graph.json","fetch_events":"https://pith.science/api/pith-number/3YCTU5FOU6UIAUBXFAI7NBZINI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI/action/storage_attestation","attest_author":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI/action/author_attestation","sign_citation":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI/action/citation_signature","submit_replication":"https://pith.science/pith/3YCTU5FOU6UIAUBXFAI7NBZINI/action/replication_record"}},"created_at":"2026-07-05T11:47:11.686962+00:00","updated_at":"2026-07-05T11:47:11.686962+00:00"}