{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:P5B2GSQMIGMZDGE3YGVULMCHE5","short_pith_number":"pith:P5B2GSQM","canonical_record":{"source":{"id":"1202.3740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"c8442a38304e848acaa7bae7f735b136c0b4aab1d3a72433a3d3c92e404406cb","abstract_canon_sha256":"fe6df5847467d6a48dcb34c48d5b40175392c6e2e0832560ccd9a7020782a55c"},"schema_version":"1.0"},"canonical_sha256":"7f43a34a0c419991989bc1ab45b047275cdfb16466fdabaedc9da26aab17e6dc","source":{"kind":"arxiv","id":"1202.3740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3740","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3740v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3740","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"P5B2GSQMIGMZ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P5B2GSQMIGMZDGE3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P5B2GSQM","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:P5B2GSQMIGMZDGE3YGVULMCHE5","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"c8442a38304e848acaa7bae7f735b136c0b4aab1d3a72433a3d3c92e404406cb","abstract_canon_sha256":"fe6df5847467d6a48dcb34c48d5b40175392c6e2e0832560ccd9a7020782a55c"},"schema_version":"1.0"},"canonical_sha256":"7f43a34a0c419991989bc1ab45b047275cdfb16466fdabaedc9da26aab17e6dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.172245Z","signature_b64":"PKztq9eVSvSKVZRLm9UPKJDeLiP8T8zODu+1iI9JmkYzkAAD0DnS2umVHf38lLVNvI1D7nEvjRjAyEoCaNMlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f43a34a0c419991989bc1ab45b047275cdfb16466fdabaedc9da26aab17e6dc","last_reissued_at":"2026-05-18T04:02:03.171711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.171711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3740","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ul0JoDUQr87jDZ7E6RHn831y4jA7Gm1W0oy79AxjDsu64ItuL1OKLVmd4WzFilodCohvTGdTwcqtSwL8BheSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:47:07.863471Z"},"content_sha256":"1289bf09ec683f6417acd0e4620d0209eb3cf114dbf8a2e7c76f920a3308b83f","schema_version":"1.0","event_id":"sha256:1289bf09ec683f6417acd0e4620d0209eb3cf114dbf8a2e7c76f920a3308b83f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:P5B2GSQMIGMZDGE3YGVULMCHE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"We study the problem of agent-based negotiation in combinatorial domains. It is difficult to reach optimal agreements in bilateral or multi-lateral negotiations when the agents' preferences for the possible alternatives are not common knowledge. Self-interested agents often end up negotiating inefficient agreements in such situations. In this paper, we present a protocol for negotiation in combinatorial domains which can lead rational agents to reach optimal agreements under incomplete information setting. Our proposed protocol enables the negotiating agents to identify efficient solutions usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3740","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PWlkQ+H3ZR7spFYs9wLCOLMhrA/GutT+a1tOjKX7mp6GNX69wUf6GPVAeP0U4jxWhZtE3WKaRO6ftgIHpjICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:47:07.863824Z"},"content_sha256":"6f80f57a4e4c9e45534e2769ab777c553facc38e428ca2cd44531f3a3849485c","schema_version":"1.0","event_id":"sha256:6f80f57a4e4c9e45534e2769ab777c553facc38e428ca2cd44531f3a3849485c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5B2GSQMIGMZDGE3YGVULMCHE5/bundle.json","state_url":"https://pith.science/pith/P5B2GSQMIGMZDGE3YGVULMCHE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5B2GSQMIGMZDGE3YGVULMCHE5/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-06-04T04:47:07Z","links":{"resolver":"https://pith.science/pith/P5B2GSQMIGMZDGE3YGVULMCHE5","bundle":"https://pith.science/pith/P5B2GSQMIGMZDGE3YGVULMCHE5/bundle.json","state":"https://pith.science/pith/P5B2GSQMIGMZDGE3YGVULMCHE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5B2GSQMIGMZDGE3YGVULMCHE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:P5B2GSQMIGMZDGE3YGVULMCHE5","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":"fe6df5847467d6a48dcb34c48d5b40175392c6e2e0832560ccd9a7020782a55c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"c8442a38304e848acaa7bae7f735b136c0b4aab1d3a72433a3d3c92e404406cb"},"schema_version":"1.0","source":{"id":"1202.3740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3740","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3740v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3740","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"P5B2GSQMIGMZ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P5B2GSQMIGMZDGE3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P5B2GSQM","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:6f80f57a4e4c9e45534e2769ab777c553facc38e428ca2cd44531f3a3849485c","target":"graph","created_at":"2026-05-18T04:02:03Z","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 study the problem of agent-based negotiation in combinatorial domains. It is difficult to reach optimal agreements in bilateral or multi-lateral negotiations when the agents' preferences for the possible alternatives are not common knowledge. Self-interested agents often end up negotiating inefficient agreements in such situations. In this paper, we present a protocol for negotiation in combinatorial domains which can lead rational agents to reach optimal agreements under incomplete information setting. Our proposed protocol enables the negotiating agents to identify efficient solutions usi","authors_text":"Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title":"An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3740","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:1289bf09ec683f6417acd0e4620d0209eb3cf114dbf8a2e7c76f920a3308b83f","target":"record","created_at":"2026-05-18T04:02:03Z","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":"fe6df5847467d6a48dcb34c48d5b40175392c6e2e0832560ccd9a7020782a55c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"c8442a38304e848acaa7bae7f735b136c0b4aab1d3a72433a3d3c92e404406cb"},"schema_version":"1.0","source":{"id":"1202.3740","kind":"arxiv","version":1}},"canonical_sha256":"7f43a34a0c419991989bc1ab45b047275cdfb16466fdabaedc9da26aab17e6dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f43a34a0c419991989bc1ab45b047275cdfb16466fdabaedc9da26aab17e6dc","first_computed_at":"2026-05-18T04:02:03.171711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:03.171711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PKztq9eVSvSKVZRLm9UPKJDeLiP8T8zODu+1iI9JmkYzkAAD0DnS2umVHf38lLVNvI1D7nEvjRjAyEoCaNMlDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:03.172245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1289bf09ec683f6417acd0e4620d0209eb3cf114dbf8a2e7c76f920a3308b83f","sha256:6f80f57a4e4c9e45534e2769ab777c553facc38e428ca2cd44531f3a3849485c"],"state_sha256":"a4e1b76bd91eb77a9cbb722db27bcf5219ba85f905742e1f44290c5aad018492"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dam0CXYI3X9ecG0N7CwlTxWOYR4Mtgnv+N3TEty/WG4Vh27IHkyM5oUXvVTuaL6V1zLtfFPcKc+/3kEOLVrhCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:47:07.866174Z","bundle_sha256":"1488d935d4b26c2e73e639f430ef711800835ac79af281eec06cfca17d9accbc"}}