{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R4HLC65GW773KLBMUZHTWP7IQT","short_pith_number":"pith:R4HLC65G","schema_version":"1.0","canonical_sha256":"8f0eb17ba6b7ffb52c2ca64f3b3fe884e5708a47839395af0b766f469e404987","source":{"kind":"arxiv","id":"1805.08013","version":1},"attestation_state":"computed","paper":{"title":"Incentive-Compatible Diffusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Moshe Tennenholtz, Oren Dean, Yakov Babichenko","submitted_at":"2018-05-21T12:23:58Z","abstract_excerpt":"Our work bridges the literature on incentive-compatible mechanism design and the literature on diffusion algorithms. We introduce the study of finding an incentive-compatible (strategy-proof) mechanism for selecting an influential vertex in a directed graph (e.g. Twitter's network). The goal is to devise a mechanism with a bounded ratio between the maximal influence and the influence of the selected user, and in which no user can improve its probability of being selected by following or unfollowing other users. We introduce the `Two Path' mechanism which is based on the idea of selecting the v"},"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":"1805.08013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-05-21T12:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"a1b9312c9e346c9650c744c98dc17e5a896bf1f4cd072a6f4a07bdf7d115deb2","abstract_canon_sha256":"339907161fe994c812efef14d40ce3160a19e8db209da276e79aa5423a4114d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:31.917892Z","signature_b64":"qRh3xngUwHCpRO7ELOzBgMs/exvMi0nbLe2qzwBoovfjZlL8jqHewvs/kufvsoe89FOe8huDmpz89VrX8AfbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f0eb17ba6b7ffb52c2ca64f3b3fe884e5708a47839395af0b766f469e404987","last_reissued_at":"2026-05-18T00:15:31.917224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:31.917224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incentive-Compatible Diffusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Moshe Tennenholtz, Oren Dean, Yakov Babichenko","submitted_at":"2018-05-21T12:23:58Z","abstract_excerpt":"Our work bridges the literature on incentive-compatible mechanism design and the literature on diffusion algorithms. We introduce the study of finding an incentive-compatible (strategy-proof) mechanism for selecting an influential vertex in a directed graph (e.g. Twitter's network). The goal is to devise a mechanism with a bounded ratio between the maximal influence and the influence of the selected user, and in which no user can improve its probability of being selected by following or unfollowing other users. We introduce the `Two Path' mechanism which is based on the idea of selecting the v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08013","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":"1805.08013","created_at":"2026-05-18T00:15:31.917335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08013v1","created_at":"2026-05-18T00:15:31.917335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08013","created_at":"2026-05-18T00:15:31.917335+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4HLC65GW773","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4HLC65GW773KLBM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4HLC65G","created_at":"2026-05-18T12:32:50.500415+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/R4HLC65GW773KLBMUZHTWP7IQT","json":"https://pith.science/pith/R4HLC65GW773KLBMUZHTWP7IQT.json","graph_json":"https://pith.science/api/pith-number/R4HLC65GW773KLBMUZHTWP7IQT/graph.json","events_json":"https://pith.science/api/pith-number/R4HLC65GW773KLBMUZHTWP7IQT/events.json","paper":"https://pith.science/paper/R4HLC65G"},"agent_actions":{"view_html":"https://pith.science/pith/R4HLC65GW773KLBMUZHTWP7IQT","download_json":"https://pith.science/pith/R4HLC65GW773KLBMUZHTWP7IQT.json","view_paper":"https://pith.science/paper/R4HLC65G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08013&json=true","fetch_graph":"https://pith.science/api/pith-number/R4HLC65GW773KLBMUZHTWP7IQT/graph.json","fetch_events":"https://pith.science/api/pith-number/R4HLC65GW773KLBMUZHTWP7IQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4HLC65GW773KLBMUZHTWP7IQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4HLC65GW773KLBMUZHTWP7IQT/action/storage_attestation","attest_author":"https://pith.science/pith/R4HLC65GW773KLBMUZHTWP7IQT/action/author_attestation","sign_citation":"https://pith.science/pith/R4HLC65GW773KLBMUZHTWP7IQT/action/citation_signature","submit_replication":"https://pith.science/pith/R4HLC65GW773KLBMUZHTWP7IQT/action/replication_record"}},"created_at":"2026-05-18T00:15:31.917335+00:00","updated_at":"2026-05-18T00:15:31.917335+00:00"}