{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LA2MH336N5J42JGBSMBJETMSNB","short_pith_number":"pith:LA2MH336","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"},"canonical_sha256":"5834c3ef7e6f53cd24c19302924d92684b60a553d4ceea4ecb99cea148708364","source":{"kind":"arxiv","id":"1304.3063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3063","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3063v1","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3063","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"LA2MH336N5J4","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LA2MH336N5J42JGB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LA2MH336","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LA2MH336N5J42JGBSMBJETMSNB","target":"record","payload":{"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"},"canonical_sha256":"5834c3ef7e6f53cd24c19302924d92684b60a553d4ceea4ecb99cea148708364","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"},"source_kind":"arxiv","source_id":"1304.3063","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1c+mpAS8BO1+Ksoyqwj3BAJ7nBZgB851GvE66n64BbbpN3Gm+exRG15jCLH9A20FCFUDnrlM+QTyD4D98XAPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:33:01.852953Z"},"content_sha256":"6eb01bfabd073bab719fff12e956f71eccf6c1257c7d1cc697d135ecd08098ab","schema_version":"1.0","event_id":"sha256:6eb01bfabd073bab719fff12e956f71eccf6c1257c7d1cc697d135ecd08098ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LA2MH336N5J42JGBSMBJETMSNB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzHwKCTLRJGx9fBily1d5ABXzGCN0S4C4Xp7Eof8eI/yXli3IwjH63s/xcNeqf5hoM5B+rjWrSyn+vMRauCCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:33:01.853311Z"},"content_sha256":"ffd23aa7c98747a9636443f6489ca97c1f5a074ee2464bca849fc3b1ef42de72","schema_version":"1.0","event_id":"sha256:ffd23aa7c98747a9636443f6489ca97c1f5a074ee2464bca849fc3b1ef42de72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/bundle.json","state_url":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LA2MH336N5J42JGBSMBJETMSNB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T06:33:01Z","links":{"resolver":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB","bundle":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/bundle.json","state":"https://pith.science/pith/LA2MH336N5J42JGBSMBJETMSNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LA2MH336N5J42JGBSMBJETMSNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LA2MH336N5J42JGBSMBJETMSNB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"557a89165a4654bbd1813697fe637a12c2efe5f2068c357a7a8528acdb2fb4c8","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:37:09Z","title_canon_sha256":"48b890758c3faf5241104b9b9b96d7aa413afa69a39e6c11e2812590158cc6d4"},"schema_version":"1.0","source":{"id":"1304.3063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3063","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3063v1","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3063","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"LA2MH336N5J4","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LA2MH336N5J42JGB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LA2MH336","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:ffd23aa7c98747a9636443f6489ca97c1f5a074ee2464bca849fc3b1ef42de72","target":"graph","created_at":"2026-05-18T03:28:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"C\\'edric Langbort, Farhad Farokhi, Takashi Tanaka","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:37:09Z","title":"A Faithful Distributed Implementation of Dual Decomposition and Average Consensus Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3063","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6eb01bfabd073bab719fff12e956f71eccf6c1257c7d1cc697d135ecd08098ab","target":"record","created_at":"2026-05-18T03:28:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"557a89165a4654bbd1813697fe637a12c2efe5f2068c357a7a8528acdb2fb4c8","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:37:09Z","title_canon_sha256":"48b890758c3faf5241104b9b9b96d7aa413afa69a39e6c11e2812590158cc6d4"},"schema_version":"1.0","source":{"id":"1304.3063","kind":"arxiv","version":1}},"canonical_sha256":"5834c3ef7e6f53cd24c19302924d92684b60a553d4ceea4ecb99cea148708364","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5834c3ef7e6f53cd24c19302924d92684b60a553d4ceea4ecb99cea148708364","first_computed_at":"2026-05-18T03:28:19.986079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:19.986079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"19XblB9ZpU78/ks5QpVC4uTQ0xUpkADIkyhSrTQHVhC7dvqm/Bj6XbGqgHWVbjg5FoGvoIXhCwUph6aWrfJPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:19.986616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eb01bfabd073bab719fff12e956f71eccf6c1257c7d1cc697d135ecd08098ab","sha256:ffd23aa7c98747a9636443f6489ca97c1f5a074ee2464bca849fc3b1ef42de72"],"state_sha256":"afcee5915d23f52fe5ed657b1b6abeefd867a6817bd9daa3a7461e7d5b943d46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgSRzKKenw6KnLNh0AsLK9Rr0Wc60HREY4YsHmWzViZMwt9cwm6e/d5WjvBDaxUynBkICBxq8a1HM07fJVTlCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:33:01.855536Z","bundle_sha256":"0aa90210328ac4b42154af877acc08bf9079a64f119eca1d46240dbd632590b3"}}