{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FW46TM2JV3FHUNPBYGTOG2ZHP6","short_pith_number":"pith:FW46TM2J","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"},"canonical_sha256":"2db9e9b349aeca7a35e1c1a6e36b277f86e9e8b9fb9cab240eccf6587773d48d","source":{"kind":"arxiv","id":"1309.1973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1973","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1973v1","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1973","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"FW46TM2JV3FH","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FW46TM2JV3FHUNPB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FW46TM2J","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FW46TM2JV3FHUNPBYGTOG2ZHP6","target":"record","payload":{"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"},"canonical_sha256":"2db9e9b349aeca7a35e1c1a6e36b277f86e9e8b9fb9cab240eccf6587773d48d","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"},"source_kind":"arxiv","source_id":"1309.1973","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-18T03:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b51laYKP10keHXVds0vbYt+jHLRPzLEL6WAjDq8HdNsgo2CINLmL+SGIaye7quuI3wJMeQK84I5HIc43kHCbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:56:51.690089Z"},"content_sha256":"077d8c35f5c0592ca943a184409e9e2770648cdec69e9bcb1aa35430ab971166","schema_version":"1.0","event_id":"sha256:077d8c35f5c0592ca943a184409e9e2770648cdec69e9bcb1aa35430ab971166"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FW46TM2JV3FHUNPBYGTOG2ZHP6","target":"graph","payload":{"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"},"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-18T03:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pz8hLMCo5Cljhw/aS56+a8qXwGDck3ZtkWsoU1kobZS476CM4JTEdtqld2yrx2NTKw/F8PdCeQ0nyfmDQuvVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:56:51.690761Z"},"content_sha256":"e31429172d3fafcd934e1569e7cb7163f97e277328e1bbd9b5933c88de2ab47e","schema_version":"1.0","event_id":"sha256:e31429172d3fafcd934e1569e7cb7163f97e277328e1bbd9b5933c88de2ab47e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/bundle.json","state_url":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/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-07T11:56:51Z","links":{"resolver":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6","bundle":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/bundle.json","state":"https://pith.science/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FW46TM2JV3FHUNPBYGTOG2ZHP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FW46TM2JV3FHUNPBYGTOG2ZHP6","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":"ab83c972eb28b756aca681b0a78241027ce630b91e2f47e59f8a661bf33e6432","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-08T16:20:06Z","title_canon_sha256":"81a9b008e2460502b15e9ac3102621ddbf46c3217b416f9cd13b922b97273f58"},"schema_version":"1.0","source":{"id":"1309.1973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1973","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1973v1","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1973","created_at":"2026-05-18T03:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"FW46TM2JV3FH","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FW46TM2JV3FHUNPB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FW46TM2J","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:e31429172d3fafcd934e1569e7cb7163f97e277328e1bbd9b5933c88de2ab47e","target":"graph","created_at":"2026-05-18T03:13:56Z","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":"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","authors_text":"Feng Wu, Nicholas R. Jennings","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-08T16:20:06Z","title":"Regret-Based Multi-Agent Coordination with Uncertain Task Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1973","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:077d8c35f5c0592ca943a184409e9e2770648cdec69e9bcb1aa35430ab971166","target":"record","created_at":"2026-05-18T03:13:56Z","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":"ab83c972eb28b756aca681b0a78241027ce630b91e2f47e59f8a661bf33e6432","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-08T16:20:06Z","title_canon_sha256":"81a9b008e2460502b15e9ac3102621ddbf46c3217b416f9cd13b922b97273f58"},"schema_version":"1.0","source":{"id":"1309.1973","kind":"arxiv","version":1}},"canonical_sha256":"2db9e9b349aeca7a35e1c1a6e36b277f86e9e8b9fb9cab240eccf6587773d48d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2db9e9b349aeca7a35e1c1a6e36b277f86e9e8b9fb9cab240eccf6587773d48d","first_computed_at":"2026-05-18T03:13:56.863498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:56.863498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HvMMKpVAqwRIDAoAANvg+DZBP7xtLGVmKnoaMXpEPh+kAJqgAfDCc5X3mfusXIj2CVE3SnH60pspQdRlAbtsAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:56.864111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:077d8c35f5c0592ca943a184409e9e2770648cdec69e9bcb1aa35430ab971166","sha256:e31429172d3fafcd934e1569e7cb7163f97e277328e1bbd9b5933c88de2ab47e"],"state_sha256":"b2c92a073b3f04ad27f56bfd7e98529e3776f43250064f7c94c9a0f3c175bff2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKBaHnlfDpNcuuFBslJf3Eb/hI7tD2eJiVYW6cV+I4jB6yhpkRacP5DYKkE/6vQOn5mAHI//1Ci34K9t2mJMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:56:51.694193Z","bundle_sha256":"1416d7fa70c4cb5c22615a49445fa1087abdd83ff598a7e2c9960e76dd38b612"}}