{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JNW5Q4A6MUZQGARCTCXWYLSBP3","short_pith_number":"pith:JNW5Q4A6","canonical_record":{"source":{"id":"1701.08799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-30T19:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"0302af5569a5dd3f9f6925e4ebc7d00cc46aba40eee80250512b4132f9736757","abstract_canon_sha256":"5e52f3052cc5746f75d73d8d3fb65bf47384d1b2a4cbf0438773544fb244651e"},"schema_version":"1.0"},"canonical_sha256":"4b6dd8701e653303022298af6c2e417ec840eb06257f0661bb59126198e4f43e","source":{"kind":"arxiv","id":"1701.08799","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08799","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08799v1","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08799","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"JNW5Q4A6MUZQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JNW5Q4A6MUZQGARC","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JNW5Q4A6","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JNW5Q4A6MUZQGARCTCXWYLSBP3","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-30T19:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"0302af5569a5dd3f9f6925e4ebc7d00cc46aba40eee80250512b4132f9736757","abstract_canon_sha256":"5e52f3052cc5746f75d73d8d3fb65bf47384d1b2a4cbf0438773544fb244651e"},"schema_version":"1.0"},"canonical_sha256":"4b6dd8701e653303022298af6c2e417ec840eb06257f0661bb59126198e4f43e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:39.165279Z","signature_b64":"UeHriB4AdEVN2bXFsUYbQscPW35YskIlzpDgRJpM6kbIoFm4olM3pKPMqe1zzkke6r3oOy7fq0GM3ne3dh3DCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b6dd8701e653303022298af6c2e417ec840eb06257f0661bb59126198e4f43e","last_reissued_at":"2026-05-18T00:51:39.164929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:39.164929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08799","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:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WcTrGYt5FAJJplmZUbqvbdumpRuKHOmxj5M1upoPyqQUijM+zr+qhlUoNFvkQBUtesxwoBrqbGETwMmcwjKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:48:07.054965Z"},"content_sha256":"86823f87eae878302ef465acd766dc91f2859e6028850db1c1b6ac27e9eda397","schema_version":"1.0","event_id":"sha256:86823f87eae878302ef465acd766dc91f2859e6028850db1c1b6ac27e9eda397"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JNW5Q4A6MUZQGARCTCXWYLSBP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Bicriteria Algorithms for the Threshold Activation Problem in Online Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Alan Kuhnle, Md Abdul Alim, My T. Thai, Tianyi Pan","submitted_at":"2017-01-30T19:52:25Z","abstract_excerpt":"We consider the Threshold Activation Problem (TAP): given social network $G$ and positive threshold $T$, find a minimum-size seed set $A$ that can trigger expected activation of at least $T$. We introduce the first scalable, parallelizable algorithm with performance guarantee for TAP suitable for datasets with millions of nodes and edges; we exploit the bicriteria nature of solutions to TAP to allow the user to control the running time versus accuracy of our algorithm through a parameter $\\alpha \\in (0,1)$: given $\\eta > 0$, with probability $1 - \\eta$ our algorithm returns a solution $A$ with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08799","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:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWd+tewW04O30LdTAnhXuKTnx4okyIh5Wg1aBsjXKHhEwfxfhFf+WtLWovkMz547p6p8c1zfq2sHaEfHs7KsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:48:07.055724Z"},"content_sha256":"ba02e685ec46223f167b46361932a4cfbc7a6e4581886de1bcbfa2799d9b0636","schema_version":"1.0","event_id":"sha256:ba02e685ec46223f167b46361932a4cfbc7a6e4581886de1bcbfa2799d9b0636"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNW5Q4A6MUZQGARCTCXWYLSBP3/bundle.json","state_url":"https://pith.science/pith/JNW5Q4A6MUZQGARCTCXWYLSBP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNW5Q4A6MUZQGARCTCXWYLSBP3/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-29T23:48:07Z","links":{"resolver":"https://pith.science/pith/JNW5Q4A6MUZQGARCTCXWYLSBP3","bundle":"https://pith.science/pith/JNW5Q4A6MUZQGARCTCXWYLSBP3/bundle.json","state":"https://pith.science/pith/JNW5Q4A6MUZQGARCTCXWYLSBP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNW5Q4A6MUZQGARCTCXWYLSBP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JNW5Q4A6MUZQGARCTCXWYLSBP3","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":"5e52f3052cc5746f75d73d8d3fb65bf47384d1b2a4cbf0438773544fb244651e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-30T19:52:25Z","title_canon_sha256":"0302af5569a5dd3f9f6925e4ebc7d00cc46aba40eee80250512b4132f9736757"},"schema_version":"1.0","source":{"id":"1701.08799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08799","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08799v1","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08799","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"JNW5Q4A6MUZQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JNW5Q4A6MUZQGARC","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JNW5Q4A6","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:ba02e685ec46223f167b46361932a4cfbc7a6e4581886de1bcbfa2799d9b0636","target":"graph","created_at":"2026-05-18T00:51:39Z","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 consider the Threshold Activation Problem (TAP): given social network $G$ and positive threshold $T$, find a minimum-size seed set $A$ that can trigger expected activation of at least $T$. We introduce the first scalable, parallelizable algorithm with performance guarantee for TAP suitable for datasets with millions of nodes and edges; we exploit the bicriteria nature of solutions to TAP to allow the user to control the running time versus accuracy of our algorithm through a parameter $\\alpha \\in (0,1)$: given $\\eta > 0$, with probability $1 - \\eta$ our algorithm returns a solution $A$ with","authors_text":"Alan Kuhnle, Md Abdul Alim, My T. Thai, Tianyi Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-30T19:52:25Z","title":"Scalable Bicriteria Algorithms for the Threshold Activation Problem in Online Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08799","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:86823f87eae878302ef465acd766dc91f2859e6028850db1c1b6ac27e9eda397","target":"record","created_at":"2026-05-18T00:51:39Z","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":"5e52f3052cc5746f75d73d8d3fb65bf47384d1b2a4cbf0438773544fb244651e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-30T19:52:25Z","title_canon_sha256":"0302af5569a5dd3f9f6925e4ebc7d00cc46aba40eee80250512b4132f9736757"},"schema_version":"1.0","source":{"id":"1701.08799","kind":"arxiv","version":1}},"canonical_sha256":"4b6dd8701e653303022298af6c2e417ec840eb06257f0661bb59126198e4f43e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b6dd8701e653303022298af6c2e417ec840eb06257f0661bb59126198e4f43e","first_computed_at":"2026-05-18T00:51:39.164929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:39.164929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UeHriB4AdEVN2bXFsUYbQscPW35YskIlzpDgRJpM6kbIoFm4olM3pKPMqe1zzkke6r3oOy7fq0GM3ne3dh3DCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:39.165279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86823f87eae878302ef465acd766dc91f2859e6028850db1c1b6ac27e9eda397","sha256:ba02e685ec46223f167b46361932a4cfbc7a6e4581886de1bcbfa2799d9b0636"],"state_sha256":"9ef9cb1fd36795cae022568ebf6077f1276201301c0b757fadca91acabf8e923"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bao3vUS4J1yo+HXIl5rZxerR2229hCbv0KF9d9T1bv3wkDcK43SNwqLCID3hjXM8jtq/annuvdZeaWGRx/2XAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:48:07.060187Z","bundle_sha256":"cf8763ab9ebedef7d7c28bc0c764b0ff61664da4caff2ec09df1ee7f4ddd09f4"}}