{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PJCTEQ6RAHXVORX65C7I6HWJMJ","short_pith_number":"pith:PJCTEQ6R","schema_version":"1.0","canonical_sha256":"7a453243d101ef5746fee8be8f1ec96277033c9457a0dbc3885140c3dcd2ef6a","source":{"kind":"arxiv","id":"2408.11186","version":4},"attestation_state":"computed","paper":{"title":"Sequential Resource Trading Using Comparison-Based Gradient Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.MA","authors_text":"Mustafa O. Karabag, Surya Murthy, Ufuk Topcu","submitted_at":"2024-08-20T20:42:41Z","abstract_excerpt":"We study sequential multi-issue trading between two greedily rational agents who exchange resources from a finite set of categories. Each agent's utility depends on its allocation, but the offering agent does not know the responding agent's utility function and receives only accept or reject feedback. We propose a comparison-based algorithm that interprets acceptance and rejection responses as pairwise state comparisons, allowing the offering agent to iteratively estimate the responding agent's gradient. Rejected offers prune the space of feasible gradient directions, enabling systematic refin"},"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":"2408.11186","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-08-20T20:42:41Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"fca2234b469b2725958f9a9dddc52698cf2496559905620c2bd3a9a9c71cf376","abstract_canon_sha256":"ed7b6e77ace8b102f3d69e5a1f712078f8025f44bf8d0138f8248de611fc1023"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.386203Z","signature_b64":"58MyFNVwukQLmPHOq+rU19EqRzXTcMUD+PPMYQarEedgHK20soWCKbQm5h/Hit2ZXemSC9ekXHskZNSAmvGSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a453243d101ef5746fee8be8f1ec96277033c9457a0dbc3885140c3dcd2ef6a","last_reissued_at":"2026-05-17T23:39:18.385531Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.385531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Resource Trading Using Comparison-Based Gradient Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.MA","authors_text":"Mustafa O. Karabag, Surya Murthy, Ufuk Topcu","submitted_at":"2024-08-20T20:42:41Z","abstract_excerpt":"We study sequential multi-issue trading between two greedily rational agents who exchange resources from a finite set of categories. Each agent's utility depends on its allocation, but the offering agent does not know the responding agent's utility function and receives only accept or reject feedback. We propose a comparison-based algorithm that interprets acceptance and rejection responses as pairwise state comparisons, allowing the offering agent to iteratively estimate the responding agent's gradient. Rejected offers prune the space of feasible gradient directions, enabling systematic refin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.11186","kind":"arxiv","version":4},"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":"2408.11186","created_at":"2026-05-17T23:39:18.385628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.11186v4","created_at":"2026-05-17T23:39:18.385628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.11186","created_at":"2026-05-17T23:39:18.385628+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJCTEQ6RAHXV","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJCTEQ6RAHXVORX6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJCTEQ6R","created_at":"2026-05-18T12:33:37.589309+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/PJCTEQ6RAHXVORX65C7I6HWJMJ","json":"https://pith.science/pith/PJCTEQ6RAHXVORX65C7I6HWJMJ.json","graph_json":"https://pith.science/api/pith-number/PJCTEQ6RAHXVORX65C7I6HWJMJ/graph.json","events_json":"https://pith.science/api/pith-number/PJCTEQ6RAHXVORX65C7I6HWJMJ/events.json","paper":"https://pith.science/paper/PJCTEQ6R"},"agent_actions":{"view_html":"https://pith.science/pith/PJCTEQ6RAHXVORX65C7I6HWJMJ","download_json":"https://pith.science/pith/PJCTEQ6RAHXVORX65C7I6HWJMJ.json","view_paper":"https://pith.science/paper/PJCTEQ6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.11186&json=true","fetch_graph":"https://pith.science/api/pith-number/PJCTEQ6RAHXVORX65C7I6HWJMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PJCTEQ6RAHXVORX65C7I6HWJMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJCTEQ6RAHXVORX65C7I6HWJMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJCTEQ6RAHXVORX65C7I6HWJMJ/action/storage_attestation","attest_author":"https://pith.science/pith/PJCTEQ6RAHXVORX65C7I6HWJMJ/action/author_attestation","sign_citation":"https://pith.science/pith/PJCTEQ6RAHXVORX65C7I6HWJMJ/action/citation_signature","submit_replication":"https://pith.science/pith/PJCTEQ6RAHXVORX65C7I6HWJMJ/action/replication_record"}},"created_at":"2026-05-17T23:39:18.385628+00:00","updated_at":"2026-05-17T23:39:18.385628+00:00"}