{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZTEDV3N7V25YCNM5AKQ7COOI6C","short_pith_number":"pith:ZTEDV3N7","schema_version":"1.0","canonical_sha256":"ccc83aedbfaebb81359d02a1f139c8f091ad9d058872b0e48189f772ea53e8c2","source":{"kind":"arxiv","id":"1711.03327","version":1},"attestation_state":"computed","paper":{"title":"Influence Maximization over Markovian Graphs: A Stochastic Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Buddhika Nettasinghe, Vikram Krishnamurthy","submitted_at":"2017-11-09T11:19:16Z","abstract_excerpt":"This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed set of nodes) that samples a node which will initiate the largest information cascade (in expectation). Further, it is assumed that the sampling process affects the evolution of the graph i.e. the sampling distribution and the transition probability matrix are functionally dependent. In this setup, recursive stochastic optimization algorithms are presented t"},"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":"1711.03327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-09T11:19:16Z","cross_cats_sorted":[],"title_canon_sha256":"da96e3db5fc27657dc684ce129e6bc2c0b4ddd4cb1b9b9b4eca81bdb48d74a2d","abstract_canon_sha256":"9630d0477dbd1bc6ef2d4fbd27407b658139840871602cb83176be1a3800ffc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.535424Z","signature_b64":"5BC1ae3938Hf/Ssj6nJ52hM2rYl8Jzpt9T04upvZhnwtrX6tmo+3D9ofHWGfd/URPrg224VE25nkxZVNoa/kAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccc83aedbfaebb81359d02a1f139c8f091ad9d058872b0e48189f772ea53e8c2","last_reissued_at":"2026-05-18T00:30:56.534640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.534640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Influence Maximization over Markovian Graphs: A Stochastic Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Buddhika Nettasinghe, Vikram Krishnamurthy","submitted_at":"2017-11-09T11:19:16Z","abstract_excerpt":"This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed set of nodes) that samples a node which will initiate the largest information cascade (in expectation). Further, it is assumed that the sampling process affects the evolution of the graph i.e. the sampling distribution and the transition probability matrix are functionally dependent. In this setup, recursive stochastic optimization algorithms are presented t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03327","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1711.03327","created_at":"2026-05-18T00:30:56.534742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03327v1","created_at":"2026-05-18T00:30:56.534742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03327","created_at":"2026-05-18T00:30:56.534742+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTEDV3N7V25Y","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTEDV3N7V25YCNM5","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTEDV3N7","created_at":"2026-05-18T12:31:59.375834+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/ZTEDV3N7V25YCNM5AKQ7COOI6C","json":"https://pith.science/pith/ZTEDV3N7V25YCNM5AKQ7COOI6C.json","graph_json":"https://pith.science/api/pith-number/ZTEDV3N7V25YCNM5AKQ7COOI6C/graph.json","events_json":"https://pith.science/api/pith-number/ZTEDV3N7V25YCNM5AKQ7COOI6C/events.json","paper":"https://pith.science/paper/ZTEDV3N7"},"agent_actions":{"view_html":"https://pith.science/pith/ZTEDV3N7V25YCNM5AKQ7COOI6C","download_json":"https://pith.science/pith/ZTEDV3N7V25YCNM5AKQ7COOI6C.json","view_paper":"https://pith.science/paper/ZTEDV3N7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03327&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTEDV3N7V25YCNM5AKQ7COOI6C/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTEDV3N7V25YCNM5AKQ7COOI6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTEDV3N7V25YCNM5AKQ7COOI6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTEDV3N7V25YCNM5AKQ7COOI6C/action/storage_attestation","attest_author":"https://pith.science/pith/ZTEDV3N7V25YCNM5AKQ7COOI6C/action/author_attestation","sign_citation":"https://pith.science/pith/ZTEDV3N7V25YCNM5AKQ7COOI6C/action/citation_signature","submit_replication":"https://pith.science/pith/ZTEDV3N7V25YCNM5AKQ7COOI6C/action/replication_record"}},"created_at":"2026-05-18T00:30:56.534742+00:00","updated_at":"2026-05-18T00:30:56.534742+00:00"}