{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FW46TM2JV3FHUNPBYGTOG2ZHP6","short_pith_number":"pith:FW46TM2J","schema_version":"1.0","canonical_sha256":"2db9e9b349aeca7a35e1c1a6e36b277f86e9e8b9fb9cab240eccf6587773d48d","source":{"kind":"arxiv","id":"1309.1973","version":1},"attestation_state":"computed","paper":{"title":"Regret-Based Multi-Agent Coordination with Uncertain Task Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Feng Wu, Nicholas R. Jennings","submitted_at":"2013-09-08T16:20:06Z","abstract_excerpt":"Many multi-agent coordination problems can be represented as DCOPs. Motivated by task allocation in disaster response, we extend standard DCOP models to consider uncertain task rewards where the outcome of completing a task depends on its current state, which is randomly drawn from unknown distributions. The goal of solving this problem is to find a solution for all agents that minimizes the overall worst-case loss. This is a challenging problem for centralized algorithms because the search space grows exponentially with the number of agents and is nontrivial for standard DCOP algorithms we ha"},"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":"1309.1973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-08T16:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"81a9b008e2460502b15e9ac3102621ddbf46c3217b416f9cd13b922b97273f58","abstract_canon_sha256":"ab83c972eb28b756aca681b0a78241027ce630b91e2f47e59f8a661bf33e6432"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:56.864111Z","signature_b64":"HvMMKpVAqwRIDAoAANvg+DZBP7xtLGVmKnoaMXpEPh+kAJqgAfDCc5X3mfusXIj2CVE3SnH60pspQdRlAbtsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2db9e9b349aeca7a35e1c1a6e36b277f86e9e8b9fb9cab240eccf6587773d48d","last_reissued_at":"2026-05-18T03:13:56.863498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:56.863498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret-Based Multi-Agent Coordination with Uncertain Task Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Feng Wu, Nicholas R. Jennings","submitted_at":"2013-09-08T16:20:06Z","abstract_excerpt":"Many multi-agent coordination problems can be represented as DCOPs. Motivated by task allocation in disaster response, we extend standard DCOP models to consider uncertain task rewards where the outcome of completing a task depends on its current state, which is randomly drawn from unknown distributions. The goal of solving this problem is to find a solution for all agents that minimizes the overall worst-case loss. This is a challenging problem for centralized algorithms because the search space grows exponentially with the number of agents and is nontrivial for standard DCOP algorithms we ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1973","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.1973","created_at":"2026-05-18T03:13:56.863621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1973v1","created_at":"2026-05-18T03:13:56.863621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1973","created_at":"2026-05-18T03:13:56.863621+00:00"},{"alias_kind":"pith_short_12","alias_value":"FW46TM2JV3FH","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FW46TM2JV3FHUNPB","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FW46TM2J","created_at":"2026-05-18T12:27:45.050594+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/FW46TM2JV3FHUNPBYGTOG2ZHP6","json":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6.json","graph_json":"https://pith.science/api/pith-number/FW46TM2JV3FHUNPBYGTOG2ZHP6/graph.json","events_json":"https://pith.science/api/pith-number/FW46TM2JV3FHUNPBYGTOG2ZHP6/events.json","paper":"https://pith.science/paper/FW46TM2J"},"agent_actions":{"view_html":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6","download_json":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6.json","view_paper":"https://pith.science/paper/FW46TM2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1973&json=true","fetch_graph":"https://pith.science/api/pith-number/FW46TM2JV3FHUNPBYGTOG2ZHP6/graph.json","fetch_events":"https://pith.science/api/pith-number/FW46TM2JV3FHUNPBYGTOG2ZHP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/action/storage_attestation","attest_author":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/action/author_attestation","sign_citation":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/action/citation_signature","submit_replication":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/action/replication_record"}},"created_at":"2026-05-18T03:13:56.863621+00:00","updated_at":"2026-05-18T03:13:56.863621+00:00"}