{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:25T74IAA7PB4ILJGHLHITN6PPC","short_pith_number":"pith:25T74IAA","schema_version":"1.0","canonical_sha256":"d767fe2000fbc3c42d263ace89b7cf78a2eb931e1b0866b1ebf17fb8ef170a8a","source":{"kind":"arxiv","id":"2403.18755","version":2},"attestation_state":"computed","paper":{"title":"Many-Objective Evolutionary Influence Maximization: Balancing Spread, Budget, Fairness, and Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.NE","authors_text":"Elia Cunegatti, Giovanni Iacca, Leonardo Lucio Custode","submitted_at":"2024-03-27T16:54:45Z","abstract_excerpt":"The Influence Maximization (IM) problem seeks to discover the set of nodes in a graph that can spread the information propagation at most. This problem is known to be NP-hard, and it is usually studied by maximizing the influence (spread) and, optionally, optimizing a second objective, such as minimizing the seed set size or maximizing the influence fairness. However, in many practical scenarios multiple aspects of the IM problem must be optimized at the same time. In this work, we propose a first case study where several IM-specific objective functions, namely budget, fairness, communities, a"},"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":"2403.18755","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-03-27T16:54:45Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"e1f72e78b1e7e73365b810a9cd684d91dd6a3c8dda6f9a35f58af5bfa8c29491","abstract_canon_sha256":"10825ceb3bc3f7f1470ec0dd207a3619bc61ec93bc1bcf1e93aae6f66709163a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:39.926810Z","signature_b64":"j0iC3SD62/IYJ5iQeDDW1Ez8cvEIAWNYOv2DA1OeFXI2pPQW3NdcUF9NxXCMDsavtd2NXggrsjyDrzwrlaGlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d767fe2000fbc3c42d263ace89b7cf78a2eb931e1b0866b1ebf17fb8ef170a8a","last_reissued_at":"2026-07-05T08:01:39.926323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:39.926323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many-Objective Evolutionary Influence Maximization: Balancing Spread, Budget, Fairness, and Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.NE","authors_text":"Elia Cunegatti, Giovanni Iacca, Leonardo Lucio Custode","submitted_at":"2024-03-27T16:54:45Z","abstract_excerpt":"The Influence Maximization (IM) problem seeks to discover the set of nodes in a graph that can spread the information propagation at most. This problem is known to be NP-hard, and it is usually studied by maximizing the influence (spread) and, optionally, optimizing a second objective, such as minimizing the seed set size or maximizing the influence fairness. However, in many practical scenarios multiple aspects of the IM problem must be optimized at the same time. In this work, we propose a first case study where several IM-specific objective functions, namely budget, fairness, communities, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18755","kind":"arxiv","version":2},"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/2403.18755/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":"2403.18755","created_at":"2026-07-05T08:01:39.926381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.18755v2","created_at":"2026-07-05T08:01:39.926381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18755","created_at":"2026-07-05T08:01:39.926381+00:00"},{"alias_kind":"pith_short_12","alias_value":"25T74IAA7PB4","created_at":"2026-07-05T08:01:39.926381+00:00"},{"alias_kind":"pith_short_16","alias_value":"25T74IAA7PB4ILJG","created_at":"2026-07-05T08:01:39.926381+00:00"},{"alias_kind":"pith_short_8","alias_value":"25T74IAA","created_at":"2026-07-05T08:01:39.926381+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05965","citing_title":"Beyond Compromise: Pareto-Lenient Consensus for Efficient Multi-Preference LLM Alignment","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC","json":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC.json","graph_json":"https://pith.science/api/pith-number/25T74IAA7PB4ILJGHLHITN6PPC/graph.json","events_json":"https://pith.science/api/pith-number/25T74IAA7PB4ILJGHLHITN6PPC/events.json","paper":"https://pith.science/paper/25T74IAA"},"agent_actions":{"view_html":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC","download_json":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC.json","view_paper":"https://pith.science/paper/25T74IAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.18755&json=true","fetch_graph":"https://pith.science/api/pith-number/25T74IAA7PB4ILJGHLHITN6PPC/graph.json","fetch_events":"https://pith.science/api/pith-number/25T74IAA7PB4ILJGHLHITN6PPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC/action/storage_attestation","attest_author":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC/action/author_attestation","sign_citation":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC/action/citation_signature","submit_replication":"https://pith.science/pith/25T74IAA7PB4ILJGHLHITN6PPC/action/replication_record"}},"created_at":"2026-07-05T08:01:39.926381+00:00","updated_at":"2026-07-05T08:01:39.926381+00:00"}