{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KJNPJI4BUBS3P5PMPSQTU5TEB4","short_pith_number":"pith:KJNPJI4B","canonical_record":{"source":{"id":"1406.0140","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-01T07:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"be45978c92f6cb71f9028ce1552a4537badfb45abbdc1aebeacaa9ece985bb96","abstract_canon_sha256":"a45c8bdcd3d8c87c6a710f0dced35913babba03d1fcc09322998662a2d23370b"},"schema_version":"1.0"},"canonical_sha256":"525af4a381a065b7f5ec7ca13a76640f2c45fcbed4d1f5ecc8038e568e4c0590","source":{"kind":"arxiv","id":"1406.0140","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0140","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0140v2","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0140","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"KJNPJI4BUBS3","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KJNPJI4BUBS3P5PM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KJNPJI4B","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KJNPJI4BUBS3P5PMPSQTU5TEB4","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0140","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-01T07:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"be45978c92f6cb71f9028ce1552a4537badfb45abbdc1aebeacaa9ece985bb96","abstract_canon_sha256":"a45c8bdcd3d8c87c6a710f0dced35913babba03d1fcc09322998662a2d23370b"},"schema_version":"1.0"},"canonical_sha256":"525af4a381a065b7f5ec7ca13a76640f2c45fcbed4d1f5ecc8038e568e4c0590","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:52.150284Z","signature_b64":"3245rFelZQ7DngxRMG88b9L6NHmpDX0j8xn+5vdULQkm8VqncRCYLbq0g6kbG0KMv/KYFLPhgHCOfG0600xdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"525af4a381a065b7f5ec7ca13a76640f2c45fcbed4d1f5ecc8038e568e4c0590","last_reissued_at":"2026-05-18T02:17:52.149554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:52.149554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0140","source_version":2,"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-18T02:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQf1rRTINh+IkuTHM48FCNhcVHxXTCr40AwKKlr5lQ7Z2fNnBOwqfzpBwEqZnFdoAMAHL3bLoFbxLkSt/lzSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:07:15.237476Z"},"content_sha256":"4f58bf374b749468eb5a04fdf0122ef72f6e7761fef37ad05333c78e7ff904ce","schema_version":"1.0","event_id":"sha256:4f58bf374b749468eb5a04fdf0122ef72f6e7761fef37ad05333c78e7ff904ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KJNPJI4BUBS3P5PMPSQTU5TEB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Team Selection For Prediction Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Azin Ghazimatin, Hamid Haghshenas, Jafar Habibi, MohammadAmin Fazli","submitted_at":"2014-06-01T07:44:54Z","abstract_excerpt":"Given a random variable $O \\in \\mathbb{R}$ and a set of experts $E$, we describe a method for finding a subset of experts $S \\subseteq E$ whose aggregated opinion best predicts the outcome of $O$. Therefore, the problem can be regarded as a team formation for performing a prediction task. We show that in case of aggregating experts' opinions by simple averaging, finding the best team (the team with the lowest total error during past $k$ turns) can be modeled with an integer quadratic programming and we prove its NP-hardness whereas its relaxation is solvable in polynomial time. Finally, we do "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0140","kind":"arxiv","version":2},"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-18T02:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6ToNxUWVXxtuq+elI6L2o6PEGXymIHzOss5mkOaRdQEZy7UNUDj/ocTQbwr9KcdOBVE6wBQvUBjIbNuSgndBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:07:15.237879Z"},"content_sha256":"3a0ebaf6397f3ca3166df4d705ffcf9b777d51ba09faa063d3389f0829054ec1","schema_version":"1.0","event_id":"sha256:3a0ebaf6397f3ca3166df4d705ffcf9b777d51ba09faa063d3389f0829054ec1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJNPJI4BUBS3P5PMPSQTU5TEB4/bundle.json","state_url":"https://pith.science/pith/KJNPJI4BUBS3P5PMPSQTU5TEB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJNPJI4BUBS3P5PMPSQTU5TEB4/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-07-07T09:07:15Z","links":{"resolver":"https://pith.science/pith/KJNPJI4BUBS3P5PMPSQTU5TEB4","bundle":"https://pith.science/pith/KJNPJI4BUBS3P5PMPSQTU5TEB4/bundle.json","state":"https://pith.science/pith/KJNPJI4BUBS3P5PMPSQTU5TEB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJNPJI4BUBS3P5PMPSQTU5TEB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KJNPJI4BUBS3P5PMPSQTU5TEB4","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":"a45c8bdcd3d8c87c6a710f0dced35913babba03d1fcc09322998662a2d23370b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-01T07:44:54Z","title_canon_sha256":"be45978c92f6cb71f9028ce1552a4537badfb45abbdc1aebeacaa9ece985bb96"},"schema_version":"1.0","source":{"id":"1406.0140","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0140","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0140v2","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0140","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"KJNPJI4BUBS3","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KJNPJI4BUBS3P5PM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KJNPJI4B","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:3a0ebaf6397f3ca3166df4d705ffcf9b777d51ba09faa063d3389f0829054ec1","target":"graph","created_at":"2026-05-18T02:17:52Z","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":"Given a random variable $O \\in \\mathbb{R}$ and a set of experts $E$, we describe a method for finding a subset of experts $S \\subseteq E$ whose aggregated opinion best predicts the outcome of $O$. Therefore, the problem can be regarded as a team formation for performing a prediction task. We show that in case of aggregating experts' opinions by simple averaging, finding the best team (the team with the lowest total error during past $k$ turns) can be modeled with an integer quadratic programming and we prove its NP-hardness whereas its relaxation is solvable in polynomial time. Finally, we do ","authors_text":"Azin Ghazimatin, Hamid Haghshenas, Jafar Habibi, MohammadAmin Fazli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-01T07:44:54Z","title":"Team Selection For Prediction Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0140","kind":"arxiv","version":2},"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:4f58bf374b749468eb5a04fdf0122ef72f6e7761fef37ad05333c78e7ff904ce","target":"record","created_at":"2026-05-18T02:17:52Z","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":"a45c8bdcd3d8c87c6a710f0dced35913babba03d1fcc09322998662a2d23370b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-01T07:44:54Z","title_canon_sha256":"be45978c92f6cb71f9028ce1552a4537badfb45abbdc1aebeacaa9ece985bb96"},"schema_version":"1.0","source":{"id":"1406.0140","kind":"arxiv","version":2}},"canonical_sha256":"525af4a381a065b7f5ec7ca13a76640f2c45fcbed4d1f5ecc8038e568e4c0590","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"525af4a381a065b7f5ec7ca13a76640f2c45fcbed4d1f5ecc8038e568e4c0590","first_computed_at":"2026-05-18T02:17:52.149554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:52.149554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3245rFelZQ7DngxRMG88b9L6NHmpDX0j8xn+5vdULQkm8VqncRCYLbq0g6kbG0KMv/KYFLPhgHCOfG0600xdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:52.150284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0140","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f58bf374b749468eb5a04fdf0122ef72f6e7761fef37ad05333c78e7ff904ce","sha256:3a0ebaf6397f3ca3166df4d705ffcf9b777d51ba09faa063d3389f0829054ec1"],"state_sha256":"34a43bb02111c9afa2ce07cd6dfab08cb3b0775e1278dffd32a68edc703d81ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63VVhrbSRbR+5rHnil6O44RTrxAx9Rtnr3DTQcxeVLxWkunwfcCzn7oSAuCI3jpMchTKLS4xaquA3YRtX4ImBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:07:15.239729Z","bundle_sha256":"161aabb3b68ab0cfcc90912eda920f8dd7bbc73dfa600d03de8d072b535fdafd"}}