{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HAQKDXASDB7253YRHNXBQUTHMV","short_pith_number":"pith:HAQKDXAS","canonical_record":{"source":{"id":"2001.08853","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-24T00:20:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e04294c66f0f00e57c841c73f400b3ee816e03188d847b7bbf53752721d0b749","abstract_canon_sha256":"4c0f2557bd0571de3d613391d6a6aca536690302a5eecbc0d1f0f25c2962cb41"},"schema_version":"1.0"},"canonical_sha256":"3820a1dc12187faeef113b6e185267654dc3ec57bcb5ad5a98f734a818334095","source":{"kind":"arxiv","id":"2001.08853","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.08853","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"2001.08853v5","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.08853","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"HAQKDXASDB72","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"pith_short_16","alias_value":"HAQKDXASDB7253YR","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"pith_short_8","alias_value":"HAQKDXAS","created_at":"2026-07-05T01:46:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HAQKDXASDB7253YRHNXBQUTHMV","target":"record","payload":{"canonical_record":{"source":{"id":"2001.08853","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-24T00:20:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e04294c66f0f00e57c841c73f400b3ee816e03188d847b7bbf53752721d0b749","abstract_canon_sha256":"4c0f2557bd0571de3d613391d6a6aca536690302a5eecbc0d1f0f25c2962cb41"},"schema_version":"1.0"},"canonical_sha256":"3820a1dc12187faeef113b6e185267654dc3ec57bcb5ad5a98f734a818334095","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:46:00.035350Z","signature_b64":"WQNBXhuT6JLruiZivNVBtRrBoBkgjtakx1fu3QZ+SNxmymu7CySepJl0lFI0jvht1rn7daKRRYZpB1tctP/bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3820a1dc12187faeef113b6e185267654dc3ec57bcb5ad5a98f734a818334095","last_reissued_at":"2026-07-05T01:46:00.034846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:46:00.034846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.08853","source_version":5,"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-05T01:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLo2AicqD+AVMeAOHG2eRuoDuPotkles2o4bhnytZcU5SxXEp8ENTCESqKUhdztiumEZAd7mzPGSRffOozydDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:46:02.110593Z"},"content_sha256":"c9bcc800bb9c1f2a3a90a76e1a7dc8f78345620a252d22703c04f7bbd7658ca6","schema_version":"1.0","event_id":"sha256:c9bcc800bb9c1f2a3a90a76e1a7dc8f78345620a252d22703c04f7bbd7658ca6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HAQKDXASDB7253YRHNXBQUTHMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MONSTOR: An Inductive Approach for Estimating and Maximizing Influence over Unseen Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Jihoon Ko, Kijung Shin, Kyuhan Lee, Noseong Park","submitted_at":"2020-01-24T00:20:35Z","abstract_excerpt":"Influence maximization (IM) is one of the most important problems in social network analysis. Its objective is to find a given number of seed nodes that maximize the spread of information through a social network. Since it is an NP-hard problem, many approximate/heuristic methods have been developed, and a number of them repeat Monte Carlo (MC) simulations over and over to reliably estimate the influence (i.e., the number of infected nodes) of a seed set. In this work, we present an inductive machine learning method, called Monte Carlo Simulator (MONSTOR), for estimating the influence of given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.08853","kind":"arxiv","version":5},"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/2001.08853/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-05T01:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1C0MzH8KFkdwNWAGEiKUjFFJLmE6ERrKL5PhR4i0DnUTNWgu2VeS1mAZEDSMgaG2EKQ0Van+cAA0QSeo10xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:46:02.110981Z"},"content_sha256":"44b7e10ace77318f5aa588a39e3707b2da34337751be1e25f10083df84b706b4","schema_version":"1.0","event_id":"sha256:44b7e10ace77318f5aa588a39e3707b2da34337751be1e25f10083df84b706b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/bundle.json","state_url":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAQKDXASDB7253YRHNXBQUTHMV/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-09T00:46:02Z","links":{"resolver":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV","bundle":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/bundle.json","state":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAQKDXASDB7253YRHNXBQUTHMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HAQKDXASDB7253YRHNXBQUTHMV","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":"4c0f2557bd0571de3d613391d6a6aca536690302a5eecbc0d1f0f25c2962cb41","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-24T00:20:35Z","title_canon_sha256":"e04294c66f0f00e57c841c73f400b3ee816e03188d847b7bbf53752721d0b749"},"schema_version":"1.0","source":{"id":"2001.08853","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.08853","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"2001.08853v5","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.08853","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"HAQKDXASDB72","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"pith_short_16","alias_value":"HAQKDXASDB7253YR","created_at":"2026-07-05T01:46:00Z"},{"alias_kind":"pith_short_8","alias_value":"HAQKDXAS","created_at":"2026-07-05T01:46:00Z"}],"graph_snapshots":[{"event_id":"sha256:44b7e10ace77318f5aa588a39e3707b2da34337751be1e25f10083df84b706b4","target":"graph","created_at":"2026-07-05T01:46:00Z","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/2001.08853/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Influence maximization (IM) is one of the most important problems in social network analysis. Its objective is to find a given number of seed nodes that maximize the spread of information through a social network. Since it is an NP-hard problem, many approximate/heuristic methods have been developed, and a number of them repeat Monte Carlo (MC) simulations over and over to reliably estimate the influence (i.e., the number of infected nodes) of a seed set. In this work, we present an inductive machine learning method, called Monte Carlo Simulator (MONSTOR), for estimating the influence of given","authors_text":"Jihoon Ko, Kijung Shin, Kyuhan Lee, Noseong Park","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-24T00:20:35Z","title":"MONSTOR: An Inductive Approach for Estimating and Maximizing Influence over Unseen Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.08853","kind":"arxiv","version":5},"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:c9bcc800bb9c1f2a3a90a76e1a7dc8f78345620a252d22703c04f7bbd7658ca6","target":"record","created_at":"2026-07-05T01:46:00Z","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":"4c0f2557bd0571de3d613391d6a6aca536690302a5eecbc0d1f0f25c2962cb41","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-24T00:20:35Z","title_canon_sha256":"e04294c66f0f00e57c841c73f400b3ee816e03188d847b7bbf53752721d0b749"},"schema_version":"1.0","source":{"id":"2001.08853","kind":"arxiv","version":5}},"canonical_sha256":"3820a1dc12187faeef113b6e185267654dc3ec57bcb5ad5a98f734a818334095","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3820a1dc12187faeef113b6e185267654dc3ec57bcb5ad5a98f734a818334095","first_computed_at":"2026-07-05T01:46:00.034846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:46:00.034846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WQNBXhuT6JLruiZivNVBtRrBoBkgjtakx1fu3QZ+SNxmymu7CySepJl0lFI0jvht1rn7daKRRYZpB1tctP/bDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:46:00.035350Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.08853","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9bcc800bb9c1f2a3a90a76e1a7dc8f78345620a252d22703c04f7bbd7658ca6","sha256:44b7e10ace77318f5aa588a39e3707b2da34337751be1e25f10083df84b706b4"],"state_sha256":"7ca46c4b5551b729ab3b130489c9357561bbc97eac66d52245e4bc2adfd0323a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HUIRaFL6Zv/6UFEfbNRJPMFRxbkVuVyQnIW0rA5P6a7V9njgYMILBN8RhfXSoG31747Xq2RXo0I0y4YRTQqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T00:46:02.113143Z","bundle_sha256":"f532cbf61c754fa5d2fa772ef445d7c583b8725d491efebdf7b292663d912f10"}}