{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LFHQNCZB5V7JIUJ6WVXLGFNYYY","short_pith_number":"pith:LFHQNCZB","schema_version":"1.0","canonical_sha256":"594f068b21ed7e94513eb56eb315b8c628a27fbd54550dfe1a31ce7d1996fbe6","source":{"kind":"arxiv","id":"2508.13084","version":2},"attestation_state":"computed","paper":{"title":"Team Formation and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gadi Taubenfeld, Ido Rafael, Shay Kutten, Yuval Emek","submitted_at":"2025-08-18T16:57:42Z","abstract_excerpt":"A novel long-lived distributed problem, called Team Formation (TF), is introduced together with a message- and time-efficient randomized algorithm. The problem is defined over the asynchronous model with a complete communication graph, using bounded size messages, where a certain fraction of the nodes may experience a generalized, strictly stronger, version of initial failures. The goal of a TF algorithm is to assemble tokens injected by the environment, in a distributed manner, into teams of size $\\sigma$, where $\\sigma$ is a parameter of the problem.\n  The usefulness of TF is demonstrated by"},"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":"2508.13084","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-18T16:57:42Z","cross_cats_sorted":[],"title_canon_sha256":"f7d8c2c7592e1ddc009858b475d9ce553d4dbe5ac226c779760f40ce4a0e5bd0","abstract_canon_sha256":"027b280b0ce2f763d61b5a62c134c479abf93839c86fafad6f1abdd09cafe60e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:25.371496Z","signature_b64":"mvJRoS5e0+ld//x7S3c5f2inVS3GQeZX0nuKGfcAdgpO8+A9/ZW2EFnenf+t6tj0LLO16nfsVavZcBK1o+E4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"594f068b21ed7e94513eb56eb315b8c628a27fbd54550dfe1a31ce7d1996fbe6","last_reissued_at":"2026-06-30T01:17:25.370656Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:25.370656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Team Formation and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gadi Taubenfeld, Ido Rafael, Shay Kutten, Yuval Emek","submitted_at":"2025-08-18T16:57:42Z","abstract_excerpt":"A novel long-lived distributed problem, called Team Formation (TF), is introduced together with a message- and time-efficient randomized algorithm. The problem is defined over the asynchronous model with a complete communication graph, using bounded size messages, where a certain fraction of the nodes may experience a generalized, strictly stronger, version of initial failures. The goal of a TF algorithm is to assemble tokens injected by the environment, in a distributed manner, into teams of size $\\sigma$, where $\\sigma$ is a parameter of the problem.\n  The usefulness of TF is demonstrated by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.13084","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.13084/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":"2508.13084","created_at":"2026-06-30T01:17:25.370754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.13084v2","created_at":"2026-06-30T01:17:25.370754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13084","created_at":"2026-06-30T01:17:25.370754+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFHQNCZB5V7J","created_at":"2026-06-30T01:17:25.370754+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFHQNCZB5V7JIUJ6","created_at":"2026-06-30T01:17:25.370754+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFHQNCZB","created_at":"2026-06-30T01:17:25.370754+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/LFHQNCZB5V7JIUJ6WVXLGFNYYY","json":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY.json","graph_json":"https://pith.science/api/pith-number/LFHQNCZB5V7JIUJ6WVXLGFNYYY/graph.json","events_json":"https://pith.science/api/pith-number/LFHQNCZB5V7JIUJ6WVXLGFNYYY/events.json","paper":"https://pith.science/paper/LFHQNCZB"},"agent_actions":{"view_html":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY","download_json":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY.json","view_paper":"https://pith.science/paper/LFHQNCZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.13084&json=true","fetch_graph":"https://pith.science/api/pith-number/LFHQNCZB5V7JIUJ6WVXLGFNYYY/graph.json","fetch_events":"https://pith.science/api/pith-number/LFHQNCZB5V7JIUJ6WVXLGFNYYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/action/storage_attestation","attest_author":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/action/author_attestation","sign_citation":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/action/citation_signature","submit_replication":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/action/replication_record"}},"created_at":"2026-06-30T01:17:25.370754+00:00","updated_at":"2026-06-30T01:17:25.370754+00:00"}