{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ETZXCE5RE53EQOF5IGZV3K6K2X","short_pith_number":"pith:ETZXCE5R","canonical_record":{"source":{"id":"1702.08736","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-28T10:49:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"20aa609cbd667176f161db034d44d1580e24c524a95eb628926a04c015e1d50e","abstract_canon_sha256":"ff52596c3e799525e4a9d87de0ca02014d3cc507787a427cbedde4751f38d8c8"},"schema_version":"1.0"},"canonical_sha256":"24f37113b127764838bd41b35dabcad5cabd4ff5d6dceadf7eec721b99fee1bb","source":{"kind":"arxiv","id":"1702.08736","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08736","created_at":"2026-05-18T00:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08736v2","created_at":"2026-05-18T00:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08736","created_at":"2026-05-18T00:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"ETZXCE5RE53E","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ETZXCE5RE53EQOF5","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ETZXCE5R","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ETZXCE5RE53EQOF5IGZV3K6K2X","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08736","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-28T10:49:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"20aa609cbd667176f161db034d44d1580e24c524a95eb628926a04c015e1d50e","abstract_canon_sha256":"ff52596c3e799525e4a9d87de0ca02014d3cc507787a427cbedde4751f38d8c8"},"schema_version":"1.0"},"canonical_sha256":"24f37113b127764838bd41b35dabcad5cabd4ff5d6dceadf7eec721b99fee1bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:36.825678Z","signature_b64":"1ppPyrkb+kZNR1nzkdSpJugfO0Gdo5hp8cd/3rluoqOmnx2bq/n3S3CvdUhK1wnDKgspQ7myAE2E79IPv9v4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24f37113b127764838bd41b35dabcad5cabd4ff5d6dceadf7eec721b99fee1bb","last_reissued_at":"2026-05-18T00:47:36.825087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:36.825087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08736","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-18T00:47:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Io6E4JBpW5gte6+Ie6zCTCPQjCk6IwhTydfhBKUtiMIenMNX7LzbxF0pdKw+emSg0AQz0yQfHhawV0Jc+aGWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:21:06.045664Z"},"content_sha256":"ad5487a860e4cd7b55e1abe57f13a459a86ff96806307b8839b055d480ee2a59","schema_version":"1.0","event_id":"sha256:ad5487a860e4cd7b55e1abe57f13a459a86ff96806307b8839b055d480ee2a59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ETZXCE5RE53EQOF5IGZV3K6K2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysing Congestion Problems in Multi-agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Ann Now\\'e, Peter Vrancx, Roxana R\\u{a}dulescu","submitted_at":"2017-02-28T10:49:36Z","abstract_excerpt":"Congestion problems are omnipresent in today's complex networks and represent a challenge in many research domains. In the context of Multi-agent Reinforcement Learning (MARL), approaches like difference rewards and resource abstraction have shown promising results in tackling such problems. Resource abstraction was shown to be an ideal candidate for solving large-scale resource allocation problems in a fully decentralized manner. However, its performance and applicability strongly depends on some, until now, undocumented assumptions. Two of the main congestion benchmark problems considered in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08736","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-18T00:47:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meegYRozler0SZuIVyuJ9Wc66ASNWDU8EMtjxoDp2sK2N33WsEr7yRWPsiVf5AI6t4rzg7+o4U8kEKbGh8wIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:21:06.046346Z"},"content_sha256":"fe6e48393b0d083a56932f18c056824c15588b899ab0830944a9d038a7b87e62","schema_version":"1.0","event_id":"sha256:fe6e48393b0d083a56932f18c056824c15588b899ab0830944a9d038a7b87e62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETZXCE5RE53EQOF5IGZV3K6K2X/bundle.json","state_url":"https://pith.science/pith/ETZXCE5RE53EQOF5IGZV3K6K2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETZXCE5RE53EQOF5IGZV3K6K2X/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-05-27T00:21:06Z","links":{"resolver":"https://pith.science/pith/ETZXCE5RE53EQOF5IGZV3K6K2X","bundle":"https://pith.science/pith/ETZXCE5RE53EQOF5IGZV3K6K2X/bundle.json","state":"https://pith.science/pith/ETZXCE5RE53EQOF5IGZV3K6K2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETZXCE5RE53EQOF5IGZV3K6K2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ETZXCE5RE53EQOF5IGZV3K6K2X","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":"ff52596c3e799525e4a9d87de0ca02014d3cc507787a427cbedde4751f38d8c8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-28T10:49:36Z","title_canon_sha256":"20aa609cbd667176f161db034d44d1580e24c524a95eb628926a04c015e1d50e"},"schema_version":"1.0","source":{"id":"1702.08736","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08736","created_at":"2026-05-18T00:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08736v2","created_at":"2026-05-18T00:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08736","created_at":"2026-05-18T00:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"ETZXCE5RE53E","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ETZXCE5RE53EQOF5","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ETZXCE5R","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:fe6e48393b0d083a56932f18c056824c15588b899ab0830944a9d038a7b87e62","target":"graph","created_at":"2026-05-18T00:47:36Z","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":"Congestion problems are omnipresent in today's complex networks and represent a challenge in many research domains. In the context of Multi-agent Reinforcement Learning (MARL), approaches like difference rewards and resource abstraction have shown promising results in tackling such problems. Resource abstraction was shown to be an ideal candidate for solving large-scale resource allocation problems in a fully decentralized manner. However, its performance and applicability strongly depends on some, until now, undocumented assumptions. Two of the main congestion benchmark problems considered in","authors_text":"Ann Now\\'e, Peter Vrancx, Roxana R\\u{a}dulescu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-28T10:49:36Z","title":"Analysing Congestion Problems in Multi-agent Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08736","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:ad5487a860e4cd7b55e1abe57f13a459a86ff96806307b8839b055d480ee2a59","target":"record","created_at":"2026-05-18T00:47:36Z","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":"ff52596c3e799525e4a9d87de0ca02014d3cc507787a427cbedde4751f38d8c8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-28T10:49:36Z","title_canon_sha256":"20aa609cbd667176f161db034d44d1580e24c524a95eb628926a04c015e1d50e"},"schema_version":"1.0","source":{"id":"1702.08736","kind":"arxiv","version":2}},"canonical_sha256":"24f37113b127764838bd41b35dabcad5cabd4ff5d6dceadf7eec721b99fee1bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24f37113b127764838bd41b35dabcad5cabd4ff5d6dceadf7eec721b99fee1bb","first_computed_at":"2026-05-18T00:47:36.825087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:36.825087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ppPyrkb+kZNR1nzkdSpJugfO0Gdo5hp8cd/3rluoqOmnx2bq/n3S3CvdUhK1wnDKgspQ7myAE2E79IPv9v4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:36.825678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08736","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad5487a860e4cd7b55e1abe57f13a459a86ff96806307b8839b055d480ee2a59","sha256:fe6e48393b0d083a56932f18c056824c15588b899ab0830944a9d038a7b87e62"],"state_sha256":"30e5548dbfc1d1f81e9552561c8035b2eab591b60ba0c4f479d17d02ba2c5b38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v997xZHTt7EVK0dzp/iFukxQvpJe2ROJuunObWLsy5LhFLwwRs8Hgf4lGLOFcT8L6Hmzw0k+2pL0S7+vdjJ3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:21:06.049744Z","bundle_sha256":"c412f97370352ba8feebaf4036381ba00db03a325e4227ccad5ace6d3fca3daa"}}