{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DENFTQRVK27AS5JRIK3NI36VRZ","short_pith_number":"pith:DENFTQRV","canonical_record":{"source":{"id":"1801.00218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T01:10:39Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b6005d0896c6c294a0f86669509afbbbc0c87afe83f035c755cad0653ea11ea5","abstract_canon_sha256":"74d53eb23394816cea69ef1d7587f15d5d993839e766e3c3edb428a05fd0291c"},"schema_version":"1.0"},"canonical_sha256":"191a59c23556be09753142b6d46fd58e4be738b64bd69569cca2af8abeb21f01","source":{"kind":"arxiv","id":"1801.00218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00218","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00218v1","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00218","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"DENFTQRVK27A","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DENFTQRVK27AS5JR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DENFTQRV","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DENFTQRVK27AS5JRIK3NI36VRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T01:10:39Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b6005d0896c6c294a0f86669509afbbbc0c87afe83f035c755cad0653ea11ea5","abstract_canon_sha256":"74d53eb23394816cea69ef1d7587f15d5d993839e766e3c3edb428a05fd0291c"},"schema_version":"1.0"},"canonical_sha256":"191a59c23556be09753142b6d46fd58e4be738b64bd69569cca2af8abeb21f01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:59.060493Z","signature_b64":"wTdxibPjVL9/usrHM3mQ+q3O2Vu7WZPg/MObdxg7ZyFcfSL1OTuv0e7xqCR2YPxSQFskoCjrDn0jIh4yctWHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"191a59c23556be09753142b6d46fd58e4be738b64bd69569cca2af8abeb21f01","last_reissued_at":"2026-05-18T00:26:59.059757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:59.059757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00218","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-18T00:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpu5Z0W9ySJS5m2VrsZarW6nQWUO+yxQQNUzA0tOuZ0cS5HgS50DjemkjrRU7iHDlC2q2h5Xqoh6IMP353DnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:21:07.525999Z"},"content_sha256":"1c75a4a8a49856eeddce6d7a2acad3dd5e2cdb1b3b70eac54825ad4d47ac3575","schema_version":"1.0","event_id":"sha256:1c75a4a8a49856eeddce6d7a2acad3dd5e2cdb1b3b70eac54825ad4d47ac3575"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DENFTQRVK27AS5JRIK3NI36VRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Game-theoretic Network Centrality: A Review","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Mateusz K. Tarkowski, Michael Wooldridge, Talal Rahwan, Tomasz P. Michalak","submitted_at":"2017-12-31T01:10:39Z","abstract_excerpt":"Game-theoretic centrality is a flexible and sophisticated approach to identify the most important nodes in a network. It builds upon the methods from cooperative game theory and network theory. The key idea is to treat nodes as players in a cooperative game, where the value of each coalition is determined by certain graph-theoretic properties. Using solution concepts from cooperative game theory, it is then possible to measure how responsible each node is for the worth of the network.\n  The literature on the topic is already quite large, and is scattered among game-theoretic and computer scien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00218","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":""},"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:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYTH1V9UTjik4B0dNsJ6X2+pBmRt1u6jHZj+BYik3iyX3jdJKNfts2udi1ntqus833q5ezGSpTayyqFGKESWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:21:07.526749Z"},"content_sha256":"4c01bef539b6cbf08b410b6323e1c91019ad9f7fa5679796ff46874f7b7a2f3c","schema_version":"1.0","event_id":"sha256:4c01bef539b6cbf08b410b6323e1c91019ad9f7fa5679796ff46874f7b7a2f3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/bundle.json","state_url":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DENFTQRVK27AS5JRIK3NI36VRZ/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-23T11:21:07Z","links":{"resolver":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ","bundle":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/bundle.json","state":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DENFTQRVK27AS5JRIK3NI36VRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DENFTQRVK27AS5JRIK3NI36VRZ","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":"74d53eb23394816cea69ef1d7587f15d5d993839e766e3c3edb428a05fd0291c","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T01:10:39Z","title_canon_sha256":"b6005d0896c6c294a0f86669509afbbbc0c87afe83f035c755cad0653ea11ea5"},"schema_version":"1.0","source":{"id":"1801.00218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00218","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00218v1","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00218","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"DENFTQRVK27A","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DENFTQRVK27AS5JR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DENFTQRV","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:4c01bef539b6cbf08b410b6323e1c91019ad9f7fa5679796ff46874f7b7a2f3c","target":"graph","created_at":"2026-05-18T00:26: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":"Game-theoretic centrality is a flexible and sophisticated approach to identify the most important nodes in a network. It builds upon the methods from cooperative game theory and network theory. The key idea is to treat nodes as players in a cooperative game, where the value of each coalition is determined by certain graph-theoretic properties. Using solution concepts from cooperative game theory, it is then possible to measure how responsible each node is for the worth of the network.\n  The literature on the topic is already quite large, and is scattered among game-theoretic and computer scien","authors_text":"Mateusz K. Tarkowski, Michael Wooldridge, Talal Rahwan, Tomasz P. Michalak","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T01:10:39Z","title":"Game-theoretic Network Centrality: A Review"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00218","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:1c75a4a8a49856eeddce6d7a2acad3dd5e2cdb1b3b70eac54825ad4d47ac3575","target":"record","created_at":"2026-05-18T00:26: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":"74d53eb23394816cea69ef1d7587f15d5d993839e766e3c3edb428a05fd0291c","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T01:10:39Z","title_canon_sha256":"b6005d0896c6c294a0f86669509afbbbc0c87afe83f035c755cad0653ea11ea5"},"schema_version":"1.0","source":{"id":"1801.00218","kind":"arxiv","version":1}},"canonical_sha256":"191a59c23556be09753142b6d46fd58e4be738b64bd69569cca2af8abeb21f01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"191a59c23556be09753142b6d46fd58e4be738b64bd69569cca2af8abeb21f01","first_computed_at":"2026-05-18T00:26:59.059757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:59.059757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wTdxibPjVL9/usrHM3mQ+q3O2Vu7WZPg/MObdxg7ZyFcfSL1OTuv0e7xqCR2YPxSQFskoCjrDn0jIh4yctWHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:59.060493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c75a4a8a49856eeddce6d7a2acad3dd5e2cdb1b3b70eac54825ad4d47ac3575","sha256:4c01bef539b6cbf08b410b6323e1c91019ad9f7fa5679796ff46874f7b7a2f3c"],"state_sha256":"fcc032b2b03951559f411abfeac40f0f331f222c0ab8fefcfa5a3bf2d5b97763"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKPEBJWfhhwz51N4tRp4uJg/vWCRbJ+PjIA3O2kcMcVL+eBR331JZuGOgR2oOLsymceh+XkIRgRIYv23yOfdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T11:21:07.530325Z","bundle_sha256":"dace0dfef41cd7aba4ab886a6964203cf62379aa09a5d93ff4346e8d184a5630"}}