{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2757IYDLBKQPHIGV2WJMUOE43I","short_pith_number":"pith:2757IYDL","canonical_record":{"source":{"id":"2411.17887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-26T21:16:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ae02f68e24c2b6bcaadec79ae43e97079230ba3d6ffecf79d67cee339fb9cee8","abstract_canon_sha256":"4194568deacb9ad51617bd4336e7b97ef5e836b827b41aec05441c5f2df4f701"},"schema_version":"1.0"},"canonical_sha256":"d7fbf4606b0aa0f3a0d5d592ca389cda2cff3a2a882c063a4396819fe4820672","source":{"kind":"arxiv","id":"2411.17887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17887","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17887v1","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17887","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"2757IYDLBKQP","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"pith_short_16","alias_value":"2757IYDLBKQPHIGV","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"pith_short_8","alias_value":"2757IYDL","created_at":"2026-07-05T09:41:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2757IYDLBKQPHIGV2WJMUOE43I","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-26T21:16:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ae02f68e24c2b6bcaadec79ae43e97079230ba3d6ffecf79d67cee339fb9cee8","abstract_canon_sha256":"4194568deacb9ad51617bd4336e7b97ef5e836b827b41aec05441c5f2df4f701"},"schema_version":"1.0"},"canonical_sha256":"d7fbf4606b0aa0f3a0d5d592ca389cda2cff3a2a882c063a4396819fe4820672","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:08.557724Z","signature_b64":"cIfNMhTRPnK0rYB/wkjTli8hGYehFsrLtw7xcf9jveMe7Sv5MSq7UvCIBbalozm9Wdyni69rdJLlnRSHXIhBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7fbf4606b0aa0f3a0d5d592ca389cda2cff3a2a882c063a4396819fe4820672","last_reissued_at":"2026-07-05T09:41:08.557275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:08.557275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17887","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-07-05T09:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCGhkucHyZY5+h5szfR7a0Mxs+s/6WujSRYcltlbWhL99foNtx8wBDsaPR0YiAUsmO6wiT0w5nUa3FRHdbmfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:15:28.442827Z"},"content_sha256":"48ec17c6dbbcf948d431671addb88544cb67f7c74e1027d6dc4e4b497ffa113f","schema_version":"1.0","event_id":"sha256:48ec17c6dbbcf948d431671addb88544cb67f7c74e1027d6dc4e4b497ffa113f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2757IYDLBKQPHIGV2WJMUOE43I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parallel Scan Algorithm in the Tensor Core Unit Model","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anastasios Zouzias, William F. McColl","submitted_at":"2024-11-26T21:16:58Z","abstract_excerpt":"We present a parallel scan (prefix sum) algorithm in the Tensor Core Unit (TCU) model of computation. The TCU model assumes that multiplication between two square matrices of constant size $s$ is a basic operation. In the $(s^2, \\ell)$-TCU model, we show that for inputs of size $n$, the algorithm has depth at most $2\\lfloor \\log_s (n)\\rfloor$ and runs in $O(n(1 + \\ell /s^2)/p + (s^2 + \\ell) \\log_s (n))$ time assuming $p$ tensor core units. Equivalently, the algorithm performs $O(n/s^2)$ multiplications of square matrices of size s."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17887","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17887/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-07-05T09:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"da7QGun9l8RNpWRIUOcV37kCu4Mca4+DQUmsxrZIbVG6IbZhW/OIDHt6ryBPZNFygj2rVrtUAK0+hACSCBNZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:15:28.443408Z"},"content_sha256":"36b529d900ade996f90ba93333d5ac9df518134afb8843760fe97db61c2ddd0a","schema_version":"1.0","event_id":"sha256:36b529d900ade996f90ba93333d5ac9df518134afb8843760fe97db61c2ddd0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2757IYDLBKQPHIGV2WJMUOE43I/bundle.json","state_url":"https://pith.science/pith/2757IYDLBKQPHIGV2WJMUOE43I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2757IYDLBKQPHIGV2WJMUOE43I/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-08-13T02:15:28Z","links":{"resolver":"https://pith.science/pith/2757IYDLBKQPHIGV2WJMUOE43I","bundle":"https://pith.science/pith/2757IYDLBKQPHIGV2WJMUOE43I/bundle.json","state":"https://pith.science/pith/2757IYDLBKQPHIGV2WJMUOE43I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2757IYDLBKQPHIGV2WJMUOE43I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2757IYDLBKQPHIGV2WJMUOE43I","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":"4194568deacb9ad51617bd4336e7b97ef5e836b827b41aec05441c5f2df4f701","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-26T21:16:58Z","title_canon_sha256":"ae02f68e24c2b6bcaadec79ae43e97079230ba3d6ffecf79d67cee339fb9cee8"},"schema_version":"1.0","source":{"id":"2411.17887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17887","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17887v1","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17887","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"2757IYDLBKQP","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"pith_short_16","alias_value":"2757IYDLBKQPHIGV","created_at":"2026-07-05T09:41:08Z"},{"alias_kind":"pith_short_8","alias_value":"2757IYDL","created_at":"2026-07-05T09:41:08Z"}],"graph_snapshots":[{"event_id":"sha256:36b529d900ade996f90ba93333d5ac9df518134afb8843760fe97db61c2ddd0a","target":"graph","created_at":"2026-07-05T09:41:08Z","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/2411.17887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a parallel scan (prefix sum) algorithm in the Tensor Core Unit (TCU) model of computation. The TCU model assumes that multiplication between two square matrices of constant size $s$ is a basic operation. In the $(s^2, \\ell)$-TCU model, we show that for inputs of size $n$, the algorithm has depth at most $2\\lfloor \\log_s (n)\\rfloor$ and runs in $O(n(1 + \\ell /s^2)/p + (s^2 + \\ell) \\log_s (n))$ time assuming $p$ tensor core units. Equivalently, the algorithm performs $O(n/s^2)$ multiplications of square matrices of size s.","authors_text":"Anastasios Zouzias, William F. McColl","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-26T21:16:58Z","title":"A Parallel Scan Algorithm in the Tensor Core Unit Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17887","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:48ec17c6dbbcf948d431671addb88544cb67f7c74e1027d6dc4e4b497ffa113f","target":"record","created_at":"2026-07-05T09:41:08Z","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":"4194568deacb9ad51617bd4336e7b97ef5e836b827b41aec05441c5f2df4f701","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-26T21:16:58Z","title_canon_sha256":"ae02f68e24c2b6bcaadec79ae43e97079230ba3d6ffecf79d67cee339fb9cee8"},"schema_version":"1.0","source":{"id":"2411.17887","kind":"arxiv","version":1}},"canonical_sha256":"d7fbf4606b0aa0f3a0d5d592ca389cda2cff3a2a882c063a4396819fe4820672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7fbf4606b0aa0f3a0d5d592ca389cda2cff3a2a882c063a4396819fe4820672","first_computed_at":"2026-07-05T09:41:08.557275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:08.557275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cIfNMhTRPnK0rYB/wkjTli8hGYehFsrLtw7xcf9jveMe7Sv5MSq7UvCIBbalozm9Wdyni69rdJLlnRSHXIhBDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:08.557724Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48ec17c6dbbcf948d431671addb88544cb67f7c74e1027d6dc4e4b497ffa113f","sha256:36b529d900ade996f90ba93333d5ac9df518134afb8843760fe97db61c2ddd0a"],"state_sha256":"dcd25adadeda7f1aea6da911b9be1f6a2fa4713d18f887ac1102d05c45c8c1f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1M+Yl5TApQ4PwrNTWiupE6rP2x7Y8TFjvm6s5C2dOXAC0s30gtj5ZPyy9VvGLkSkB81pI0iLEzUOr+YXMxNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:15:28.448428Z","bundle_sha256":"1248d6059e725e72743647db6a77a040fc188bfd2979bc044e080eefe705f078"}}