{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DENFTQRVK27AS5JRIK3NI36VRZ","short_pith_number":"pith:DENFTQRV","schema_version":"1.0","canonical_sha256":"191a59c23556be09753142b6d46fd58e4be738b64bd69569cca2af8abeb21f01","source":{"kind":"arxiv","id":"1801.00218","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.00218","created_at":"2026-05-18T00:26:59.059877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00218v1","created_at":"2026-05-18T00:26:59.059877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00218","created_at":"2026-05-18T00:26:59.059877+00:00"},{"alias_kind":"pith_short_12","alias_value":"DENFTQRVK27A","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DENFTQRVK27AS5JR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DENFTQRV","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2502.00446","citing_title":"Identifying vulnerable nodes and detecting malicious entanglement patterns to handle st-connectivity attacks in quantum networks","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18157","citing_title":"A Tractable Class of Cooperative Games Defined by Directed Networks: Unanimity Decomposition and Shapley Value","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21537","citing_title":"The CriticalSet problem: Identifying Critical Contributors in Bipartite Dependency Networks","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ","json":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ.json","graph_json":"https://pith.science/api/pith-number/DENFTQRVK27AS5JRIK3NI36VRZ/graph.json","events_json":"https://pith.science/api/pith-number/DENFTQRVK27AS5JRIK3NI36VRZ/events.json","paper":"https://pith.science/paper/DENFTQRV"},"agent_actions":{"view_html":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ","download_json":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ.json","view_paper":"https://pith.science/paper/DENFTQRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00218&json=true","fetch_graph":"https://pith.science/api/pith-number/DENFTQRVK27AS5JRIK3NI36VRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DENFTQRVK27AS5JRIK3NI36VRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/action/storage_attestation","attest_author":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/action/author_attestation","sign_citation":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/action/citation_signature","submit_replication":"https://pith.science/pith/DENFTQRVK27AS5JRIK3NI36VRZ/action/replication_record"}},"created_at":"2026-05-18T00:26:59.059877+00:00","updated_at":"2026-05-18T00:26:59.059877+00:00"}