{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5QUW22AZEXCCTYQKXOLTKWXTWK","short_pith_number":"pith:5QUW22AZ","canonical_record":{"source":{"id":"1807.11022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-29T08:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"fa765ef5102df70607a529120b0dcab991d24d624ac8687e3cefb9a92b736564","abstract_canon_sha256":"e2706f00e6c043b44e5b0f9235768f8a7f5cb3e84b637d2f205913fe4be63d9d"},"schema_version":"1.0"},"canonical_sha256":"ec296d681925c429e20abb97355af3b2b35dd4819f919547a0392c383f5cf9c1","source":{"kind":"arxiv","id":"1807.11022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11022","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11022v1","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11022","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"5QUW22AZEXCC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5QUW22AZEXCCTYQK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5QUW22AZ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5QUW22AZEXCCTYQKXOLTKWXTWK","target":"record","payload":{"canonical_record":{"source":{"id":"1807.11022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-29T08:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"fa765ef5102df70607a529120b0dcab991d24d624ac8687e3cefb9a92b736564","abstract_canon_sha256":"e2706f00e6c043b44e5b0f9235768f8a7f5cb3e84b637d2f205913fe4be63d9d"},"schema_version":"1.0"},"canonical_sha256":"ec296d681925c429e20abb97355af3b2b35dd4819f919547a0392c383f5cf9c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:33.157529Z","signature_b64":"sizgGofmw1SCKdGDZN9emRh++fzycCv7hcB4Vsmnzy9mzzjVPUONMf+yQB03ZM7NKoAO+76fveUZuvyfLFv3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec296d681925c429e20abb97355af3b2b35dd4819f919547a0392c383f5cf9c1","last_reissued_at":"2026-05-18T00:09:33.156928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:33.156928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.11022","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-18T00:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nDDOSkBKlTeJVk6bkUsenb1qh3dRQBvTUkzGor2lNB+Ckra2KenFpdMgKbGwkurgm9lMEbJyrmTJJycUQu7rBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:22:27.739728Z"},"content_sha256":"1ddc20977a1ee06ecdde7f78c9a7fabf60037aed8c772152560ce7cbd3655695","schema_version":"1.0","event_id":"sha256:1ddc20977a1ee06ecdde7f78c9a7fabf60037aed8c772152560ce7cbd3655695"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5QUW22AZEXCCTYQKXOLTKWXTWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimum Depth of the Bounded Pipeline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ahmet A. Husainov","submitted_at":"2018-07-29T08:13:23Z","abstract_excerpt":"The paper is devoted to studying the performance of a computational pipeline, the number of simultaneously executing stages of which at each time is bounded from above by a fixed number. A look at the restriction as a structural hazard makes it possible to construct an analytical model for calculating the processing time of a given input data amount. Using this model, led to a formula for calculating the optimal depth of a bounded pipeline for a given volume of input data. The formula shows that the optimal depth can get large changes for small changes in the amount of data. To eliminate this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11022","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-18T00:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xI5yb4I24JBe1VRBzoaqGwZKJMouwJDLsmeVQ53A0UmtspucpfgD9hq5gpk205IB9RzXBanXGJbHC/w+2gCGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:22:27.740429Z"},"content_sha256":"8bd50f669166698705227340af39d16bb7b361be9fcee4e029a551d4eb3c923b","schema_version":"1.0","event_id":"sha256:8bd50f669166698705227340af39d16bb7b361be9fcee4e029a551d4eb3c923b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QUW22AZEXCCTYQKXOLTKWXTWK/bundle.json","state_url":"https://pith.science/pith/5QUW22AZEXCCTYQKXOLTKWXTWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QUW22AZEXCCTYQKXOLTKWXTWK/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-10T13:22:27Z","links":{"resolver":"https://pith.science/pith/5QUW22AZEXCCTYQKXOLTKWXTWK","bundle":"https://pith.science/pith/5QUW22AZEXCCTYQKXOLTKWXTWK/bundle.json","state":"https://pith.science/pith/5QUW22AZEXCCTYQKXOLTKWXTWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QUW22AZEXCCTYQKXOLTKWXTWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5QUW22AZEXCCTYQKXOLTKWXTWK","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":"e2706f00e6c043b44e5b0f9235768f8a7f5cb3e84b637d2f205913fe4be63d9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-29T08:13:23Z","title_canon_sha256":"fa765ef5102df70607a529120b0dcab991d24d624ac8687e3cefb9a92b736564"},"schema_version":"1.0","source":{"id":"1807.11022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11022","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11022v1","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11022","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"5QUW22AZEXCC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5QUW22AZEXCCTYQK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5QUW22AZ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:8bd50f669166698705227340af39d16bb7b361be9fcee4e029a551d4eb3c923b","target":"graph","created_at":"2026-05-18T00:09:33Z","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":"The paper is devoted to studying the performance of a computational pipeline, the number of simultaneously executing stages of which at each time is bounded from above by a fixed number. A look at the restriction as a structural hazard makes it possible to construct an analytical model for calculating the processing time of a given input data amount. Using this model, led to a formula for calculating the optimal depth of a bounded pipeline for a given volume of input data. The formula shows that the optimal depth can get large changes for small changes in the amount of data. To eliminate this ","authors_text":"Ahmet A. Husainov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-29T08:13:23Z","title":"Optimum Depth of the Bounded Pipeline"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11022","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:1ddc20977a1ee06ecdde7f78c9a7fabf60037aed8c772152560ce7cbd3655695","target":"record","created_at":"2026-05-18T00:09:33Z","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":"e2706f00e6c043b44e5b0f9235768f8a7f5cb3e84b637d2f205913fe4be63d9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-29T08:13:23Z","title_canon_sha256":"fa765ef5102df70607a529120b0dcab991d24d624ac8687e3cefb9a92b736564"},"schema_version":"1.0","source":{"id":"1807.11022","kind":"arxiv","version":1}},"canonical_sha256":"ec296d681925c429e20abb97355af3b2b35dd4819f919547a0392c383f5cf9c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec296d681925c429e20abb97355af3b2b35dd4819f919547a0392c383f5cf9c1","first_computed_at":"2026-05-18T00:09:33.156928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:33.156928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sizgGofmw1SCKdGDZN9emRh++fzycCv7hcB4Vsmnzy9mzzjVPUONMf+yQB03ZM7NKoAO+76fveUZuvyfLFv3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:33.157529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ddc20977a1ee06ecdde7f78c9a7fabf60037aed8c772152560ce7cbd3655695","sha256:8bd50f669166698705227340af39d16bb7b361be9fcee4e029a551d4eb3c923b"],"state_sha256":"fb8f168b8eb60a0cdc265e6196dda659b7883561a1a92c0a40a339c73d3c91ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hyrXew+MFMPBRdvtr0x4SuKxq5C/hT+3r7sLntBD/y9k4S+b1RHhrZQ2Wa7wbwrnfuQMkAdb10uyy7pDiauCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:22:27.744900Z","bundle_sha256":"2b99926f3e37b7a8b32d9acde28689764efb8e5ce532364d5ebc4ff23ea11b35"}}