{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YILM3PYA2QAN4HRNJCG7IUQWUA","short_pith_number":"pith:YILM3PYA","canonical_record":{"source":{"id":"2608.00648","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-08-01T13:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"318073dc74754f8e55740bfe7efe1417bdeb95c6cd12a11fc11d6ba80ecc217e","abstract_canon_sha256":"f2d1866bd028fe898b70123e0b7bfd16b56bb53dd9cdf61ed81c71a522fc8737"},"schema_version":"1.0"},"canonical_sha256":"c216cdbf00d400de1e2d488df45216a0231b6cb2a650512926a53831eb2a1988","source":{"kind":"arxiv","id":"2608.00648","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00648","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00648v1","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00648","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"YILM3PYA2QAN","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"YILM3PYA2QAN4HRN","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"YILM3PYA","created_at":"2026-08-04T00:38:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YILM3PYA2QAN4HRNJCG7IUQWUA","target":"record","payload":{"canonical_record":{"source":{"id":"2608.00648","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-08-01T13:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"318073dc74754f8e55740bfe7efe1417bdeb95c6cd12a11fc11d6ba80ecc217e","abstract_canon_sha256":"f2d1866bd028fe898b70123e0b7bfd16b56bb53dd9cdf61ed81c71a522fc8737"},"schema_version":"1.0"},"canonical_sha256":"c216cdbf00d400de1e2d488df45216a0231b6cb2a650512926a53831eb2a1988","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T00:38:27.640340Z","signature_b64":"9DNB7KZjLcQMQft7vRxCDBuncOcEQhASgFWANm8rWs8hL7gNzmuUUgqbnOKWtraDUB7xWBq72vuZA1xCw87KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c216cdbf00d400de1e2d488df45216a0231b6cb2a650512926a53831eb2a1988","last_reissued_at":"2026-08-04T00:38:27.638748Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T00:38:27.638748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.00648","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-08-04T00:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLRC1ML49TEH6lbyRwnOJO9iIrIlYcCmVarDR/f5Oot5hbwkBbe0j99GwB5GCkcdSXdo0oSmYTNfGgim7hmDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:39:50.435010Z"},"content_sha256":"9d20ff968fda72703645865b0031eaf52cbf18e2f5df3b1caebadc797b407fc9","schema_version":"1.0","event_id":"sha256:9d20ff968fda72703645865b0031eaf52cbf18e2f5df3b1caebadc797b407fc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YILM3PYA2QAN4HRNJCG7IUQWUA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Licheng Wang, Mingtao Huang, Yuan Shen","submitted_at":"2026-08-01T13:08:16Z","abstract_excerpt":"Cooperative task scheduling in communication-constrained distributed multi-agent systems is challenging because each agent must make decisions from partial and dynamic observations while satisfying complex practical constraints. Existing heuristics rely on handcrafted bidding rules and repeated consensus, whereas many learning-based methods assume global observations and lack explicit communication-based coordination. To address these limitations, this paper proposes a neural scheduling framework for distributed multi-robot task allocation (MRTA), consisting of a multi-decoder graph attention "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00648","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/2608.00648/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-08-04T00:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4NjstqhxZiYSg8WdJ1VZNyJUXM9B5mvAVbFh6JMyOyOxvjeFBPNIBdLGpfsiXrz5KwVjlIikiJqnKjbT61rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:39:50.435505Z"},"content_sha256":"e328a9e19438faa0c7fd775d4eeb05968a9fbbe6b91c97ff034ad9eaee6f86e4","schema_version":"1.0","event_id":"sha256:e328a9e19438faa0c7fd775d4eeb05968a9fbbe6b91c97ff034ad9eaee6f86e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YILM3PYA2QAN4HRNJCG7IUQWUA/bundle.json","state_url":"https://pith.science/pith/YILM3PYA2QAN4HRNJCG7IUQWUA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YILM3PYA2QAN4HRNJCG7IUQWUA/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-08-10T01:39:50Z","links":{"resolver":"https://pith.science/pith/YILM3PYA2QAN4HRNJCG7IUQWUA","bundle":"https://pith.science/pith/YILM3PYA2QAN4HRNJCG7IUQWUA/bundle.json","state":"https://pith.science/pith/YILM3PYA2QAN4HRNJCG7IUQWUA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YILM3PYA2QAN4HRNJCG7IUQWUA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YILM3PYA2QAN4HRNJCG7IUQWUA","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":"f2d1866bd028fe898b70123e0b7bfd16b56bb53dd9cdf61ed81c71a522fc8737","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-08-01T13:08:16Z","title_canon_sha256":"318073dc74754f8e55740bfe7efe1417bdeb95c6cd12a11fc11d6ba80ecc217e"},"schema_version":"1.0","source":{"id":"2608.00648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00648","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00648v1","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00648","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"YILM3PYA2QAN","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"YILM3PYA2QAN4HRN","created_at":"2026-08-04T00:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"YILM3PYA","created_at":"2026-08-04T00:38:27Z"}],"graph_snapshots":[{"event_id":"sha256:e328a9e19438faa0c7fd775d4eeb05968a9fbbe6b91c97ff034ad9eaee6f86e4","target":"graph","created_at":"2026-08-04T00:38:27Z","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/2608.00648/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cooperative task scheduling in communication-constrained distributed multi-agent systems is challenging because each agent must make decisions from partial and dynamic observations while satisfying complex practical constraints. Existing heuristics rely on handcrafted bidding rules and repeated consensus, whereas many learning-based methods assume global observations and lack explicit communication-based coordination. To address these limitations, this paper proposes a neural scheduling framework for distributed multi-robot task allocation (MRTA), consisting of a multi-decoder graph attention ","authors_text":"Licheng Wang, Mingtao Huang, Yuan Shen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00648","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:9d20ff968fda72703645865b0031eaf52cbf18e2f5df3b1caebadc797b407fc9","target":"record","created_at":"2026-08-04T00:38:27Z","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":"f2d1866bd028fe898b70123e0b7bfd16b56bb53dd9cdf61ed81c71a522fc8737","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2026-08-01T13:08:16Z","title_canon_sha256":"318073dc74754f8e55740bfe7efe1417bdeb95c6cd12a11fc11d6ba80ecc217e"},"schema_version":"1.0","source":{"id":"2608.00648","kind":"arxiv","version":1}},"canonical_sha256":"c216cdbf00d400de1e2d488df45216a0231b6cb2a650512926a53831eb2a1988","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c216cdbf00d400de1e2d488df45216a0231b6cb2a650512926a53831eb2a1988","first_computed_at":"2026-08-04T00:38:27.638748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T00:38:27.638748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9DNB7KZjLcQMQft7vRxCDBuncOcEQhASgFWANm8rWs8hL7gNzmuUUgqbnOKWtraDUB7xWBq72vuZA1xCw87KAg==","signature_status":"signed_v1","signed_at":"2026-08-04T00:38:27.640340Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.00648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d20ff968fda72703645865b0031eaf52cbf18e2f5df3b1caebadc797b407fc9","sha256:e328a9e19438faa0c7fd775d4eeb05968a9fbbe6b91c97ff034ad9eaee6f86e4"],"state_sha256":"eed37627cab82bbf45ab857def7c2a8bc82dca4eeb63682dc1a2a8d48c0661d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vn8T1553E736EKDr0ZNRG+cM50uBj9nswV8tfGxj9m+YCOz4wPNLXQfPJYc8cNHDAeq4J3o4D01m36b+8F/hCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T01:39:50.440943Z","bundle_sha256":"06ea982001f7bf30cf926eaef568fe63fb76136213455bf263a46ae2f0572e3a"}}