{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EUIEEOKQCLHYFNOUKH7YHXUSMJ","short_pith_number":"pith:EUIEEOKQ","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"},"canonical_sha256":"251042395012cf82b5d451ff83de92627118369114fa23dd6fe7c3fd3cf210d2","source":{"kind":"arxiv","id":"1407.5074","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5074","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5074v2","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5074","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"EUIEEOKQCLHY","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EUIEEOKQCLHYFNOU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EUIEEOKQ","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EUIEEOKQCLHYFNOUKH7YHXUSMJ","target":"record","payload":{"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"},"canonical_sha256":"251042395012cf82b5d451ff83de92627118369114fa23dd6fe7c3fd3cf210d2","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"},"source_kind":"arxiv","source_id":"1407.5074","source_version":2,"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-18T01:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xCUqwmrNaYmJ25t7etJa0eUA6UOdOZ6mY+pt9U9QchiViQG/Ttl2lmgAkt83xFCTWgzUjnNKA4cBhMpq3CJ9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T08:36:04.734459Z"},"content_sha256":"a75a6f350cdb29c92f5543c5b92c9fca2ac0258c3764905efd73fb7709996924","schema_version":"1.0","event_id":"sha256:a75a6f350cdb29c92f5543c5b92c9fca2ac0258c3764905efd73fb7709996924"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EUIEEOKQCLHYFNOUKH7YHXUSMJ","target":"graph","payload":{"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"},"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-18T01:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/19CIgBdJ9WWuQEhD+rpbM53xRHvyVq2RRUdfOmf2qu7IU6PhMfJbujbs9a5VSpEVyG4U7W/9ia7pZUOvHdnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T08:36:04.734819Z"},"content_sha256":"d5148d5e531592a9472febb7c59ea6a07d4c63504bbfea6d4b608f3fb5a255a3","schema_version":"1.0","event_id":"sha256:d5148d5e531592a9472febb7c59ea6a07d4c63504bbfea6d4b608f3fb5a255a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/bundle.json","state_url":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/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-07-04T08:36:04Z","links":{"resolver":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ","bundle":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/bundle.json","state":"https://pith.science/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUIEEOKQCLHYFNOUKH7YHXUSMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EUIEEOKQCLHYFNOUKH7YHXUSMJ","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":"70ec136631741e9656ec976ef8456e600469fc69b3db23fdad126fc0ae35e742","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-07-14T20:35:57Z","title_canon_sha256":"fcc8417b1e93c6305fcba2fddd070b505e6b2a4269e04ae269e484b9376e5edc"},"schema_version":"1.0","source":{"id":"1407.5074","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5074","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5074v2","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5074","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"EUIEEOKQCLHY","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EUIEEOKQCLHYFNOU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EUIEEOKQ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:d5148d5e531592a9472febb7c59ea6a07d4c63504bbfea6d4b608f3fb5a255a3","target":"graph","created_at":"2026-05-18T01:24:33Z","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":"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","authors_text":"Flavio Esposito, Saber Mirzaei","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-07-14T20:35:57Z","title":"An Alloy Verification Model for Consensus-Based Auction Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5074","kind":"arxiv","version":2},"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:a75a6f350cdb29c92f5543c5b92c9fca2ac0258c3764905efd73fb7709996924","target":"record","created_at":"2026-05-18T01:24:33Z","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":"70ec136631741e9656ec976ef8456e600469fc69b3db23fdad126fc0ae35e742","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-07-14T20:35:57Z","title_canon_sha256":"fcc8417b1e93c6305fcba2fddd070b505e6b2a4269e04ae269e484b9376e5edc"},"schema_version":"1.0","source":{"id":"1407.5074","kind":"arxiv","version":2}},"canonical_sha256":"251042395012cf82b5d451ff83de92627118369114fa23dd6fe7c3fd3cf210d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"251042395012cf82b5d451ff83de92627118369114fa23dd6fe7c3fd3cf210d2","first_computed_at":"2026-05-18T01:24:33.328989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:33.328989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VWvSsiMNj6iAr7HaHZSzLVuqlm5ycxt4KleGsjuaipx0clXBn8w4WN3LavELki9SFQuuKU54d8QK8f1SWfc2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:33.329562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5074","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a75a6f350cdb29c92f5543c5b92c9fca2ac0258c3764905efd73fb7709996924","sha256:d5148d5e531592a9472febb7c59ea6a07d4c63504bbfea6d4b608f3fb5a255a3"],"state_sha256":"be1e40b40cfe08555a22cbb00f5f40ad33c220ed49429eabec0aecdc90dc89b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oTx3rnAlCKyPToal5+zW9Qik8pU1+wVuOksdRvL6/3YL/e4WK4B0UlKbompzQsgWIM3wojBbkNDfrsD8XP0TAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T08:36:04.736892Z","bundle_sha256":"fcfb8bba0424453ab61bf9f9a094f5e453989413a47f44ea4d2ae5452fb3bf3b"}}