{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HAQKDXASDB7253YRHNXBQUTHMV","short_pith_number":"pith:HAQKDXAS","schema_version":"1.0","canonical_sha256":"3820a1dc12187faeef113b6e185267654dc3ec57bcb5ad5a98f734a818334095","source":{"kind":"arxiv","id":"2001.08853","version":5},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2001.08853","created_at":"2026-07-05T01:46:00.034903+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.08853v5","created_at":"2026-07-05T01:46:00.034903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.08853","created_at":"2026-07-05T01:46:00.034903+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAQKDXASDB72","created_at":"2026-07-05T01:46:00.034903+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAQKDXASDB7253YR","created_at":"2026-07-05T01:46:00.034903+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAQKDXAS","created_at":"2026-07-05T01:46:00.034903+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV","json":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV.json","graph_json":"https://pith.science/api/pith-number/HAQKDXASDB7253YRHNXBQUTHMV/graph.json","events_json":"https://pith.science/api/pith-number/HAQKDXASDB7253YRHNXBQUTHMV/events.json","paper":"https://pith.science/paper/HAQKDXAS"},"agent_actions":{"view_html":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV","download_json":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV.json","view_paper":"https://pith.science/paper/HAQKDXAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.08853&json=true","fetch_graph":"https://pith.science/api/pith-number/HAQKDXASDB7253YRHNXBQUTHMV/graph.json","fetch_events":"https://pith.science/api/pith-number/HAQKDXASDB7253YRHNXBQUTHMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/action/storage_attestation","attest_author":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/action/author_attestation","sign_citation":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/action/citation_signature","submit_replication":"https://pith.science/pith/HAQKDXASDB7253YRHNXBQUTHMV/action/replication_record"}},"created_at":"2026-07-05T01:46:00.034903+00:00","updated_at":"2026-07-05T01:46:00.034903+00:00"}