{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4VVR3BPN6ERDVRWWQEXQ4ORJF7","short_pith_number":"pith:4VVR3BPN","canonical_record":{"source":{"id":"1703.07807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T18:30:10Z","cross_cats_sorted":[],"title_canon_sha256":"e2c7896d03acccaa8fa8bac7a94a562bff0cbb8c289d718f637d1b7d60b22ae8","abstract_canon_sha256":"552b1aff67632c1e5d7047d8117a16e20e5ac230547cd7c44feb2487718738c7"},"schema_version":"1.0"},"canonical_sha256":"e56b1d85edf1223ac6d6812f0e3a292fff73e3ef0831d8082a8fd5aeeb0b55b4","source":{"kind":"arxiv","id":"1703.07807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07807","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07807v1","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07807","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"4VVR3BPN6ERD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VVR3BPN6ERDVRWW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VVR3BPN","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4VVR3BPN6ERDVRWWQEXQ4ORJF7","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T18:30:10Z","cross_cats_sorted":[],"title_canon_sha256":"e2c7896d03acccaa8fa8bac7a94a562bff0cbb8c289d718f637d1b7d60b22ae8","abstract_canon_sha256":"552b1aff67632c1e5d7047d8117a16e20e5ac230547cd7c44feb2487718738c7"},"schema_version":"1.0"},"canonical_sha256":"e56b1d85edf1223ac6d6812f0e3a292fff73e3ef0831d8082a8fd5aeeb0b55b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:04.750745Z","signature_b64":"/3oNqg0nwy9a6ndgXmGUYvdWk21LPk9cxYwJxDiIotBiXAMzpl13g+420feVkyeQlxeTjvLjsFAOmFoY9C/3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e56b1d85edf1223ac6d6812f0e3a292fff73e3ef0831d8082a8fd5aeeb0b55b4","last_reissued_at":"2026-05-18T00:48:04.750128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:04.750128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07807","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:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n56NyF98i0wyf643IGFUHY6RVX6t/B8fTLRfrKy1cAvFs+eAEeXVbNuuTDyp/1X5IiaxaZYPiR18mTSAU88MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:58:35.112557Z"},"content_sha256":"7e766d11eb7d92cc75ce61a98cb7530a57cf6578ac82fad0a367d0e2bb042f9e","schema_version":"1.0","event_id":"sha256:7e766d11eb7d92cc75ce61a98cb7530a57cf6578ac82fad0a367d0e2bb042f9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4VVR3BPN6ERDVRWWQEXQ4ORJF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Partition using Score Based Compatibilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arun Rajkumar, Koyel Mukherjee, Theja Tulabandhula","submitted_at":"2017-03-22T18:30:10Z","abstract_excerpt":"We study the problem of learning to partition users into groups, where one must learn the compatibilities between the users to achieve optimal groupings. We define four natural objectives that optimize for average and worst case compatibilities and propose new algorithms for adaptively learning optimal groupings. When we do not impose any structure on the compatibilities, we show that the group formation objectives considered are $NP$ hard to solve and we either give approximation guarantees or prove inapproximability results. We then introduce an elegant structure, namely that of \\textit{intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07807","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:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNiajuTdOVYUvyubaSps02MfDbw9f77og36xPAy2w6FXV6QNKp4UwUZZEkmd5mWZ/LWH2I7tBg24ZkSwsRXzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:58:35.113268Z"},"content_sha256":"42218a403c37b30352bbc0969beb5a337782f2b80a04a18098795d2271d06c26","schema_version":"1.0","event_id":"sha256:42218a403c37b30352bbc0969beb5a337782f2b80a04a18098795d2271d06c26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VVR3BPN6ERDVRWWQEXQ4ORJF7/bundle.json","state_url":"https://pith.science/pith/4VVR3BPN6ERDVRWWQEXQ4ORJF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VVR3BPN6ERDVRWWQEXQ4ORJF7/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-05-25T23:58:35Z","links":{"resolver":"https://pith.science/pith/4VVR3BPN6ERDVRWWQEXQ4ORJF7","bundle":"https://pith.science/pith/4VVR3BPN6ERDVRWWQEXQ4ORJF7/bundle.json","state":"https://pith.science/pith/4VVR3BPN6ERDVRWWQEXQ4ORJF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VVR3BPN6ERDVRWWQEXQ4ORJF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4VVR3BPN6ERDVRWWQEXQ4ORJF7","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":"552b1aff67632c1e5d7047d8117a16e20e5ac230547cd7c44feb2487718738c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T18:30:10Z","title_canon_sha256":"e2c7896d03acccaa8fa8bac7a94a562bff0cbb8c289d718f637d1b7d60b22ae8"},"schema_version":"1.0","source":{"id":"1703.07807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07807","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07807v1","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07807","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"4VVR3BPN6ERD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VVR3BPN6ERDVRWW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VVR3BPN","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:42218a403c37b30352bbc0969beb5a337782f2b80a04a18098795d2271d06c26","target":"graph","created_at":"2026-05-18T00:48:04Z","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 study the problem of learning to partition users into groups, where one must learn the compatibilities between the users to achieve optimal groupings. We define four natural objectives that optimize for average and worst case compatibilities and propose new algorithms for adaptively learning optimal groupings. When we do not impose any structure on the compatibilities, we show that the group formation objectives considered are $NP$ hard to solve and we either give approximation guarantees or prove inapproximability results. We then introduce an elegant structure, namely that of \\textit{intr","authors_text":"Arun Rajkumar, Koyel Mukherjee, Theja Tulabandhula","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T18:30:10Z","title":"Learning to Partition using Score Based Compatibilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07807","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:7e766d11eb7d92cc75ce61a98cb7530a57cf6578ac82fad0a367d0e2bb042f9e","target":"record","created_at":"2026-05-18T00:48:04Z","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":"552b1aff67632c1e5d7047d8117a16e20e5ac230547cd7c44feb2487718738c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-22T18:30:10Z","title_canon_sha256":"e2c7896d03acccaa8fa8bac7a94a562bff0cbb8c289d718f637d1b7d60b22ae8"},"schema_version":"1.0","source":{"id":"1703.07807","kind":"arxiv","version":1}},"canonical_sha256":"e56b1d85edf1223ac6d6812f0e3a292fff73e3ef0831d8082a8fd5aeeb0b55b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e56b1d85edf1223ac6d6812f0e3a292fff73e3ef0831d8082a8fd5aeeb0b55b4","first_computed_at":"2026-05-18T00:48:04.750128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:04.750128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/3oNqg0nwy9a6ndgXmGUYvdWk21LPk9cxYwJxDiIotBiXAMzpl13g+420feVkyeQlxeTjvLjsFAOmFoY9C/3AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:04.750745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e766d11eb7d92cc75ce61a98cb7530a57cf6578ac82fad0a367d0e2bb042f9e","sha256:42218a403c37b30352bbc0969beb5a337782f2b80a04a18098795d2271d06c26"],"state_sha256":"7c9bf2ab7cb607c15dbee887529597217cbd9f09f86eb9b0b7537e31380ea59d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mra39Fi2sE3fYEyfPB5D7oOhOpPxiSfYqKXm+R0Z5U8DN6oT08xvcFn8Er+R/NHJY4wxqWOSwxIy0ERCP/Q4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:58:35.117129Z","bundle_sha256":"baafe48cd7650056432028ade651af0a00efe287bf3063e48489f3169f40a56f"}}