{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MQAQ6C2EPDDPKWKMYGKAEZPRIM","short_pith_number":"pith:MQAQ6C2E","schema_version":"1.0","canonical_sha256":"64010f0b4478c6f5594cc1940265f14327f7f4e22d0534da818fa7c0cc6bc7af","source":{"kind":"arxiv","id":"1509.05322","version":1},"attestation_state":"computed","paper":{"title":"Computing stable outcomes in symmetric additively-separable hedonic games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Gairing, Rahul Savani","submitted_at":"2015-09-17T16:33:23Z","abstract_excerpt":"We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of such games that are guaranteed to possess stable outcomes. These games are specified by an undirected edge- weighted graph: nodes are players, an outcome of the game is a partition of the nodes into coalitions, and the utility of a node is the sum of incident edge weights in the same coalition. We consider several stability requirements defined in the liter"},"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":"1509.05322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-17T16:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"15a5fdb40435436136de97c70a979684a108eae2978fb9bc896839edb1a35537","abstract_canon_sha256":"40e1c77fdf570bf3652924e41c9fdf120b0d496314ccd05bb34a5e95c007f12f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:44.173616Z","signature_b64":"vY5N+tOESOLbgt4ASg5xCF4i5P4ebe5Jau+MSgfGP0Gtkcabd8bplUHvvq0ev0cPn5+Eu0VS6J91vBMb+aBvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64010f0b4478c6f5594cc1940265f14327f7f4e22d0534da818fa7c0cc6bc7af","last_reissued_at":"2026-05-18T01:32:44.173136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:44.173136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing stable outcomes in symmetric additively-separable hedonic games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Gairing, Rahul Savani","submitted_at":"2015-09-17T16:33:23Z","abstract_excerpt":"We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of such games that are guaranteed to possess stable outcomes. These games are specified by an undirected edge- weighted graph: nodes are players, an outcome of the game is a partition of the nodes into coalitions, and the utility of a node is the sum of incident edge weights in the same coalition. We consider several stability requirements defined in the liter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05322","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":"1509.05322","created_at":"2026-05-18T01:32:44.173205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05322v1","created_at":"2026-05-18T01:32:44.173205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05322","created_at":"2026-05-18T01:32:44.173205+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQAQ6C2EPDDP","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQAQ6C2EPDDPKWKM","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQAQ6C2E","created_at":"2026-05-18T12:29:32.376354+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/MQAQ6C2EPDDPKWKMYGKAEZPRIM","json":"https://pith.science/pith/MQAQ6C2EPDDPKWKMYGKAEZPRIM.json","graph_json":"https://pith.science/api/pith-number/MQAQ6C2EPDDPKWKMYGKAEZPRIM/graph.json","events_json":"https://pith.science/api/pith-number/MQAQ6C2EPDDPKWKMYGKAEZPRIM/events.json","paper":"https://pith.science/paper/MQAQ6C2E"},"agent_actions":{"view_html":"https://pith.science/pith/MQAQ6C2EPDDPKWKMYGKAEZPRIM","download_json":"https://pith.science/pith/MQAQ6C2EPDDPKWKMYGKAEZPRIM.json","view_paper":"https://pith.science/paper/MQAQ6C2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05322&json=true","fetch_graph":"https://pith.science/api/pith-number/MQAQ6C2EPDDPKWKMYGKAEZPRIM/graph.json","fetch_events":"https://pith.science/api/pith-number/MQAQ6C2EPDDPKWKMYGKAEZPRIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQAQ6C2EPDDPKWKMYGKAEZPRIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQAQ6C2EPDDPKWKMYGKAEZPRIM/action/storage_attestation","attest_author":"https://pith.science/pith/MQAQ6C2EPDDPKWKMYGKAEZPRIM/action/author_attestation","sign_citation":"https://pith.science/pith/MQAQ6C2EPDDPKWKMYGKAEZPRIM/action/citation_signature","submit_replication":"https://pith.science/pith/MQAQ6C2EPDDPKWKMYGKAEZPRIM/action/replication_record"}},"created_at":"2026-05-18T01:32:44.173205+00:00","updated_at":"2026-05-18T01:32:44.173205+00:00"}