{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SA6TZ7XEKUVBTELIU57R46JJZQ","short_pith_number":"pith:SA6TZ7XE","canonical_record":{"source":{"id":"1305.2744","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2013-05-13T11:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"df7d848ea7516b7b2d1940f56ba6e08dc29a459605d8eee58cf459ddb25b0981","abstract_canon_sha256":"28e04c7626c1e9f4866084c87d9a47cb14dd6e976f25733382f53fba6e843be8"},"schema_version":"1.0"},"canonical_sha256":"903d3cfee4552a199168a77f1e7929cc25ef9d098449de127edaf6ee1fc675c6","source":{"kind":"arxiv","id":"1305.2744","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2744","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2744v1","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2744","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"SA6TZ7XEKUVB","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SA6TZ7XEKUVBTELI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SA6TZ7XE","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SA6TZ7XEKUVBTELIU57R46JJZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2744","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2013-05-13T11:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"df7d848ea7516b7b2d1940f56ba6e08dc29a459605d8eee58cf459ddb25b0981","abstract_canon_sha256":"28e04c7626c1e9f4866084c87d9a47cb14dd6e976f25733382f53fba6e843be8"},"schema_version":"1.0"},"canonical_sha256":"903d3cfee4552a199168a77f1e7929cc25ef9d098449de127edaf6ee1fc675c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:47.479526Z","signature_b64":"yzb5Lv/LJJxJ9H1Ga/9GINCsebwS2FT46+QfrcwUbXpsP0KF6qzrFacKhbqEanv9deGcYWWDF/pAKyWDCXN/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"903d3cfee4552a199168a77f1e7929cc25ef9d098449de127edaf6ee1fc675c6","last_reissued_at":"2026-05-18T03:25:47.478939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:47.478939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2744","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-18T03:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUh+sf0LmH9GiSOtgmw1cmOsy9DVQPsLQpS8GwMFG14WztUQi1RuAtnI68bTbsLae0oOXFg1JmZbtNAqp1C8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:46:13.355640Z"},"content_sha256":"4187773d6437e2e26bee680772203274e6fb7e8689d3ce0720be146ee9e77103","schema_version":"1.0","event_id":"sha256:4187773d6437e2e26bee680772203274e6fb7e8689d3ce0720be146ee9e77103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SA6TZ7XEKUVBTELIU57R46JJZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time Estimation Model of Concurrent Computing Systems","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ahmet A. Husainov, E. S. Kudryashova","submitted_at":"2013-05-13T11:31:08Z","abstract_excerpt":"We consider an asynchronous system with transitions corresponding to the instructions of a computer system. For each instruction, a runtime is given. We propose a mathematical model, allowing us to construct an algorithm for finding the minimum time of the parallel process with a given trace. We consider a problem of constructing a parallel process which transforms the initial state to given and has the minimum execution time. We show that it is reduced to the problem of finding the shortest path in a directed graph with edge lengths equal to 1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2744","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-18T03:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCwNhVzK8WixM3+TETTAIuaBjQavX/BpIEKOy7V53kusaYR5p/mIT+dr8CyaYbNNIUXg7Ga7skCVEqYEfyzsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:46:13.356295Z"},"content_sha256":"1644b81a9177d2d3ec23d8613bb23a700b30f0b8f077e8cbdda98cb4660b9d4f","schema_version":"1.0","event_id":"sha256:1644b81a9177d2d3ec23d8613bb23a700b30f0b8f077e8cbdda98cb4660b9d4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/bundle.json","state_url":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/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-28T21:46:13Z","links":{"resolver":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ","bundle":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/bundle.json","state":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SA6TZ7XEKUVBTELIU57R46JJZQ","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":"28e04c7626c1e9f4866084c87d9a47cb14dd6e976f25733382f53fba6e843be8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2013-05-13T11:31:08Z","title_canon_sha256":"df7d848ea7516b7b2d1940f56ba6e08dc29a459605d8eee58cf459ddb25b0981"},"schema_version":"1.0","source":{"id":"1305.2744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2744","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2744v1","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2744","created_at":"2026-05-18T03:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"SA6TZ7XEKUVB","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SA6TZ7XEKUVBTELI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SA6TZ7XE","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:1644b81a9177d2d3ec23d8613bb23a700b30f0b8f077e8cbdda98cb4660b9d4f","target":"graph","created_at":"2026-05-18T03:25: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":"We consider an asynchronous system with transitions corresponding to the instructions of a computer system. For each instruction, a runtime is given. We propose a mathematical model, allowing us to construct an algorithm for finding the minimum time of the parallel process with a given trace. We consider a problem of constructing a parallel process which transforms the initial state to given and has the minimum execution time. We show that it is reduced to the problem of finding the shortest path in a directed graph with edge lengths equal to 1.","authors_text":"Ahmet A. Husainov, E. S. Kudryashova","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2013-05-13T11:31:08Z","title":"Time Estimation Model of Concurrent Computing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2744","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:4187773d6437e2e26bee680772203274e6fb7e8689d3ce0720be146ee9e77103","target":"record","created_at":"2026-05-18T03:25: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":"28e04c7626c1e9f4866084c87d9a47cb14dd6e976f25733382f53fba6e843be8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LO","submitted_at":"2013-05-13T11:31:08Z","title_canon_sha256":"df7d848ea7516b7b2d1940f56ba6e08dc29a459605d8eee58cf459ddb25b0981"},"schema_version":"1.0","source":{"id":"1305.2744","kind":"arxiv","version":1}},"canonical_sha256":"903d3cfee4552a199168a77f1e7929cc25ef9d098449de127edaf6ee1fc675c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"903d3cfee4552a199168a77f1e7929cc25ef9d098449de127edaf6ee1fc675c6","first_computed_at":"2026-05-18T03:25:47.478939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:47.478939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yzb5Lv/LJJxJ9H1Ga/9GINCsebwS2FT46+QfrcwUbXpsP0KF6qzrFacKhbqEanv9deGcYWWDF/pAKyWDCXN/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:47.479526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4187773d6437e2e26bee680772203274e6fb7e8689d3ce0720be146ee9e77103","sha256:1644b81a9177d2d3ec23d8613bb23a700b30f0b8f077e8cbdda98cb4660b9d4f"],"state_sha256":"7ff4cc04a4aa8193ce1e3f65eebac781d18affc2c37a09ee413271f0ffb0608c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ClzpwpaefhrTgpkQvnPl7n7PU/ABdNABP45jjNg7KHdey7RV6CBGxkDmugz5xBFZQ0cIym3bEXf6Y8+WkpuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:46:13.359038Z","bundle_sha256":"4c69e7ea30764a89c3a6d0d4e0905a37af2aef4f6e5ed64d0c2ece48a34e2b75"}}