{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AKG6HPLPOBMO6K6XEE3SPLKHRA","short_pith_number":"pith:AKG6HPLP","canonical_record":{"source":{"id":"1508.05328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-08-21T16:30:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"68afda38950cd2716ccf1836de632149f475f7bcb22e01ef5fc77c8b0f7bb0e6","abstract_canon_sha256":"9de360c5123ea1c184c6b0fe38997ee275a8588ef0c72e76b5128da1a5793b50"},"schema_version":"1.0"},"canonical_sha256":"028de3bd6f7058ef2bd7213727ad4788369aa9fdbec92f0078096ce01cae82a6","source":{"kind":"arxiv","id":"1508.05328","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05328","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05328v2","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05328","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"AKG6HPLPOBMO","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AKG6HPLPOBMO6K6X","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AKG6HPLP","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AKG6HPLPOBMO6K6XEE3SPLKHRA","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-08-21T16:30:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"68afda38950cd2716ccf1836de632149f475f7bcb22e01ef5fc77c8b0f7bb0e6","abstract_canon_sha256":"9de360c5123ea1c184c6b0fe38997ee275a8588ef0c72e76b5128da1a5793b50"},"schema_version":"1.0"},"canonical_sha256":"028de3bd6f7058ef2bd7213727ad4788369aa9fdbec92f0078096ce01cae82a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:59.753829Z","signature_b64":"01LFf1QQ9rzwCAu60H3CgDA67/AjC0CHHxwBIuu8Nx5rPJbEa9TigQqEP6HKXTs5Tlg4VdrgRT/oQ8nCOBEQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"028de3bd6f7058ef2bd7213727ad4788369aa9fdbec92f0078096ce01cae82a6","last_reissued_at":"2026-05-18T01:17:59.753074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:59.753074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05328","source_version":2,"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-18T01:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mD5SqlEW4Q2a9nkKH6q56VU5fQdW2BzjY+qeBnhEJ+OOYA+39G6Off3xtDNYA9+4fRJoxOUTGoSAA0rGPQAwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:31:59.982624Z"},"content_sha256":"84b02191783b8ab413c520ae15e3d468f167237714ebcc93834783b44262ab01","schema_version":"1.0","event_id":"sha256:84b02191783b8ab413c520ae15e3d468f167237714ebcc93834783b44262ab01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AKG6HPLPOBMO6K6XEE3SPLKHRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-agent Reinforcement Learning with Sparse Interactions by Negotiation and Knowledge Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Chunlin Chen, Luowei Zhou, Pei Yang, Yang Gao","submitted_at":"2015-08-21T16:30:25Z","abstract_excerpt":"Reinforcement learning has significant applications for multi-agent systems, especially in unknown dynamic environments. However, most multi-agent reinforcement learning (MARL) algorithms suffer from such problems as exponential computation complexity in the joint state-action space, which makes it difficult to scale up to realistic multi-agent problems. In this paper, a novel algorithm named negotiation-based MARL with sparse interactions (NegoSI) is presented. In contrast to traditional sparse-interaction based MARL algorithms, NegoSI adopts the equilibrium concept and makes it possible for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05328","kind":"arxiv","version":2},"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-18T01:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQLNifbNoIbD1bnE1p5EZdWbwIl86eMWQz7ElhmIgksoJAb02Jd2+I1VhsqRC6Be4SOLe7JyRJHKHQode1APDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:31:59.982975Z"},"content_sha256":"2d02934833f833dc23a86c8f9bcf4dd497661df4b9e330fa26aec44a4f0fa9e7","schema_version":"1.0","event_id":"sha256:2d02934833f833dc23a86c8f9bcf4dd497661df4b9e330fa26aec44a4f0fa9e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKG6HPLPOBMO6K6XEE3SPLKHRA/bundle.json","state_url":"https://pith.science/pith/AKG6HPLPOBMO6K6XEE3SPLKHRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKG6HPLPOBMO6K6XEE3SPLKHRA/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-23T01:31:59Z","links":{"resolver":"https://pith.science/pith/AKG6HPLPOBMO6K6XEE3SPLKHRA","bundle":"https://pith.science/pith/AKG6HPLPOBMO6K6XEE3SPLKHRA/bundle.json","state":"https://pith.science/pith/AKG6HPLPOBMO6K6XEE3SPLKHRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKG6HPLPOBMO6K6XEE3SPLKHRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AKG6HPLPOBMO6K6XEE3SPLKHRA","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":"9de360c5123ea1c184c6b0fe38997ee275a8588ef0c72e76b5128da1a5793b50","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-08-21T16:30:25Z","title_canon_sha256":"68afda38950cd2716ccf1836de632149f475f7bcb22e01ef5fc77c8b0f7bb0e6"},"schema_version":"1.0","source":{"id":"1508.05328","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05328","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05328v2","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05328","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"AKG6HPLPOBMO","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AKG6HPLPOBMO6K6X","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AKG6HPLP","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:2d02934833f833dc23a86c8f9bcf4dd497661df4b9e330fa26aec44a4f0fa9e7","target":"graph","created_at":"2026-05-18T01:17:59Z","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":"Reinforcement learning has significant applications for multi-agent systems, especially in unknown dynamic environments. However, most multi-agent reinforcement learning (MARL) algorithms suffer from such problems as exponential computation complexity in the joint state-action space, which makes it difficult to scale up to realistic multi-agent problems. In this paper, a novel algorithm named negotiation-based MARL with sparse interactions (NegoSI) is presented. In contrast to traditional sparse-interaction based MARL algorithms, NegoSI adopts the equilibrium concept and makes it possible for ","authors_text":"Chunlin Chen, Luowei Zhou, Pei Yang, Yang Gao","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-08-21T16:30:25Z","title":"Multi-agent Reinforcement Learning with Sparse Interactions by Negotiation and Knowledge Transfer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05328","kind":"arxiv","version":2},"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:84b02191783b8ab413c520ae15e3d468f167237714ebcc93834783b44262ab01","target":"record","created_at":"2026-05-18T01:17:59Z","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":"9de360c5123ea1c184c6b0fe38997ee275a8588ef0c72e76b5128da1a5793b50","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-08-21T16:30:25Z","title_canon_sha256":"68afda38950cd2716ccf1836de632149f475f7bcb22e01ef5fc77c8b0f7bb0e6"},"schema_version":"1.0","source":{"id":"1508.05328","kind":"arxiv","version":2}},"canonical_sha256":"028de3bd6f7058ef2bd7213727ad4788369aa9fdbec92f0078096ce01cae82a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"028de3bd6f7058ef2bd7213727ad4788369aa9fdbec92f0078096ce01cae82a6","first_computed_at":"2026-05-18T01:17:59.753074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:59.753074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"01LFf1QQ9rzwCAu60H3CgDA67/AjC0CHHxwBIuu8Nx5rPJbEa9TigQqEP6HKXTs5Tlg4VdrgRT/oQ8nCOBEQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:59.753829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05328","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84b02191783b8ab413c520ae15e3d468f167237714ebcc93834783b44262ab01","sha256:2d02934833f833dc23a86c8f9bcf4dd497661df4b9e330fa26aec44a4f0fa9e7"],"state_sha256":"a59cf82ccfd46cfe54ac0b69669c16736632d4c47e1efbba40365973d31f88c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BmqFaAp5ceWWKOKq3lDj8Pfei1NkY3sG5xowIASWCQLL7SPK3IOFfikugJ8w9qN5aKbW5FqhkPR1MwQiSYFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T01:31:59.985089Z","bundle_sha256":"009d8700e86154450aeefdfb2731e1ce05cd515eb8318d64a11d26d32380af22"}}