{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2ZYI3FR6VGC3BX5VJXVDFPXHGA","short_pith_number":"pith:2ZYI3FR6","canonical_record":{"source":{"id":"1608.00099","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-07-30T10:40:29Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"d6c2002de5fa366de6decc0b0df03fa8307c3a2993b531e19107f36191f44bbf","abstract_canon_sha256":"b17b97895ac8f444efdece3435324c16cdb78b55dfd043c892cad399e193c184"},"schema_version":"1.0"},"canonical_sha256":"d6708d963ea985b0dfb54dea32bee730016e3b980629c498b8760f036b220486","source":{"kind":"arxiv","id":"1608.00099","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00099","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00099v2","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00099","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"2ZYI3FR6VGC3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ZYI3FR6VGC3BX5V","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ZYI3FR6","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2ZYI3FR6VGC3BX5VJXVDFPXHGA","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00099","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-07-30T10:40:29Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"d6c2002de5fa366de6decc0b0df03fa8307c3a2993b531e19107f36191f44bbf","abstract_canon_sha256":"b17b97895ac8f444efdece3435324c16cdb78b55dfd043c892cad399e193c184"},"schema_version":"1.0"},"canonical_sha256":"d6708d963ea985b0dfb54dea32bee730016e3b980629c498b8760f036b220486","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:26.948892Z","signature_b64":"eNR+qVGgk3m4JTP87+6y5o67OZF0okZHFjjt7ON7oVX8UjSXC2n7a87CH5nFH9Q6k3o7fELy2eQxjz99OSraBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6708d963ea985b0dfb54dea32bee730016e3b980629c498b8760f036b220486","last_reissued_at":"2026-05-18T00:47:26.948193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:26.948193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00099","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:47:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VWFAlNMzxihXAAJN4orVPksVM93WbtbmHWziziiJ8WI9iNQQRNblFIMQID1DEOtofw5Nd/O8zrXj0sZF3H3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:10:27.088935Z"},"content_sha256":"50cdddb95b1669fbc41170ade8d0279b3968a8b6bd613faaad413ee093c58c61","schema_version":"1.0","event_id":"sha256:50cdddb95b1669fbc41170ade8d0279b3968a8b6bd613faaad413ee093c58c61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2ZYI3FR6VGC3BX5VJXVDFPXHGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TRIOT: Faster tensor manipulation in C++11","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.MS","authors_text":"Florian Heyl, Oliver Serang","submitted_at":"2016-07-30T10:40:29Z","abstract_excerpt":"[abridged] Context: Multidimensional arrays are used by many different algorithms. As such, indexing and broadcasting complex operations over multidimensional arrays are ubiquitous tasks and can be performance limiting. Inquiry: Simultaneously indexing two or more multidimensional arrays with different shapes (e.g., copying data from one tensor to another larger, zero padded tensor in anticipation of a convolution) is difficult to do efficiently: Hard-coded nested for loops in C, Fortran, and Go cannot be applied when the dimension of a tensor is unknown at compile time. Likewise, boost::multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00099","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:47:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6YAaxhE73icXZjhdnX3S02fyR7gNWkqXn5TXt42wWhK3tLMArwNRNEz1QDJKtvpkUJMy06luxqUJGyMN9rdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:10:27.089287Z"},"content_sha256":"cce6705e2e5222c042c8369e62b2fe0cb776157b0d6e9034f1264ff56de257b7","schema_version":"1.0","event_id":"sha256:cce6705e2e5222c042c8369e62b2fe0cb776157b0d6e9034f1264ff56de257b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZYI3FR6VGC3BX5VJXVDFPXHGA/bundle.json","state_url":"https://pith.science/pith/2ZYI3FR6VGC3BX5VJXVDFPXHGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZYI3FR6VGC3BX5VJXVDFPXHGA/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-05-30T19:10:27Z","links":{"resolver":"https://pith.science/pith/2ZYI3FR6VGC3BX5VJXVDFPXHGA","bundle":"https://pith.science/pith/2ZYI3FR6VGC3BX5VJXVDFPXHGA/bundle.json","state":"https://pith.science/pith/2ZYI3FR6VGC3BX5VJXVDFPXHGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZYI3FR6VGC3BX5VJXVDFPXHGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2ZYI3FR6VGC3BX5VJXVDFPXHGA","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":"b17b97895ac8f444efdece3435324c16cdb78b55dfd043c892cad399e193c184","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-07-30T10:40:29Z","title_canon_sha256":"d6c2002de5fa366de6decc0b0df03fa8307c3a2993b531e19107f36191f44bbf"},"schema_version":"1.0","source":{"id":"1608.00099","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00099","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00099v2","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00099","created_at":"2026-05-18T00:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"2ZYI3FR6VGC3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ZYI3FR6VGC3BX5V","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ZYI3FR6","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:cce6705e2e5222c042c8369e62b2fe0cb776157b0d6e9034f1264ff56de257b7","target":"graph","created_at":"2026-05-18T00:47:26Z","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":"[abridged] Context: Multidimensional arrays are used by many different algorithms. As such, indexing and broadcasting complex operations over multidimensional arrays are ubiquitous tasks and can be performance limiting. Inquiry: Simultaneously indexing two or more multidimensional arrays with different shapes (e.g., copying data from one tensor to another larger, zero padded tensor in anticipation of a convolution) is difficult to do efficiently: Hard-coded nested for loops in C, Fortran, and Go cannot be applied when the dimension of a tensor is unknown at compile time. Likewise, boost::multi","authors_text":"Florian Heyl, Oliver Serang","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-07-30T10:40:29Z","title":"TRIOT: Faster tensor manipulation in C++11"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00099","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:50cdddb95b1669fbc41170ade8d0279b3968a8b6bd613faaad413ee093c58c61","target":"record","created_at":"2026-05-18T00:47:26Z","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":"b17b97895ac8f444efdece3435324c16cdb78b55dfd043c892cad399e193c184","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-07-30T10:40:29Z","title_canon_sha256":"d6c2002de5fa366de6decc0b0df03fa8307c3a2993b531e19107f36191f44bbf"},"schema_version":"1.0","source":{"id":"1608.00099","kind":"arxiv","version":2}},"canonical_sha256":"d6708d963ea985b0dfb54dea32bee730016e3b980629c498b8760f036b220486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6708d963ea985b0dfb54dea32bee730016e3b980629c498b8760f036b220486","first_computed_at":"2026-05-18T00:47:26.948193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:26.948193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eNR+qVGgk3m4JTP87+6y5o67OZF0okZHFjjt7ON7oVX8UjSXC2n7a87CH5nFH9Q6k3o7fELy2eQxjz99OSraBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:26.948892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00099","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50cdddb95b1669fbc41170ade8d0279b3968a8b6bd613faaad413ee093c58c61","sha256:cce6705e2e5222c042c8369e62b2fe0cb776157b0d6e9034f1264ff56de257b7"],"state_sha256":"9b876d71160fb85b1dd007551465066177ed73963d1bd7d442e51a60f1a74799"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyV9DKCeczSApsdZfHdusy0Kja0FgGT+dnbPe5+ETZJiesnkoVT6QDgt8/d9CnRPpzvZyrfP/t7/vQiPdHuXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:10:27.091548Z","bundle_sha256":"cf00f053da9db48fd586aa9feec47d66d99dc9062fea7d7608fdb04e2d1cb573"}}