{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DKUDK23OPIKDQQYSB4MXKHJRLL","short_pith_number":"pith:DKUDK23O","schema_version":"1.0","canonical_sha256":"1aa8356b6e7a143843120f19751d315ae262a21b34c1c51c1b16ec205793b79a","source":{"kind":"arxiv","id":"1505.06661","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.06661","created_at":"2026-05-18T02:03:44.336860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06661v1","created_at":"2026-05-18T02:03:44.336860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06661","created_at":"2026-05-18T02:03:44.336860+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKUDK23OPIKD","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKUDK23OPIKDQQYS","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKUDK23O","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL","json":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL.json","graph_json":"https://pith.science/api/pith-number/DKUDK23OPIKDQQYSB4MXKHJRLL/graph.json","events_json":"https://pith.science/api/pith-number/DKUDK23OPIKDQQYSB4MXKHJRLL/events.json","paper":"https://pith.science/paper/DKUDK23O"},"agent_actions":{"view_html":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL","download_json":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL.json","view_paper":"https://pith.science/paper/DKUDK23O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06661&json=true","fetch_graph":"https://pith.science/api/pith-number/DKUDK23OPIKDQQYSB4MXKHJRLL/graph.json","fetch_events":"https://pith.science/api/pith-number/DKUDK23OPIKDQQYSB4MXKHJRLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/action/storage_attestation","attest_author":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/action/author_attestation","sign_citation":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/action/citation_signature","submit_replication":"https://pith.science/pith/DKUDK23OPIKDQQYSB4MXKHJRLL/action/replication_record"}},"created_at":"2026-05-18T02:03:44.336860+00:00","updated_at":"2026-05-18T02:03:44.336860+00:00"}