{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5XUBR33CUMFYUSTDNYGSRBGWQS","short_pith_number":"pith:5XUBR33C","canonical_record":{"source":{"id":"2311.15345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-11-26T16:19:43Z","cross_cats_sorted":[],"title_canon_sha256":"55d349bf575d44fa5df5be89065dda195b7c0efb36d65ac28dfed49bc02a2c31","abstract_canon_sha256":"300130bfc6f30989833838ebfb13567f20fe1a99103890f39193528e08fba125"},"schema_version":"1.0"},"canonical_sha256":"ede818ef62a30b8a4a636e0d2884d684b05e9a9fe3e75bad72700b0808742f4e","source":{"kind":"arxiv","id":"2311.15345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.15345","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"2311.15345v1","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15345","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"5XUBR33CUMFY","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"pith_short_16","alias_value":"5XUBR33CUMFYUSTD","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"pith_short_8","alias_value":"5XUBR33C","created_at":"2026-07-05T07:17:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5XUBR33CUMFYUSTDNYGSRBGWQS","target":"record","payload":{"canonical_record":{"source":{"id":"2311.15345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-11-26T16:19:43Z","cross_cats_sorted":[],"title_canon_sha256":"55d349bf575d44fa5df5be89065dda195b7c0efb36d65ac28dfed49bc02a2c31","abstract_canon_sha256":"300130bfc6f30989833838ebfb13567f20fe1a99103890f39193528e08fba125"},"schema_version":"1.0"},"canonical_sha256":"ede818ef62a30b8a4a636e0d2884d684b05e9a9fe3e75bad72700b0808742f4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:02.072485Z","signature_b64":"SSV+vjT/PpjTs9ndKhBJ9262DR7krWyitb8IauWZ/0RFiwNPSgsQtLur4F1BRhwNghYC5S/te9A/4YE6CMOfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede818ef62a30b8a4a636e0d2884d684b05e9a9fe3e75bad72700b0808742f4e","last_reissued_at":"2026-07-05T07:17:02.072098Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:02.072098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.15345","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-05T07:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJLh1GmsCyBdodyelte19GhIjAOYn+jhK5mJhAX0yXS9ivDRHyptRZGmlNsWocDdZzf1v8liqXQS1vbE5c82AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:01:13.017215Z"},"content_sha256":"d2874cb0ce0294a84c45fdc835de4d278e9f0f422af2894c0abd230d1c47875a","schema_version":"1.0","event_id":"sha256:d2874cb0ce0294a84c45fdc835de4d278e9f0f422af2894c0abd230d1c47875a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5XUBR33CUMFYUSTDNYGSRBGWQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sample Reuse Strategy for Dynamic Influence Maximization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ke Tang, Shaofeng Zhang, Shengcai Liu","submitted_at":"2023-11-26T16:19:43Z","abstract_excerpt":"Dynamic influence maximization problem (DIMP) aims to maintain a group of influential users within an evolving social network, so that the influence scope can be maximized at any given moment. A primary category of DIMP algorithms focuses on the renewal of reverse reachable (RR) sets, which is designed for static social network scenarios, to accelerate the estimation of influence spread. And the generation time of RR sets plays a crucial role in algorithm efficiency. However, their update approaches require sequential updates for each edge change, leading to considerable computational cost. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15345","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/2311.15345/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-05T07:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rok1WBgAbTn56EU/mdjoBscR41Wqgs3V9nJ+P5g66rum2ms1fIWzdd9SHyv8R+7HZNJGr9QH8lMsl39jo9nMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:01:13.017740Z"},"content_sha256":"b5448895b72ffc9b94c18dec630218bc4d7d04f7b246ea1a145d390606719426","schema_version":"1.0","event_id":"sha256:b5448895b72ffc9b94c18dec630218bc4d7d04f7b246ea1a145d390606719426"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XUBR33CUMFYUSTDNYGSRBGWQS/bundle.json","state_url":"https://pith.science/pith/5XUBR33CUMFYUSTDNYGSRBGWQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XUBR33CUMFYUSTDNYGSRBGWQS/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-08-19T22:01:13Z","links":{"resolver":"https://pith.science/pith/5XUBR33CUMFYUSTDNYGSRBGWQS","bundle":"https://pith.science/pith/5XUBR33CUMFYUSTDNYGSRBGWQS/bundle.json","state":"https://pith.science/pith/5XUBR33CUMFYUSTDNYGSRBGWQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XUBR33CUMFYUSTDNYGSRBGWQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5XUBR33CUMFYUSTDNYGSRBGWQS","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":"300130bfc6f30989833838ebfb13567f20fe1a99103890f39193528e08fba125","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-11-26T16:19:43Z","title_canon_sha256":"55d349bf575d44fa5df5be89065dda195b7c0efb36d65ac28dfed49bc02a2c31"},"schema_version":"1.0","source":{"id":"2311.15345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.15345","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"2311.15345v1","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15345","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"5XUBR33CUMFY","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"pith_short_16","alias_value":"5XUBR33CUMFYUSTD","created_at":"2026-07-05T07:17:02Z"},{"alias_kind":"pith_short_8","alias_value":"5XUBR33C","created_at":"2026-07-05T07:17:02Z"}],"graph_snapshots":[{"event_id":"sha256:b5448895b72ffc9b94c18dec630218bc4d7d04f7b246ea1a145d390606719426","target":"graph","created_at":"2026-07-05T07:17: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.15345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic influence maximization problem (DIMP) aims to maintain a group of influential users within an evolving social network, so that the influence scope can be maximized at any given moment. A primary category of DIMP algorithms focuses on the renewal of reverse reachable (RR) sets, which is designed for static social network scenarios, to accelerate the estimation of influence spread. And the generation time of RR sets plays a crucial role in algorithm efficiency. However, their update approaches require sequential updates for each edge change, leading to considerable computational cost. In","authors_text":"Ke Tang, Shaofeng Zhang, Shengcai Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-11-26T16:19:43Z","title":"A Sample Reuse Strategy for Dynamic Influence Maximization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15345","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:d2874cb0ce0294a84c45fdc835de4d278e9f0f422af2894c0abd230d1c47875a","target":"record","created_at":"2026-07-05T07:17: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":"300130bfc6f30989833838ebfb13567f20fe1a99103890f39193528e08fba125","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-11-26T16:19:43Z","title_canon_sha256":"55d349bf575d44fa5df5be89065dda195b7c0efb36d65ac28dfed49bc02a2c31"},"schema_version":"1.0","source":{"id":"2311.15345","kind":"arxiv","version":1}},"canonical_sha256":"ede818ef62a30b8a4a636e0d2884d684b05e9a9fe3e75bad72700b0808742f4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede818ef62a30b8a4a636e0d2884d684b05e9a9fe3e75bad72700b0808742f4e","first_computed_at":"2026-07-05T07:17:02.072098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:17:02.072098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SSV+vjT/PpjTs9ndKhBJ9262DR7krWyitb8IauWZ/0RFiwNPSgsQtLur4F1BRhwNghYC5S/te9A/4YE6CMOfBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:17:02.072485Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.15345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2874cb0ce0294a84c45fdc835de4d278e9f0f422af2894c0abd230d1c47875a","sha256:b5448895b72ffc9b94c18dec630218bc4d7d04f7b246ea1a145d390606719426"],"state_sha256":"1ef69ddf3ac24d2d3b40681825beeeb3f455feaac6c234c352cec4b84c9c4ba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLvktP9ByAAnohxuwSKVQfIRRLxnFycB3PCeaUZQJ85yk1WQN4FmaT5VOw45hvQLT5sJ4ufHHmJvNVTmwfKwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T22:01:13.023559Z","bundle_sha256":"850b3149ede3eca87f2391006d1f28842438166eb41b03d1e0543ae217933a6a"}}