{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DS3QEAXZHKD7XKJAXOXHGFCJKG","short_pith_number":"pith:DS3QEAXZ","canonical_record":{"source":{"id":"1303.6907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T17:41:51Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0b8bf1c5bd4c91712989338f66b66f2e5b1d043805cd613879568c60db13a455","abstract_canon_sha256":"a4bb71e539461b1368843e06b2d16a843c6a50692f6ec3fa857864d11035d192"},"schema_version":"1.0"},"canonical_sha256":"1cb70202f93a87fba920bbae731449518df7d022f33170a93c55d56da5d24b21","source":{"kind":"arxiv","id":"1303.6907","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6907","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6907v2","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6907","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"DS3QEAXZHKD7","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DS3QEAXZHKD7XKJA","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DS3QEAXZ","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DS3QEAXZHKD7XKJAXOXHGFCJKG","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T17:41:51Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0b8bf1c5bd4c91712989338f66b66f2e5b1d043805cd613879568c60db13a455","abstract_canon_sha256":"a4bb71e539461b1368843e06b2d16a843c6a50692f6ec3fa857864d11035d192"},"schema_version":"1.0"},"canonical_sha256":"1cb70202f93a87fba920bbae731449518df7d022f33170a93c55d56da5d24b21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:05.040595Z","signature_b64":"Hk2Od99+admcpuPIJfti2KPUsQ0vLTag4tvo6cIHH+VICv+rZoEHf7vGCCXACXuuEmG4j/Ml4EpUD/2SDDLxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cb70202f93a87fba920bbae731449518df7d022f33170a93c55d56da5d24b21","last_reissued_at":"2026-05-18T02:45:05.040077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:05.040077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6907","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-18T02:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RidZcTVoQSGxkalQkWPa+0l0yKSYLJpzZYqqxmcHfZYo/7rDrrNkdlYYoIveu4nZWecm8Wx9aGz5gpw65hhbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:38:40.313399Z"},"content_sha256":"e7797e31c7fa5ca4da1af29dcf65792785df2527efee4a5f3a453273a77c1492","schema_version":"1.0","event_id":"sha256:e7797e31c7fa5ca4da1af29dcf65792785df2527efee4a5f3a453273a77c1492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DS3QEAXZHKD7XKJAXOXHGFCJKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Approximability of Maximizing the Spread of Influence in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Cristina Bazgan, Florian Sikora, Morgan Chopin","submitted_at":"2013-03-27T17:41:51Z","abstract_excerpt":"In this paper, we consider the problem of maximizing the spread of influence through a social network. Given a graph with a threshold value~$thr(v)$ attached to each vertex~$v$, the spread of influence is modeled as follows: A vertex~$v$ becomes \"active\" (influenced) if at least $thr(v)$ of its neighbors are active. In the corresponding optimization problem the objective is then to find a fixed number of vertices to activate such that the number of activated vertices at the end of the propagation process is maximum. We show that this problem is strongly inapproximable in fpt-time with respect "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6907","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-18T02:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmyKqMYz/eX0m3R+cGtgQU+uVQr34O5hYX1AGnEEalwE365cX9dHdS7XQrzU0Xsq3SNLYhO5cGxYltErSSm1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:38:40.313745Z"},"content_sha256":"4f92d4d0049492f833575843c832e0e6a4ef980c0ceff96081b4c91fcfeb8e37","schema_version":"1.0","event_id":"sha256:4f92d4d0049492f833575843c832e0e6a4ef980c0ceff96081b4c91fcfeb8e37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DS3QEAXZHKD7XKJAXOXHGFCJKG/bundle.json","state_url":"https://pith.science/pith/DS3QEAXZHKD7XKJAXOXHGFCJKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DS3QEAXZHKD7XKJAXOXHGFCJKG/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-31T03:38:40Z","links":{"resolver":"https://pith.science/pith/DS3QEAXZHKD7XKJAXOXHGFCJKG","bundle":"https://pith.science/pith/DS3QEAXZHKD7XKJAXOXHGFCJKG/bundle.json","state":"https://pith.science/pith/DS3QEAXZHKD7XKJAXOXHGFCJKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DS3QEAXZHKD7XKJAXOXHGFCJKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DS3QEAXZHKD7XKJAXOXHGFCJKG","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":"a4bb71e539461b1368843e06b2d16a843c6a50692f6ec3fa857864d11035d192","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T17:41:51Z","title_canon_sha256":"0b8bf1c5bd4c91712989338f66b66f2e5b1d043805cd613879568c60db13a455"},"schema_version":"1.0","source":{"id":"1303.6907","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6907","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6907v2","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6907","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"DS3QEAXZHKD7","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DS3QEAXZHKD7XKJA","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DS3QEAXZ","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:4f92d4d0049492f833575843c832e0e6a4ef980c0ceff96081b4c91fcfeb8e37","target":"graph","created_at":"2026-05-18T02:45:05Z","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":"In this paper, we consider the problem of maximizing the spread of influence through a social network. Given a graph with a threshold value~$thr(v)$ attached to each vertex~$v$, the spread of influence is modeled as follows: A vertex~$v$ becomes \"active\" (influenced) if at least $thr(v)$ of its neighbors are active. In the corresponding optimization problem the objective is then to find a fixed number of vertices to activate such that the number of activated vertices at the end of the propagation process is maximum. We show that this problem is strongly inapproximable in fpt-time with respect ","authors_text":"Andr\\'e Nichterlein, Cristina Bazgan, Florian Sikora, Morgan Chopin","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T17:41:51Z","title":"Parameterized Approximability of Maximizing the Spread of Influence in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6907","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:e7797e31c7fa5ca4da1af29dcf65792785df2527efee4a5f3a453273a77c1492","target":"record","created_at":"2026-05-18T02:45:05Z","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":"a4bb71e539461b1368843e06b2d16a843c6a50692f6ec3fa857864d11035d192","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T17:41:51Z","title_canon_sha256":"0b8bf1c5bd4c91712989338f66b66f2e5b1d043805cd613879568c60db13a455"},"schema_version":"1.0","source":{"id":"1303.6907","kind":"arxiv","version":2}},"canonical_sha256":"1cb70202f93a87fba920bbae731449518df7d022f33170a93c55d56da5d24b21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cb70202f93a87fba920bbae731449518df7d022f33170a93c55d56da5d24b21","first_computed_at":"2026-05-18T02:45:05.040077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:05.040077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hk2Od99+admcpuPIJfti2KPUsQ0vLTag4tvo6cIHH+VICv+rZoEHf7vGCCXACXuuEmG4j/Ml4EpUD/2SDDLxBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:05.040595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6907","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7797e31c7fa5ca4da1af29dcf65792785df2527efee4a5f3a453273a77c1492","sha256:4f92d4d0049492f833575843c832e0e6a4ef980c0ceff96081b4c91fcfeb8e37"],"state_sha256":"ce9d0331004f2784eaad194ce9ec3418c15b4df269e9e843363ce3759b9d556e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjeR1JM+EP6JfYfBS76+uhzLRS6yd+Dw8dCoTVnkf756biIM6fPLH0HIDoPxdeuZX/dDhvfOTsHnQbB1yXOWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:38:40.315698Z","bundle_sha256":"95fdae3222d972445d27799e503646a12eb215f9946f77305b83e7c9c36eafcd"}}