{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UVTKGZUESVCZHDWNOUEIEPVARK","short_pith_number":"pith:UVTKGZUE","canonical_record":{"source":{"id":"1711.10665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T03:34:01Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"39a55d429bf47e9536497f9979f316a4cb9ef07d5277be31e38ac36739bff851","abstract_canon_sha256":"ba7c2549091fc2af18afdaaa662dc65eeee7ff4069349a12da8a2d23a5bbba0b"},"schema_version":"1.0"},"canonical_sha256":"a566a366849545938ecd7508823ea08aa3d5c7711cf8c23742675e3931bc9ca2","source":{"kind":"arxiv","id":"1711.10665","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10665","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10665v2","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10665","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"UVTKGZUESVCZ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UVTKGZUESVCZHDWN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UVTKGZUE","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UVTKGZUESVCZHDWNOUEIEPVARK","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T03:34:01Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"39a55d429bf47e9536497f9979f316a4cb9ef07d5277be31e38ac36739bff851","abstract_canon_sha256":"ba7c2549091fc2af18afdaaa662dc65eeee7ff4069349a12da8a2d23a5bbba0b"},"schema_version":"1.0"},"canonical_sha256":"a566a366849545938ecd7508823ea08aa3d5c7711cf8c23742675e3931bc9ca2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:35.658576Z","signature_b64":"CFa/+i1jxxhS4pBQCIOOrXUmHOLS8PR5Dgbmk5BZ0+KZvWlZUjHiH2IQ0871FhhkkPAJfCLfCNRH6EUnHZYbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a566a366849545938ecd7508823ea08aa3d5c7711cf8c23742675e3931bc9ca2","last_reissued_at":"2026-05-18T00:27:35.657890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:35.657890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10665","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:27:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcKKrZ8tkstoHpw6SLwNduTnOEnEBxym6wKqg+IWCUM43LAq5ZdNkMFf2vIhZ6N+K/o7BnL7mPELPIbB5vZjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:57:54.573190Z"},"content_sha256":"d8c16574a6e9c0e899cbd7f5e5a3fb1a4735eed06b8d640ab18e95759dccb4e3","schema_version":"1.0","event_id":"sha256:d8c16574a6e9c0e899cbd7f5e5a3fb1a4735eed06b8d640ab18e95759dccb4e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UVTKGZUESVCZHDWNOUEIEPVARK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-Effective Seed Selection in Online Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Jingxin Xu, Kai Han, Liusheng Huang, Shaojie Tang, Xiaokui Xiao, Yuntian He","submitted_at":"2017-11-29T03:34:01Z","abstract_excerpt":"We study the min-cost seed selection problem in online social networks, where the goal is to select a set of seed nodes with the minimum total cost such that the expected number of influenced nodes in the network exceeds a predefined threshold. We propose several algorithms that outperform the previous studies both on the theoretical approximation ratios and on the experimental performance. Under the case where the nodes have heterogeneous costs, our algorithms are the first bi- criteria approximation algorithms with polynomial running time and provable logarithmic performance bounds using a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10665","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:27:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wui1rJZjR0m0bW2g6m5thR7cPjkI/wze9pY+UUBWlWm9orjKlDwSd2qqYQjk/9jWgGXxl0DvPKw11umwqPNzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:57:54.573565Z"},"content_sha256":"b1904c8c6e287f24e564ffc746ebf3cb19db2a26ac908c775898fc752fe9c4aa","schema_version":"1.0","event_id":"sha256:b1904c8c6e287f24e564ffc746ebf3cb19db2a26ac908c775898fc752fe9c4aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVTKGZUESVCZHDWNOUEIEPVARK/bundle.json","state_url":"https://pith.science/pith/UVTKGZUESVCZHDWNOUEIEPVARK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVTKGZUESVCZHDWNOUEIEPVARK/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-25T14:57:54Z","links":{"resolver":"https://pith.science/pith/UVTKGZUESVCZHDWNOUEIEPVARK","bundle":"https://pith.science/pith/UVTKGZUESVCZHDWNOUEIEPVARK/bundle.json","state":"https://pith.science/pith/UVTKGZUESVCZHDWNOUEIEPVARK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVTKGZUESVCZHDWNOUEIEPVARK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UVTKGZUESVCZHDWNOUEIEPVARK","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":"ba7c2549091fc2af18afdaaa662dc65eeee7ff4069349a12da8a2d23a5bbba0b","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T03:34:01Z","title_canon_sha256":"39a55d429bf47e9536497f9979f316a4cb9ef07d5277be31e38ac36739bff851"},"schema_version":"1.0","source":{"id":"1711.10665","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10665","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10665v2","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10665","created_at":"2026-05-18T00:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"UVTKGZUESVCZ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UVTKGZUESVCZHDWN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UVTKGZUE","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:b1904c8c6e287f24e564ffc746ebf3cb19db2a26ac908c775898fc752fe9c4aa","target":"graph","created_at":"2026-05-18T00:27:35Z","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":"We study the min-cost seed selection problem in online social networks, where the goal is to select a set of seed nodes with the minimum total cost such that the expected number of influenced nodes in the network exceeds a predefined threshold. We propose several algorithms that outperform the previous studies both on the theoretical approximation ratios and on the experimental performance. Under the case where the nodes have heterogeneous costs, our algorithms are the first bi- criteria approximation algorithms with polynomial running time and provable logarithmic performance bounds using a g","authors_text":"Jingxin Xu, Kai Han, Liusheng Huang, Shaojie Tang, Xiaokui Xiao, Yuntian He","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T03:34:01Z","title":"Cost-Effective Seed Selection in Online Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10665","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:d8c16574a6e9c0e899cbd7f5e5a3fb1a4735eed06b8d640ab18e95759dccb4e3","target":"record","created_at":"2026-05-18T00:27:35Z","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":"ba7c2549091fc2af18afdaaa662dc65eeee7ff4069349a12da8a2d23a5bbba0b","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T03:34:01Z","title_canon_sha256":"39a55d429bf47e9536497f9979f316a4cb9ef07d5277be31e38ac36739bff851"},"schema_version":"1.0","source":{"id":"1711.10665","kind":"arxiv","version":2}},"canonical_sha256":"a566a366849545938ecd7508823ea08aa3d5c7711cf8c23742675e3931bc9ca2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a566a366849545938ecd7508823ea08aa3d5c7711cf8c23742675e3931bc9ca2","first_computed_at":"2026-05-18T00:27:35.657890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:35.657890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CFa/+i1jxxhS4pBQCIOOrXUmHOLS8PR5Dgbmk5BZ0+KZvWlZUjHiH2IQ0871FhhkkPAJfCLfCNRH6EUnHZYbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:35.658576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10665","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8c16574a6e9c0e899cbd7f5e5a3fb1a4735eed06b8d640ab18e95759dccb4e3","sha256:b1904c8c6e287f24e564ffc746ebf3cb19db2a26ac908c775898fc752fe9c4aa"],"state_sha256":"d5efccd040912736c0a023d3ea041956f5df4c51ab312cae583fe382c13b0800"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEgGq1TziwxbwHZn+faqlDJjm3Vt3R5Jn/wjclol+kP6SQXIWO14tZLuVQcBqpS3difvRxWYlfl5YAAHt48pDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:57:54.576626Z","bundle_sha256":"fae40cb657a5c258d090b4bb2d3c4ac12b865ebe72ec0ebdaeafe06c72c8a3cd"}}