{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CKSTRCCGSPOQELRYBI4HESSDIR","short_pith_number":"pith:CKSTRCCG","canonical_record":{"source":{"id":"2605.21932","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-05-21T03:00:47Z","cross_cats_sorted":[],"title_canon_sha256":"f7fc9515370c6e91af3b629384e05e8a0e052c53f1fad0c7130a49a73719868c","abstract_canon_sha256":"0b7921b456b77211ff36379de6b7a850d41f55ed20120fc0aceb0b48d44291ca"},"schema_version":"1.0"},"canonical_sha256":"12a538884693dd022e380a38724a434451092ef1bc07ceda64d541dc13ad6490","source":{"kind":"arxiv","id":"2605.21932","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21932","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21932v1","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21932","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"pith_short_12","alias_value":"CKSTRCCGSPOQ","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"pith_short_16","alias_value":"CKSTRCCGSPOQELRY","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"pith_short_8","alias_value":"CKSTRCCG","created_at":"2026-05-22T01:04:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CKSTRCCGSPOQELRYBI4HESSDIR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21932","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-05-21T03:00:47Z","cross_cats_sorted":[],"title_canon_sha256":"f7fc9515370c6e91af3b629384e05e8a0e052c53f1fad0c7130a49a73719868c","abstract_canon_sha256":"0b7921b456b77211ff36379de6b7a850d41f55ed20120fc0aceb0b48d44291ca"},"schema_version":"1.0"},"canonical_sha256":"12a538884693dd022e380a38724a434451092ef1bc07ceda64d541dc13ad6490","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:15.537739Z","signature_b64":"t94jBnm64w6BnAuGKtyWe52i8X1/SfvNjDKp/cSW86Q+Su2zcRKIjucOhz3b7zvRQelUYJsB8YCLoSGBEX8RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12a538884693dd022e380a38724a434451092ef1bc07ceda64d541dc13ad6490","last_reissued_at":"2026-05-22T01:04:15.536891Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:15.536891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21932","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-22T01:04:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOMZUbikzDEnbqYLVgmpIBgLn1ck3CXLI5/OF+kHFEqKNYO38HjVED2+ZZQUMT5GHKK07ld/GCFcoDifNoRYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:37:00.299480Z"},"content_sha256":"a4d2d885d61e95c950bea71bcaf5dfc2e1231d563c6ac94a92c636e73c0a660b","schema_version":"1.0","event_id":"sha256:a4d2d885d61e95c950bea71bcaf5dfc2e1231d563c6ac94a92c636e73c0a660b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CKSTRCCGSPOQELRYBI4HESSDIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Auction-Consensus Algorithm with Learned Bidding Scheme for Multi-Robot Systems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Constantine Tarawneh, Jose Rodriguez, Qi Lu, Sven Koenig, Wenjie Dong","submitted_at":"2026-05-21T03:00:47Z","abstract_excerpt":"Multi-Robot Task Allocation (MRTA) is a central challenge in decentralized multi-agent systems, where teams of robots must cooperatively assign and execute tasks under limited communication while optimizing global performance objectives. Auction-consensus algorithms, such as the Consensus-Based Bundle Algorithm (CBBA), provide scalable decentralized coordination with provable convergence, but rely on hand-crafted greedy scoring functions that often lead to suboptimal task allocations. This paper proposes a learning-enhanced auction-consensus framework in which CBBA's deterministic bidding mech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21932","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21932/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-22T01:04:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDny5o1PeKExIkkGZS3N1ko8cgAle+Soe0Lgv/zChyqto6a8Io7jBXttBuajuPTa1gXhUhpxvU8sjbSgLFWuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:37:00.299876Z"},"content_sha256":"d2f95cfe96ec135feb54c6d9b39d6d7759d86c8b7eebd7f9660f3a01453854f2","schema_version":"1.0","event_id":"sha256:d2f95cfe96ec135feb54c6d9b39d6d7759d86c8b7eebd7f9660f3a01453854f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKSTRCCGSPOQELRYBI4HESSDIR/bundle.json","state_url":"https://pith.science/pith/CKSTRCCGSPOQELRYBI4HESSDIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKSTRCCGSPOQELRYBI4HESSDIR/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-12T06:37:00Z","links":{"resolver":"https://pith.science/pith/CKSTRCCGSPOQELRYBI4HESSDIR","bundle":"https://pith.science/pith/CKSTRCCGSPOQELRYBI4HESSDIR/bundle.json","state":"https://pith.science/pith/CKSTRCCGSPOQELRYBI4HESSDIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKSTRCCGSPOQELRYBI4HESSDIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CKSTRCCGSPOQELRYBI4HESSDIR","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":"0b7921b456b77211ff36379de6b7a850d41f55ed20120fc0aceb0b48d44291ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-05-21T03:00:47Z","title_canon_sha256":"f7fc9515370c6e91af3b629384e05e8a0e052c53f1fad0c7130a49a73719868c"},"schema_version":"1.0","source":{"id":"2605.21932","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21932","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21932v1","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21932","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"pith_short_12","alias_value":"CKSTRCCGSPOQ","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"pith_short_16","alias_value":"CKSTRCCGSPOQELRY","created_at":"2026-05-22T01:04:15Z"},{"alias_kind":"pith_short_8","alias_value":"CKSTRCCG","created_at":"2026-05-22T01:04:15Z"}],"graph_snapshots":[{"event_id":"sha256:d2f95cfe96ec135feb54c6d9b39d6d7759d86c8b7eebd7f9660f3a01453854f2","target":"graph","created_at":"2026-05-22T01:04:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.21932/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-Robot Task Allocation (MRTA) is a central challenge in decentralized multi-agent systems, where teams of robots must cooperatively assign and execute tasks under limited communication while optimizing global performance objectives. Auction-consensus algorithms, such as the Consensus-Based Bundle Algorithm (CBBA), provide scalable decentralized coordination with provable convergence, but rely on hand-crafted greedy scoring functions that often lead to suboptimal task allocations. This paper proposes a learning-enhanced auction-consensus framework in which CBBA's deterministic bidding mech","authors_text":"Constantine Tarawneh, Jose Rodriguez, Qi Lu, Sven Koenig, Wenjie Dong","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-05-21T03:00:47Z","title":"Auction-Consensus Algorithm with Learned Bidding Scheme for Multi-Robot Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21932","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:a4d2d885d61e95c950bea71bcaf5dfc2e1231d563c6ac94a92c636e73c0a660b","target":"record","created_at":"2026-05-22T01:04:15Z","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":"0b7921b456b77211ff36379de6b7a850d41f55ed20120fc0aceb0b48d44291ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-05-21T03:00:47Z","title_canon_sha256":"f7fc9515370c6e91af3b629384e05e8a0e052c53f1fad0c7130a49a73719868c"},"schema_version":"1.0","source":{"id":"2605.21932","kind":"arxiv","version":1}},"canonical_sha256":"12a538884693dd022e380a38724a434451092ef1bc07ceda64d541dc13ad6490","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12a538884693dd022e380a38724a434451092ef1bc07ceda64d541dc13ad6490","first_computed_at":"2026-05-22T01:04:15.536891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:15.536891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t94jBnm64w6BnAuGKtyWe52i8X1/SfvNjDKp/cSW86Q+Su2zcRKIjucOhz3b7zvRQelUYJsB8YCLoSGBEX8RDg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:15.537739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21932","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4d2d885d61e95c950bea71bcaf5dfc2e1231d563c6ac94a92c636e73c0a660b","sha256:d2f95cfe96ec135feb54c6d9b39d6d7759d86c8b7eebd7f9660f3a01453854f2"],"state_sha256":"cb24419265517276419979e1e34af21616fb5034b452e88012b5b3e86fe5faa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gh7MKSfNNyapRBKS0lSLAEzbepkpOCxQGEpbiSt7NlIlWnL0WisWUU+LblXmR6gf5milRDe/KAECGYWULuMODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:37:00.302492Z","bundle_sha256":"6f74ad0d570dc7be5bb9c6293a6b9f9a9968df90552e1cb4f4ec12ad118013d7"}}