{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TLJIKKQSDBE2LQHUE663LB4R5J","short_pith_number":"pith:TLJIKKQS","schema_version":"1.0","canonical_sha256":"9ad2852a121849a5c0f427bdb58791ea57f356ef623551e7c1d18f49aa68ddc3","source":{"kind":"arxiv","id":"2605.17221","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Mechanism Design in Diffusion Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks.","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hanpin Wang, Xinlun Zhang, Yongzhi Cao, Yu Huang, Zhechen Li","submitted_at":"2026-05-17T01:54:28Z","abstract_excerpt":"A diffusion auction refers to a selling process conducted over a social network, where each participant submits a bid and may invite other potential buyers to join the auction. Although various mechanisms have been proposed, none of them can simultaneously achieve incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound. In this paper, we propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties. We further extend PDM to general network structures through a m"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.17221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T01:54:28Z","cross_cats_sorted":[],"title_canon_sha256":"450c06ffb1ab9370cecc77088e9305b2e44f99b44e45ff2d1f9944bd48c96ab3","abstract_canon_sha256":"67d0e4eb3744e860406bc74d317df576c7b3cd06947f788c1ecfecc9df9aae98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:45.974921Z","signature_b64":"EolpwbImPUxFS0ML7faRdm0TGhvAyoyTM/T/3oSwrXjkRCgg75UCB3kru9oSvUK+RPq+XlbnzGZkXKlq+czaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ad2852a121849a5c0f427bdb58791ea57f356ef623551e7c1d18f49aa68ddc3","last_reissued_at":"2026-05-20T00:03:45.974008Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:45.974008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Mechanism Design in Diffusion Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks.","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hanpin Wang, Xinlun Zhang, Yongzhi Cao, Yu Huang, Zhechen Li","submitted_at":"2026-05-17T01:54:28Z","abstract_excerpt":"A diffusion auction refers to a selling process conducted over a social network, where each participant submits a bid and may invite other potential buyers to join the auction. Although various mechanisms have been proposed, none of them can simultaneously achieve incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound. In this paper, we propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties. We further extend PDM to general network structures through a m"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties: incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The base mechanism is defined only for path graphs and extensions rely on a map f that preserves key properties when the network is arbitrary; if no such f exists that simultaneously maintains IC, non-negative revenue, and the constant efficiency bound for general graphs, the general claim fails.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PDM and f-PDM achieve IC, non-negative revenue, and constant-approximate efficiency in diffusion auctions on paths and general networks, with further variants for Sybil attacks, collusion, and multi-unit cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c91ebc1e43fb690c74a5dac6cfdc7a578de373e62cbfb3ba23f0b833a09836e8"},"source":{"id":"2605.17221","kind":"arxiv","version":1},"verdict":{"id":"8fe07f53-7c56-4e51-926b-a7a97a5305c2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:18:03.185591Z","strongest_claim":"We propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties: incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound.","one_line_summary":"PDM and f-PDM achieve IC, non-negative revenue, and constant-approximate efficiency in diffusion auctions on paths and general networks, with further variants for Sybil attacks, collusion, and multi-unit cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The base mechanism is defined only for path graphs and extensions rely on a map f that preserves key properties when the network is arbitrary; if no such f exists that simultaneously maintains IC, non-negative revenue, and the constant efficiency bound for general graphs, the general claim fails.","pith_extraction_headline":"The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17221/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.380357Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:31:18.409623Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.918215Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.809007Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b0356ae858acb04beb54c59a9b5fe4f55ab05afdbca42fabc1591838c32262b9"},"references":{"count":46,"sample":[{"doi":"","year":1999,"title":"SIAM Journal on Computing28(6), 2117–2132 (1999)","work_id":"a7274b49-dd5a-44ab-b16e-3f8639fdeb8d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2000,"title":"Proceedings of the National Academy of Sciences97(21), 11149–11152 (2000) 24 X","work_id":"acbbf70f-347a-4759-8ad2-1bbca10a7d00","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"Journal of Economic Theory100(2), 295– 328 (2001)","work_id":"81e1b9ae-afcd-49de-a2d2-eda87ee032f5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Journal of Economic Theory144(2), 565–603 (2009)","work_id":"fcc20cce-6757-4187-8e88-bc8622dd1b99","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems","work_id":"04b9b44d-7c73-489f-abb3-4e29ff3253b6","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":46,"snapshot_sha256":"48be5b29d26c516649515eb637a5fc74cc5a3ab012ca2f4684aebdd100295a5e","internal_anchors":1},"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":"2605.17221","created_at":"2026-05-20T00:03:45.974168+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17221v1","created_at":"2026-05-20T00:03:45.974168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17221","created_at":"2026-05-20T00:03:45.974168+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLJIKKQSDBE2","created_at":"2026-05-20T00:03:45.974168+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLJIKKQSDBE2LQHU","created_at":"2026-05-20T00:03:45.974168+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLJIKKQS","created_at":"2026-05-20T00:03:45.974168+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/TLJIKKQSDBE2LQHUE663LB4R5J","json":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J.json","graph_json":"https://pith.science/api/pith-number/TLJIKKQSDBE2LQHUE663LB4R5J/graph.json","events_json":"https://pith.science/api/pith-number/TLJIKKQSDBE2LQHUE663LB4R5J/events.json","paper":"https://pith.science/paper/TLJIKKQS"},"agent_actions":{"view_html":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J","download_json":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J.json","view_paper":"https://pith.science/paper/TLJIKKQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17221&json=true","fetch_graph":"https://pith.science/api/pith-number/TLJIKKQSDBE2LQHUE663LB4R5J/graph.json","fetch_events":"https://pith.science/api/pith-number/TLJIKKQSDBE2LQHUE663LB4R5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/action/storage_attestation","attest_author":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/action/author_attestation","sign_citation":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/action/citation_signature","submit_replication":"https://pith.science/pith/TLJIKKQSDBE2LQHUE663LB4R5J/action/replication_record"}},"created_at":"2026-05-20T00:03:45.974168+00:00","updated_at":"2026-05-20T00:03:45.974168+00:00"}