{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FD7RTXB4UITA432J26FL7WO5QJ","short_pith_number":"pith:FD7RTXB4","schema_version":"1.0","canonical_sha256":"28ff19dc3ca2260e6f49d78abfd9dd826e0792eb10342aa814fa1a1c818a9c36","source":{"kind":"arxiv","id":"2405.09185","version":1},"attestation_state":"computed","paper":{"title":"Influence Maximization in Hypergraphs Using A Genetic Algorithm with New Initialization and Evaluation Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.SI","authors_text":"Qiang Zhang, Renquan Zhang, Wenbin Pei, Xilong Qu, Xirong Xu, Yingchao Yang","submitted_at":"2024-05-15T08:46:33Z","abstract_excerpt":"Influence maximization (IM) is a crucial optimization task related to analyzing complex networks in the real world, such as social networks, disease propagation networks, and marketing networks. Publications to date about the IM problem focus mainly on graphs, which fail to capture high-order interaction relationships from the real world. Therefore, the use of hypergraphs for addressing the IM problem has been receiving increasing attention. However, identifying the most influential nodes in hypergraphs remains challenging, mainly because nodes and hyperedges are often strongly coupled and cor"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.09185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-05-15T08:46:33Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"e9b8c3d5d056b44c542709662a1670f393aceee3b703313cb1d2a1ca95e375e5","abstract_canon_sha256":"4089a374ed5330e7f6074057a3927e96488a45609f57917cdd313ce2148c273c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:27.100979Z","signature_b64":"qJxCYg37LecwfA9uqQHbxHgIzV/l4QYKFVfVN/EpmgYkPnmFwBT2dAhqvoYNhpsRQHOA6uO1cX22W9GhinL0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28ff19dc3ca2260e6f49d78abfd9dd826e0792eb10342aa814fa1a1c818a9c36","last_reissued_at":"2026-07-05T08:19:27.100352Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:27.100352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Influence Maximization in Hypergraphs Using A Genetic Algorithm with New Initialization and Evaluation Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.SI","authors_text":"Qiang Zhang, Renquan Zhang, Wenbin Pei, Xilong Qu, Xirong Xu, Yingchao Yang","submitted_at":"2024-05-15T08:46:33Z","abstract_excerpt":"Influence maximization (IM) is a crucial optimization task related to analyzing complex networks in the real world, such as social networks, disease propagation networks, and marketing networks. Publications to date about the IM problem focus mainly on graphs, which fail to capture high-order interaction relationships from the real world. Therefore, the use of hypergraphs for addressing the IM problem has been receiving increasing attention. However, identifying the most influential nodes in hypergraphs remains challenging, mainly because nodes and hyperedges are often strongly coupled and cor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09185","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/2405.09185/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.09185","created_at":"2026-07-05T08:19:27.100432+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.09185v1","created_at":"2026-07-05T08:19:27.100432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09185","created_at":"2026-07-05T08:19:27.100432+00:00"},{"alias_kind":"pith_short_12","alias_value":"FD7RTXB4UITA","created_at":"2026-07-05T08:19:27.100432+00:00"},{"alias_kind":"pith_short_16","alias_value":"FD7RTXB4UITA432J","created_at":"2026-07-05T08:19:27.100432+00:00"},{"alias_kind":"pith_short_8","alias_value":"FD7RTXB4","created_at":"2026-07-05T08:19:27.100432+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15746","citing_title":"Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ","json":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ.json","graph_json":"https://pith.science/api/pith-number/FD7RTXB4UITA432J26FL7WO5QJ/graph.json","events_json":"https://pith.science/api/pith-number/FD7RTXB4UITA432J26FL7WO5QJ/events.json","paper":"https://pith.science/paper/FD7RTXB4"},"agent_actions":{"view_html":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ","download_json":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ.json","view_paper":"https://pith.science/paper/FD7RTXB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.09185&json=true","fetch_graph":"https://pith.science/api/pith-number/FD7RTXB4UITA432J26FL7WO5QJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FD7RTXB4UITA432J26FL7WO5QJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ/action/storage_attestation","attest_author":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ/action/author_attestation","sign_citation":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ/action/citation_signature","submit_replication":"https://pith.science/pith/FD7RTXB4UITA432J26FL7WO5QJ/action/replication_record"}},"created_at":"2026-07-05T08:19:27.100432+00:00","updated_at":"2026-07-05T08:19:27.100432+00:00"}