{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4FISB3NQZYBY5BPLEGQT2MVD5A","short_pith_number":"pith:4FISB3NQ","canonical_record":{"source":{"id":"1703.01121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-03T12:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"2c7dd4c801524e677dcb675b997aa614e730371d8d173d841231201048d5cb05","abstract_canon_sha256":"c1c58e328ade4a36997e0bcf012dd401135733b78574d59e44d5a3d72afb8dd6"},"schema_version":"1.0"},"canonical_sha256":"e15120edb0ce038e85eb21a13d32a3e8295f3c3424fed38871b9149508bf30be","source":{"kind":"arxiv","id":"1703.01121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01121","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01121v1","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01121","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"4FISB3NQZYBY","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4FISB3NQZYBY5BPL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4FISB3NQ","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4FISB3NQZYBY5BPLEGQT2MVD5A","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-03T12:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"2c7dd4c801524e677dcb675b997aa614e730371d8d173d841231201048d5cb05","abstract_canon_sha256":"c1c58e328ade4a36997e0bcf012dd401135733b78574d59e44d5a3d72afb8dd6"},"schema_version":"1.0"},"canonical_sha256":"e15120edb0ce038e85eb21a13d32a3e8295f3c3424fed38871b9149508bf30be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:35.937838Z","signature_b64":"oaxOJl/83BAr9l48hg+atDWqS2O3wOCDIvr14pWx+Hv8YFIc9b52geeym6cVUezFRfB7x8LL2vDzrOEUFhT5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e15120edb0ce038e85eb21a13d32a3e8295f3c3424fed38871b9149508bf30be","last_reissued_at":"2026-05-18T00:49:35.937240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:35.937240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01121","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:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ku3z3fvws/4wKIT9AoYGJga1XOEosyZrbh5x6moFrD2io1627Lc+41nzdWa9lF0fnKdPqjI439xUYD/opCaCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:38:01.940397Z"},"content_sha256":"d7ab4939eef3b0ba5dafb37739022bd05da54471d34a62ed400ce3d9d61a7233","schema_version":"1.0","event_id":"sha256:d7ab4939eef3b0ba5dafb37739022bd05da54471d34a62ed400ce3d9d61a7233"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4FISB3NQZYBY5BPLEGQT2MVD5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Parameterized Complexity of Group Activity Selection Problems on Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ayumi Igarashi, Edith Elkind, Robert Bredereck","submitted_at":"2017-03-03T12:10:13Z","abstract_excerpt":"In Group Activity Selection Problem (GASP), players form coalitions to participate in activities and have preferences over pairs of the form (activity, group size). Recently, Igarashi et al. have initiated the study of group activity selection problems on social networks (gGASP): a group of players can engage in the same activity if the members of the group form a connected subset of the underlying communication structure. Igarashi et al. have primarily focused on Nash stable outcomes, and showed that many associated algorithmic questions are computationally hard even for very simple networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01121","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:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pHHUhyz9mnf4ZFoSIrDCOdFUTSMEPhf0R9otmiwMydq/ED6oOB7/Ao0Dlvc0hrKn+P4RZhQIesdbU5fAS7EHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:38:01.941139Z"},"content_sha256":"66eb61a95d59f397c120f0149247ae5a3368a60bf2cd4931d377ce9b32f7e801","schema_version":"1.0","event_id":"sha256:66eb61a95d59f397c120f0149247ae5a3368a60bf2cd4931d377ce9b32f7e801"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FISB3NQZYBY5BPLEGQT2MVD5A/bundle.json","state_url":"https://pith.science/pith/4FISB3NQZYBY5BPLEGQT2MVD5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FISB3NQZYBY5BPLEGQT2MVD5A/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-10T05:38:01Z","links":{"resolver":"https://pith.science/pith/4FISB3NQZYBY5BPLEGQT2MVD5A","bundle":"https://pith.science/pith/4FISB3NQZYBY5BPLEGQT2MVD5A/bundle.json","state":"https://pith.science/pith/4FISB3NQZYBY5BPLEGQT2MVD5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FISB3NQZYBY5BPLEGQT2MVD5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4FISB3NQZYBY5BPLEGQT2MVD5A","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":"c1c58e328ade4a36997e0bcf012dd401135733b78574d59e44d5a3d72afb8dd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-03T12:10:13Z","title_canon_sha256":"2c7dd4c801524e677dcb675b997aa614e730371d8d173d841231201048d5cb05"},"schema_version":"1.0","source":{"id":"1703.01121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01121","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01121v1","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01121","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"4FISB3NQZYBY","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4FISB3NQZYBY5BPL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4FISB3NQ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:66eb61a95d59f397c120f0149247ae5a3368a60bf2cd4931d377ce9b32f7e801","target":"graph","created_at":"2026-05-18T00:49:35Z","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":"In Group Activity Selection Problem (GASP), players form coalitions to participate in activities and have preferences over pairs of the form (activity, group size). Recently, Igarashi et al. have initiated the study of group activity selection problems on social networks (gGASP): a group of players can engage in the same activity if the members of the group form a connected subset of the underlying communication structure. Igarashi et al. have primarily focused on Nash stable outcomes, and showed that many associated algorithmic questions are computationally hard even for very simple networks.","authors_text":"Ayumi Igarashi, Edith Elkind, Robert Bredereck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-03T12:10:13Z","title":"On Parameterized Complexity of Group Activity Selection Problems on Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01121","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:d7ab4939eef3b0ba5dafb37739022bd05da54471d34a62ed400ce3d9d61a7233","target":"record","created_at":"2026-05-18T00:49:35Z","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":"c1c58e328ade4a36997e0bcf012dd401135733b78574d59e44d5a3d72afb8dd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-03T12:10:13Z","title_canon_sha256":"2c7dd4c801524e677dcb675b997aa614e730371d8d173d841231201048d5cb05"},"schema_version":"1.0","source":{"id":"1703.01121","kind":"arxiv","version":1}},"canonical_sha256":"e15120edb0ce038e85eb21a13d32a3e8295f3c3424fed38871b9149508bf30be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e15120edb0ce038e85eb21a13d32a3e8295f3c3424fed38871b9149508bf30be","first_computed_at":"2026-05-18T00:49:35.937240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:35.937240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oaxOJl/83BAr9l48hg+atDWqS2O3wOCDIvr14pWx+Hv8YFIc9b52geeym6cVUezFRfB7x8LL2vDzrOEUFhT5Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:35.937838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7ab4939eef3b0ba5dafb37739022bd05da54471d34a62ed400ce3d9d61a7233","sha256:66eb61a95d59f397c120f0149247ae5a3368a60bf2cd4931d377ce9b32f7e801"],"state_sha256":"43c79aab4ea664437bddb8e56d5df3e81c34abb32bb4b63f6a55098e741430a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twVXzTks/W8n6XeZn5NKQKMNq50wL6KB8NCLMkVCbFSG1t2bd00ksxsL03CzFq+rN9fgh+rv4p8BusiyoSfQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:38:01.945005Z","bundle_sha256":"11d924cc9ba0714d4c592f0bee1a6874d1c8b4cc567b64cab3148f245c0fb0b6"}}