{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CBB53CR2K6YQV3LC6IRYBGXZU5","short_pith_number":"pith:CBB53CR2","canonical_record":{"source":{"id":"1805.10086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-25T11:36:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cfe1a2f345f70fc14ac004a4c4917ca906fd8abbf0234cc34119da91071b07f9","abstract_canon_sha256":"faff1b0073a3938e10b5da2569cf2e663abf4041171a86ce1a8fa9c915e1498e"},"schema_version":"1.0"},"canonical_sha256":"1043dd8a3a57b10aed62f223809af9a740fb71554ba0311a923996c7a5a02c95","source":{"kind":"arxiv","id":"1805.10086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10086","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10086v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10086","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"CBB53CR2K6YQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CBB53CR2K6YQV3LC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CBB53CR2","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CBB53CR2K6YQV3LC6IRYBGXZU5","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-25T11:36:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cfe1a2f345f70fc14ac004a4c4917ca906fd8abbf0234cc34119da91071b07f9","abstract_canon_sha256":"faff1b0073a3938e10b5da2569cf2e663abf4041171a86ce1a8fa9c915e1498e"},"schema_version":"1.0"},"canonical_sha256":"1043dd8a3a57b10aed62f223809af9a740fb71554ba0311a923996c7a5a02c95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:58.307266Z","signature_b64":"wMJshGBBI6JaJ5iTaH1px0ZIpo/bvyYjuqYYYEjqF/xNcx/krqCQu7PMixCGYnccXTUMw+8GF8VbvG+HUaLPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1043dd8a3a57b10aed62f223809af9a740fb71554ba0311a923996c7a5a02c95","last_reissued_at":"2026-05-18T00:14:58.306755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:58.306755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10086","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j4zyTl/y3JIG+BbY/TmRhGknsovsxN7hj1cBSBFo2wdYySMrUCGxmnsc8trf9cZl4rZsxbj8ga5DbsQideD2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:49:19.849092Z"},"content_sha256":"d3ec6a040471add790c4e7646dbf57c7bf1b5ea986a22e2cfcda9d66a6bcd009","schema_version":"1.0","event_id":"sha256:d3ec6a040471add790c4e7646dbf57c7bf1b5ea986a22e2cfcda9d66a6bcd009"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CBB53CR2K6YQV3LC6IRYBGXZU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On some tractable and hard instances for partial incentives and target set selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Stefan Ehard","submitted_at":"2018-05-25T11:36:32Z","abstract_excerpt":"A widely studied model for influence diffusion in social networks are {\\it target sets}. For a graph $G$ and an integer-valued threshold function $\\tau$ on its vertex set, a {\\it target set} or {\\it dynamic monopoly} is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\\tau(u)$ neighbors in it eventually yields the entire vertex set of $G$. This notion is limited to the binary choice of including a vertex in the target set or not, and Cordasco et al.~proposed {\\it partial incentives} as a variant allowing for intermediate choices.\n  We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10086","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYuOkrWOMmZ/AvGxZZh+/2kB//C6yKMe6UCQ+0QeqH9iG2oO6t+bv770cpXxarmPfXEFxVFrmDZUVQvQ9G3tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:49:19.849836Z"},"content_sha256":"a5dacf30b1b8563cb0720ba413e41a9ecacb78bc7a9e8c4e57256af935ef0f07","schema_version":"1.0","event_id":"sha256:a5dacf30b1b8563cb0720ba413e41a9ecacb78bc7a9e8c4e57256af935ef0f07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBB53CR2K6YQV3LC6IRYBGXZU5/bundle.json","state_url":"https://pith.science/pith/CBB53CR2K6YQV3LC6IRYBGXZU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBB53CR2K6YQV3LC6IRYBGXZU5/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-10T11:49:19Z","links":{"resolver":"https://pith.science/pith/CBB53CR2K6YQV3LC6IRYBGXZU5","bundle":"https://pith.science/pith/CBB53CR2K6YQV3LC6IRYBGXZU5/bundle.json","state":"https://pith.science/pith/CBB53CR2K6YQV3LC6IRYBGXZU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBB53CR2K6YQV3LC6IRYBGXZU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CBB53CR2K6YQV3LC6IRYBGXZU5","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":"faff1b0073a3938e10b5da2569cf2e663abf4041171a86ce1a8fa9c915e1498e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-25T11:36:32Z","title_canon_sha256":"cfe1a2f345f70fc14ac004a4c4917ca906fd8abbf0234cc34119da91071b07f9"},"schema_version":"1.0","source":{"id":"1805.10086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10086","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10086v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10086","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"CBB53CR2K6YQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CBB53CR2K6YQV3LC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CBB53CR2","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:a5dacf30b1b8563cb0720ba413e41a9ecacb78bc7a9e8c4e57256af935ef0f07","target":"graph","created_at":"2026-05-18T00:14:58Z","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":"A widely studied model for influence diffusion in social networks are {\\it target sets}. For a graph $G$ and an integer-valued threshold function $\\tau$ on its vertex set, a {\\it target set} or {\\it dynamic monopoly} is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\\tau(u)$ neighbors in it eventually yields the entire vertex set of $G$. This notion is limited to the binary choice of including a vertex in the target set or not, and Cordasco et al.~proposed {\\it partial incentives} as a variant allowing for intermediate choices.\n  We show tha","authors_text":"Dieter Rautenbach, Stefan Ehard","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-25T11:36:32Z","title":"On some tractable and hard instances for partial incentives and target set selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10086","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:d3ec6a040471add790c4e7646dbf57c7bf1b5ea986a22e2cfcda9d66a6bcd009","target":"record","created_at":"2026-05-18T00:14:58Z","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":"faff1b0073a3938e10b5da2569cf2e663abf4041171a86ce1a8fa9c915e1498e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-25T11:36:32Z","title_canon_sha256":"cfe1a2f345f70fc14ac004a4c4917ca906fd8abbf0234cc34119da91071b07f9"},"schema_version":"1.0","source":{"id":"1805.10086","kind":"arxiv","version":1}},"canonical_sha256":"1043dd8a3a57b10aed62f223809af9a740fb71554ba0311a923996c7a5a02c95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1043dd8a3a57b10aed62f223809af9a740fb71554ba0311a923996c7a5a02c95","first_computed_at":"2026-05-18T00:14:58.306755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:58.306755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wMJshGBBI6JaJ5iTaH1px0ZIpo/bvyYjuqYYYEjqF/xNcx/krqCQu7PMixCGYnccXTUMw+8GF8VbvG+HUaLPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:58.307266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3ec6a040471add790c4e7646dbf57c7bf1b5ea986a22e2cfcda9d66a6bcd009","sha256:a5dacf30b1b8563cb0720ba413e41a9ecacb78bc7a9e8c4e57256af935ef0f07"],"state_sha256":"e4dc3fae33c1f6571915685bedc5bb2424726e65cd6f5d3e145eb0345944d519"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbsntxWt5Qn36VIEung64LgF244kQCgrjiDJlAW/ZvrtW+D+5cwnez8u1+uGTlK8EzlBjTTyx28WAOy+ifAzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:49:19.853935Z","bundle_sha256":"26b950e116ef991bbabe3ffd785ee07a747157b3bf3a8a4faee8734ce5832cc4"}}