{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LFHQNCZB5V7JIUJ6WVXLGFNYYY","short_pith_number":"pith:LFHQNCZB","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"},"canonical_sha256":"594f068b21ed7e94513eb56eb315b8c628a27fbd54550dfe1a31ce7d1996fbe6","source":{"kind":"arxiv","id":"2508.13084","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.13084","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2508.13084v2","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13084","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"LFHQNCZB5V7J","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"LFHQNCZB5V7JIUJ6","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"LFHQNCZB","created_at":"2026-06-30T01:17:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LFHQNCZB5V7JIUJ6WVXLGFNYYY","target":"record","payload":{"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"},"canonical_sha256":"594f068b21ed7e94513eb56eb315b8c628a27fbd54550dfe1a31ce7d1996fbe6","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"},"source_kind":"arxiv","source_id":"2508.13084","source_version":2,"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-06-30T01:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YaNbfwIh/1Br1sas+I6vv8pjH9303dtm2u3I7gnTD3jsrI1OoFnaVo/0wXX4b+cBrwMzRA4zspwnRZjTzP9nBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T18:36:16.995337Z"},"content_sha256":"aa588acf01d1536d70d47a5918fb257163f5c99150d66fa5390fed0cb4dc6a4a","schema_version":"1.0","event_id":"sha256:aa588acf01d1536d70d47a5918fb257163f5c99150d66fa5390fed0cb4dc6a4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LFHQNCZB5V7JIUJ6WVXLGFNYYY","target":"graph","payload":{"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"},"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-06-30T01:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7acJ2Expv/Hl5iZZfxoJtBDHPetIErr80yJ6XSs8CV5unU8uJ4sWewxvRtkh+GaFt9thK7ExKZgNE5y0zf+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T18:36:16.995714Z"},"content_sha256":"6e38ef0c5c455c87b43096aee47ba593dec23f64b8ba3e56c199b97e58f2058b","schema_version":"1.0","event_id":"sha256:6e38ef0c5c455c87b43096aee47ba593dec23f64b8ba3e56c199b97e58f2058b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/bundle.json","state_url":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/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-07-03T18:36:16Z","links":{"resolver":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY","bundle":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/bundle.json","state":"https://pith.science/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFHQNCZB5V7JIUJ6WVXLGFNYYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LFHQNCZB5V7JIUJ6WVXLGFNYYY","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":"027b280b0ce2f763d61b5a62c134c479abf93839c86fafad6f1abdd09cafe60e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-18T16:57:42Z","title_canon_sha256":"f7d8c2c7592e1ddc009858b475d9ce553d4dbe5ac226c779760f40ce4a0e5bd0"},"schema_version":"1.0","source":{"id":"2508.13084","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.13084","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2508.13084v2","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13084","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"LFHQNCZB5V7J","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"LFHQNCZB5V7JIUJ6","created_at":"2026-06-30T01:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"LFHQNCZB","created_at":"2026-06-30T01:17:25Z"}],"graph_snapshots":[{"event_id":"sha256:6e38ef0c5c455c87b43096aee47ba593dec23f64b8ba3e56c199b97e58f2058b","target":"graph","created_at":"2026-06-30T01:17:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.13084/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gadi Taubenfeld, Ido Rafael, Shay Kutten, Yuval Emek","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-18T16:57:42Z","title":"Team Formation and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.13084","kind":"arxiv","version":2},"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:aa588acf01d1536d70d47a5918fb257163f5c99150d66fa5390fed0cb4dc6a4a","target":"record","created_at":"2026-06-30T01:17:25Z","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":"027b280b0ce2f763d61b5a62c134c479abf93839c86fafad6f1abdd09cafe60e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-08-18T16:57:42Z","title_canon_sha256":"f7d8c2c7592e1ddc009858b475d9ce553d4dbe5ac226c779760f40ce4a0e5bd0"},"schema_version":"1.0","source":{"id":"2508.13084","kind":"arxiv","version":2}},"canonical_sha256":"594f068b21ed7e94513eb56eb315b8c628a27fbd54550dfe1a31ce7d1996fbe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"594f068b21ed7e94513eb56eb315b8c628a27fbd54550dfe1a31ce7d1996fbe6","first_computed_at":"2026-06-30T01:17:25.370656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:17:25.370656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mvJRoS5e0+ld//x7S3c5f2inVS3GQeZX0nuKGfcAdgpO8+A9/ZW2EFnenf+t6tj0LLO16nfsVavZcBK1o+E4Dg==","signature_status":"signed_v1","signed_at":"2026-06-30T01:17:25.371496Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.13084","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa588acf01d1536d70d47a5918fb257163f5c99150d66fa5390fed0cb4dc6a4a","sha256:6e38ef0c5c455c87b43096aee47ba593dec23f64b8ba3e56c199b97e58f2058b"],"state_sha256":"9c4da253ee289cf3b5cc77bafe9a8d897f5dd751c5a896af22e12c702424a3f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cfTG7qj3jrFMGht+7snLTvDFqk0I7ahe3s3AyC8HAQ8iNm/5k430Dj33O8ckRh2bZ1bJGz3lmBTETxAx1nBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T18:36:16.997771Z","bundle_sha256":"ab4d5af5f2681df4cde18bec155cf1cce0647569d1419349a6adc430f668b674"}}