{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O5CVFZRLXI4TPFZDZW4ZK7BEW2","short_pith_number":"pith:O5CVFZRL","canonical_record":{"source":{"id":"1711.06871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-18T14:56:36Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"cef16093de6e3caf6d135dad507572689050f7555a2577a930c9b72e480a8e79","abstract_canon_sha256":"46c3af47453f286079bc3cda51c0b0829592fd332c534c8d10ee97edd2a8e18e"},"schema_version":"1.0"},"canonical_sha256":"774552e62bba39379723cdb9957c24b6b4722221d194c150f7315513960de5c3","source":{"kind":"arxiv","id":"1711.06871","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06871","created_at":"2026-05-17T23:59:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06871v2","created_at":"2026-05-17T23:59:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06871","created_at":"2026-05-17T23:59:39Z"},{"alias_kind":"pith_short_12","alias_value":"O5CVFZRLXI4T","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O5CVFZRLXI4TPFZD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O5CVFZRL","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O5CVFZRLXI4TPFZDZW4ZK7BEW2","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-18T14:56:36Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"cef16093de6e3caf6d135dad507572689050f7555a2577a930c9b72e480a8e79","abstract_canon_sha256":"46c3af47453f286079bc3cda51c0b0829592fd332c534c8d10ee97edd2a8e18e"},"schema_version":"1.0"},"canonical_sha256":"774552e62bba39379723cdb9957c24b6b4722221d194c150f7315513960de5c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:39.427021Z","signature_b64":"czL4aGFsqeXW/4KlAcq/YXQ5eHIjHXjFT33aM56OS96waVcn00ld5iIpPyJiFLSOyyRapyEpMvBw/wgwCThaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"774552e62bba39379723cdb9957c24b6b4722221d194c150f7315513960de5c3","last_reissued_at":"2026-05-17T23:59:39.426371Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:39.426371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06871","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-17T23:59:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zf59CoODn9rgb8EoK3vIvA8NeCEaS2WwcMUgXYnKU9P8osYmfvhJ+4K9wMU6V3cPW28sws+gDwe4wmPyM/X1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:08:46.110281Z"},"content_sha256":"05ed156839c7045816cf1b06c8fb5f91a4c9a9a8323acfbca858a3c67975ecca","schema_version":"1.0","event_id":"sha256:05ed156839c7045816cf1b06c8fb5f91a4c9a9a8323acfbca858a3c67975ecca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O5CVFZRLXI4TPFZDZW4ZK7BEW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.MA","authors_text":"Antonios Tsourdos, Hyo-Sang Shin, Inmo Jang","submitted_at":"2017-11-18T14:56:36Z","abstract_excerpt":"This paper proposes a novel game-theoretical autonomous decision-making framework to address a task allocation problem for a swarm of multiple agents. We consider cooperation of self-interested agents, and show that our proposed decentralized algorithm guarantees convergence of agents with social inhibition to a Nash stable partition (i.e., social agreement) within polynomial time. The algorithm is simple and executable based on local interactions with neighbor agents under a strongly-connected communication network and even in asynchronous environments. We analytically present a mathematical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06871","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-17T23:59:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2MB6k1oIqnPkHywzx/7f0pBLz2bbbrfn4L5OkTpHKycoJ7hAcrHUHycaKfL3NzEkB+uUjUVQq1h+lNCpyG9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:08:46.110760Z"},"content_sha256":"57e0972f782472e3d6f0affc4f7f78ffe2ef5e33f458f095eef23535861038bf","schema_version":"1.0","event_id":"sha256:57e0972f782472e3d6f0affc4f7f78ffe2ef5e33f458f095eef23535861038bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/bundle.json","state_url":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/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-02T23:08:46Z","links":{"resolver":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2","bundle":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/bundle.json","state":"https://pith.science/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5CVFZRLXI4TPFZDZW4ZK7BEW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O5CVFZRLXI4TPFZDZW4ZK7BEW2","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":"46c3af47453f286079bc3cda51c0b0829592fd332c534c8d10ee97edd2a8e18e","cross_cats_sorted":["cs.AI","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-18T14:56:36Z","title_canon_sha256":"cef16093de6e3caf6d135dad507572689050f7555a2577a930c9b72e480a8e79"},"schema_version":"1.0","source":{"id":"1711.06871","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06871","created_at":"2026-05-17T23:59:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06871v2","created_at":"2026-05-17T23:59:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06871","created_at":"2026-05-17T23:59:39Z"},{"alias_kind":"pith_short_12","alias_value":"O5CVFZRLXI4T","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O5CVFZRLXI4TPFZD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O5CVFZRL","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:57e0972f782472e3d6f0affc4f7f78ffe2ef5e33f458f095eef23535861038bf","target":"graph","created_at":"2026-05-17T23:59:39Z","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":"This paper proposes a novel game-theoretical autonomous decision-making framework to address a task allocation problem for a swarm of multiple agents. We consider cooperation of self-interested agents, and show that our proposed decentralized algorithm guarantees convergence of agents with social inhibition to a Nash stable partition (i.e., social agreement) within polynomial time. The algorithm is simple and executable based on local interactions with neighbor agents under a strongly-connected communication network and even in asynchronous environments. We analytically present a mathematical ","authors_text":"Antonios Tsourdos, Hyo-Sang Shin, Inmo Jang","cross_cats":["cs.AI","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-18T14:56:36Z","title":"Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06871","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:05ed156839c7045816cf1b06c8fb5f91a4c9a9a8323acfbca858a3c67975ecca","target":"record","created_at":"2026-05-17T23:59:39Z","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":"46c3af47453f286079bc3cda51c0b0829592fd332c534c8d10ee97edd2a8e18e","cross_cats_sorted":["cs.AI","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-18T14:56:36Z","title_canon_sha256":"cef16093de6e3caf6d135dad507572689050f7555a2577a930c9b72e480a8e79"},"schema_version":"1.0","source":{"id":"1711.06871","kind":"arxiv","version":2}},"canonical_sha256":"774552e62bba39379723cdb9957c24b6b4722221d194c150f7315513960de5c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"774552e62bba39379723cdb9957c24b6b4722221d194c150f7315513960de5c3","first_computed_at":"2026-05-17T23:59:39.426371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:39.426371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"czL4aGFsqeXW/4KlAcq/YXQ5eHIjHXjFT33aM56OS96waVcn00ld5iIpPyJiFLSOyyRapyEpMvBw/wgwCThaAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:39.427021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06871","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05ed156839c7045816cf1b06c8fb5f91a4c9a9a8323acfbca858a3c67975ecca","sha256:57e0972f782472e3d6f0affc4f7f78ffe2ef5e33f458f095eef23535861038bf"],"state_sha256":"18f1a8328cc01fba92326d1a8708a0c5d3cfdf8bad8fe03411c561e37092c29b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFFwxWQPl4e5M1W9IWOK0bfA3xjTgqAJZCf/Mz0x6MoTyE2qR3E+4ZB0LCSzezilRnzutAVIS6nMVohtLcYgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:08:46.112885Z","bundle_sha256":"180b64a9e5151df4eebf734a6cac5193af65ff1cc9e5d527789c198871f1669f"}}