{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OD36BENVBLK4RNNLDVSIG2EOPH","short_pith_number":"pith:OD36BENV","schema_version":"1.0","canonical_sha256":"70f7e091b50ad5c8b5ab1d6483688e79e4133b226729e529550be09b182711dd","source":{"kind":"arxiv","id":"1904.08575","version":2},"attestation_state":"computed","paper":{"title":"SPONGE: A generalized eigenproblem for clustering signed networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Aldo Glielmo, Hemant Tyagi, Mihai Cucuringu, Peter Davies","submitted_at":"2019-04-18T02:55:22Z","abstract_excerpt":"We introduce a principled and theoretically sound spectral method for $k$-way clustering in signed graphs, where the affinity measure between nodes takes either positive or negative values. Our approach is motivated by social balance theory, where the task of clustering aims to decompose the network into disjoint groups, such that individuals within the same group are connected by as many positive edges as possible, while individuals from different groups are connected by as many negative edges as possible. Our algorithm relies on a generalized eigenproblem formulation inspired by recent work "},"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":"1904.08575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-18T02:55:22Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"e24120dbb708c56cc487ec8094ac43cc7f0bfcc6fd461df828a3ff8412afc554","abstract_canon_sha256":"2220fe8832b2a628d167a818806e0953f540778b24490af83a463699174acd08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:51.744413Z","signature_b64":"EuFWeL59MrDb9wkdgEPk1B9Y+7mBAjWcFBQl2PYlAllNFjuwUiI4AeHVim79vY1k3kyV+J09Syx4PqlDWkdVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70f7e091b50ad5c8b5ab1d6483688e79e4133b226729e529550be09b182711dd","last_reissued_at":"2026-05-17T23:45:51.744003Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:51.744003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPONGE: A generalized eigenproblem for clustering signed networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Aldo Glielmo, Hemant Tyagi, Mihai Cucuringu, Peter Davies","submitted_at":"2019-04-18T02:55:22Z","abstract_excerpt":"We introduce a principled and theoretically sound spectral method for $k$-way clustering in signed graphs, where the affinity measure between nodes takes either positive or negative values. Our approach is motivated by social balance theory, where the task of clustering aims to decompose the network into disjoint groups, such that individuals within the same group are connected by as many positive edges as possible, while individuals from different groups are connected by as many negative edges as possible. Our algorithm relies on a generalized eigenproblem formulation inspired by recent work "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08575","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":"1904.08575","created_at":"2026-05-17T23:45:51.744067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08575v2","created_at":"2026-05-17T23:45:51.744067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08575","created_at":"2026-05-17T23:45:51.744067+00:00"},{"alias_kind":"pith_short_12","alias_value":"OD36BENVBLK4","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OD36BENVBLK4RNNL","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OD36BENV","created_at":"2026-05-18T12:33:24.271573+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/OD36BENVBLK4RNNLDVSIG2EOPH","json":"https://pith.science/pith/OD36BENVBLK4RNNLDVSIG2EOPH.json","graph_json":"https://pith.science/api/pith-number/OD36BENVBLK4RNNLDVSIG2EOPH/graph.json","events_json":"https://pith.science/api/pith-number/OD36BENVBLK4RNNLDVSIG2EOPH/events.json","paper":"https://pith.science/paper/OD36BENV"},"agent_actions":{"view_html":"https://pith.science/pith/OD36BENVBLK4RNNLDVSIG2EOPH","download_json":"https://pith.science/pith/OD36BENVBLK4RNNLDVSIG2EOPH.json","view_paper":"https://pith.science/paper/OD36BENV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08575&json=true","fetch_graph":"https://pith.science/api/pith-number/OD36BENVBLK4RNNLDVSIG2EOPH/graph.json","fetch_events":"https://pith.science/api/pith-number/OD36BENVBLK4RNNLDVSIG2EOPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OD36BENVBLK4RNNLDVSIG2EOPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OD36BENVBLK4RNNLDVSIG2EOPH/action/storage_attestation","attest_author":"https://pith.science/pith/OD36BENVBLK4RNNLDVSIG2EOPH/action/author_attestation","sign_citation":"https://pith.science/pith/OD36BENVBLK4RNNLDVSIG2EOPH/action/citation_signature","submit_replication":"https://pith.science/pith/OD36BENVBLK4RNNLDVSIG2EOPH/action/replication_record"}},"created_at":"2026-05-17T23:45:51.744067+00:00","updated_at":"2026-05-17T23:45:51.744067+00:00"}