{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:THDP6CVGMULFWQGTJSRUCDGTLI","short_pith_number":"pith:THDP6CVG","canonical_record":{"source":{"id":"2003.11677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-03-25T23:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"77d99e92a71d9350a5a8f3f5810e57d38553397eceb4aec5500c40735699143d","abstract_canon_sha256":"eee97d72e03f39b33bfc972e530fb6571a1f32aa63b8d79df92f55aab8fb00a5"},"schema_version":"1.0"},"canonical_sha256":"99c6ff0aa665165b40d34ca3410cd35a1ee6779e37eaf386a2456a22bad3db57","source":{"kind":"arxiv","id":"2003.11677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.11677","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"2003.11677v1","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11677","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"THDP6CVGMULF","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"pith_short_16","alias_value":"THDP6CVGMULFWQGT","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"pith_short_8","alias_value":"THDP6CVG","created_at":"2026-07-05T01:08:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:THDP6CVGMULFWQGTJSRUCDGTLI","target":"record","payload":{"canonical_record":{"source":{"id":"2003.11677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-03-25T23:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"77d99e92a71d9350a5a8f3f5810e57d38553397eceb4aec5500c40735699143d","abstract_canon_sha256":"eee97d72e03f39b33bfc972e530fb6571a1f32aa63b8d79df92f55aab8fb00a5"},"schema_version":"1.0"},"canonical_sha256":"99c6ff0aa665165b40d34ca3410cd35a1ee6779e37eaf386a2456a22bad3db57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:12.674292Z","signature_b64":"sHwEUQku6mh5AKd5aWZC9YknyLD0XhOuq+qeVBprCeRmRzXt8AcOyH1YwGfhRoci01+Hp1v10JOR3HXKYdp7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99c6ff0aa665165b40d34ca3410cd35a1ee6779e37eaf386a2456a22bad3db57","last_reissued_at":"2026-07-05T01:08:12.673715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:12.673715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.11677","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-07-05T01:08:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMj1vsoc8AuJvYnL1Y8uTV8sjbr5i3/EZ3IIPDkM2XwrburLVLqZSnDPOt6aQr3XA7cP3iCldgkT5ZaRzCamAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:42:58.099800Z"},"content_sha256":"6cc4d1eb89ce56f9d9b9f362c64d0454e56767d4932dcd99c4d5a009e409d34c","schema_version":"1.0","event_id":"sha256:6cc4d1eb89ce56f9d9b9f362c64d0454e56767d4932dcd99c4d5a009e409d34c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:THDP6CVGMULFWQGTJSRUCDGTLI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous Activity Maximization in Online Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jianxiong Guo, Tiantian Chen, Weili Wu","submitted_at":"2020-03-25T23:30:54Z","abstract_excerpt":"Activity maximization is a task of seeking a small subset of users in a given social network that makes the expected total activity benefit maximized. This is a generalization of many real applications. In this paper, we extend activity maximization problem to that under the general marketing strategy $\\vec{x}$, which is a $d$-dimensional vector from a lattice space and has probability $h_u(\\vec{x})$ to activate a node $u$ as a seed. Based on that, we propose the continuous activity maximization (CAM) problem, where the domain is continuous and the seed set we select conforms to a certain prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11677","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.11677/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:08:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5ELO6TOFULLd6FWhms29BGeeObmXWUkSdejRhSA+cvwzd9+G42rW5fOGX4cvFGErfHcc3fR8oVlCGGQUS6eAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:42:58.100168Z"},"content_sha256":"05dbb917055a4334f12059dd7856baf034846ec00c297762b1f9058b5b342802","schema_version":"1.0","event_id":"sha256:05dbb917055a4334f12059dd7856baf034846ec00c297762b1f9058b5b342802"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/bundle.json","state_url":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THDP6CVGMULFWQGTJSRUCDGTLI/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-07-05T05:42:58Z","links":{"resolver":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI","bundle":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/bundle.json","state":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THDP6CVGMULFWQGTJSRUCDGTLI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:THDP6CVGMULFWQGTJSRUCDGTLI","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":"eee97d72e03f39b33bfc972e530fb6571a1f32aa63b8d79df92f55aab8fb00a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-03-25T23:30:54Z","title_canon_sha256":"77d99e92a71d9350a5a8f3f5810e57d38553397eceb4aec5500c40735699143d"},"schema_version":"1.0","source":{"id":"2003.11677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.11677","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"2003.11677v1","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11677","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"THDP6CVGMULF","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"pith_short_16","alias_value":"THDP6CVGMULFWQGT","created_at":"2026-07-05T01:08:12Z"},{"alias_kind":"pith_short_8","alias_value":"THDP6CVG","created_at":"2026-07-05T01:08:12Z"}],"graph_snapshots":[{"event_id":"sha256:05dbb917055a4334f12059dd7856baf034846ec00c297762b1f9058b5b342802","target":"graph","created_at":"2026-07-05T01:08:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.11677/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Activity maximization is a task of seeking a small subset of users in a given social network that makes the expected total activity benefit maximized. This is a generalization of many real applications. In this paper, we extend activity maximization problem to that under the general marketing strategy $\\vec{x}$, which is a $d$-dimensional vector from a lattice space and has probability $h_u(\\vec{x})$ to activate a node $u$ as a seed. Based on that, we propose the continuous activity maximization (CAM) problem, where the domain is continuous and the seed set we select conforms to a certain prob","authors_text":"Jianxiong Guo, Tiantian Chen, Weili Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-03-25T23:30:54Z","title":"Continuous Activity Maximization in Online Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11677","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:6cc4d1eb89ce56f9d9b9f362c64d0454e56767d4932dcd99c4d5a009e409d34c","target":"record","created_at":"2026-07-05T01:08:12Z","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":"eee97d72e03f39b33bfc972e530fb6571a1f32aa63b8d79df92f55aab8fb00a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-03-25T23:30:54Z","title_canon_sha256":"77d99e92a71d9350a5a8f3f5810e57d38553397eceb4aec5500c40735699143d"},"schema_version":"1.0","source":{"id":"2003.11677","kind":"arxiv","version":1}},"canonical_sha256":"99c6ff0aa665165b40d34ca3410cd35a1ee6779e37eaf386a2456a22bad3db57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99c6ff0aa665165b40d34ca3410cd35a1ee6779e37eaf386a2456a22bad3db57","first_computed_at":"2026-07-05T01:08:12.673715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:08:12.673715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sHwEUQku6mh5AKd5aWZC9YknyLD0XhOuq+qeVBprCeRmRzXt8AcOyH1YwGfhRoci01+Hp1v10JOR3HXKYdp7DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:08:12.674292Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.11677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cc4d1eb89ce56f9d9b9f362c64d0454e56767d4932dcd99c4d5a009e409d34c","sha256:05dbb917055a4334f12059dd7856baf034846ec00c297762b1f9058b5b342802"],"state_sha256":"83b1cbb52e95d844fee6e5e2f971a163d6ef52ca6b5d8485ce39028e4455b32c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nF+u+3Q5oUZNqooUt27EGvR/xWOefiVc7zbvYzIFpErEUyemz0/rskgzFk/PAJFlONobCAQxsHc/ltfe4E7YBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T05:42:58.102147Z","bundle_sha256":"d8202b50e980854bc627f832758e4c1ee3ccbe0588076239b6a8335da3d9408f"}}