{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LA2MH336N5J42JGBSMBJETMSNB","short_pith_number":"pith:LA2MH336","schema_version":"1.0","canonical_sha256":"5834c3ef7e6f53cd24c19302924d92684b60a553d4ceea4ecb99cea148708364","source":{"kind":"arxiv","id":"1304.3063","version":1},"attestation_state":"computed","paper":{"title":"A Faithful Distributed Implementation of Dual Decomposition and Average Consensus Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"C\\'edric Langbort, Farhad Farokhi, Takashi Tanaka","submitted_at":"2013-04-10T19:37:09Z","abstract_excerpt":"We consider large scale cost allocation problems and consensus seeking problems for multiple agents, in which agents are suggested to collaborate in a distributed algorithm to find a solution. If agents are strategic to minimize their own individual cost rather than the global social cost, they are endowed with an incentive not to follow the intended algorithm, unless the tax/subsidy mechanism is carefully designed. Inspired by the classical Vickrey-Clarke-Groves mechanism and more recent algorithmic mechanism design theory, we propose a tax mechanism that incentivises agents to faithfully imp"},"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":"1304.3063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:37:09Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"48b890758c3faf5241104b9b9b96d7aa413afa69a39e6c11e2812590158cc6d4","abstract_canon_sha256":"557a89165a4654bbd1813697fe637a12c2efe5f2068c357a7a8528acdb2fb4c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:19.986616Z","signature_b64":"19XblB9ZpU78/ks5QpVC4uTQ0xUpkADIkyhSrTQHVhC7dvqm/Bj6XbGqgHWVbjg5FoGvoIXhCwUph6aWrfJPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5834c3ef7e6f53cd24c19302924d92684b60a553d4ceea4ecb99cea148708364","last_reissued_at":"2026-05-18T03:28:19.986079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:19.986079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faithful Distributed Implementation of Dual Decomposition and Average Consensus Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"C\\'edric Langbort, Farhad Farokhi, Takashi Tanaka","submitted_at":"2013-04-10T19:37:09Z","abstract_excerpt":"We consider large scale cost allocation problems and consensus seeking problems for multiple agents, in which agents are suggested to collaborate in a distributed algorithm to find a solution. If agents are strategic to minimize their own individual cost rather than the global social cost, they are endowed with an incentive not to follow the intended algorithm, unless the tax/subsidy mechanism is carefully designed. Inspired by the classical Vickrey-Clarke-Groves mechanism and more recent algorithmic mechanism design theory, we propose a tax mechanism that incentivises agents to faithfully imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3063","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":"1304.3063","created_at":"2026-05-18T03:28:19.986151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3063v1","created_at":"2026-05-18T03:28:19.986151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3063","created_at":"2026-05-18T03:28:19.986151+00:00"},{"alias_kind":"pith_short_12","alias_value":"LA2MH336N5J4","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LA2MH336N5J42JGB","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LA2MH336","created_at":"2026-05-18T12:27:51.066281+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/LA2MH336N5J42JGBSMBJETMSNB","json":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB.json","graph_json":"https://pith.science/api/pith-number/LA2MH336N5J42JGBSMBJETMSNB/graph.json","events_json":"https://pith.science/api/pith-number/LA2MH336N5J42JGBSMBJETMSNB/events.json","paper":"https://pith.science/paper/LA2MH336"},"agent_actions":{"view_html":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB","download_json":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB.json","view_paper":"https://pith.science/paper/LA2MH336","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3063&json=true","fetch_graph":"https://pith.science/api/pith-number/LA2MH336N5J42JGBSMBJETMSNB/graph.json","fetch_events":"https://pith.science/api/pith-number/LA2MH336N5J42JGBSMBJETMSNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/action/storage_attestation","attest_author":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/action/author_attestation","sign_citation":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/action/citation_signature","submit_replication":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/action/replication_record"}},"created_at":"2026-05-18T03:28:19.986151+00:00","updated_at":"2026-05-18T03:28:19.986151+00:00"}