{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IRWV3EAWUSAECOLTPIT5VRRKRP","short_pith_number":"pith:IRWV3EAW","schema_version":"1.0","canonical_sha256":"446d5d9016a4804139737a27dac62a8bf628efd913f5260f20b7cf7d5f479f03","source":{"kind":"arxiv","id":"1411.7838","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Finding Effectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Laurent Bulteau, Nimrod Talmon, Rolf Niedermeier, Stefan Fafianie, Vincent Froese","submitted_at":"2014-11-28T12:29:36Z","abstract_excerpt":"The NP-hard EFFECTORS problem on directed graphs is motivated by applications in network mining, particularly concerning the analysis of probabilistic information-propagation processes in social networks. In the corresponding model the arcs carry probabilities and there is a probabilistic diffusion process activating nodes by neighboring activated nodes with probabilities as specified by the arcs. The point is to explain a given network activation state as well as possible by using a minimum number of \"effector nodes\"; these are selected before the activation process starts.\n  We correct, comp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1411.7838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-28T12:29:36Z","cross_cats_sorted":[],"title_canon_sha256":"c4a0084a46b15a0c2215c9b4b8c2c2993511f5f7272dc115e05250bf3d6a55fe","abstract_canon_sha256":"cc34a0fd012ea00446b8d0c1dc484de9bbfffd385a71cd0cffca9edc6829bc7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:30.785096Z","signature_b64":"kpLU2M+f/x4RZeVzU/1ntGiVb5mtTZD3EYB2Jofg7YkkwmCytLS36SJJLyNKIRUOoCJitxbagiY6wkkTgB/qAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"446d5d9016a4804139737a27dac62a8bf628efd913f5260f20b7cf7d5f479f03","last_reissued_at":"2026-05-18T01:25:30.784478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:30.784478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Finding Effectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Laurent Bulteau, Nimrod Talmon, Rolf Niedermeier, Stefan Fafianie, Vincent Froese","submitted_at":"2014-11-28T12:29:36Z","abstract_excerpt":"The NP-hard EFFECTORS problem on directed graphs is motivated by applications in network mining, particularly concerning the analysis of probabilistic information-propagation processes in social networks. In the corresponding model the arcs carry probabilities and there is a probabilistic diffusion process activating nodes by neighboring activated nodes with probabilities as specified by the arcs. The point is to explain a given network activation state as well as possible by using a minimum number of \"effector nodes\"; these are selected before the activation process starts.\n  We correct, comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7838","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.7838","created_at":"2026-05-18T01:25:30.784594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7838v2","created_at":"2026-05-18T01:25:30.784594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7838","created_at":"2026-05-18T01:25:30.784594+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRWV3EAWUSAE","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRWV3EAWUSAECOLT","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRWV3EAW","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP","json":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP.json","graph_json":"https://pith.science/api/pith-number/IRWV3EAWUSAECOLTPIT5VRRKRP/graph.json","events_json":"https://pith.science/api/pith-number/IRWV3EAWUSAECOLTPIT5VRRKRP/events.json","paper":"https://pith.science/paper/IRWV3EAW"},"agent_actions":{"view_html":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP","download_json":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP.json","view_paper":"https://pith.science/paper/IRWV3EAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7838&json=true","fetch_graph":"https://pith.science/api/pith-number/IRWV3EAWUSAECOLTPIT5VRRKRP/graph.json","fetch_events":"https://pith.science/api/pith-number/IRWV3EAWUSAECOLTPIT5VRRKRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP/action/storage_attestation","attest_author":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP/action/author_attestation","sign_citation":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP/action/citation_signature","submit_replication":"https://pith.science/pith/IRWV3EAWUSAECOLTPIT5VRRKRP/action/replication_record"}},"created_at":"2026-05-18T01:25:30.784594+00:00","updated_at":"2026-05-18T01:25:30.784594+00:00"}