{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I7VYN6NDNHBPJXBXYKO7IZ3XQW","short_pith_number":"pith:I7VYN6ND","canonical_record":{"source":{"id":"1712.09123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-25T20:03:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"472f94f31baf62f061c98ba6e87e2370e2401ec925cc1be7b2cd20831a1cbec2","abstract_canon_sha256":"2db316d060aa19436dba3d4918bacebe351fa36221cafe9c097454bbc4d343aa"},"schema_version":"1.0"},"canonical_sha256":"47eb86f9a369c2f4dc37c29df4677785a8e44dfd460c39b31e4e518d476a894d","source":{"kind":"arxiv","id":"1712.09123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09123","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09123v1","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09123","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"pith_short_12","alias_value":"I7VYN6NDNHBP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I7VYN6NDNHBPJXBX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I7VYN6ND","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I7VYN6NDNHBPJXBXYKO7IZ3XQW","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-25T20:03:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"472f94f31baf62f061c98ba6e87e2370e2401ec925cc1be7b2cd20831a1cbec2","abstract_canon_sha256":"2db316d060aa19436dba3d4918bacebe351fa36221cafe9c097454bbc4d343aa"},"schema_version":"1.0"},"canonical_sha256":"47eb86f9a369c2f4dc37c29df4677785a8e44dfd460c39b31e4e518d476a894d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:14.378194Z","signature_b64":"sW43hOQCUH7BRw58v9+nX2UJkcpazMixTB04V4Q4IP+ttpoW5LUv45myFTAkRCPuiAAVjqCbARCY3evJ4Qf2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47eb86f9a369c2f4dc37c29df4677785a8e44dfd460c39b31e4e518d476a894d","last_reissued_at":"2026-05-18T00:27:14.377745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:14.377745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09123","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:27:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwGMrSJc/otdG6JpbDESom2mUVPCYOWbeMxKEjuYaXkuYyvF+QpstjePpoElpCoKDggfSmTAlQMcJaE5qUSwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:28:53.851073Z"},"content_sha256":"d06ae5f36edc06d9b591b142fe5850b00439aad2dcd0360112a30c856e7cedea","schema_version":"1.0","event_id":"sha256:d06ae5f36edc06d9b591b142fe5850b00439aad2dcd0360112a30c856e7cedea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I7VYN6NDNHBPJXBXYKO7IZ3XQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SAGA: A Submodular Greedy Algorithm For Group Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Nishant Vijayakumar, Sanjay Chawla, Shameem A Puthiya Parambath","submitted_at":"2017-12-25T20:03:46Z","abstract_excerpt":"In this paper, we propose a unified framework and an algorithm for the problem of group recommendation where a fixed number of items or alternatives can be recommended to a group of users. The problem of group recommendation arises naturally in many real world contexts, and is closely related to the budgeted social choice problem studied in economics. We frame the group recommendation problem as choosing a subgraph with the largest group consensus score in a completely connected graph defined over the item affinity matrix. We propose a fast greedy algorithm with strong theoretical guarantees, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09123","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:27:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iPiQyHzkj/ct+GOCQf84GfP1hGwjkdjx7N0/+G+M0u5yPjr2d+1uzSZ2erBSk5JkuhITexQ0K6KrvROrWFaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:28:53.851474Z"},"content_sha256":"fbb1c57521f38a1b16b7bec315fd92d4937049c527420aaa60685129f2dde580","schema_version":"1.0","event_id":"sha256:fbb1c57521f38a1b16b7bec315fd92d4937049c527420aaa60685129f2dde580"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7VYN6NDNHBPJXBXYKO7IZ3XQW/bundle.json","state_url":"https://pith.science/pith/I7VYN6NDNHBPJXBXYKO7IZ3XQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7VYN6NDNHBPJXBXYKO7IZ3XQW/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-06T05:28:53Z","links":{"resolver":"https://pith.science/pith/I7VYN6NDNHBPJXBXYKO7IZ3XQW","bundle":"https://pith.science/pith/I7VYN6NDNHBPJXBXYKO7IZ3XQW/bundle.json","state":"https://pith.science/pith/I7VYN6NDNHBPJXBXYKO7IZ3XQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7VYN6NDNHBPJXBXYKO7IZ3XQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I7VYN6NDNHBPJXBXYKO7IZ3XQW","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":"2db316d060aa19436dba3d4918bacebe351fa36221cafe9c097454bbc4d343aa","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-25T20:03:46Z","title_canon_sha256":"472f94f31baf62f061c98ba6e87e2370e2401ec925cc1be7b2cd20831a1cbec2"},"schema_version":"1.0","source":{"id":"1712.09123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09123","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09123v1","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09123","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"pith_short_12","alias_value":"I7VYN6NDNHBP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I7VYN6NDNHBPJXBX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I7VYN6ND","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:fbb1c57521f38a1b16b7bec315fd92d4937049c527420aaa60685129f2dde580","target":"graph","created_at":"2026-05-18T00:27:14Z","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 this paper, we propose a unified framework and an algorithm for the problem of group recommendation where a fixed number of items or alternatives can be recommended to a group of users. The problem of group recommendation arises naturally in many real world contexts, and is closely related to the budgeted social choice problem studied in economics. We frame the group recommendation problem as choosing a subgraph with the largest group consensus score in a completely connected graph defined over the item affinity matrix. We propose a fast greedy algorithm with strong theoretical guarantees, ","authors_text":"Nishant Vijayakumar, Sanjay Chawla, Shameem A Puthiya Parambath","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-25T20:03:46Z","title":"SAGA: A Submodular Greedy Algorithm For Group Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09123","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:d06ae5f36edc06d9b591b142fe5850b00439aad2dcd0360112a30c856e7cedea","target":"record","created_at":"2026-05-18T00:27:14Z","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":"2db316d060aa19436dba3d4918bacebe351fa36221cafe9c097454bbc4d343aa","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-25T20:03:46Z","title_canon_sha256":"472f94f31baf62f061c98ba6e87e2370e2401ec925cc1be7b2cd20831a1cbec2"},"schema_version":"1.0","source":{"id":"1712.09123","kind":"arxiv","version":1}},"canonical_sha256":"47eb86f9a369c2f4dc37c29df4677785a8e44dfd460c39b31e4e518d476a894d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47eb86f9a369c2f4dc37c29df4677785a8e44dfd460c39b31e4e518d476a894d","first_computed_at":"2026-05-18T00:27:14.377745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:14.377745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sW43hOQCUH7BRw58v9+nX2UJkcpazMixTB04V4Q4IP+ttpoW5LUv45myFTAkRCPuiAAVjqCbARCY3evJ4Qf2Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:14.378194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d06ae5f36edc06d9b591b142fe5850b00439aad2dcd0360112a30c856e7cedea","sha256:fbb1c57521f38a1b16b7bec315fd92d4937049c527420aaa60685129f2dde580"],"state_sha256":"3901bf58ced419a766ab1fa1a66350082c93714feb11b4d544b8ea81f3c08210"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lnkm8e9PPjF84MEFTBp0OV5TfR3A319z8FiuzcQzH4+ebfCxqi/9xVvrMSJfMQ3e5EVtKxa6yaWOiWTr8hz7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T05:28:53.856356Z","bundle_sha256":"9d33831c4c6fb7135ffcb6fde2d1d89520ee4e91983f2af7a76962aeafa9f90d"}}