{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ER3UJ3QCLBV264NQX6CN526VUT","short_pith_number":"pith:ER3UJ3QC","canonical_record":{"source":{"id":"1410.1972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-10-08T03:15:03Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6bffbb43d695cd2cd4c50cc28ab1fec565583ebeda982cab565683fa113ebca4","abstract_canon_sha256":"0d2e645b8dfb168000ed95c50416d85d7fa7cd73af45849ed540d0b3211dd3c1"},"schema_version":"1.0"},"canonical_sha256":"247744ee02586baf71b0bf84deebd5a4d2992249f438284177592b0c88674d86","source":{"kind":"arxiv","id":"1410.1972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1972","created_at":"2026-05-18T01:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1972v1","created_at":"2026-05-18T01:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1972","created_at":"2026-05-18T01:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"ER3UJ3QCLBV2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ER3UJ3QCLBV264NQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ER3UJ3QC","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ER3UJ3QCLBV264NQX6CN526VUT","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-10-08T03:15:03Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6bffbb43d695cd2cd4c50cc28ab1fec565583ebeda982cab565683fa113ebca4","abstract_canon_sha256":"0d2e645b8dfb168000ed95c50416d85d7fa7cd73af45849ed540d0b3211dd3c1"},"schema_version":"1.0"},"canonical_sha256":"247744ee02586baf71b0bf84deebd5a4d2992249f438284177592b0c88674d86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:50.109579Z","signature_b64":"rzOL24ClG0o3GMDYKgeaOYfiZL6EaMKjSGPenHeCpFqA4Uh/alFJ9S6huCTS/xssX331SR/4Rn2xW5jqvk3DDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"247744ee02586baf71b0bf84deebd5a4d2992249f438284177592b0c88674d86","last_reissued_at":"2026-05-18T01:41:50.108974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:50.108974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1972","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-18T01:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/cjYA0sI25ziZVyFViUdBMldXM/g4srPNwML/2bECrwphlXdc/Al4obI4IPn59M88q6Vno6eBmRhTY+gpDEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:46:25.242568Z"},"content_sha256":"23f79255698072ec010cb52c9b19439a1838fb037ce4d44de4236b62aa610524","schema_version":"1.0","event_id":"sha256:23f79255698072ec010cb52c9b19439a1838fb037ce4d44de4236b62aa610524"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ER3UJ3QCLBV264NQX6CN526VUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifying effective multiple spreaders by coloring complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Bin Huang, Duan-Bing Chen, Hai-Feng Zhang, Ming Tang, Xiang-Yu Zhao","submitted_at":"2014-10-08T03:15:03Z","abstract_excerpt":"How to identify influential nodes in social networks is of theoretical significance, which relates to how to prevent epidemic spreading or cascading failure, how to accelerate information diffusion, and so on. In this Letter, we make an attempt to find \\emph{effective multiple spreaders} in complex networks by generalizing the idea of the coloring problem in graph theory to complex networks. In our method, each node in a network is colored by one kind of color and nodes with the same color are sorted into an independent set. Then, for a given centrality index, the nodes with the highest centra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1972","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-18T01:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14/h6H7vctaAs2iEX1jXyZUj00EUBgQluMiQ5YkAjfx68B0Z7ASftfL2XQwTia8hASsCM9QjSJn5yJtK+ylNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:46:25.243190Z"},"content_sha256":"ad2cd924e18e25c668303aba1de38f0b515f75e81fd6d374ca14c4bcde44cd24","schema_version":"1.0","event_id":"sha256:ad2cd924e18e25c668303aba1de38f0b515f75e81fd6d374ca14c4bcde44cd24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ER3UJ3QCLBV264NQX6CN526VUT/bundle.json","state_url":"https://pith.science/pith/ER3UJ3QCLBV264NQX6CN526VUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ER3UJ3QCLBV264NQX6CN526VUT/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-05-27T01:46:25Z","links":{"resolver":"https://pith.science/pith/ER3UJ3QCLBV264NQX6CN526VUT","bundle":"https://pith.science/pith/ER3UJ3QCLBV264NQX6CN526VUT/bundle.json","state":"https://pith.science/pith/ER3UJ3QCLBV264NQX6CN526VUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ER3UJ3QCLBV264NQX6CN526VUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ER3UJ3QCLBV264NQX6CN526VUT","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":"0d2e645b8dfb168000ed95c50416d85d7fa7cd73af45849ed540d0b3211dd3c1","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-10-08T03:15:03Z","title_canon_sha256":"6bffbb43d695cd2cd4c50cc28ab1fec565583ebeda982cab565683fa113ebca4"},"schema_version":"1.0","source":{"id":"1410.1972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1972","created_at":"2026-05-18T01:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1972v1","created_at":"2026-05-18T01:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1972","created_at":"2026-05-18T01:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"ER3UJ3QCLBV2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ER3UJ3QCLBV264NQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ER3UJ3QC","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:ad2cd924e18e25c668303aba1de38f0b515f75e81fd6d374ca14c4bcde44cd24","target":"graph","created_at":"2026-05-18T01:41:50Z","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":"How to identify influential nodes in social networks is of theoretical significance, which relates to how to prevent epidemic spreading or cascading failure, how to accelerate information diffusion, and so on. In this Letter, we make an attempt to find \\emph{effective multiple spreaders} in complex networks by generalizing the idea of the coloring problem in graph theory to complex networks. In our method, each node in a network is colored by one kind of color and nodes with the same color are sorted into an independent set. Then, for a given centrality index, the nodes with the highest centra","authors_text":"Bin Huang, Duan-Bing Chen, Hai-Feng Zhang, Ming Tang, Xiang-Yu Zhao","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-10-08T03:15:03Z","title":"Identifying effective multiple spreaders by coloring complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1972","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:23f79255698072ec010cb52c9b19439a1838fb037ce4d44de4236b62aa610524","target":"record","created_at":"2026-05-18T01:41:50Z","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":"0d2e645b8dfb168000ed95c50416d85d7fa7cd73af45849ed540d0b3211dd3c1","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-10-08T03:15:03Z","title_canon_sha256":"6bffbb43d695cd2cd4c50cc28ab1fec565583ebeda982cab565683fa113ebca4"},"schema_version":"1.0","source":{"id":"1410.1972","kind":"arxiv","version":1}},"canonical_sha256":"247744ee02586baf71b0bf84deebd5a4d2992249f438284177592b0c88674d86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"247744ee02586baf71b0bf84deebd5a4d2992249f438284177592b0c88674d86","first_computed_at":"2026-05-18T01:41:50.108974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:50.108974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rzOL24ClG0o3GMDYKgeaOYfiZL6EaMKjSGPenHeCpFqA4Uh/alFJ9S6huCTS/xssX331SR/4Rn2xW5jqvk3DDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:50.109579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23f79255698072ec010cb52c9b19439a1838fb037ce4d44de4236b62aa610524","sha256:ad2cd924e18e25c668303aba1de38f0b515f75e81fd6d374ca14c4bcde44cd24"],"state_sha256":"eab6e6c5a02815aaa4aaddb804ca5ee3e919cfa723c24825abae9e6de268d35b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IymFlR1kVN5590MuHdbNFQI6cfAeYxlaP52LDtmCLqCpiSsxMhy2GMbPeg9aM7JtVze9YTuimk58BqQ7JLUhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:46:25.246708Z","bundle_sha256":"c34dd414141c7eb94cdf0a468d86697f31d3bef09e7cf72db07ee037b8bbf609"}}