{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:THDP6CVGMULFWQGTJSRUCDGTLI","short_pith_number":"pith:THDP6CVG","schema_version":"1.0","canonical_sha256":"99c6ff0aa665165b40d34ca3410cd35a1ee6779e37eaf386a2456a22bad3db57","source":{"kind":"arxiv","id":"2003.11677","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.11677","created_at":"2026-07-05T01:08:12.673785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.11677v1","created_at":"2026-07-05T01:08:12.673785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11677","created_at":"2026-07-05T01:08:12.673785+00:00"},{"alias_kind":"pith_short_12","alias_value":"THDP6CVGMULF","created_at":"2026-07-05T01:08:12.673785+00:00"},{"alias_kind":"pith_short_16","alias_value":"THDP6CVGMULFWQGT","created_at":"2026-07-05T01:08:12.673785+00:00"},{"alias_kind":"pith_short_8","alias_value":"THDP6CVG","created_at":"2026-07-05T01:08:12.673785+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/THDP6CVGMULFWQGTJSRUCDGTLI","json":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI.json","graph_json":"https://pith.science/api/pith-number/THDP6CVGMULFWQGTJSRUCDGTLI/graph.json","events_json":"https://pith.science/api/pith-number/THDP6CVGMULFWQGTJSRUCDGTLI/events.json","paper":"https://pith.science/paper/THDP6CVG"},"agent_actions":{"view_html":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI","download_json":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI.json","view_paper":"https://pith.science/paper/THDP6CVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.11677&json=true","fetch_graph":"https://pith.science/api/pith-number/THDP6CVGMULFWQGTJSRUCDGTLI/graph.json","fetch_events":"https://pith.science/api/pith-number/THDP6CVGMULFWQGTJSRUCDGTLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/action/storage_attestation","attest_author":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/action/author_attestation","sign_citation":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/action/citation_signature","submit_replication":"https://pith.science/pith/THDP6CVGMULFWQGTJSRUCDGTLI/action/replication_record"}},"created_at":"2026-07-05T01:08:12.673785+00:00","updated_at":"2026-07-05T01:08:12.673785+00:00"}