{"as_of":"2026-08-06T13:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9564fa321dd2f53a86da5fa9385bd61b3cca042dda96fff621952520872f2201","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T07:52:03.319874Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2604.15746/citation-record","integrity":"/paper/2604.15746/integrity","json":"/paper/2604.15746/citation-record.json","paper":"/paper/2604.15746"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Technology adoption in online social networks","venue":null,"work_id":"da3bf113-5b7f-41b7-9bc5-db94a9af19b7","year":2011},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:184241a25113addd75dd316400df48540e06ab0ca7208cccb5ade4853875627c","observation_id":"7f7a23a7-0963-4168-ab3e-058138c2ce83","resolution":{"observed_at":"2026-05-21T12:30:08.721788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Interpersonal communication in social networking sites: An investigation in the framework of uses and gratifica- tion theory","venue":null,"work_id":"b5cdb63b-1617-4ea0-96af-e2010a743c98","year":2018},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:13f4a22194a5b71ba793f1297444fa56c5ad8b71404cecdd90bd20622dd85b77","observation_id":"08df4f05-4029-4dcb-a737-795f91f9626f","resolution":{"observed_at":"2026-05-21T12:30:08.743071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Twenty years of social media marketing: A systematic review, integrative framework, and future research agenda","venue":null,"work_id":"7b545fcf-1d80-4a2b-9c6f-e0d098e23759","year":2024},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:af1cdc87ec93c625590602b7091cc9dd380b91b46fd448cb27582d8514816af1","observation_id":"397214fa-feb2-4305-bb8b-e72903d81587","resolution":{"observed_at":"2026-05-21T12:30:08.706828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence maximization on temporal networks: a review","venue":null,"work_id":"8931d64e-4db1-4b98-acb9-a3947dc7a4da","year":2024},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:1b7875848f51d9c3642237edf7e6db4bb828519bbcb656174e7cba8e433c9331","observation_id":"97fc5477-e4c2-4d27-a3d2-088616517a16","resolution":{"observed_at":"2026-05-21T12:30:08.731132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Maximizing the spread of influence through a social network","venue":null,"work_id":"ba304521-a180-4173-88cd-a6207b28a085","year":2003},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:39c9684d296d843b5f9d1d96389d97b1f592506ba0587337cf946f0912fdcd41","observation_id":"a06f346e-1bce-4365-945f-a65f742cabcf","resolution":{"observed_at":"2026-05-21T12:30:08.697892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence maximization based on threshold models in hypergraphs","venue":null,"work_id":"7ab8a35b-de0a-4e1a-a4c5-1454d8390cf9","year":2024},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:ade18aff0a8add321e9cd97e6ee31af9ea42dfecfec360b60cba7e2714cff88d","observation_id":"59fe6918-f220-4227-b038-01937e98ee30","resolution":{"observed_at":"2026-05-21T12:30:08.695008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence maximization on large-scale mobile social network: a divide-and-conquer method","venue":null,"work_id":"49659a9d-a945-4d9e-91d7-026970385290","year":2014},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:4414e33613aa1aab7de8a138fd6263daf114b8e273ad6e4765290509c14d9dc2","observation_id":"d663b600-d150-4042-97e3-516dda3283d9","resolution":{"observed_at":"2026-05-21T12:30:08.703626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A survey on influence maximization in a social network","venue":null,"work_id":"29e01ceb-089b-4c2b-8e6d-ed72bff0a559","year":2020},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:69f9ec29ededed85cbc11e97a92d9cf87e571a86ec5fe94f250dfc233303e9f1","observation_id":"d5664f54-b700-490f-b0a2-3dbbb111f677","resolution":{"observed_at":"2026-05-21T12:30:08.712670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Outbreak minimization vs influence maximization: an optimization framework","venue":null,"work_id":"80e41ea4-262f-4aef-87c5-23e8aee256bd","year":2020},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:9e7fda589da27778ca98760859d85f9231d72cb77590de925b004fe822e8c578","observation_id":"2e766d1e-3094-422e-aca7-acdbc36cc9ab","resolution":{"observed_at":"2026-05-21T12:30:08.745934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Social influence maximization under em- pirical influence models","venue":null,"work_id":"662a1b7b-00f2-412a-beab-d801cab00483","year":2018},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:3fb6c00fe63290cdc5118f5c745ac80fb004725d3cb0763bdf6cc5c243861936","observation_id":"7fe7be16-8de0-4482-9b36-e0936d61ffda","resolution":{"observed_at":"2026-05-21T12:30:08.685792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Recent advances in information diffusion and influence maximization in complex social networks","venue":null,"work_id":"1afb0aa1-d084-4e3d-b6d6-cf7dc65f927a","year":2014},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:15e44df4179e859ed47a1f398521860fc3039e9062b9223623abe6e178f2108c","observation_id":"dada6ce8-e94a-4f1e-a4d7-36c19a4a4d61","resolution":{"observed_at":"2026-05-21T12:30:08.734158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence maximization based on network motifs in mobile social networks","venue":null,"work_id":"28f32f87-8a48-4efb-93cc-dfdcbdce23e8","year":2022},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:9c3a430bbb00cb9a4a1947f6e2e3515d004bebf2fa9c091e5659e5dcdada66dc","observation_id":"1e8970f2-e07e-4792-97a9-a1ff7cfbc068","resolution":{"observed_at":"2026-05-21T12:30:08.700804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Online processing algorithms for influence maximization","venue":null,"work_id":"f23ccdb9-82f0-4b83-8cde-3b4d7dac5d72","year":2018},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:d94f05a00a6bcb0ec04694efe6152c0c0896a3f7c6e2355cd45c43bf6c0f2074","observation_id":"6eff52a2-f962-41e1-a939-d526eb3bc847","resolution":{"observed_at":"2026-05-21T12:30:08.804715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A survey on influence maximization: From an ml-based combinatorial optimization","venue":null,"work_id":"57d67ae7-cc3b-4cd5-8e80-8eefde7fab8f","year":2023},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:1e4b3f2432a3d5cd6a45ce603a7bdca35e86f9abd95c41a9b9b541d76591edf2","observation_id":"664113a3-3427-45a7-8e4c-4244758b6ec2","resolution":{"observed_at":"2026-05-21T12:30:08.799280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence max- imization in social networks using graph embedding and graph neural network","venue":null,"work_id":"e77b8e52-5f19-4d65-9b13-d17ba6f565d1","year":2022},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:9c9d3e75db3478c5cc4d96065893e696d35ae38586c42a7b0d4978c60ebf4c04","observation_id":"3779eaea-3256-4163-acee-0248386abc33","resolution":{"observed_at":"2026-05-21T12:30:08.737176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Smg: Fast scalable greedy algorithm for influence maximization in social networks","venue":null,"work_id":"500b8462-514a-4449-8faa-4509f9d38c5f","year":2015},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:ca6dcd404ad60cf9b36846adde4efac2ebcdd9adadc9d4011074c35a37d1e25f","observation_id":"c74e8ab3-9183-4c9c-97dd-e11a06b04f8b","resolution":{"observed_at":"2026-05-21T12:30:08.752493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence maximization on social graphs: A survey","venue":null,"work_id":"8368c61e-2ab4-4837-af96-2830dcf356fa","year":2018},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:eee07e5a12bfd8346ad3ccf6354ad2bbbe61b7732dbefad1a5291162c9d8ceff","observation_id":"c0c34080-4ed5-4c1e-b24c-c91aae9190ce","resolution":{"observed_at":"2026-05-21T12:30:08.769455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Networks beyond pairwise interactions: Structure and dynamics","venue":null,"work_id":"f8c276be-68f0-453e-8beb-5aba93a055b4","year":2020},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:96e4912f72118d316e6ca6cf8f48536416bfe415b3c433c2b5af33d87f2a692d","observation_id":"99f309e7-a111-40af-a0d8-20d56ba5b5da","resolution":{"observed_at":"2026-05-21T12:30:08.766922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Social contagion models on hypergraphs","venue":null,"work_id":"e4f24326-a1f5-4c83-afb1-7a1b3edee69d","year":2020},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:35c7aa5b682d46bc4b9063cb49cc4c58ff85e350d4210c39309373044c2ae6d7","observation_id":"d8c34f98-78eb-43ba-9287-ecc8b27bbb61","resolution":{"observed_at":"2026-05-21T12:30:08.779762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Social influence maximization in hypergraph in social networks","venue":null,"work_id":"bdb85f0d-ff75-42ab-a02c-ab9d9ebcd468","year":2018},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:5ec433853d19ee5d1a5676bdbd25bae06fc18d9304143fdb115f47df82404307","observation_id":"72ac4fa1-ba57-4095-9439-0ac2b970c4a5","resolution":{"observed_at":"2026-05-21T12:30:08.777068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Social influence maximization in hypergraphs","venue":null,"work_id":"00da5b22-1d4a-4c15-8562-3419eedf2726","year":2021},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:c5abfde41ef568527c138b9e157dd73f45aa6b4468c1d8c79b13b2f06cf98036","observation_id":"806686b5-44f0-4941-abbc-6e83ffcf7863","resolution":{"observed_at":"2026-05-21T12:30:08.764041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence maximization in hypergraphs: A self- optimizing algorithm based on electrostatic field","venue":null,"work_id":"4f63f043-669f-4a1a-94b3-67c2f071411f","year":2023},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:cdb2ea439b9869606bb74119aca3d3ab521fc21662b53b176dba295307b57543","observation_id":"fcab1c84-a765-4f2f-9dc0-5b51125fa292","resolution":{"observed_at":"2026-05-21T12:30:08.791125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Hedv-greedy: An advanced algorithm for influence maximization in hypergraphs","venue":null,"work_id":"bf134fff-4e47-4250-945c-3e71986f6b14","year":2024},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:610549e22f10583ce6cd971f9febb8d7c15ba3b30aa91d5e7cdfdfbf861bd0f8","observation_id":"a8f0719e-776c-4883-be39-a406ff9a0a5c","resolution":{"observed_at":"2026-05-21T12:30:08.796568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-09T12:26:17.282451Z","title":"Particle swarm optimization","venue":null,"work_id":"65191184-7d1b-461e-9a5c-cfd15e3bd5a4","year":1995},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:852214ecb0b56e3da19c58f1c24de0cc58e9b79aa79973a2cf86121411a5f822","observation_id":"a231a45b-9eb5-4857-a878-c8c4ca764055","resolution":{"observed_at":"2026-05-21T12:30:08.724766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Community- based influence maximization for viral marketing","venue":null,"work_id":"27ddcc75-a27e-4358-ae4b-77f8bf0efbd5","year":2019},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:35b56d2068cdb1d07c00f71cc1ced6b22a91c4f5e4850c9cc6f7171e9c876954","observation_id":"d1b521fd-2a74-46ce-b2f3-878eea05438c","resolution":{"observed_at":"2026-05-21T12:30:08.728018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Substantial undocumented infection facilitates the rapid dissemination of novel coronavirus (sars-cov-2)","venue":null,"work_id":"32d497d6-c44d-41c4-9aa5-cc0d76495c57","year":2020},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:0f72c237f89513a45fdb0d96dfd6b14d915457c249f35b41cc1fcc5b87c248f3","observation_id":"ecd26bc0-ad29-4b1e-98ca-f2e0fa03b493","resolution":{"observed_at":"2026-05-21T12:30:08.785362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A faster algorithm for betweenness centrality","venue":null,"work_id":"e08d082c-e18a-4081-abb5-9c6f90f8d49c","year":2001},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:e656d8b6c03de86527a42f9145faa3b6c0b3c46f6ff3ebc6eebadcb1706619e8","observation_id":"07f8af16-3726-461d-a42a-8fb14e71f94e","resolution":{"observed_at":"2026-05-21T12:30:08.688816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Ranking of closeness centrality for large-scale social networks","venue":null,"work_id":"3f656cd6-1db9-480c-a8fe-89987fc37366","year":2008},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:614a4bb0998ef192e2fe7f9975dafe301cf5bb68b8983fdf1be3c7b8cacd445e","observation_id":"4b09426d-f5aa-46f6-aff1-c6c62684e8fa","resolution":{"observed_at":"2026-05-21T12:30:08.691867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The anatomy of a large-scale hypertextual web search engine","venue":null,"work_id":"804b2f80-52fd-41e4-b891-b6494805588e","year":1998},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:734e5070d7f3e3b3b1045bbcd763572eb88befe400b1e4990aa83682cd371ce4","observation_id":"3030b1f3-bd8f-4e30-9056-4f61a56f8bf5","resolution":{"observed_at":"2026-05-21T12:30:08.755304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"An efficient adaptive degree-based heuristic algorithm for influence maximization in hyper- graphs","venue":null,"work_id":"2acf3092-9862-43db-904d-5ff1f3444785","year":2023},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:2d224e5852d10eeb1d2c11926796dbdde668a9865bbfeaaf1d7909f0c0d0c280","observation_id":"32987076-f9ce-47a5-972c-34a80f51368f","resolution":{"observed_at":"2026-05-21T12:30:08.749548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Celf++ optimizing the greedy algorithm for influence maximization in social networks","venue":null,"work_id":"dc128e13-e7a1-4406-9e20-88c82f490a01","year":2011},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:4f18b8071cce8f1c465ed8b5c0ca146dec802eb040b9d372046cb178bd9e32e7","observation_id":"652a7cfb-cee0-43bf-83b8-c5285a035679","resolution":{"observed_at":"2026-05-21T12:30:08.758322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence maximization in social networks based on discrete particle swarm optimization","venue":null,"work_id":"6e4cb1ea-f46e-42e1-8652-1d73038de9d0","year":2016},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:79e1223aa6ef64ce85c62ce214babcde1178556c97d5e63d948562129aa0bdb1","observation_id":"55e412ac-2fec-4e2e-a8cd-66de77d54203","resolution":{"observed_at":"2026-05-21T12:30:08.801950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Maximizing the spread of influence via the collective intelligence of discrete bat algorithm","venue":null,"work_id":"303d1492-c3b5-45da-97bf-03fba344a7fc","year":2018},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:6ce3c4d70534c76f2621cd512c4c6b39923c18a363f5c8ef36c00e6bc2246d10","observation_id":"54778163-712a-4444-96da-d9d0fb03a9a6","resolution":{"observed_at":"2026-05-21T12:30:08.793733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks","venue":null,"work_id":"4e4090c4-babd-4744-a4c6-c134c88b734d","year":2020},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:96f53128c3206b2f3aa4d31fe5c9243db5726a7a009772ff92a8859fa912825c","observation_id":"09f3fe86-2b1e-4f2a-9e2d-c312707b427a","resolution":{"observed_at":"2026-05-21T12:30:08.715859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Abem: An adaptive agent-based evolutionary approach for influence maximization in dynamic social networks","venue":null,"work_id":"147dc714-588a-4e66-8602-b7f4ed0fd794","year":2023},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:ce3e343fa5105447450a9063570a74cabf5f91e10c78d56ff9266fffc2a7b865","observation_id":"698c44bd-cb77-4dcb-a9b5-505b7e7f3f05","resolution":{"observed_at":"2026-05-21T12:30:08.719014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Betweenness computation in the single graph representation of hypergraphs","venue":null,"work_id":"8d236568-63f8-4520-a085-a46c0ff246df","year":2013},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:03adda99465a9dd3f2eb7e13aabc632e3f61493e1aa480b3699c52053550757c","observation_id":"3d062b57-38f4-4d7f-a524-0e1e72d6bc63","resolution":{"observed_at":"2026-05-21T12:30:08.761119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09185","last_updated":"2024-05-15T08:46:33Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T08:46:33Z","title":"Influence Maximization in Hypergraphs Using A Genetic Algorithm with New Initialization and Evaluation Methods","version":1},"cited_work":{"arxiv_id":"2405.09185","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.09185","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Influence maximization in hypergraphs using a genetic algorithm with new ini- tialization and evaluation methods","venue":null,"work_id":"7adb0111-b6ec-410a-9fe8-fe313fa4591b","year":2024},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"cited_paper":"/paper/2405.09185","citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:792ea357804a56bcb5bcb6b1260a6bfe0988af72de3e1a4d500180374c58f849","observation_id":"47066c60-7eb7-4be0-818d-25b48b97f883","resolution":{"observed_at":"2026-05-10T07:52:13.552440Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Hyper-imrank: Ranking-based influence max- imization for hypergraphs","venue":null,"work_id":"2ebf47f1-7f89-4352-b511-87d56a6e0677","year":2022},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:edf9e12b0de68b77eac3c5ad7709cd21a6d88a62db69414960cbf5d92d08b9f2","observation_id":"787e3f9e-2e33-4f82-9987-3eaade223b25","resolution":{"observed_at":"2026-05-21T12:30:08.739922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Threshold- limited spreading in social networks with multiple initiators","venue":null,"work_id":"cb888ec7-bd51-4ff2-9242-59eff22f7d52","year":2013},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:2d2af0f0b35953ff0a335e24f2e9cda53ce9c0f227f6186ef826e7a2a85d1832","observation_id":"1f0f4c51-fdeb-4656-87a5-2d0f82b1e75c","resolution":{"observed_at":"2026-05-21T12:30:08.709678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Influence of opinion leaders on dynamics and diffusion of network public opinion","venue":null,"work_id":"ed680c5c-2792-48b8-954e-09df8f1b6e7c","year":2013},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:5e8e852bc23113e2378b6f072ac01e7adf2662a6cda99f2893941c1d8ec606ea","observation_id":"350ba0b8-5fab-455f-957e-888b76bb7fe0","resolution":{"observed_at":"2026-05-21T12:30:08.788243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A discrete binary version of the particle swarm algorithm","venue":null,"work_id":"6295ccf5-6da3-4920-9e1e-73b329241842","year":1997},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:85380dc0a15f805e16d4ad3739d3f178f2f9683923f09a862c2775e47d11d363","observation_id":"092d4641-ad67-48cf-b94b-ace32ff9eb7f","resolution":{"observed_at":"2026-05-21T12:30:08.771812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A modified particle swarm optimizer","venue":null,"work_id":"3d09e5fe-c50c-4d92-a168-af5b3d9651f3","year":1998},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:ad604ae95e28dd16f176c52b53c5275fd0e384613499889a05f21137a15a9067","observation_id":"bb7e92c1-1d0f-4d14-9fe6-664503ace51c","resolution":{"observed_at":"2026-05-21T12:30:08.774174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Searching for superspreaders of information in real-world social me- dia","venue":null,"work_id":"929ee637-5b1a-4914-90b6-00c4801f6319","year":2014},"citing_paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T07:52:03.319874Z"},"links":{"citing_paper":"/paper/2604.15746"},"observation_digest":"sha256:128e418a8e7827ea2a34a290088fda8b794bfeeb630d8149c8031bd4bdb20889","observation_id":"d184f408-3ebc-4dd8-8c1e-fdc621dd8301","resolution":{"observed_at":"2026-05-21T12:30:08.782568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.15746","last_updated":"2026-04-17T06:42:59Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T06:42:59Z","title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":42},"total_outbound_references":43},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2604.15746."}