{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3U32H2SHWBM6ZMOGD7HTK4LDFB","short_pith_number":"pith:3U32H2SH","canonical_record":{"source":{"id":"1706.03184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-10T05:38:20Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"4d5999be7b15e213a07774057762924977e227dc7715cdb765901a37b8e00d2f","abstract_canon_sha256":"c8da6ca13d4801169afaed5fd3f9a2582100bf42ddca110bec47016f69903aca"},"schema_version":"1.0"},"canonical_sha256":"dd37a3ea47b059ecb1c61fcf357163285b9db6f31d7f4edf65cc5bf5eabda379","source":{"kind":"arxiv","id":"1706.03184","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03184","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03184v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03184","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"3U32H2SHWBM6","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3U32H2SHWBM6ZMOG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3U32H2SH","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3U32H2SHWBM6ZMOGD7HTK4LDFB","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-10T05:38:20Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"4d5999be7b15e213a07774057762924977e227dc7715cdb765901a37b8e00d2f","abstract_canon_sha256":"c8da6ca13d4801169afaed5fd3f9a2582100bf42ddca110bec47016f69903aca"},"schema_version":"1.0"},"canonical_sha256":"dd37a3ea47b059ecb1c61fcf357163285b9db6f31d7f4edf65cc5bf5eabda379","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:09.654763Z","signature_b64":"6bzDOqx2yUUD5gELkjE6zH8i6cnFL6JmHkWFFcfbVgnKK8ofnye6IzV6x3bZLgZ1ZO5GqeRGGwdMsSrWZgIACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd37a3ea47b059ecb1c61fcf357163285b9db6f31d7f4edf65cc5bf5eabda379","last_reissued_at":"2026-05-18T00:18:09.653972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:09.653972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03184","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-05-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/tWEvwYjDtvLtn5RXZu5kGN2MKY0ObPmWbpAGfWOSzbz0vEC8XI6nKxxrw1LYZHsMu/kuW8ctttliOXXlKHaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:55:24.841924Z"},"content_sha256":"3e3d01614a3b1a38890c3216be44731ba1956a78dfe75c7a224b613e17bfe4b9","schema_version":"1.0","event_id":"sha256:3e3d01614a3b1a38890c3216be44731ba1956a78dfe75c7a224b613e17bfe4b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3U32H2SHWBM6ZMOGD7HTK4LDFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper Bounds on Number of Steals in Rooted Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Charles E. Leiserson, Tao B. Schardl, Warut Suksompong","submitted_at":"2017-06-10T05:38:20Z","abstract_excerpt":"Inspired by applications in parallel computing, we analyze the setting of work stealing in multithreaded computations. We obtain tight upper bounds on the number of steals when the computation can be modeled by rooted trees. In particular, we show that if the computation with $n$ processors starts with one processor having a complete $k$-ary tree of height $h$ (and the remaining $n-1$ processors having nothing), the maximum possible number of steals is $\\sum_{i=1}^n(k-1)^i\\binom{h}{i}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03184","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":""},"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-05-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NeEReJYQvAt3wP0lBhzTGe0XG77AeTtt0KR13TqHrPp0PRiKFixienGAQmEkmBvI34Vu7rvypsVgIArPNV0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:55:24.842496Z"},"content_sha256":"7409e4e76d309998b7ebd483145b26c376ff4a54ff42623c36cda3a21eecc48a","schema_version":"1.0","event_id":"sha256:7409e4e76d309998b7ebd483145b26c376ff4a54ff42623c36cda3a21eecc48a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3U32H2SHWBM6ZMOGD7HTK4LDFB/bundle.json","state_url":"https://pith.science/pith/3U32H2SHWBM6ZMOGD7HTK4LDFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3U32H2SHWBM6ZMOGD7HTK4LDFB/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-06-06T20:55:24Z","links":{"resolver":"https://pith.science/pith/3U32H2SHWBM6ZMOGD7HTK4LDFB","bundle":"https://pith.science/pith/3U32H2SHWBM6ZMOGD7HTK4LDFB/bundle.json","state":"https://pith.science/pith/3U32H2SHWBM6ZMOGD7HTK4LDFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3U32H2SHWBM6ZMOGD7HTK4LDFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3U32H2SHWBM6ZMOGD7HTK4LDFB","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":"c8da6ca13d4801169afaed5fd3f9a2582100bf42ddca110bec47016f69903aca","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-10T05:38:20Z","title_canon_sha256":"4d5999be7b15e213a07774057762924977e227dc7715cdb765901a37b8e00d2f"},"schema_version":"1.0","source":{"id":"1706.03184","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03184","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03184v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03184","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"3U32H2SHWBM6","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3U32H2SHWBM6ZMOG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3U32H2SH","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:7409e4e76d309998b7ebd483145b26c376ff4a54ff42623c36cda3a21eecc48a","target":"graph","created_at":"2026-05-18T00:18:09Z","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"},"paper":{"abstract_excerpt":"Inspired by applications in parallel computing, we analyze the setting of work stealing in multithreaded computations. We obtain tight upper bounds on the number of steals when the computation can be modeled by rooted trees. In particular, we show that if the computation with $n$ processors starts with one processor having a complete $k$-ary tree of height $h$ (and the remaining $n-1$ processors having nothing), the maximum possible number of steals is $\\sum_{i=1}^n(k-1)^i\\binom{h}{i}$.","authors_text":"Charles E. Leiserson, Tao B. Schardl, Warut Suksompong","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-10T05:38:20Z","title":"Upper Bounds on Number of Steals in Rooted Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03184","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:3e3d01614a3b1a38890c3216be44731ba1956a78dfe75c7a224b613e17bfe4b9","target":"record","created_at":"2026-05-18T00:18:09Z","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":"c8da6ca13d4801169afaed5fd3f9a2582100bf42ddca110bec47016f69903aca","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-10T05:38:20Z","title_canon_sha256":"4d5999be7b15e213a07774057762924977e227dc7715cdb765901a37b8e00d2f"},"schema_version":"1.0","source":{"id":"1706.03184","kind":"arxiv","version":2}},"canonical_sha256":"dd37a3ea47b059ecb1c61fcf357163285b9db6f31d7f4edf65cc5bf5eabda379","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd37a3ea47b059ecb1c61fcf357163285b9db6f31d7f4edf65cc5bf5eabda379","first_computed_at":"2026-05-18T00:18:09.653972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:09.653972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6bzDOqx2yUUD5gELkjE6zH8i6cnFL6JmHkWFFcfbVgnKK8ofnye6IzV6x3bZLgZ1ZO5GqeRGGwdMsSrWZgIACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:09.654763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03184","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e3d01614a3b1a38890c3216be44731ba1956a78dfe75c7a224b613e17bfe4b9","sha256:7409e4e76d309998b7ebd483145b26c376ff4a54ff42623c36cda3a21eecc48a"],"state_sha256":"3c5ce804c2277ec24b723778126d4a482e169e357f6bcab4e16cc14bb318496e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jD5xvymXIIHe1lmTH0EaX0mGuZ0voFK+979YaBGHiHcA2C1eoHMoMD5AMZZtFUZQoBTZIQqkoHEiuLG4B8hCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:55:24.845422Z","bundle_sha256":"26e6b02badfb1d1ca358f7b042f08ea616b989350cddac441a60c90e11726b1c"}}