{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YR2S4RVG354ZA2NNYBOFKSSEAE","short_pith_number":"pith:YR2S4RVG","schema_version":"1.0","canonical_sha256":"c4752e46a6df799069adc05c554a440113b9581c4deddedcf10d99a6fdc27115","source":{"kind":"arxiv","id":"1705.04254","version":1},"attestation_state":"computed","paper":{"title":"Community Detection in Signed Networks: an Error-Correcting Code Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Cheng-Shang Chang, Duan-Shin Lee, Li-Heng Liou, Sheng-Min Lu","submitted_at":"2017-05-11T16:00:14Z","abstract_excerpt":"In this paper, we consider the community detection problem in signed networks, where there are two types of edges: positive edges (friends) and negative edges (enemies). One renowned theorem of signed networks, known as Harary's theorem, states that structurally balanced signed networks are clusterable. By viewing each cycle in a signed network as a parity-check constraint, we show that the community detection problem in a signed network with two communities is equivalent to the decoding problem for a parity-check code. We also show how one can use two renowned decoding algorithms in error- co"},"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":"1705.04254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-11T16:00:14Z","cross_cats_sorted":[],"title_canon_sha256":"9393a0a11d74b61d8c444be9f712371e89909e0b2aa5bbc9830915880c7746f2","abstract_canon_sha256":"103572bdbecb45d7520fefd7e0cd116d128a2ca48319a7843d659285e14cf213"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:39.382951Z","signature_b64":"ymw5zl4fplKaZUvXpzPYAHjNMqseitEPCX9Fkq67Ks+QoUAmFb1d/YWYp0AXtJVs4RA2PFNHbMobie81e7rLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4752e46a6df799069adc05c554a440113b9581c4deddedcf10d99a6fdc27115","last_reissued_at":"2026-05-18T00:44:39.382548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:39.382548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection in Signed Networks: an Error-Correcting Code Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Cheng-Shang Chang, Duan-Shin Lee, Li-Heng Liou, Sheng-Min Lu","submitted_at":"2017-05-11T16:00:14Z","abstract_excerpt":"In this paper, we consider the community detection problem in signed networks, where there are two types of edges: positive edges (friends) and negative edges (enemies). One renowned theorem of signed networks, known as Harary's theorem, states that structurally balanced signed networks are clusterable. By viewing each cycle in a signed network as a parity-check constraint, we show that the community detection problem in a signed network with two communities is equivalent to the decoding problem for a parity-check code. We also show how one can use two renowned decoding algorithms in error- co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04254","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":"1705.04254","created_at":"2026-05-18T00:44:39.382610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04254v1","created_at":"2026-05-18T00:44:39.382610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04254","created_at":"2026-05-18T00:44:39.382610+00:00"},{"alias_kind":"pith_short_12","alias_value":"YR2S4RVG354Z","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YR2S4RVG354ZA2NN","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YR2S4RVG","created_at":"2026-05-18T12:31:56.362134+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/YR2S4RVG354ZA2NNYBOFKSSEAE","json":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE.json","graph_json":"https://pith.science/api/pith-number/YR2S4RVG354ZA2NNYBOFKSSEAE/graph.json","events_json":"https://pith.science/api/pith-number/YR2S4RVG354ZA2NNYBOFKSSEAE/events.json","paper":"https://pith.science/paper/YR2S4RVG"},"agent_actions":{"view_html":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE","download_json":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE.json","view_paper":"https://pith.science/paper/YR2S4RVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04254&json=true","fetch_graph":"https://pith.science/api/pith-number/YR2S4RVG354ZA2NNYBOFKSSEAE/graph.json","fetch_events":"https://pith.science/api/pith-number/YR2S4RVG354ZA2NNYBOFKSSEAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/action/storage_attestation","attest_author":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/action/author_attestation","sign_citation":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/action/citation_signature","submit_replication":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/action/replication_record"}},"created_at":"2026-05-18T00:44:39.382610+00:00","updated_at":"2026-05-18T00:44:39.382610+00:00"}