{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PL4TUJ26A722ZTRSOB4QGEDQHU","short_pith_number":"pith:PL4TUJ26","schema_version":"1.0","canonical_sha256":"7af93a275e07f5acce3270790310703d028704d3461d5476d3edd1946a76c9e6","source":{"kind":"arxiv","id":"2008.11191","version":1},"attestation_state":"computed","paper":{"title":"Multi-team Formation using Community Based Approach in Real-World Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Durga Bhavani S, Ramesh Bobby Addanki","submitted_at":"2020-08-25T17:49:25Z","abstract_excerpt":"In an organization, tasks called projects that require several skills, are generally assigned to teams rather than individuals. The problem of choosing a right team for a given task with minimal communication cost is known as team formation problem and many algorithms have been proposed in the literature. We propose an algorithm that exploits the community structure of the social network and forms a team by choosing a leader along with its neighbours from within a community. This algorithm is different from the skill-centric algorithms in the literature which start by searching for each skill,"},"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":"2008.11191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-08-25T17:49:25Z","cross_cats_sorted":[],"title_canon_sha256":"82fce4ab99684a4d57c0686a7ab476b88988f0476a87ec860950ff13ac0bd770","abstract_canon_sha256":"cfc755fa2e9ca62611f9810a7d9ef0f389e382a17a7b86451e17f3decb80e489"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:30:15.011501Z","signature_b64":"A0EQj/IV4RbG4NnvgylL+dNU21nKPCcQUVJyRlUPWrKyrUGcMD4UjOAU7DB7ewucyRqQNeQEDUf1VWdP+6RuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7af93a275e07f5acce3270790310703d028704d3461d5476d3edd1946a76c9e6","last_reissued_at":"2026-07-05T01:30:15.011086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:30:15.011086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-team Formation using Community Based Approach in Real-World Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Durga Bhavani S, Ramesh Bobby Addanki","submitted_at":"2020-08-25T17:49:25Z","abstract_excerpt":"In an organization, tasks called projects that require several skills, are generally assigned to teams rather than individuals. The problem of choosing a right team for a given task with minimal communication cost is known as team formation problem and many algorithms have been proposed in the literature. We propose an algorithm that exploits the community structure of the social network and forms a team by choosing a leader along with its neighbours from within a community. This algorithm is different from the skill-centric algorithms in the literature which start by searching for each skill,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.11191","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.11191/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.11191","created_at":"2026-07-05T01:30:15.011144+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.11191v1","created_at":"2026-07-05T01:30:15.011144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.11191","created_at":"2026-07-05T01:30:15.011144+00:00"},{"alias_kind":"pith_short_12","alias_value":"PL4TUJ26A722","created_at":"2026-07-05T01:30:15.011144+00:00"},{"alias_kind":"pith_short_16","alias_value":"PL4TUJ26A722ZTRS","created_at":"2026-07-05T01:30:15.011144+00:00"},{"alias_kind":"pith_short_8","alias_value":"PL4TUJ26","created_at":"2026-07-05T01:30:15.011144+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21549","citing_title":"Distill CLIP (DCLIP): Enhancing Image-Text Retrieval via Cross-Modal Transformer Distillation","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU","json":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU.json","graph_json":"https://pith.science/api/pith-number/PL4TUJ26A722ZTRSOB4QGEDQHU/graph.json","events_json":"https://pith.science/api/pith-number/PL4TUJ26A722ZTRSOB4QGEDQHU/events.json","paper":"https://pith.science/paper/PL4TUJ26"},"agent_actions":{"view_html":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU","download_json":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU.json","view_paper":"https://pith.science/paper/PL4TUJ26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.11191&json=true","fetch_graph":"https://pith.science/api/pith-number/PL4TUJ26A722ZTRSOB4QGEDQHU/graph.json","fetch_events":"https://pith.science/api/pith-number/PL4TUJ26A722ZTRSOB4QGEDQHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU/action/storage_attestation","attest_author":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU/action/author_attestation","sign_citation":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU/action/citation_signature","submit_replication":"https://pith.science/pith/PL4TUJ26A722ZTRSOB4QGEDQHU/action/replication_record"}},"created_at":"2026-07-05T01:30:15.011144+00:00","updated_at":"2026-07-05T01:30:15.011144+00:00"}