{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LOO7PW5MFNSJU4DQFHXJAL4C3K","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":"ea9ffbfcdd2f7819db3f30c19cbcfb625c143aff4ab49c4ae151252ee3b0e630","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-03-31T09:44:20Z","title_canon_sha256":"f7f7ece560f48ffc336b209f7d877c8346cbf7d49e8e70bbee90620e3b2a4188"},"schema_version":"1.0","source":{"id":"2605.12513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12513","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12513v1","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12513","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"LOO7PW5MFNSJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOO7PW5MFNSJU4DQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOO7PW5M","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3d5a99f76d68b150a22af96d43e183b81541a507cce0296385194700fa2c2148","target":"graph","created_at":"2026-05-18T03:10:02Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Experiments on multiple real-world networks show that SP-GCRL achieves significant gains over heuristic and learning-based baselines across budgets and topologies, while maintaining strong large-scale scalability."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The proposed social-propagation-aware nonlinear diffusion function correctly models reinforcement, diminishing returns, and probability drift under repeated exposure in real incomplete graphs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"SP-GCRL combines a nonlinear social diffusion model, dual-view contrastive learning for robust node embeddings, a GAT surrogate, and DDQN to learn end-to-end seed selection policies for influence maximization under partial graph observability."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"SP-GCRL learns end-to-end seed selection policies for influence maximization on incomplete social graphs using contrastive representations and a nonlinear diffusion model."}],"snapshot_sha256":"4fbc9d99e03a12d81dfd47d4791e1c5548b881e3fa5fa17173cc9fd54a039041"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5e5ff1114b1ebce4c20c4a31daa2e76cef175d0ea7de765e075de0f62a5c67bd"},"paper":{"abstract_excerpt":"Influence maximization (IM) in real platforms is challenged by incomplete, noisy social graphs and non-stationary diffusion dynamics. We propose SP-GCRL, a social-propagation-aware graph contrastive reinforcement learning framework that learns end-to-end seed selection under partial observability.We first introduce a social-propagation-aware nonlinear diffusion function to model reinforcement/diminishing effects and probability drift under repeated exposure; we then construct dual structural views and perform contrastive learning to obtain node representations robust to missing edges and weak ","authors_text":"Haohua Niu, Hao Li, Jiao Liang, Lingfeng Zhang, Luca Rossi, Yuxuan Yang, Zongfu Luo","cross_cats":["cs.AI"],"headline":"SP-GCRL learns end-to-end seed selection policies for influence maximization on incomplete social graphs using contrastive representations and a nonlinear diffusion model.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-03-31T09:44:20Z","title":"SP-GCRL: Influence Maximization on Incomplete Social Graphs"},"references":{"count":36,"internal_anchors":0,"resolved_work":36,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Science advances10(15), eadh4439 (2024)","work_id":"eb6d3968-250d-46f1-a0dc-b0b06de81c4a","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"In: 2018 IEEE/WIC/ACM Interna- tional Conference on Web Intelligence (WI)","work_id":"77cfe480-4c45-481a-9e6b-3fdf66e5b490","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Proceedings of the National Academy of Sciences115(37), 9216–9221 (2018)","work_id":"4a291fda-160e-4e6e-a795-6846f02118ab","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"In: Uncertainty in Artificial In- telligence","work_id":"2ba968f8-4fc7-4978-b64f-1a2eb7e957fe","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"IEEE Transactions on Compu- tational Social Systems11(2), 2210–2221 (2023)","work_id":"f47ebf0c-63de-4345-9de4-fb6090ecffec","year":2023}],"snapshot_sha256":"a8e71eff1121b08217523c3ab84acbad2df7deab5dd9e8254ed670e82f055f89"},"source":{"id":"2605.12513","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T21:06:38.102110Z","id":"fe9e45d0-561b-46ea-8720-3e4253c7994a","model_set":{"reader":"grok-4.3"},"one_line_summary":"SP-GCRL combines a nonlinear social diffusion model, dual-view contrastive learning for robust node embeddings, a GAT surrogate, and DDQN to learn end-to-end seed selection policies for influence maximization under partial graph observability.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"SP-GCRL learns end-to-end seed selection policies for influence maximization on incomplete social graphs using contrastive representations and a nonlinear diffusion model.","strongest_claim":"Experiments on multiple real-world networks show that SP-GCRL achieves significant gains over heuristic and learning-based baselines across budgets and topologies, while maintaining strong large-scale scalability.","weakest_assumption":"The proposed social-propagation-aware nonlinear diffusion function correctly models reinforcement, diminishing returns, and probability drift under repeated exposure in real incomplete graphs."}},"verdict_id":"fe9e45d0-561b-46ea-8720-3e4253c7994a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:804f808401b708f7b63ff5bf273eabf6f1c8c70c7d7b8eacba432e4ca55087ab","target":"record","created_at":"2026-05-18T03:10:02Z","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":"ea9ffbfcdd2f7819db3f30c19cbcfb625c143aff4ab49c4ae151252ee3b0e630","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-03-31T09:44:20Z","title_canon_sha256":"f7f7ece560f48ffc336b209f7d877c8346cbf7d49e8e70bbee90620e3b2a4188"},"schema_version":"1.0","source":{"id":"2605.12513","kind":"arxiv","version":1}},"canonical_sha256":"5b9df7dbac2b649a707029ee902f82da9f94f5b7a70ab83d5323c8e5363bccd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b9df7dbac2b649a707029ee902f82da9f94f5b7a70ab83d5323c8e5363bccd9","first_computed_at":"2026-05-18T03:10:02.956899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:02.956899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hY1wYMAlBybM/1asaGdZ4KLWAV3a151Quzgf6CDM55rEQpbMOlt3UgNlU7ZIR1ilXYlll9dJ5QOhnqGpag6mDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:02.957515Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:804f808401b708f7b63ff5bf273eabf6f1c8c70c7d7b8eacba432e4ca55087ab","sha256:3d5a99f76d68b150a22af96d43e183b81541a507cce0296385194700fa2c2148"],"state_sha256":"397dca1b8a00e872d194fcc8c3b0e363d6ea79b6fe1213bc9ff540abffcf4dbd"}