{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HSOXD2JF3J74RC6THG3B2IKHDS","short_pith_number":"pith:HSOXD2JF","canonical_record":{"source":{"id":"2009.07325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-15T19:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"1a042890ac5d76aa28cc5308fcead8ae643eda8f44bed6cd2a2fe14999e96a59","abstract_canon_sha256":"a253b99387291e3caa2504484f568b26a33c477af354b4578a58a6b884ff02f2"},"schema_version":"1.0"},"canonical_sha256":"3c9d71e925da7fc88bd339b61d21471cb99982d5e17d4c82ea4fdf5c2bbbeb45","source":{"kind":"arxiv","id":"2009.07325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.07325","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"2009.07325v2","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.07325","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"HSOXD2JF3J74","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"pith_short_16","alias_value":"HSOXD2JF3J74RC6T","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"pith_short_8","alias_value":"HSOXD2JF","created_at":"2026-07-05T02:30:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HSOXD2JF3J74RC6THG3B2IKHDS","target":"record","payload":{"canonical_record":{"source":{"id":"2009.07325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-15T19:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"1a042890ac5d76aa28cc5308fcead8ae643eda8f44bed6cd2a2fe14999e96a59","abstract_canon_sha256":"a253b99387291e3caa2504484f568b26a33c477af354b4578a58a6b884ff02f2"},"schema_version":"1.0"},"canonical_sha256":"3c9d71e925da7fc88bd339b61d21471cb99982d5e17d4c82ea4fdf5c2bbbeb45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:42.118399Z","signature_b64":"5EMFquxJv+Hn0p6s1AYwmkd7f9p5wS3F+5mWLnl1BHyEDIetYwFtWWgui+kE6NMpoC3DuPOyrG6SnitWvnc4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c9d71e925da7fc88bd339b61d21471cb99982d5e17d4c82ea4fdf5c2bbbeb45","last_reissued_at":"2026-07-05T02:30:42.117784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:42.117784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.07325","source_version":2,"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-05T02:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yNf8cQ0d6GyemhSlbQsXO6S41nNRO5V/xkGBUlO+wckHSUpnr8/9mly9vn/J/unPZmdbY4BXEECgUMERwqqACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:37:58.797948Z"},"content_sha256":"9a07543f03e01e541871560dc4044154c064546ba27165cd4b16e40bedf67ad9","schema_version":"1.0","event_id":"sha256:9a07543f03e01e541871560dc4044154c064546ba27165cd4b16e40bedf67ad9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HSOXD2JF3J74RC6THG3B2IKHDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"gIM: GPU Accelerated RIS-based Influence Maximization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Matin Hashemi, Saber Salehkaleybar, Soheil Shahrouz","submitted_at":"2020-09-15T19:06:10Z","abstract_excerpt":"Given a social network modeled as a weighted graph $G$, the influence maximization problem seeks $k$ vertices to become initially influenced, to maximize the expected number of influenced nodes under a particular diffusion model. The influence maximization problem has been proven to be NP-hard, and most proposed solutions to the problem are approximate greedy algorithms, which can guarantee a tunable approximation ratio for their results with respect to the optimal solution. The state-of-the-art algorithms are based on Reverse Influence Sampling (RIS) technique, which can offer both computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.07325","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/2009.07325/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-05T02:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnhiB50/ScMgJODBugNFOlCGAe5s3hq1aS3CLdyO7NrtH4cjuNBoqlIdYSuB/KDFfArPNoo3HV3SbV3uYWpABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:37:58.798332Z"},"content_sha256":"08b9f239a710ff2cac1c238ae893a8305aeb21335239e1bfae8a2aa1cf8ae6ed","schema_version":"1.0","event_id":"sha256:08b9f239a710ff2cac1c238ae893a8305aeb21335239e1bfae8a2aa1cf8ae6ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/bundle.json","state_url":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSOXD2JF3J74RC6THG3B2IKHDS/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-07-06T18:37:58Z","links":{"resolver":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS","bundle":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/bundle.json","state":"https://pith.science/pith/HSOXD2JF3J74RC6THG3B2IKHDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSOXD2JF3J74RC6THG3B2IKHDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HSOXD2JF3J74RC6THG3B2IKHDS","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":"a253b99387291e3caa2504484f568b26a33c477af354b4578a58a6b884ff02f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-15T19:06:10Z","title_canon_sha256":"1a042890ac5d76aa28cc5308fcead8ae643eda8f44bed6cd2a2fe14999e96a59"},"schema_version":"1.0","source":{"id":"2009.07325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.07325","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"2009.07325v2","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.07325","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"HSOXD2JF3J74","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"pith_short_16","alias_value":"HSOXD2JF3J74RC6T","created_at":"2026-07-05T02:30:42Z"},{"alias_kind":"pith_short_8","alias_value":"HSOXD2JF","created_at":"2026-07-05T02:30:42Z"}],"graph_snapshots":[{"event_id":"sha256:08b9f239a710ff2cac1c238ae893a8305aeb21335239e1bfae8a2aa1cf8ae6ed","target":"graph","created_at":"2026-07-05T02:30:42Z","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/2009.07325/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a social network modeled as a weighted graph $G$, the influence maximization problem seeks $k$ vertices to become initially influenced, to maximize the expected number of influenced nodes under a particular diffusion model. The influence maximization problem has been proven to be NP-hard, and most proposed solutions to the problem are approximate greedy algorithms, which can guarantee a tunable approximation ratio for their results with respect to the optimal solution. The state-of-the-art algorithms are based on Reverse Influence Sampling (RIS) technique, which can offer both computatio","authors_text":"Matin Hashemi, Saber Salehkaleybar, Soheil Shahrouz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-15T19:06:10Z","title":"gIM: GPU Accelerated RIS-based Influence Maximization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.07325","kind":"arxiv","version":2},"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:9a07543f03e01e541871560dc4044154c064546ba27165cd4b16e40bedf67ad9","target":"record","created_at":"2026-07-05T02:30:42Z","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":"a253b99387291e3caa2504484f568b26a33c477af354b4578a58a6b884ff02f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-15T19:06:10Z","title_canon_sha256":"1a042890ac5d76aa28cc5308fcead8ae643eda8f44bed6cd2a2fe14999e96a59"},"schema_version":"1.0","source":{"id":"2009.07325","kind":"arxiv","version":2}},"canonical_sha256":"3c9d71e925da7fc88bd339b61d21471cb99982d5e17d4c82ea4fdf5c2bbbeb45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c9d71e925da7fc88bd339b61d21471cb99982d5e17d4c82ea4fdf5c2bbbeb45","first_computed_at":"2026-07-05T02:30:42.117784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:30:42.117784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5EMFquxJv+Hn0p6s1AYwmkd7f9p5wS3F+5mWLnl1BHyEDIetYwFtWWgui+kE6NMpoC3DuPOyrG6SnitWvnc4Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:30:42.118399Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.07325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a07543f03e01e541871560dc4044154c064546ba27165cd4b16e40bedf67ad9","sha256:08b9f239a710ff2cac1c238ae893a8305aeb21335239e1bfae8a2aa1cf8ae6ed"],"state_sha256":"88d29ac25af8f064f0802ffb50e084c66b6710407f08112bba7993f44699c675"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+HEbTZ4QIN3dbxqE5GaO0b2UBpNHespRyPMAhiQO5v1l3RvNi8Y/vHme6+L9vGZjUus0mrBxeGqcm1owXDNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:37:58.800435Z","bundle_sha256":"62dd04b8b72ecb58b71e6ff80f0ba536e7380a7994a10beefb2b694e7aff73e4"}}