{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NCL6CHK7QARJM63F5HB4OOXFAE","short_pith_number":"pith:NCL6CHK7","schema_version":"1.0","canonical_sha256":"6897e11d5f8022967b65e9c3c73ae5013b417af04b4718971c086dc5f71e2789","source":{"kind":"arxiv","id":"1205.6683","version":2},"attestation_state":"computed","paper":{"title":"Reputation Games for Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.GT"],"primary_cat":"cs.DM","authors_text":"Daichi Paku, David Avis, Kazuo Iwama","submitted_at":"2012-05-30T14:17:46Z","abstract_excerpt":"J. Hopcroft and D. Sheldon originally introduced network reputation games to investigate the self-interested behavior of web authors who want to maximize their PageRank on a directed web graph by choosing their outlinks in a game theoretic manner. They give best response strategies for each player and characterize properties of web graphs which are Nash equilibria. In this paper we consider three different models for PageRank games on undirected graphs such as certain social networks. In undirected graphs players may delete links at will, but typically cannot add links without the other player"},"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":"1205.6683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-30T14:17:46Z","cross_cats_sorted":["cs.DS","cs.GT"],"title_canon_sha256":"905a8c5c0ee0e83c60aa38952b4f61a60cc649a3903e545995fc964196881f93","abstract_canon_sha256":"caae9f8aa130b7f417ff533c8a0c4010577c6db515078b08596485b339b60354"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:28.615734Z","signature_b64":"oMpel+HwZ3bqIpZqYCHAbZENfTD5d2si/iYtWysIWRKpdMMC+77vSlLBdyN+andaC6HpgnUZelHGv0KGz/mODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6897e11d5f8022967b65e9c3c73ae5013b417af04b4718971c086dc5f71e2789","last_reissued_at":"2026-05-18T03:39:28.614935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:28.614935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reputation Games for Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.GT"],"primary_cat":"cs.DM","authors_text":"Daichi Paku, David Avis, Kazuo Iwama","submitted_at":"2012-05-30T14:17:46Z","abstract_excerpt":"J. Hopcroft and D. Sheldon originally introduced network reputation games to investigate the self-interested behavior of web authors who want to maximize their PageRank on a directed web graph by choosing their outlinks in a game theoretic manner. They give best response strategies for each player and characterize properties of web graphs which are Nash equilibria. In this paper we consider three different models for PageRank games on undirected graphs such as certain social networks. In undirected graphs players may delete links at will, but typically cannot add links without the other player"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6683","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.6683","created_at":"2026-05-18T03:39:28.615069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6683v2","created_at":"2026-05-18T03:39:28.615069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6683","created_at":"2026-05-18T03:39:28.615069+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCL6CHK7QARJ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCL6CHK7QARJM63F","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCL6CHK7","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE","json":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE.json","graph_json":"https://pith.science/api/pith-number/NCL6CHK7QARJM63F5HB4OOXFAE/graph.json","events_json":"https://pith.science/api/pith-number/NCL6CHK7QARJM63F5HB4OOXFAE/events.json","paper":"https://pith.science/paper/NCL6CHK7"},"agent_actions":{"view_html":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE","download_json":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE.json","view_paper":"https://pith.science/paper/NCL6CHK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6683&json=true","fetch_graph":"https://pith.science/api/pith-number/NCL6CHK7QARJM63F5HB4OOXFAE/graph.json","fetch_events":"https://pith.science/api/pith-number/NCL6CHK7QARJM63F5HB4OOXFAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE/action/storage_attestation","attest_author":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE/action/author_attestation","sign_citation":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE/action/citation_signature","submit_replication":"https://pith.science/pith/NCL6CHK7QARJM63F5HB4OOXFAE/action/replication_record"}},"created_at":"2026-05-18T03:39:28.615069+00:00","updated_at":"2026-05-18T03:39:28.615069+00:00"}