{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VLH264TPUISDAMPRYNTMJY5YDP","short_pith_number":"pith:VLH264TP","canonical_record":{"source":{"id":"1507.04383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-15T20:28:18Z","cross_cats_sorted":[],"title_canon_sha256":"b99cfbf269a0c60e6a5b1b52b42848a424166d44885639b5066b3bacd801fa2f","abstract_canon_sha256":"718695c7f14e7891f83520e4a7bbb0d605418f118210d130792516aefb19ff4c"},"schema_version":"1.0"},"canonical_sha256":"aacfaf726fa2243031f1c366c4e3b81bd5d0612cfda58e2410665f2f2d4a836f","source":{"kind":"arxiv","id":"1507.04383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04383","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04383v1","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04383","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"VLH264TPUISD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VLH264TPUISDAMPR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VLH264TP","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VLH264TPUISDAMPRYNTMJY5YDP","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-15T20:28:18Z","cross_cats_sorted":[],"title_canon_sha256":"b99cfbf269a0c60e6a5b1b52b42848a424166d44885639b5066b3bacd801fa2f","abstract_canon_sha256":"718695c7f14e7891f83520e4a7bbb0d605418f118210d130792516aefb19ff4c"},"schema_version":"1.0"},"canonical_sha256":"aacfaf726fa2243031f1c366c4e3b81bd5d0612cfda58e2410665f2f2d4a836f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:47.555822Z","signature_b64":"6IV8janI0toQep0RxT090B2V0hXGeFkfBVecv/VesCHQU+b9zep5ZhSfsYQpNU0S072rHQmB4PyVOnikKKadBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aacfaf726fa2243031f1c366c4e3b81bd5d0612cfda58e2410665f2f2d4a836f","last_reissued_at":"2026-05-18T01:36:47.555095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:47.555095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04383","source_version":1,"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-18T01:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LH0B1pIMAxNU6kV1sk1vevrHe1Mjmsx+ubqQC4pFh1mnSgJtJ7WFSMR+yOeUuYdSiSOkrCZTwG2lmC8yLoXECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:53:23.016642Z"},"content_sha256":"647bd02e8bc29983c4236730fd78db0e56712a0d5fe08dfaf39ba704a6ac1e5c","schema_version":"1.0","event_id":"sha256:647bd02e8bc29983c4236730fd78db0e56712a0d5fe08dfaf39ba704a6ac1e5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VLH264TPUISDAMPRYNTMJY5YDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Monte Carlo Tree Search on Intel Xeon Phi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aske Plaat, Jaap van den Herik, Jos Vermaseren, S. Ali Mirsoleimani","submitted_at":"2015-07-15T20:28:18Z","abstract_excerpt":"Many algorithms have been parallelized successfully on the Intel Xeon Phi coprocessor, especially those with regular, balanced, and predictable data access patterns and instruction flows. Irregular and unbalanced algorithms are harder to parallelize efficiently. They are, for instance, present in artificial intelligence search algorithms such as Monte Carlo Tree Search (MCTS). In this paper we study the scaling behavior of MCTS, on a highly optimized real-world application, on real hardware. The Intel Xeon Phi allows shared memory scaling studies up to 61 cores and 244 hardware threads. We com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04383","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"},"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-18T01:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JooDEjWuOpj0r1MCgRWyAyUxeFlh0yaJobtJRkxQPwcprUUMzO6+bSzAar2Kyq+yvTGyd6z6ppvPxIPO0jZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:53:23.016983Z"},"content_sha256":"25d9fcb7c74b058fdf53a25bfce7596e0ac172a67c351e4fb0115533204cefac","schema_version":"1.0","event_id":"sha256:25d9fcb7c74b058fdf53a25bfce7596e0ac172a67c351e4fb0115533204cefac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLH264TPUISDAMPRYNTMJY5YDP/bundle.json","state_url":"https://pith.science/pith/VLH264TPUISDAMPRYNTMJY5YDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLH264TPUISDAMPRYNTMJY5YDP/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-27T19:53:23Z","links":{"resolver":"https://pith.science/pith/VLH264TPUISDAMPRYNTMJY5YDP","bundle":"https://pith.science/pith/VLH264TPUISDAMPRYNTMJY5YDP/bundle.json","state":"https://pith.science/pith/VLH264TPUISDAMPRYNTMJY5YDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLH264TPUISDAMPRYNTMJY5YDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VLH264TPUISDAMPRYNTMJY5YDP","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":"718695c7f14e7891f83520e4a7bbb0d605418f118210d130792516aefb19ff4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-15T20:28:18Z","title_canon_sha256":"b99cfbf269a0c60e6a5b1b52b42848a424166d44885639b5066b3bacd801fa2f"},"schema_version":"1.0","source":{"id":"1507.04383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04383","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04383v1","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04383","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"VLH264TPUISD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VLH264TPUISDAMPR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VLH264TP","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:25d9fcb7c74b058fdf53a25bfce7596e0ac172a67c351e4fb0115533204cefac","target":"graph","created_at":"2026-05-18T01:36:47Z","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":"Many algorithms have been parallelized successfully on the Intel Xeon Phi coprocessor, especially those with regular, balanced, and predictable data access patterns and instruction flows. Irregular and unbalanced algorithms are harder to parallelize efficiently. They are, for instance, present in artificial intelligence search algorithms such as Monte Carlo Tree Search (MCTS). In this paper we study the scaling behavior of MCTS, on a highly optimized real-world application, on real hardware. The Intel Xeon Phi allows shared memory scaling studies up to 61 cores and 244 hardware threads. We com","authors_text":"Aske Plaat, Jaap van den Herik, Jos Vermaseren, S. Ali Mirsoleimani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-15T20:28:18Z","title":"Scaling Monte Carlo Tree Search on Intel Xeon Phi"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04383","kind":"arxiv","version":1},"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:647bd02e8bc29983c4236730fd78db0e56712a0d5fe08dfaf39ba704a6ac1e5c","target":"record","created_at":"2026-05-18T01:36:47Z","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":"718695c7f14e7891f83520e4a7bbb0d605418f118210d130792516aefb19ff4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-15T20:28:18Z","title_canon_sha256":"b99cfbf269a0c60e6a5b1b52b42848a424166d44885639b5066b3bacd801fa2f"},"schema_version":"1.0","source":{"id":"1507.04383","kind":"arxiv","version":1}},"canonical_sha256":"aacfaf726fa2243031f1c366c4e3b81bd5d0612cfda58e2410665f2f2d4a836f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aacfaf726fa2243031f1c366c4e3b81bd5d0612cfda58e2410665f2f2d4a836f","first_computed_at":"2026-05-18T01:36:47.555095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:47.555095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6IV8janI0toQep0RxT090B2V0hXGeFkfBVecv/VesCHQU+b9zep5ZhSfsYQpNU0S072rHQmB4PyVOnikKKadBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:47.555822Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:647bd02e8bc29983c4236730fd78db0e56712a0d5fe08dfaf39ba704a6ac1e5c","sha256:25d9fcb7c74b058fdf53a25bfce7596e0ac172a67c351e4fb0115533204cefac"],"state_sha256":"3a7bf3cf030cbfcf8c8fa194d368d1e3279822310ffde1bc1cf323b806c86d84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tU3GoBmQZANf+7mNi2l4toiB5I+K0S9Tgby5b45tbCIAIB1BdUqJPxsMNAzi3C4z5ZXrfvve+rMEFZ8Zl6yJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:53:23.018826Z","bundle_sha256":"da255d9bca099640ee987add25637d90594444e5a4fa4813bc1d0defcae5abe7"}}