{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FXZTUMGPYBM5MAJVGEU4XH26KO","short_pith_number":"pith:FXZTUMGP","canonical_record":{"source":{"id":"2204.06250","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-04-13T08:41:10Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"ad9f328fafb0cb7781131870fe4c5d7eb5eada2d10c6abd2dd94bc7168726b64","abstract_canon_sha256":"1d2625abcb32ba8c36099333735c43eaa86227cbcfbf107aa77e1c611799e5b9"},"schema_version":"1.0"},"canonical_sha256":"2df33a30cfc059d601353129cb9f5e53b4e31182856e7dc241235cbb9fc71272","source":{"kind":"arxiv","id":"2204.06250","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.06250","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"2204.06250v3","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.06250","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"FXZTUMGPYBM5","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"pith_short_16","alias_value":"FXZTUMGPYBM5MAJV","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"pith_short_8","alias_value":"FXZTUMGP","created_at":"2026-07-05T04:48:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FXZTUMGPYBM5MAJVGEU4XH26KO","target":"record","payload":{"canonical_record":{"source":{"id":"2204.06250","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-04-13T08:41:10Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"ad9f328fafb0cb7781131870fe4c5d7eb5eada2d10c6abd2dd94bc7168726b64","abstract_canon_sha256":"1d2625abcb32ba8c36099333735c43eaa86227cbcfbf107aa77e1c611799e5b9"},"schema_version":"1.0"},"canonical_sha256":"2df33a30cfc059d601353129cb9f5e53b4e31182856e7dc241235cbb9fc71272","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:48.315084Z","signature_b64":"UizHomr/RWMgSQb528BuNV3dU+FSZYz6Y0PHtPrU8U7NRpmD2Xqw+VZvRGwXD2a1wHWDPgtHL+TbEzUn7BV4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2df33a30cfc059d601353129cb9f5e53b4e31182856e7dc241235cbb9fc71272","last_reissued_at":"2026-07-05T04:48:48.314492Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:48.314492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.06250","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ujacua0lW+gLvXATyuK+Mk7UbCOboCgpQB3JmMdM7BRpUkmmU9RKaqSj6Su4oPD+cM3p/RWwVXTHf3UPOTJWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:38:46.516690Z"},"content_sha256":"4f2e700c238c6746f40a4f9b565a8a1a25209f5aa6257ea5a4d2749062d92b2c","schema_version":"1.0","event_id":"sha256:4f2e700c238c6746f40a4f9b565a8a1a25209f5aa6257ea5a4d2749062d92b2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FXZTUMGPYBM5MAJVGEU4XH26KO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-scale multi-objective influence maximisation with network downscaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.SI","authors_text":"Doina Bucur, Elia Cunegatti, Giovanni Iacca","submitted_at":"2022-04-13T08:41:10Z","abstract_excerpt":"Finding the most influential nodes in a network is a computationally hard problem with several possible applications in various kinds of network-based problems. While several methods have been proposed for tackling the influence maximisation (IM) problem, their runtime typically scales poorly when the network size increases. Here, we propose an original method, based on network downscaling, that allows a multi-objective evolutionary algorithm (MOEA) to solve the IM problem on a reduced scale network, while preserving the relevant properties of the original network. The downscaled solution is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.06250","kind":"arxiv","version":3},"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/2204.06250/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"giTBwFWZfSGA2lpAucviL5nMTpY17UpGKJL72Td5PrD6KOK2Hf9P5iHzPTyVlo69FtEpyPgeH2tc5QILS5eYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:38:46.517041Z"},"content_sha256":"120ce01242815f0284bbd6ff4f3c6dd9e31f1f2e90ee1d144837a23d57fa8e62","schema_version":"1.0","event_id":"sha256:120ce01242815f0284bbd6ff4f3c6dd9e31f1f2e90ee1d144837a23d57fa8e62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXZTUMGPYBM5MAJVGEU4XH26KO/bundle.json","state_url":"https://pith.science/pith/FXZTUMGPYBM5MAJVGEU4XH26KO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXZTUMGPYBM5MAJVGEU4XH26KO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-23T13:38:46Z","links":{"resolver":"https://pith.science/pith/FXZTUMGPYBM5MAJVGEU4XH26KO","bundle":"https://pith.science/pith/FXZTUMGPYBM5MAJVGEU4XH26KO/bundle.json","state":"https://pith.science/pith/FXZTUMGPYBM5MAJVGEU4XH26KO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXZTUMGPYBM5MAJVGEU4XH26KO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FXZTUMGPYBM5MAJVGEU4XH26KO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1d2625abcb32ba8c36099333735c43eaa86227cbcfbf107aa77e1c611799e5b9","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-04-13T08:41:10Z","title_canon_sha256":"ad9f328fafb0cb7781131870fe4c5d7eb5eada2d10c6abd2dd94bc7168726b64"},"schema_version":"1.0","source":{"id":"2204.06250","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.06250","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"2204.06250v3","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.06250","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"FXZTUMGPYBM5","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"pith_short_16","alias_value":"FXZTUMGPYBM5MAJV","created_at":"2026-07-05T04:48:48Z"},{"alias_kind":"pith_short_8","alias_value":"FXZTUMGP","created_at":"2026-07-05T04:48:48Z"}],"graph_snapshots":[{"event_id":"sha256:120ce01242815f0284bbd6ff4f3c6dd9e31f1f2e90ee1d144837a23d57fa8e62","target":"graph","created_at":"2026-07-05T04:48:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2204.06250/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding the most influential nodes in a network is a computationally hard problem with several possible applications in various kinds of network-based problems. While several methods have been proposed for tackling the influence maximisation (IM) problem, their runtime typically scales poorly when the network size increases. Here, we propose an original method, based on network downscaling, that allows a multi-objective evolutionary algorithm (MOEA) to solve the IM problem on a reduced scale network, while preserving the relevant properties of the original network. The downscaled solution is t","authors_text":"Doina Bucur, Elia Cunegatti, Giovanni Iacca","cross_cats":["cs.AI","cs.LG","cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-04-13T08:41:10Z","title":"Large-scale multi-objective influence maximisation with network downscaling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.06250","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4f2e700c238c6746f40a4f9b565a8a1a25209f5aa6257ea5a4d2749062d92b2c","target":"record","created_at":"2026-07-05T04:48:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1d2625abcb32ba8c36099333735c43eaa86227cbcfbf107aa77e1c611799e5b9","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-04-13T08:41:10Z","title_canon_sha256":"ad9f328fafb0cb7781131870fe4c5d7eb5eada2d10c6abd2dd94bc7168726b64"},"schema_version":"1.0","source":{"id":"2204.06250","kind":"arxiv","version":3}},"canonical_sha256":"2df33a30cfc059d601353129cb9f5e53b4e31182856e7dc241235cbb9fc71272","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2df33a30cfc059d601353129cb9f5e53b4e31182856e7dc241235cbb9fc71272","first_computed_at":"2026-07-05T04:48:48.314492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:48.314492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UizHomr/RWMgSQb528BuNV3dU+FSZYz6Y0PHtPrU8U7NRpmD2Xqw+VZvRGwXD2a1wHWDPgtHL+TbEzUn7BV4Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:48.315084Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.06250","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f2e700c238c6746f40a4f9b565a8a1a25209f5aa6257ea5a4d2749062d92b2c","sha256:120ce01242815f0284bbd6ff4f3c6dd9e31f1f2e90ee1d144837a23d57fa8e62"],"state_sha256":"d9f2a82ad5230fe9aedea9f5de7610e54e9f2a046b5e7002467ae4211153f758"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+j269aeAteijoiIIG76CQ5dfP4U+u/OwqxOatMB1FGXQW7mSfm1CDMH0CovCeIsM0pr4ryZR5JU5NfkAGd5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T13:38:46.520958Z","bundle_sha256":"6c1665e0961d1c871505840da4d02549c8912585ccacefc80a6a3498e303c7e4"}}