{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IUMSPF7QC5IOJ2R74CKTD3S762","short_pith_number":"pith:IUMSPF7Q","canonical_record":{"source":{"id":"1709.02767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-08T16:32:08Z","cross_cats_sorted":[],"title_canon_sha256":"fbe7409311c6a9aa112a0f9df11f4c1bae24f7060c740004e84403585b8aa339","abstract_canon_sha256":"a6961e4bf9956073acfede956463b1ed3a1f4c5b0e8f6ffb7a36c2312dabbbbd"},"schema_version":"1.0"},"canonical_sha256":"45192797f01750e4ea3fe09531ee5ff68b84b955f86a7ac464db8a1fddd21c98","source":{"kind":"arxiv","id":"1709.02767","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02767","created_at":"2026-05-18T00:19:26Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02767v2","created_at":"2026-05-18T00:19:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02767","created_at":"2026-05-18T00:19:26Z"},{"alias_kind":"pith_short_12","alias_value":"IUMSPF7QC5IO","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUMSPF7QC5IOJ2R7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUMSPF7Q","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IUMSPF7QC5IOJ2R74CKTD3S762","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-08T16:32:08Z","cross_cats_sorted":[],"title_canon_sha256":"fbe7409311c6a9aa112a0f9df11f4c1bae24f7060c740004e84403585b8aa339","abstract_canon_sha256":"a6961e4bf9956073acfede956463b1ed3a1f4c5b0e8f6ffb7a36c2312dabbbbd"},"schema_version":"1.0"},"canonical_sha256":"45192797f01750e4ea3fe09531ee5ff68b84b955f86a7ac464db8a1fddd21c98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:26.893846Z","signature_b64":"ZFbQdnPz4VsuMHTH8pdBWcN7mYlfkEtYGpwp5Ts+gl8knbxNPF0RZ5TVFf79gubhyN2FMLmiWoZul+JpVdK5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45192797f01750e4ea3fe09531ee5ff68b84b955f86a7ac464db8a1fddd21c98","last_reissued_at":"2026-05-18T00:19:26.893364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:26.893364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02767","source_version":2,"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:19:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swm+6t2sITQiDC06sku5uPYoEFViHILKw4ERb+ywewXZ6YsTVptScNIucK0XMfp4ETrl507SciVM1XO8ZYaKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:20:30.880747Z"},"content_sha256":"f9e4bd9057366a51f52e2ef4dca6acd618549fcff67d82f13bd13e2d14b834f0","schema_version":"1.0","event_id":"sha256:f9e4bd9057366a51f52e2ef4dca6acd618549fcff67d82f13bd13e2d14b834f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IUMSPF7QC5IOJ2R74CKTD3S762","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A cost-effective rumor-containing strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Cheng Pan, Lu-Xing Yang, Xiaofan Yang, Yingbo Wu, Yuan Yan Tang","submitted_at":"2017-09-08T16:32:08Z","abstract_excerpt":"This paper addresses the issue of suppressing a rumor using the truth in a cost-effective way. First, an individual-level dynamical model capturing the rumor-truth mixed spreading processes is proposed. On this basis, the cost-effective rumor-containing problem is modeled as an optimization problem. Extensive experiments show that finding a cost-effective rumor-containing strategy boils down to enhancing the first truth-spreading rate until the cost effectiveness of the rumor-containing strategy reaches the first turning point. This finding greatly reduces the time spent for solving the optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02767","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"},"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:19:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YnxNB06EgF+UqpLhmYM9N6+xBG8SMdxazJji7LoEoxO+WYOgxv2pD/nalx6IMO2+JDIXu/vV/XZ1wMroNszeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:20:30.881087Z"},"content_sha256":"70e841ca577e2e17c288b3e78068d25cffd00b92056910521fe410cb45883c61","schema_version":"1.0","event_id":"sha256:70e841ca577e2e17c288b3e78068d25cffd00b92056910521fe410cb45883c61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUMSPF7QC5IOJ2R74CKTD3S762/bundle.json","state_url":"https://pith.science/pith/IUMSPF7QC5IOJ2R74CKTD3S762/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUMSPF7QC5IOJ2R74CKTD3S762/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-01T08:20:30Z","links":{"resolver":"https://pith.science/pith/IUMSPF7QC5IOJ2R74CKTD3S762","bundle":"https://pith.science/pith/IUMSPF7QC5IOJ2R74CKTD3S762/bundle.json","state":"https://pith.science/pith/IUMSPF7QC5IOJ2R74CKTD3S762/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUMSPF7QC5IOJ2R74CKTD3S762/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IUMSPF7QC5IOJ2R74CKTD3S762","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":"a6961e4bf9956073acfede956463b1ed3a1f4c5b0e8f6ffb7a36c2312dabbbbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-08T16:32:08Z","title_canon_sha256":"fbe7409311c6a9aa112a0f9df11f4c1bae24f7060c740004e84403585b8aa339"},"schema_version":"1.0","source":{"id":"1709.02767","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02767","created_at":"2026-05-18T00:19:26Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02767v2","created_at":"2026-05-18T00:19:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02767","created_at":"2026-05-18T00:19:26Z"},{"alias_kind":"pith_short_12","alias_value":"IUMSPF7QC5IO","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUMSPF7QC5IOJ2R7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUMSPF7Q","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:70e841ca577e2e17c288b3e78068d25cffd00b92056910521fe410cb45883c61","target":"graph","created_at":"2026-05-18T00:19:26Z","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":"This paper addresses the issue of suppressing a rumor using the truth in a cost-effective way. First, an individual-level dynamical model capturing the rumor-truth mixed spreading processes is proposed. On this basis, the cost-effective rumor-containing problem is modeled as an optimization problem. Extensive experiments show that finding a cost-effective rumor-containing strategy boils down to enhancing the first truth-spreading rate until the cost effectiveness of the rumor-containing strategy reaches the first turning point. This finding greatly reduces the time spent for solving the optimi","authors_text":"Cheng Pan, Lu-Xing Yang, Xiaofan Yang, Yingbo Wu, Yuan Yan Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-08T16:32:08Z","title":"A cost-effective rumor-containing strategy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02767","kind":"arxiv","version":2},"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:f9e4bd9057366a51f52e2ef4dca6acd618549fcff67d82f13bd13e2d14b834f0","target":"record","created_at":"2026-05-18T00:19:26Z","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":"a6961e4bf9956073acfede956463b1ed3a1f4c5b0e8f6ffb7a36c2312dabbbbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-08T16:32:08Z","title_canon_sha256":"fbe7409311c6a9aa112a0f9df11f4c1bae24f7060c740004e84403585b8aa339"},"schema_version":"1.0","source":{"id":"1709.02767","kind":"arxiv","version":2}},"canonical_sha256":"45192797f01750e4ea3fe09531ee5ff68b84b955f86a7ac464db8a1fddd21c98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45192797f01750e4ea3fe09531ee5ff68b84b955f86a7ac464db8a1fddd21c98","first_computed_at":"2026-05-18T00:19:26.893364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:26.893364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZFbQdnPz4VsuMHTH8pdBWcN7mYlfkEtYGpwp5Ts+gl8knbxNPF0RZ5TVFf79gubhyN2FMLmiWoZul+JpVdK5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:26.893846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02767","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9e4bd9057366a51f52e2ef4dca6acd618549fcff67d82f13bd13e2d14b834f0","sha256:70e841ca577e2e17c288b3e78068d25cffd00b92056910521fe410cb45883c61"],"state_sha256":"bbd35361b64ca326ec21ec558ef9f5ba7f9b3402278c9cc2b1c4a6296bc56c5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+pSRYCwocHfTlI52M2edOXe7A4eVPqvxxT2SgAgB1Y1XsVmQ0mepGGwr3kccqqx5Wm7EGFY8wKP9pd2hbiMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:20:30.883010Z","bundle_sha256":"fa989e6341b3a8fbf483df0f90147ec229a74395584ec199d42fe7c84ac9e6bb"}}