{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YR2S4RVG354ZA2NNYBOFKSSEAE","short_pith_number":"pith:YR2S4RVG","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"},"canonical_sha256":"c4752e46a6df799069adc05c554a440113b9581c4deddedcf10d99a6fdc27115","source":{"kind":"arxiv","id":"1705.04254","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04254","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04254v1","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04254","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"YR2S4RVG354Z","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YR2S4RVG354ZA2NN","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YR2S4RVG","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YR2S4RVG354ZA2NNYBOFKSSEAE","target":"record","payload":{"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"},"canonical_sha256":"c4752e46a6df799069adc05c554a440113b9581c4deddedcf10d99a6fdc27115","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"},"source_kind":"arxiv","source_id":"1705.04254","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fOgCk0u3z7q0a2QORgvvL5E6p230QXvXxCuo5fvg91WuSeiEdscC7tPtkmBhoCgn1009mrxQgoqOKqcbHuxBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:07.231859Z"},"content_sha256":"47c3ddb270fe84371bd7922e8edd3f0f3c865bbbcb2c8a924f4087e030610247","schema_version":"1.0","event_id":"sha256:47c3ddb270fe84371bd7922e8edd3f0f3c865bbbcb2c8a924f4087e030610247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YR2S4RVG354ZA2NNYBOFKSSEAE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7TPsi2qjgpXpP+Rpo4VC74XRtm/vnfBkYTb7AhI0Q9oWlxZosOTjtB1+CJ3uPxyW83JtBjV0jAsbXeF+B9BBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:07.232209Z"},"content_sha256":"c35056c24cc959018794abe806787b6e522653a163655c18d0bdf5d64c5ccbf5","schema_version":"1.0","event_id":"sha256:c35056c24cc959018794abe806787b6e522653a163655c18d0bdf5d64c5ccbf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/bundle.json","state_url":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T14:14:07Z","links":{"resolver":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE","bundle":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/bundle.json","state":"https://pith.science/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YR2S4RVG354ZA2NNYBOFKSSEAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YR2S4RVG354ZA2NNYBOFKSSEAE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"103572bdbecb45d7520fefd7e0cd116d128a2ca48319a7843d659285e14cf213","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-11T16:00:14Z","title_canon_sha256":"9393a0a11d74b61d8c444be9f712371e89909e0b2aa5bbc9830915880c7746f2"},"schema_version":"1.0","source":{"id":"1705.04254","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04254","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04254v1","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04254","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"YR2S4RVG354Z","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YR2S4RVG354ZA2NN","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YR2S4RVG","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:c35056c24cc959018794abe806787b6e522653a163655c18d0bdf5d64c5ccbf5","target":"graph","created_at":"2026-05-18T00:44:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cheng-Shang Chang, Duan-Shin Lee, Li-Heng Liou, Sheng-Min Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-11T16:00:14Z","title":"Community Detection in Signed Networks: an Error-Correcting Code Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04254","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:47c3ddb270fe84371bd7922e8edd3f0f3c865bbbcb2c8a924f4087e030610247","target":"record","created_at":"2026-05-18T00:44:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"103572bdbecb45d7520fefd7e0cd116d128a2ca48319a7843d659285e14cf213","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-11T16:00:14Z","title_canon_sha256":"9393a0a11d74b61d8c444be9f712371e89909e0b2aa5bbc9830915880c7746f2"},"schema_version":"1.0","source":{"id":"1705.04254","kind":"arxiv","version":1}},"canonical_sha256":"c4752e46a6df799069adc05c554a440113b9581c4deddedcf10d99a6fdc27115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4752e46a6df799069adc05c554a440113b9581c4deddedcf10d99a6fdc27115","first_computed_at":"2026-05-18T00:44:39.382548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:39.382548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ymw5zl4fplKaZUvXpzPYAHjNMqseitEPCX9Fkq67Ks+QoUAmFb1d/YWYp0AXtJVs4RA2PFNHbMobie81e7rLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:39.382951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04254","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47c3ddb270fe84371bd7922e8edd3f0f3c865bbbcb2c8a924f4087e030610247","sha256:c35056c24cc959018794abe806787b6e522653a163655c18d0bdf5d64c5ccbf5"],"state_sha256":"9a3dc0ff651c216bfd8cb9e284d412723cbd94cace0956669c56eb1a8c06abd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wMybBAdWDdUXvcs4tO85cG139yZm0ZLgHVNtufGf+cN9VFVauYGAApB9MIb+he59lG6V9nqsyu9fm+BqIE2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:14:07.234154Z","bundle_sha256":"aa52d4c035a4cb25ef9454d0456cf98abdbbe40b7b7981bf06f1d6b58567c331"}}