{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LG5VLEVCTVLJXBQODC62RAMTWP","short_pith_number":"pith:LG5VLEVC","canonical_record":{"source":{"id":"1701.02368","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-09T21:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"deed04e93ed0f3ca833cb3eb6f66bc89890a21b2d6c318da033f37f95c84ed87","abstract_canon_sha256":"005f917ca96dc6144ff0ad217bc5d1e5da02efa5911bd14af2c1e97003a0dcb3"},"schema_version":"1.0"},"canonical_sha256":"59bb5592a29d569b860e18bda88193b3d0f0b4d555b04e7d0fac2f952788bdb9","source":{"kind":"arxiv","id":"1701.02368","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02368","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02368v3","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02368","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"LG5VLEVCTVLJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LG5VLEVCTVLJXBQO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LG5VLEVC","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LG5VLEVCTVLJXBQODC62RAMTWP","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02368","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-09T21:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"deed04e93ed0f3ca833cb3eb6f66bc89890a21b2d6c318da033f37f95c84ed87","abstract_canon_sha256":"005f917ca96dc6144ff0ad217bc5d1e5da02efa5911bd14af2c1e97003a0dcb3"},"schema_version":"1.0"},"canonical_sha256":"59bb5592a29d569b860e18bda88193b3d0f0b4d555b04e7d0fac2f952788bdb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.171904Z","signature_b64":"5OEExCVt2bS+8ohVQNhfpCAvg0NyW7g/C1eHfb8H8i0Zw0sD0VFrKiK+WSluRksH9JwFUGDSJbo1vTnKKeS3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59bb5592a29d569b860e18bda88193b3d0f0b4d555b04e7d0fac2f952788bdb9","last_reissued_at":"2026-05-18T00:31:00.171146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.171146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02368","source_version":3,"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:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"na0aAK0WP28MnCPfTxePQQSzQROh5o8xt9UK1n2sebicoV73aJoviXwxwcEnz+LHxe+sqVganncpiM4CvbCvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:29:58.351346Z"},"content_sha256":"9bca95c3246628a1309709f5367dfc3468bd44914865b4c8e8aedb242171c09d","schema_version":"1.0","event_id":"sha256:9bca95c3246628a1309709f5367dfc3468bd44914865b4c8e8aedb242171c09d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LG5VLEVCTVLJXBQODC62RAMTWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bin Liu, Cong Liu, Deying Li, Ding-Zhu Du, Guangmo Tong, Ling Guo, Weili Wu","submitted_at":"2017-01-09T21:57:38Z","abstract_excerpt":"Social networks allow rapid spread of ideas and innovations while the negative information can also propagate widely. When the cascades with different opinions reaching the same user, the cascade arriving first is the most likely to be taken by the user. Therefore, once misinformation or rumor is detected, a natural containment method is to introduce a positive cascade competing against the rumor. Given a budget $k$, the rumor blocking problem asks for $k$ seed users to trigger the spread of the positive cascade such that the number of the users who are not influenced by rumor can be maximized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02368","kind":"arxiv","version":3},"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:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nw9PlbvFMzobvaTkAXdwihUSpm2jBq3a9AIS9SGNuAn33vQKHr/CJkMEfYACzDclTsAui6wAc55KQupMZjupAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:29:58.351706Z"},"content_sha256":"514d1d6ae00cd901ff7ed2d7e9e2c33815e3d18a1024294e5dd7755dac0edaa0","schema_version":"1.0","event_id":"sha256:514d1d6ae00cd901ff7ed2d7e9e2c33815e3d18a1024294e5dd7755dac0edaa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LG5VLEVCTVLJXBQODC62RAMTWP/bundle.json","state_url":"https://pith.science/pith/LG5VLEVCTVLJXBQODC62RAMTWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LG5VLEVCTVLJXBQODC62RAMTWP/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-30T23:29:58Z","links":{"resolver":"https://pith.science/pith/LG5VLEVCTVLJXBQODC62RAMTWP","bundle":"https://pith.science/pith/LG5VLEVCTVLJXBQODC62RAMTWP/bundle.json","state":"https://pith.science/pith/LG5VLEVCTVLJXBQODC62RAMTWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LG5VLEVCTVLJXBQODC62RAMTWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LG5VLEVCTVLJXBQODC62RAMTWP","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":"005f917ca96dc6144ff0ad217bc5d1e5da02efa5911bd14af2c1e97003a0dcb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-09T21:57:38Z","title_canon_sha256":"deed04e93ed0f3ca833cb3eb6f66bc89890a21b2d6c318da033f37f95c84ed87"},"schema_version":"1.0","source":{"id":"1701.02368","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02368","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02368v3","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02368","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"LG5VLEVCTVLJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LG5VLEVCTVLJXBQO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LG5VLEVC","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:514d1d6ae00cd901ff7ed2d7e9e2c33815e3d18a1024294e5dd7755dac0edaa0","target":"graph","created_at":"2026-05-18T00:31:00Z","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":"Social networks allow rapid spread of ideas and innovations while the negative information can also propagate widely. When the cascades with different opinions reaching the same user, the cascade arriving first is the most likely to be taken by the user. Therefore, once misinformation or rumor is detected, a natural containment method is to introduce a positive cascade competing against the rumor. Given a budget $k$, the rumor blocking problem asks for $k$ seed users to trigger the spread of the positive cascade such that the number of the users who are not influenced by rumor can be maximized","authors_text":"Bin Liu, Cong Liu, Deying Li, Ding-Zhu Du, Guangmo Tong, Ling Guo, Weili Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-09T21:57:38Z","title":"An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02368","kind":"arxiv","version":3},"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:9bca95c3246628a1309709f5367dfc3468bd44914865b4c8e8aedb242171c09d","target":"record","created_at":"2026-05-18T00:31:00Z","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":"005f917ca96dc6144ff0ad217bc5d1e5da02efa5911bd14af2c1e97003a0dcb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-09T21:57:38Z","title_canon_sha256":"deed04e93ed0f3ca833cb3eb6f66bc89890a21b2d6c318da033f37f95c84ed87"},"schema_version":"1.0","source":{"id":"1701.02368","kind":"arxiv","version":3}},"canonical_sha256":"59bb5592a29d569b860e18bda88193b3d0f0b4d555b04e7d0fac2f952788bdb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59bb5592a29d569b860e18bda88193b3d0f0b4d555b04e7d0fac2f952788bdb9","first_computed_at":"2026-05-18T00:31:00.171146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:00.171146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5OEExCVt2bS+8ohVQNhfpCAvg0NyW7g/C1eHfb8H8i0Zw0sD0VFrKiK+WSluRksH9JwFUGDSJbo1vTnKKeS3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:00.171904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02368","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bca95c3246628a1309709f5367dfc3468bd44914865b4c8e8aedb242171c09d","sha256:514d1d6ae00cd901ff7ed2d7e9e2c33815e3d18a1024294e5dd7755dac0edaa0"],"state_sha256":"c0e66b63037a21c9a9fea36646240419eba1635b324d64a39705f2e10e91dba8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k89bry0vGSVzISPPQxtTFGmCc7U5z3b+wiDWZ9akBmwE+HW20lnMCPuUQhWvmLlxQjQS+T3pX54CRaMzfyN/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:29:58.353708Z","bundle_sha256":"fb49541f00f29e132948b49ff193551df83de3e4c23321e0e6e08afe81ae18b5"}}