{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IYSY4LBVL3M35BLIBRUQVROWQO","short_pith_number":"pith:IYSY4LBV","schema_version":"1.0","canonical_sha256":"46258e2c355ed9be85680c690ac5d683b6f06eb2626ec1a38d8991fa1a742c4b","source":{"kind":"arxiv","id":"1004.1854","version":4},"attestation_state":"computed","paper":{"title":"Contribution Games in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Elliot Anshelevich, Martin Hoefer","submitted_at":"2010-04-11T23:39:21Z","abstract_excerpt":"We consider network contribution games, where each agent in a social network has a budget of effort that he can contribute to different collaborative projects or relationships. Depending on the contribution of the involved agents a relationship will flourish or drown, and to measure the success we use a reward function for each relationship. Every agent is trying to maximize the reward from all relationships that it is involved in. We consider pairwise equilibria of this game, and characterize the existence, computational complexity, and quality of equilibrium based on the types of reward func"},"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":"1004.1854","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-04-11T23:39:21Z","cross_cats_sorted":["cs.DS","cs.MA"],"title_canon_sha256":"3f30683b6dccb60bdb3b9a3b544bad46ff7496a902f722c9461154588f1bb192","abstract_canon_sha256":"bd4759fbbcfaab21f1919e5d949b8915e143c399a88f4348ab3638083d7fc8f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:00.989909Z","signature_b64":"/E/ztwMKp6RbEOYuqMYytwIFF3+H78eHuyVeePKm9RNSLJk8sXGd7HmZoicTQXI9nKWpxCSEEbvgjBBDgS6LDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46258e2c355ed9be85680c690ac5d683b6f06eb2626ec1a38d8991fa1a742c4b","last_reissued_at":"2026-05-18T03:57:00.989099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:00.989099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contribution Games in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Elliot Anshelevich, Martin Hoefer","submitted_at":"2010-04-11T23:39:21Z","abstract_excerpt":"We consider network contribution games, where each agent in a social network has a budget of effort that he can contribute to different collaborative projects or relationships. Depending on the contribution of the involved agents a relationship will flourish or drown, and to measure the success we use a reward function for each relationship. Every agent is trying to maximize the reward from all relationships that it is involved in. We consider pairwise equilibria of this game, and characterize the existence, computational complexity, and quality of equilibrium based on the types of reward func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1854","kind":"arxiv","version":4},"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":"1004.1854","created_at":"2026-05-18T03:57:00.989216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.1854v4","created_at":"2026-05-18T03:57:00.989216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1854","created_at":"2026-05-18T03:57:00.989216+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYSY4LBVL3M3","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYSY4LBVL3M35BLI","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYSY4LBV","created_at":"2026-05-18T12:26:09.077623+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/IYSY4LBVL3M35BLIBRUQVROWQO","json":"https://pith.science/pith/IYSY4LBVL3M35BLIBRUQVROWQO.json","graph_json":"https://pith.science/api/pith-number/IYSY4LBVL3M35BLIBRUQVROWQO/graph.json","events_json":"https://pith.science/api/pith-number/IYSY4LBVL3M35BLIBRUQVROWQO/events.json","paper":"https://pith.science/paper/IYSY4LBV"},"agent_actions":{"view_html":"https://pith.science/pith/IYSY4LBVL3M35BLIBRUQVROWQO","download_json":"https://pith.science/pith/IYSY4LBVL3M35BLIBRUQVROWQO.json","view_paper":"https://pith.science/paper/IYSY4LBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.1854&json=true","fetch_graph":"https://pith.science/api/pith-number/IYSY4LBVL3M35BLIBRUQVROWQO/graph.json","fetch_events":"https://pith.science/api/pith-number/IYSY4LBVL3M35BLIBRUQVROWQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYSY4LBVL3M35BLIBRUQVROWQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYSY4LBVL3M35BLIBRUQVROWQO/action/storage_attestation","attest_author":"https://pith.science/pith/IYSY4LBVL3M35BLIBRUQVROWQO/action/author_attestation","sign_citation":"https://pith.science/pith/IYSY4LBVL3M35BLIBRUQVROWQO/action/citation_signature","submit_replication":"https://pith.science/pith/IYSY4LBVL3M35BLIBRUQVROWQO/action/replication_record"}},"created_at":"2026-05-18T03:57:00.989216+00:00","updated_at":"2026-05-18T03:57:00.989216+00:00"}