{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VWTUZQPSOJC6QRKYRVFQLBLD46","short_pith_number":"pith:VWTUZQPS","schema_version":"1.0","canonical_sha256":"ada74cc1f27245e845588d4b058563e78ba5e761a5b147b7a04704cc4ef4c84e","source":{"kind":"arxiv","id":"1409.5512","version":1},"attestation_state":"computed","paper":{"title":"Replacing the Irreplaceable: Fast Algorithms for Team Member Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Hanghang Tong, Kate Ehrlich, Liangyue Li, Nan Cao, Norbou Buchler, Yu-Ru Lin","submitted_at":"2014-09-19T04:05:16Z","abstract_excerpt":"In this paper, we study the problem of Team Member Replacement: given a team of people embedded in a social network working on the same task, find a good candidate who can fit in the team after one team member becomes unavailable. We conjecture that a good team member replacement should have good skill matching as well as good structure matching. We formulate this problem using the concept of graph kernel. To tackle the computational challenges, we propose a family of fast algorithms by (a) designing effective pruning strategies, and (b) exploring the smoothness between the existing and the ne"},"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":"1409.5512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-09-19T04:05:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0d251c5b3d064828f6d0d1e8ee9b2c145a906e15340c717bab7b8b22da2c80f1","abstract_canon_sha256":"863b7579955ffcd6435efa57dd728f8b8ccc19cdc4c4fc896a67e511d735fc4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:27.290693Z","signature_b64":"1S/CRePafqiI94EDYbmTVOIK2d/526R+sqf+v8BhmAT4dvVBq78d9AsVgZ8kw9iqWMLug4GIYXp3WLUbeCL7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada74cc1f27245e845588d4b058563e78ba5e761a5b147b7a04704cc4ef4c84e","last_reissued_at":"2026-05-18T02:42:27.289884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:27.289884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Replacing the Irreplaceable: Fast Algorithms for Team Member Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Hanghang Tong, Kate Ehrlich, Liangyue Li, Nan Cao, Norbou Buchler, Yu-Ru Lin","submitted_at":"2014-09-19T04:05:16Z","abstract_excerpt":"In this paper, we study the problem of Team Member Replacement: given a team of people embedded in a social network working on the same task, find a good candidate who can fit in the team after one team member becomes unavailable. We conjecture that a good team member replacement should have good skill matching as well as good structure matching. We formulate this problem using the concept of graph kernel. To tackle the computational challenges, we propose a family of fast algorithms by (a) designing effective pruning strategies, and (b) exploring the smoothness between the existing and the ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5512","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":"1409.5512","created_at":"2026-05-18T02:42:27.290003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5512v1","created_at":"2026-05-18T02:42:27.290003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5512","created_at":"2026-05-18T02:42:27.290003+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWTUZQPSOJC6","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWTUZQPSOJC6QRKY","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWTUZQPS","created_at":"2026-05-18T12:28:54.890064+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/VWTUZQPSOJC6QRKYRVFQLBLD46","json":"https://pith.science/pith/VWTUZQPSOJC6QRKYRVFQLBLD46.json","graph_json":"https://pith.science/api/pith-number/VWTUZQPSOJC6QRKYRVFQLBLD46/graph.json","events_json":"https://pith.science/api/pith-number/VWTUZQPSOJC6QRKYRVFQLBLD46/events.json","paper":"https://pith.science/paper/VWTUZQPS"},"agent_actions":{"view_html":"https://pith.science/pith/VWTUZQPSOJC6QRKYRVFQLBLD46","download_json":"https://pith.science/pith/VWTUZQPSOJC6QRKYRVFQLBLD46.json","view_paper":"https://pith.science/paper/VWTUZQPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5512&json=true","fetch_graph":"https://pith.science/api/pith-number/VWTUZQPSOJC6QRKYRVFQLBLD46/graph.json","fetch_events":"https://pith.science/api/pith-number/VWTUZQPSOJC6QRKYRVFQLBLD46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWTUZQPSOJC6QRKYRVFQLBLD46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWTUZQPSOJC6QRKYRVFQLBLD46/action/storage_attestation","attest_author":"https://pith.science/pith/VWTUZQPSOJC6QRKYRVFQLBLD46/action/author_attestation","sign_citation":"https://pith.science/pith/VWTUZQPSOJC6QRKYRVFQLBLD46/action/citation_signature","submit_replication":"https://pith.science/pith/VWTUZQPSOJC6QRKYRVFQLBLD46/action/replication_record"}},"created_at":"2026-05-18T02:42:27.290003+00:00","updated_at":"2026-05-18T02:42:27.290003+00:00"}