{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RQB6JNNWFSZPF2HJYN4FLB246K","short_pith_number":"pith:RQB6JNNW","schema_version":"1.0","canonical_sha256":"8c03e4b5b62cb2f2e8e9c37855875cf2a3ad0f866f01a42b577ec1b9da9e406b","source":{"kind":"arxiv","id":"1711.00940","version":2},"attestation_state":"computed","paper":{"title":"Monotone bargaining is Nash-solvable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Gleb Koshevoy, Vladimir Gurvich","submitted_at":"2017-11-02T21:20:48Z","abstract_excerpt":"Given two finite ordered sets $A = \\{a_1, \\ldots, a_m\\}$ and $B = \\{b_1, \\ldots, b_n\\}$, introduce the set of $m n$ outcomes of the game $O = \\{(a, b) \\mid a \\in A, b \\in B\\} = \\{(a_i, b_j) \\mid i \\in I = \\{1, \\ldots, m\\}, j \\in J = \\{1, \\ldots, n\\}$. Two players, Alice and Bob, have the sets of strategies $X$ and $Y$ that consist of all monotone non-decreasing mappings $x: A \\rightarrow B$ and $y: B \\rightarrow A$, respectively. It is easily seen that each pair $(x,y) \\in X \\times Y$ produces at least one {\\em deal}, that is, an outcome $(a,b) \\in O$ such that $x(a) = b$ and $y(b) = a$. Denot"},"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":"1711.00940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-02T21:20:48Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"8b990b285d2595c6709c72b8b3da19d78367a466d8c296bad45efaeb62c14c6f","abstract_canon_sha256":"2fa3c5135d78e37e27391fb03cbda6674037b86d54f34af0f43bab73a76f0ab8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:22.328568Z","signature_b64":"LPrH+NpJ/lnybKkL5qq2mqznWDKsJKK2hwsjTbq11mUdObb92j9UclqHc1xKOwM6C8ZGFOPitlLbdRmhlN6sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c03e4b5b62cb2f2e8e9c37855875cf2a3ad0f866f01a42b577ec1b9da9e406b","last_reissued_at":"2026-05-18T00:28:22.327814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:22.327814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone bargaining is Nash-solvable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Gleb Koshevoy, Vladimir Gurvich","submitted_at":"2017-11-02T21:20:48Z","abstract_excerpt":"Given two finite ordered sets $A = \\{a_1, \\ldots, a_m\\}$ and $B = \\{b_1, \\ldots, b_n\\}$, introduce the set of $m n$ outcomes of the game $O = \\{(a, b) \\mid a \\in A, b \\in B\\} = \\{(a_i, b_j) \\mid i \\in I = \\{1, \\ldots, m\\}, j \\in J = \\{1, \\ldots, n\\}$. Two players, Alice and Bob, have the sets of strategies $X$ and $Y$ that consist of all monotone non-decreasing mappings $x: A \\rightarrow B$ and $y: B \\rightarrow A$, respectively. It is easily seen that each pair $(x,y) \\in X \\times Y$ produces at least one {\\em deal}, that is, an outcome $(a,b) \\in O$ such that $x(a) = b$ and $y(b) = a$. Denot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00940","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":"1711.00940","created_at":"2026-05-18T00:28:22.327918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00940v2","created_at":"2026-05-18T00:28:22.327918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00940","created_at":"2026-05-18T00:28:22.327918+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQB6JNNWFSZP","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQB6JNNWFSZPF2HJ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQB6JNNW","created_at":"2026-05-18T12:31:39.905425+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/RQB6JNNWFSZPF2HJYN4FLB246K","json":"https://pith.science/pith/RQB6JNNWFSZPF2HJYN4FLB246K.json","graph_json":"https://pith.science/api/pith-number/RQB6JNNWFSZPF2HJYN4FLB246K/graph.json","events_json":"https://pith.science/api/pith-number/RQB6JNNWFSZPF2HJYN4FLB246K/events.json","paper":"https://pith.science/paper/RQB6JNNW"},"agent_actions":{"view_html":"https://pith.science/pith/RQB6JNNWFSZPF2HJYN4FLB246K","download_json":"https://pith.science/pith/RQB6JNNWFSZPF2HJYN4FLB246K.json","view_paper":"https://pith.science/paper/RQB6JNNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00940&json=true","fetch_graph":"https://pith.science/api/pith-number/RQB6JNNWFSZPF2HJYN4FLB246K/graph.json","fetch_events":"https://pith.science/api/pith-number/RQB6JNNWFSZPF2HJYN4FLB246K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQB6JNNWFSZPF2HJYN4FLB246K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQB6JNNWFSZPF2HJYN4FLB246K/action/storage_attestation","attest_author":"https://pith.science/pith/RQB6JNNWFSZPF2HJYN4FLB246K/action/author_attestation","sign_citation":"https://pith.science/pith/RQB6JNNWFSZPF2HJYN4FLB246K/action/citation_signature","submit_replication":"https://pith.science/pith/RQB6JNNWFSZPF2HJYN4FLB246K/action/replication_record"}},"created_at":"2026-05-18T00:28:22.327918+00:00","updated_at":"2026-05-18T00:28:22.327918+00:00"}