{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EUIEEOKQCLHYFNOUKH7YHXUSMJ","short_pith_number":"pith:EUIEEOKQ","schema_version":"1.0","canonical_sha256":"251042395012cf82b5d451ff83de92627118369114fa23dd6fe7c3fd3cf210d2","source":{"kind":"arxiv","id":"1407.5074","version":2},"attestation_state":"computed","paper":{"title":"An Alloy Verification Model for Consensus-Based Auction Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SE","authors_text":"Flavio Esposito, Saber Mirzaei","submitted_at":"2014-07-14T20:35:57Z","abstract_excerpt":"Max Consensus-based Auction (MCA) protocols are an elegant approach to establish conflict-free distributed allocations in a wide range of network utility maximization problems. A set of agents independently bid on a set of items, and exchange their bids with their first hop-neighbors for a distributed (max-consensus) winner determination. The use of MCA protocols was proposed, $e.g.$, to solve the task allocation problem for a fleet of unmanned aerial vehicles, in smart grids, or in distributed virtual network management applications. Misconfigured or malicious agents participating in a MCA, o"},"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":"1407.5074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-07-14T20:35:57Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"fcc8417b1e93c6305fcba2fddd070b505e6b2a4269e04ae269e484b9376e5edc","abstract_canon_sha256":"70ec136631741e9656ec976ef8456e600469fc69b3db23fdad126fc0ae35e742"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:33.329562Z","signature_b64":"VWvSsiMNj6iAr7HaHZSzLVuqlm5ycxt4KleGsjuaipx0clXBn8w4WN3LavELki9SFQuuKU54d8QK8f1SWfc2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"251042395012cf82b5d451ff83de92627118369114fa23dd6fe7c3fd3cf210d2","last_reissued_at":"2026-05-18T01:24:33.328989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:33.328989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Alloy Verification Model for Consensus-Based Auction Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SE","authors_text":"Flavio Esposito, Saber Mirzaei","submitted_at":"2014-07-14T20:35:57Z","abstract_excerpt":"Max Consensus-based Auction (MCA) protocols are an elegant approach to establish conflict-free distributed allocations in a wide range of network utility maximization problems. A set of agents independently bid on a set of items, and exchange their bids with their first hop-neighbors for a distributed (max-consensus) winner determination. The use of MCA protocols was proposed, $e.g.$, to solve the task allocation problem for a fleet of unmanned aerial vehicles, in smart grids, or in distributed virtual network management applications. Misconfigured or malicious agents participating in a MCA, o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5074","kind":"arxiv","version":2},"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":"1407.5074","created_at":"2026-05-18T01:24:33.329063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5074v2","created_at":"2026-05-18T01:24:33.329063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5074","created_at":"2026-05-18T01:24:33.329063+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUIEEOKQCLHY","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUIEEOKQCLHYFNOU","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUIEEOKQ","created_at":"2026-05-18T12:28:28.263976+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/EUIEEOKQCLHYFNOUKH7YHXUSMJ","json":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ.json","graph_json":"https://pith.science/api/pith-number/EUIEEOKQCLHYFNOUKH7YHXUSMJ/graph.json","events_json":"https://pith.science/api/pith-number/EUIEEOKQCLHYFNOUKH7YHXUSMJ/events.json","paper":"https://pith.science/paper/EUIEEOKQ"},"agent_actions":{"view_html":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ","download_json":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ.json","view_paper":"https://pith.science/paper/EUIEEOKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5074&json=true","fetch_graph":"https://pith.science/api/pith-number/EUIEEOKQCLHYFNOUKH7YHXUSMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EUIEEOKQCLHYFNOUKH7YHXUSMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/action/storage_attestation","attest_author":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/action/author_attestation","sign_citation":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/action/citation_signature","submit_replication":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/action/replication_record"}},"created_at":"2026-05-18T01:24:33.329063+00:00","updated_at":"2026-05-18T01:24:33.329063+00:00"}