{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DKUDK23OPIKDQQYSB4MXKHJRLL","short_pith_number":"pith:DKUDK23O","canonical_record":{"source":{"id":"1505.06661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-05-25T15:17:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6f2e489eb7870278060175f581705f068ac9ca9f8a5a5ef6c554030c04dcd96c","abstract_canon_sha256":"a2b842434ede4f540471655c3b2a96452fb94512061eb0b178c94e54f5fbd919"},"schema_version":"1.0"},"canonical_sha256":"1aa8356b6e7a143843120f19751d315ae262a21b34c1c51c1b16ec205793b79a","source":{"kind":"arxiv","id":"1505.06661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06661","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06661v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06661","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"DKUDK23OPIKD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DKUDK23OPIKDQQYS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DKUDK23O","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DKUDK23OPIKDQQYSB4MXKHJRLL","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-05-25T15:17:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6f2e489eb7870278060175f581705f068ac9ca9f8a5a5ef6c554030c04dcd96c","abstract_canon_sha256":"a2b842434ede4f540471655c3b2a96452fb94512061eb0b178c94e54f5fbd919"},"schema_version":"1.0"},"canonical_sha256":"1aa8356b6e7a143843120f19751d315ae262a21b34c1c51c1b16ec205793b79a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:44.337484Z","signature_b64":"euixvrSgtSAKmpGNDfyEZb7w5YIIuVRxXbHrqDp04h8ZNzO0TSQV8vqSXJdO4ALJOHFYJDkFSCk0r+Z+aHLnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aa8356b6e7a143843120f19751d315ae262a21b34c1c51c1b16ec205793b79a","last_reissued_at":"2026-05-18T02:03:44.336727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:44.336727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06661","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-18T02:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMuMbjbOxD4xXRWQnHoFEa7Lf/YZjVMNHRhTsgmO/a0W+x/BbZVfh8xKy7cOcEkY4Pq14yaUFflqEIGlJYSWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:31:53.124257Z"},"content_sha256":"84811ecbc1f0c85603875cff9dd4a42f8544f267acdc6ba93cf810705bce144f","schema_version":"1.0","event_id":"sha256:84811ecbc1f0c85603875cff9dd4a42f8544f267acdc6ba93cf810705bce144f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DKUDK23OPIKDQQYSB4MXKHJRLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Realistic Team Formation in Social Networks based on Densest Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Matthias Hein, Syama Sundar Rangapuram, Thomas B\\\"uhler","submitted_at":"2015-05-25T15:17:46Z","abstract_excerpt":"Given a task $\\mathcal{T}$, a set of experts $V$ with multiple skills and a social network $G(V, W)$ reflecting the compatibility among the experts, team formation is the problem of identifying a team $C \\subseteq V$ that is both competent in performing the task $\\mathcal{T}$ and compatible in working together. Existing methods for this problem make too restrictive assumptions and thus cannot model practical scenarios. The goal of this paper is to consider the team formation problem in a realistic setting and present a novel formulation based on densest subgraphs. Our formulation allows modeli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06661","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-18T02:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"041vE89Hh6YnsrebL45uQ/sA7VqXBjTwZ8z7IaVWhfgdi5n6aAu92AMpo0XuvF1QFCqiRm7pUluzEFGgk0d+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:31:53.124621Z"},"content_sha256":"bc53b2fceb587cc10327820236cd970d972369a91a0c7d7ab2ebbff26c81e77c","schema_version":"1.0","event_id":"sha256:bc53b2fceb587cc10327820236cd970d972369a91a0c7d7ab2ebbff26c81e77c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/bundle.json","state_url":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/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-02T14:31:53Z","links":{"resolver":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL","bundle":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/bundle.json","state":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DKUDK23OPIKDQQYSB4MXKHJRLL","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":"a2b842434ede4f540471655c3b2a96452fb94512061eb0b178c94e54f5fbd919","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-05-25T15:17:46Z","title_canon_sha256":"6f2e489eb7870278060175f581705f068ac9ca9f8a5a5ef6c554030c04dcd96c"},"schema_version":"1.0","source":{"id":"1505.06661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06661","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06661v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06661","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"DKUDK23OPIKD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DKUDK23OPIKDQQYS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DKUDK23O","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:bc53b2fceb587cc10327820236cd970d972369a91a0c7d7ab2ebbff26c81e77c","target":"graph","created_at":"2026-05-18T02:03:44Z","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 task $\\mathcal{T}$, a set of experts $V$ with multiple skills and a social network $G(V, W)$ reflecting the compatibility among the experts, team formation is the problem of identifying a team $C \\subseteq V$ that is both competent in performing the task $\\mathcal{T}$ and compatible in working together. Existing methods for this problem make too restrictive assumptions and thus cannot model practical scenarios. The goal of this paper is to consider the team formation problem in a realistic setting and present a novel formulation based on densest subgraphs. Our formulation allows modeli","authors_text":"Matthias Hein, Syama Sundar Rangapuram, Thomas B\\\"uhler","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-05-25T15:17:46Z","title":"Towards Realistic Team Formation in Social Networks based on Densest Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06661","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:84811ecbc1f0c85603875cff9dd4a42f8544f267acdc6ba93cf810705bce144f","target":"record","created_at":"2026-05-18T02:03:44Z","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":"a2b842434ede4f540471655c3b2a96452fb94512061eb0b178c94e54f5fbd919","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-05-25T15:17:46Z","title_canon_sha256":"6f2e489eb7870278060175f581705f068ac9ca9f8a5a5ef6c554030c04dcd96c"},"schema_version":"1.0","source":{"id":"1505.06661","kind":"arxiv","version":1}},"canonical_sha256":"1aa8356b6e7a143843120f19751d315ae262a21b34c1c51c1b16ec205793b79a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aa8356b6e7a143843120f19751d315ae262a21b34c1c51c1b16ec205793b79a","first_computed_at":"2026-05-18T02:03:44.336727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:44.336727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"euixvrSgtSAKmpGNDfyEZb7w5YIIuVRxXbHrqDp04h8ZNzO0TSQV8vqSXJdO4ALJOHFYJDkFSCk0r+Z+aHLnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:44.337484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84811ecbc1f0c85603875cff9dd4a42f8544f267acdc6ba93cf810705bce144f","sha256:bc53b2fceb587cc10327820236cd970d972369a91a0c7d7ab2ebbff26c81e77c"],"state_sha256":"f8fc2764f75841cfbab7bb619d003598d1b2e8abc7b42b302df56d20130f8626"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QsCV+n0x76COqiUpWvB72UFk5K93b2Y+5BGxtHDyE3JDfFmA0mMYI15W6+KRi6AAwn6nPVtVYu2VRyNuCMGBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:31:53.127198Z","bundle_sha256":"01417c0b66bad59045859a8a22996c631c67def862ed215bc0ab71539ed5e963"}}