{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HAT32T257QDVKQJILB73PLOIDI","short_pith_number":"pith:HAT32T25","schema_version":"1.0","canonical_sha256":"3827bd4f5dfc07554128587fb7adc81a15d18206d713f7d26a3487c0efff89e6","source":{"kind":"arxiv","id":"1212.3782","version":4},"attestation_state":"computed","paper":{"title":"Can Selfish Groups be Self-Enforcing?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SI"],"primary_cat":"cs.DM","authors_text":"Augustin Chaintreau, Dorian Mazauric, Guillaume Ducoffe","submitted_at":"2012-12-16T12:09:47Z","abstract_excerpt":"Algorithmic graph theory has thoroughly analyzed how, given a network describing constraints between various nodes, groups can be formed among these so that the resulting configuration optimizes a \\emph{global} metric. In contrast, for various social and economic networks, groups are formed \\emph{de facto} by the choices of selfish players. A fundamental problem in this setting is the existence and convergence to a \\emph{self-enforcing} configuration: assignment of players into groups such that no player has an incentive to move into another group than hers. Motivated by information sharing on"},"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":"1212.3782","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-16T12:09:47Z","cross_cats_sorted":["cs.GT","cs.SI"],"title_canon_sha256":"0934075b336828e4d8d88a5c11cbc07cd606f9390ed0ac3c634844312e8d1f55","abstract_canon_sha256":"0793a558b0e1b588c63a97376afa36a3444914470cafe803846a419d615da1a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:18.687908Z","signature_b64":"JLXt1ugwctmjCR/DIH8vqHoHuvC0TxWBPg5cB4yu+ZQd8tNCEUVV+7kctW9y/v9sBilUiAoKZuwqaM6wlT9xBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3827bd4f5dfc07554128587fb7adc81a15d18206d713f7d26a3487c0efff89e6","last_reissued_at":"2026-05-18T02:59:18.687076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:18.687076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Selfish Groups be Self-Enforcing?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SI"],"primary_cat":"cs.DM","authors_text":"Augustin Chaintreau, Dorian Mazauric, Guillaume Ducoffe","submitted_at":"2012-12-16T12:09:47Z","abstract_excerpt":"Algorithmic graph theory has thoroughly analyzed how, given a network describing constraints between various nodes, groups can be formed among these so that the resulting configuration optimizes a \\emph{global} metric. In contrast, for various social and economic networks, groups are formed \\emph{de facto} by the choices of selfish players. A fundamental problem in this setting is the existence and convergence to a \\emph{self-enforcing} configuration: assignment of players into groups such that no player has an incentive to move into another group than hers. Motivated by information sharing on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3782","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":"1212.3782","created_at":"2026-05-18T02:59:18.687188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3782v4","created_at":"2026-05-18T02:59:18.687188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3782","created_at":"2026-05-18T02:59:18.687188+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAT32T257QDV","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAT32T257QDVKQJI","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAT32T25","created_at":"2026-05-18T12:27:09.501522+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/HAT32T257QDVKQJILB73PLOIDI","json":"https://pith.science/pith/HAT32T257QDVKQJILB73PLOIDI.json","graph_json":"https://pith.science/api/pith-number/HAT32T257QDVKQJILB73PLOIDI/graph.json","events_json":"https://pith.science/api/pith-number/HAT32T257QDVKQJILB73PLOIDI/events.json","paper":"https://pith.science/paper/HAT32T25"},"agent_actions":{"view_html":"https://pith.science/pith/HAT32T257QDVKQJILB73PLOIDI","download_json":"https://pith.science/pith/HAT32T257QDVKQJILB73PLOIDI.json","view_paper":"https://pith.science/paper/HAT32T25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3782&json=true","fetch_graph":"https://pith.science/api/pith-number/HAT32T257QDVKQJILB73PLOIDI/graph.json","fetch_events":"https://pith.science/api/pith-number/HAT32T257QDVKQJILB73PLOIDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAT32T257QDVKQJILB73PLOIDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAT32T257QDVKQJILB73PLOIDI/action/storage_attestation","attest_author":"https://pith.science/pith/HAT32T257QDVKQJILB73PLOIDI/action/author_attestation","sign_citation":"https://pith.science/pith/HAT32T257QDVKQJILB73PLOIDI/action/citation_signature","submit_replication":"https://pith.science/pith/HAT32T257QDVKQJILB73PLOIDI/action/replication_record"}},"created_at":"2026-05-18T02:59:18.687188+00:00","updated_at":"2026-05-18T02:59:18.687188+00:00"}