{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LIXBZ5YAQWYASZGFMOHTAADNK7","short_pith_number":"pith:LIXBZ5YA","canonical_record":{"source":{"id":"1812.03770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-12-10T12:52:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d3b451ddb5ef0cb160dfbe1cdd069fb1ca16f2e3e7accb611dc95c2f0d46b63e","abstract_canon_sha256":"7ed054d72e4817e084135fcd24281405ee67e42d888c7d980e6894848d3d3173"},"schema_version":"1.0"},"canonical_sha256":"5a2e1cf70085b00964c5638f30006d57f4ed082cc29accc0e0d34aa28b9630c5","source":{"kind":"arxiv","id":"1812.03770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03770","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03770v1","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03770","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"LIXBZ5YAQWYA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIXBZ5YAQWYASZGF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIXBZ5YA","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LIXBZ5YAQWYASZGFMOHTAADNK7","target":"record","payload":{"canonical_record":{"source":{"id":"1812.03770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-12-10T12:52:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d3b451ddb5ef0cb160dfbe1cdd069fb1ca16f2e3e7accb611dc95c2f0d46b63e","abstract_canon_sha256":"7ed054d72e4817e084135fcd24281405ee67e42d888c7d980e6894848d3d3173"},"schema_version":"1.0"},"canonical_sha256":"5a2e1cf70085b00964c5638f30006d57f4ed082cc29accc0e0d34aa28b9630c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:43.898558Z","signature_b64":"ANvaTT0V9lbnWhXRZVPabhrW751HzNbuafsHulMMsXrvbhDiFjTOCKC7f9AWQrnJ+0Z5O1p0p1Pw9khJZSdlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a2e1cf70085b00964c5638f30006d57f4ed082cc29accc0e0d34aa28b9630c5","last_reissued_at":"2026-05-17T23:58:43.897987Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:43.897987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.03770","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-17T23:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6StlTv11Uj3jIKuLU1fmMA0KIjMTowgnPocrYrhMBEPw438GPBwRaAdfTOPiT1HVlfMJnJBhCEc5SE0NwLlvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:31.240576Z"},"content_sha256":"bd55ac6656a5f91eb7714b4d01381e5afe42e42a2049a365ac6c541a7bdd1f1b","schema_version":"1.0","event_id":"sha256:bd55ac6656a5f91eb7714b4d01381e5afe42e42a2049a365ac6c541a7bdd1f1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LIXBZ5YAQWYASZGFMOHTAADNK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Functional Design of Computation Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.MS","authors_text":"Pierre Vandenhove","submitted_at":"2018-12-10T12:52:03Z","abstract_excerpt":"Representing the control flow of a computer program as a computation graph can bring many benefits in a broad variety of domains where performance is critical. This technique is a core component of most major numerical libraries (TensorFlow, PyTorch, Theano, MXNet,...) and is successfully used to speed up and optimise many computationally-intensive tasks. However, different design choices in each of these libraries lead to noticeable differences in efficiency and in the way an end user writes efficient code. In this report, we detail the implementation and features of the computation graph sup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03770","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-17T23:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNMCc0Sea85QxIB2D0I51bpWXZCifWDtg/DxKnP3wKtenkh/QbyokI4CgzFgB9EC4T85CTBDZ/VGwAw9/3eEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:31.240919Z"},"content_sha256":"ef7e4385426dad2338d5fbb4a357dd4acaefba7a799c35dcd2adf82c89e8c2c9","schema_version":"1.0","event_id":"sha256:ef7e4385426dad2338d5fbb4a357dd4acaefba7a799c35dcd2adf82c89e8c2c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIXBZ5YAQWYASZGFMOHTAADNK7/bundle.json","state_url":"https://pith.science/pith/LIXBZ5YAQWYASZGFMOHTAADNK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIXBZ5YAQWYASZGFMOHTAADNK7/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-09T00:23:31Z","links":{"resolver":"https://pith.science/pith/LIXBZ5YAQWYASZGFMOHTAADNK7","bundle":"https://pith.science/pith/LIXBZ5YAQWYASZGFMOHTAADNK7/bundle.json","state":"https://pith.science/pith/LIXBZ5YAQWYASZGFMOHTAADNK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIXBZ5YAQWYASZGFMOHTAADNK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LIXBZ5YAQWYASZGFMOHTAADNK7","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":"7ed054d72e4817e084135fcd24281405ee67e42d888c7d980e6894848d3d3173","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-12-10T12:52:03Z","title_canon_sha256":"d3b451ddb5ef0cb160dfbe1cdd069fb1ca16f2e3e7accb611dc95c2f0d46b63e"},"schema_version":"1.0","source":{"id":"1812.03770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03770","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03770v1","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03770","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"LIXBZ5YAQWYA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIXBZ5YAQWYASZGF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIXBZ5YA","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:ef7e4385426dad2338d5fbb4a357dd4acaefba7a799c35dcd2adf82c89e8c2c9","target":"graph","created_at":"2026-05-17T23:58:43Z","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":"Representing the control flow of a computer program as a computation graph can bring many benefits in a broad variety of domains where performance is critical. This technique is a core component of most major numerical libraries (TensorFlow, PyTorch, Theano, MXNet,...) and is successfully used to speed up and optimise many computationally-intensive tasks. However, different design choices in each of these libraries lead to noticeable differences in efficiency and in the way an end user writes efficient code. In this report, we detail the implementation and features of the computation graph sup","authors_text":"Pierre Vandenhove","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-12-10T12:52:03Z","title":"Functional Design of Computation Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03770","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:bd55ac6656a5f91eb7714b4d01381e5afe42e42a2049a365ac6c541a7bdd1f1b","target":"record","created_at":"2026-05-17T23:58:43Z","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":"7ed054d72e4817e084135fcd24281405ee67e42d888c7d980e6894848d3d3173","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-12-10T12:52:03Z","title_canon_sha256":"d3b451ddb5ef0cb160dfbe1cdd069fb1ca16f2e3e7accb611dc95c2f0d46b63e"},"schema_version":"1.0","source":{"id":"1812.03770","kind":"arxiv","version":1}},"canonical_sha256":"5a2e1cf70085b00964c5638f30006d57f4ed082cc29accc0e0d34aa28b9630c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a2e1cf70085b00964c5638f30006d57f4ed082cc29accc0e0d34aa28b9630c5","first_computed_at":"2026-05-17T23:58:43.897987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:43.897987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ANvaTT0V9lbnWhXRZVPabhrW751HzNbuafsHulMMsXrvbhDiFjTOCKC7f9AWQrnJ+0Z5O1p0p1Pw9khJZSdlDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:43.898558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.03770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd55ac6656a5f91eb7714b4d01381e5afe42e42a2049a365ac6c541a7bdd1f1b","sha256:ef7e4385426dad2338d5fbb4a357dd4acaefba7a799c35dcd2adf82c89e8c2c9"],"state_sha256":"5df2fa5129d9a4a5cce89771b2a2ccedbf181fc2d0d16172459c7887884f1ce4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pnSAoNsIRrzHQYgQMQ/vQEnmj71HGdvnRJ/XF1hbn05aXwJVZJkEbcWwl3FC5vframD6Ty3bm9hTgflU1rGNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:23:31.242749Z","bundle_sha256":"52ab2eb6ec26ba398974dade6949fb894457c741020fec9b9482f266356bd1f3"}}