{"as_of":"2026-08-22T07:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:be08ecfea875093b2ac9c111707faec9cc5fd386e0f7331f9e475d4548c0cd62","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:41:26.082966Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.08406/citation-record","integrity":"/paper/2608.08406/integrity","json":"/paper/2608.08406/citation-record.json","paper":"/paper/2608.08406"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"cs/0310049","last_updated":"2003-10-25T16:03:58Z","snapshot_observed_at":"2026-08-07T03:52:13.153712Z","submitted_at":"2003-10-25T16:03:58Z","title":"An O(m) Algorithm for Cores Decomposition of Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0310049","snapshot_observed_at":"2026-08-14T04:41:25.736142Z","title":"An o (m) algorithm for cores decomposition of networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.736142Z"},"links":{"cited_paper":"/paper/cs/0310049","citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:b8f478198f8157773904b42f261180e2a4db55b8d9f6a85d47f5e19c0486709a","observation_id":"2f1c4391-6b2c-43c0-82c1-13a062fa0cbd","resolution":{"observed_at":"2026-08-14T04:41:25.736142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:26.610680Z","title":null,"venue":null,"work_id":"d362c6d3-b05a-48f2-82af-7e393b576bff","year":2019},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:26.082966Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:3f488d065bdef547e1c00f01072e9075c4e603347fca8e69659ca38eb554ce15","observation_id":"182278a7-ac79-40f9-9270-d754229a2a1b","resolution":{"observed_at":"2026-08-14T04:41:26.622885Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:27.497201Z","title":"Qintian Guo, Sibo Wang, Zhewei Wei, and Ming Chen","venue":null,"work_id":"78efdc8a-2953-468e-9dd3-42cd55ca39e0","year":2020},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":1978,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.805190Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:23754cf7a68512b6ca2e1461ab5cf89654c66a66be0168c81de40e8284409014","observation_id":"8d8f9e8a-4a34-4877-bf01-e1c2fa6abafa","resolution":{"observed_at":"2026-08-14T04:41:27.513644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:26.947133Z","title":"Dynaflux: Implicit dynamics-preserving reinforcement learning for topology-free influence maximization","venue":null,"work_id":"58bccabf-bbca-4d4f-ad44-031bbac136e4","year":2026},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:26.001951Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:e8048372cb8b98bded9356133ce73fd8d229993dca4d4a69bb315b390b03d4d7","observation_id":"fa8e3ead-78d8-4ee3-97bc-6e6863268c67","resolution":{"observed_at":"2026-08-14T04:41:26.984838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.07378","last_updated":"2019-06-18T04:54:26Z","snapshot_observed_at":"2026-08-14T16:14:11.165259Z","submitted_at":"2019-06-18T04:54:26Z","title":"DISCO: Influence Maximization Meets Network Embedding and Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.07378","snapshot_observed_at":"2026-08-14T04:41:25.853053Z","title":"Disco: Influence maximization meets network embedding and deep learning.arXiv preprint arXiv:1906.07378, 2019a","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.853053Z"},"links":{"cited_paper":"/paper/1906.07378","citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:eb85ff7aa4ecfbb0d594e41802ea44488f47e666e7ec58bc9690b08ed6887741","observation_id":"827fabe1-c8d7-4d34-8a6f-f0f91702fdad","resolution":{"observed_at":"2026-08-14T04:41:25.853053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:27.274772Z","title":"Online processing algorithms for influence maximization","venue":null,"work_id":"9e36ee53-d0d8-4eed-8178-31ab71d99ef6","year":2018},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.914720Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:20cf6fca9d0b5c339140fd7fca1a7003e7071e710c4fefba8d69c9153b6d31f6","observation_id":"21ba576a-d950-49f2-b510-0976ae245f76","resolution":{"observed_at":"2026-08-14T04:41:27.302776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:27.072178Z","title":"Influence maximization in near-linear time: A martingale approach","venue":null,"work_id":"0daa794f-c9d4-4ea1-aaae-1b5d8ff54b91","year":2015},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.980594Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:bf173b0521f5431b9c509c574936d21f3f5569282898b2eaf751c0c142a118c9","observation_id":"e680c4b9-49a6-44fe-8cf8-a5c1231e95d5","resolution":{"observed_at":"2026-08-14T04:41:27.099798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1202.3162","last_updated":"2013-08-12T21:35:28Z","snapshot_observed_at":"2026-08-16T19:44:23.537354Z","submitted_at":"2012-02-14T21:56:54Z","title":"Social Contagion: An Empirical Study of Information Spread on Digg and Twitter Follower Graphs","version":2},"cited_work":{"arxiv_id":"1202.3162","doi":null,"metadata_source":"pith","pith_arxiv_id":"1202.3162","snapshot_observed_at":"2026-08-14T04:41:26.323537Z","title":"Social Contagion: An Empirical Study of Information Spread on Digg and Twitter Follower Graphs","venue":"cs.SI","work_id":"e6026627-0451-4987-9959-a8b0cb06b3ef","year":2012},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.827196Z"},"links":{"cited_paper":"/paper/1202.3162","citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:a6973d01b9c524fe70f56fcf303ea26cc82af1e5e22332d0775b4ad605d7d1a7","observation_id":"ffc60157-d8b7-4821-943a-02f98a7e2528","resolution":{"observed_at":"2026-08-14T04:41:26.364755Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:26.689431Z","title":"All models are trained for 200 epochs using AdamW (Kingma & Ba, 2015; Loshchilov & Hutter,","venue":null,"work_id":"b4cb37d4-4222-4377-b269-65595b812795","year":2015},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:26.064749Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:fe706e2e63b46c1d53e63486a37be1fd04faaf06f2640053215b315565e194ae","observation_id":"4d60c367-7430-4868-9263-d936855f1ad6","resolution":{"observed_at":"2026-08-14T04:41:26.707100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:27.172442Z","title":"Influence maximization: Near-optimal time complexity meets practical efficiency","venue":null,"work_id":"8bd8ec0c-0f56-4a70-80fe-ed6b1c68d7ee","year":2014},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.945166Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:565f0d84a53fcf84f485e7b52cf7d4fb15e33dece64857a877b80036fa24faa4","observation_id":"eadb6a97-a3fe-42e3-992c-6a7bfe811d9a","resolution":{"observed_at":"2026-08-14T04:41:27.204746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:27.591886Z","title":"Pyg 2.0: Scalable learning on real world graphs","venue":null,"work_id":"b5d49e29-96a4-4495-a12a-8215ec8f0fbc","year":2025},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.774766Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:d71302c9a59e3ec32c233e484f707888b51b174470bd1d6eef09fe67b9a68f16","observation_id":"221dcee1-6950-4725-bfb7-914040acea85","resolution":{"observed_at":"2026-08-14T04:41:27.610841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:26.794599Z","title":"While these architectural improvements enhance predictive capacity, they also introduce training complexity","venue":null,"work_id":"e4dbe20f-f32b-4cae-abe1-8ee9a4d2d1b3","year":2023},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:26.048239Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:2f941b1670b0fc3f96a90649234f85db35336cf511ce99a977c1c97c448c45e2","observation_id":"b09b6ceb-24e4-4641-895a-4fdcfca393f4","resolution":{"observed_at":"2026-08-14T04:41:26.809413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:27.383642Z","title":"Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks","venue":null,"work_id":"1a3713de-efca-4d0b-8515-dff4684909ae","year":2016},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:25.894786Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:4ed657b63b73eb1708e0390cf094a5c2f9c94aca5c775c66b66cf82878ba88b2","observation_id":"52744ce8-298b-4ab9-b33d-ebaca0b526e5","resolution":{"observed_at":"2026-08-14T04:41:27.403151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:41:26.889263Z","title":"Specifically, it replaces conventional message-passing networks with a sheaf neural network (Hansen & Gebhart, 2020; Bodnar et al.,","venue":null,"work_id":"9fd1e0b8-6c60-4362-bc8c-221fb971d7ae","year":2020},"citing_paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-14T04:41:26.034753Z"},"links":{"citing_paper":"/paper/2608.08406"},"observation_digest":"sha256:a5f6e7b33adae35bad1e0ec2bba30df7ba9333c5d6c9a8e69d8a3a74b10b043d","observation_id":"c382df30-cedc-4824-ac6b-670955a5b6ad","resolution":{"observed_at":"2026-08-14T04:41:26.901309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.08406","last_updated":"2026-08-09T01:47:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T04:34:04.666094Z","submitted_at":"2026-08-09T01:47:51Z","title":"Rethinking Learning-Based Influence Maximization: Simple Neural Surrogates and Native Discrete Search"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":14},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2608.08406."}