{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KLQSQA46J64GXY7ID2Q6CWQLB5","short_pith_number":"pith:KLQSQA46","canonical_record":{"source":{"id":"1712.02712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-07T16:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"a3b23d344b14d9ca5d1e22f497d378b93ee46588b924740d10e42d6317368f16","abstract_canon_sha256":"bc6305fdd9b7b7c40ac919377731584f59dbadc5da03efeb898e23bcb43f2d72"},"schema_version":"1.0"},"canonical_sha256":"52e128039e4fb86be3e81ea1e15a0b0f4a3646c596788a19ddbe897000461548","source":{"kind":"arxiv","id":"1712.02712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02712","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02712v1","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02712","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"pith_short_12","alias_value":"KLQSQA46J64G","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KLQSQA46J64GXY7I","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KLQSQA46","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KLQSQA46J64GXY7ID2Q6CWQLB5","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-07T16:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"a3b23d344b14d9ca5d1e22f497d378b93ee46588b924740d10e42d6317368f16","abstract_canon_sha256":"bc6305fdd9b7b7c40ac919377731584f59dbadc5da03efeb898e23bcb43f2d72"},"schema_version":"1.0"},"canonical_sha256":"52e128039e4fb86be3e81ea1e15a0b0f4a3646c596788a19ddbe897000461548","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:33.106706Z","signature_b64":"/vWXVZxzLjFb4x9X4ACXChpK2n9IVyyDTuUbaCasTfaW2zzLTApFO4JddQWxJ8VeDdeY45b1RtyicL7/ggz6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52e128039e4fb86be3e81ea1e15a0b0f4a3646c596788a19ddbe897000461548","last_reissued_at":"2026-05-18T00:28:33.106021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:33.106021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02712","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3H5F9q0ja0N2o+4drNOfH0a6nIFA8Rb8n0tAV7gakbRvp3s2+XbKTcPnrlsdwzT1Pkc8sMhnhoujefjfjYDdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T08:51:48.324388Z"},"content_sha256":"403af4da8466feaab52a8117648f0109e2bc50f40267fdf6ad7d125d9c9c97eb","schema_version":"1.0","event_id":"sha256:403af4da8466feaab52a8117648f0109e2bc50f40267fdf6ad7d125d9c9c97eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KLQSQA46J64GXY7ID2Q6CWQLB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group Activity Selection on Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ayumi Igarashi, Dominik Peters, Edith Elkind, Robert Bredereck","submitted_at":"2017-12-07T16:51:14Z","abstract_excerpt":"We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups (gGASP). We show that if multiple groups can simultaneously engage in the same activity, finding a stable outcome is easy as long as the network is acyclic. In contrast, if each activity can be assigned to a single group only, finding stable outcomes becomes computationally intractable, even if the underlying network is very simple: the problem of determining whether a given instance of a gGASP admits a Nash stable o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02712","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbBmZS6byZhuRWtjCRXUKx8lDRP6kmUqFTwQc1idF86frUVY7yiz4I5789IJ4T+j/3NpFKHJdeh2BswpajzoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T08:51:48.324739Z"},"content_sha256":"24199661266ad2093fbcea74897110bbff4f26d76a7cafcc32a4c4191b1a3b63","schema_version":"1.0","event_id":"sha256:24199661266ad2093fbcea74897110bbff4f26d76a7cafcc32a4c4191b1a3b63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLQSQA46J64GXY7ID2Q6CWQLB5/bundle.json","state_url":"https://pith.science/pith/KLQSQA46J64GXY7ID2Q6CWQLB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLQSQA46J64GXY7ID2Q6CWQLB5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T08:51:48Z","links":{"resolver":"https://pith.science/pith/KLQSQA46J64GXY7ID2Q6CWQLB5","bundle":"https://pith.science/pith/KLQSQA46J64GXY7ID2Q6CWQLB5/bundle.json","state":"https://pith.science/pith/KLQSQA46J64GXY7ID2Q6CWQLB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLQSQA46J64GXY7ID2Q6CWQLB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KLQSQA46J64GXY7ID2Q6CWQLB5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bc6305fdd9b7b7c40ac919377731584f59dbadc5da03efeb898e23bcb43f2d72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-07T16:51:14Z","title_canon_sha256":"a3b23d344b14d9ca5d1e22f497d378b93ee46588b924740d10e42d6317368f16"},"schema_version":"1.0","source":{"id":"1712.02712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02712","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02712v1","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02712","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"pith_short_12","alias_value":"KLQSQA46J64G","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KLQSQA46J64GXY7I","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KLQSQA46","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:24199661266ad2093fbcea74897110bbff4f26d76a7cafcc32a4c4191b1a3b63","target":"graph","created_at":"2026-05-18T00:28:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups (gGASP). We show that if multiple groups can simultaneously engage in the same activity, finding a stable outcome is easy as long as the network is acyclic. In contrast, if each activity can be assigned to a single group only, finding stable outcomes becomes computationally intractable, even if the underlying network is very simple: the problem of determining whether a given instance of a gGASP admits a Nash stable o","authors_text":"Ayumi Igarashi, Dominik Peters, Edith Elkind, Robert Bredereck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-07T16:51:14Z","title":"Group Activity Selection on Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02712","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:403af4da8466feaab52a8117648f0109e2bc50f40267fdf6ad7d125d9c9c97eb","target":"record","created_at":"2026-05-18T00:28:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bc6305fdd9b7b7c40ac919377731584f59dbadc5da03efeb898e23bcb43f2d72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-07T16:51:14Z","title_canon_sha256":"a3b23d344b14d9ca5d1e22f497d378b93ee46588b924740d10e42d6317368f16"},"schema_version":"1.0","source":{"id":"1712.02712","kind":"arxiv","version":1}},"canonical_sha256":"52e128039e4fb86be3e81ea1e15a0b0f4a3646c596788a19ddbe897000461548","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52e128039e4fb86be3e81ea1e15a0b0f4a3646c596788a19ddbe897000461548","first_computed_at":"2026-05-18T00:28:33.106021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:33.106021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/vWXVZxzLjFb4x9X4ACXChpK2n9IVyyDTuUbaCasTfaW2zzLTApFO4JddQWxJ8VeDdeY45b1RtyicL7/ggz6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:33.106706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:403af4da8466feaab52a8117648f0109e2bc50f40267fdf6ad7d125d9c9c97eb","sha256:24199661266ad2093fbcea74897110bbff4f26d76a7cafcc32a4c4191b1a3b63"],"state_sha256":"14fe37bb24c943d4294573af80b84b7e322ba98f8919b0948bd74134a0a695c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruxk1xjt1JI27vmGncK6lr9DFKvJOvzYrIlfCjRJ8SyRXP6ZUd/Ki9jLZzsrvxfBiFMR4rG7bU0eycsezDNZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T08:51:48.326691Z","bundle_sha256":"47436845e3456d332a84aa3c9c5d1590f9778f13b03f050e2669d3ebb4bf41af"}}