{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SA6TZ7XEKUVBTELIU57R46JJZQ","short_pith_number":"pith:SA6TZ7XE","schema_version":"1.0","canonical_sha256":"903d3cfee4552a199168a77f1e7929cc25ef9d098449de127edaf6ee1fc675c6","source":{"kind":"arxiv","id":"1305.2744","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.2744","created_at":"2026-05-18T03:25:47.479027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2744v1","created_at":"2026-05-18T03:25:47.479027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2744","created_at":"2026-05-18T03:25:47.479027+00:00"},{"alias_kind":"pith_short_12","alias_value":"SA6TZ7XEKUVB","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SA6TZ7XEKUVBTELI","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SA6TZ7XE","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ","json":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ.json","graph_json":"https://pith.science/api/pith-number/SA6TZ7XEKUVBTELIU57R46JJZQ/graph.json","events_json":"https://pith.science/api/pith-number/SA6TZ7XEKUVBTELIU57R46JJZQ/events.json","paper":"https://pith.science/paper/SA6TZ7XE"},"agent_actions":{"view_html":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ","download_json":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ.json","view_paper":"https://pith.science/paper/SA6TZ7XE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2744&json=true","fetch_graph":"https://pith.science/api/pith-number/SA6TZ7XEKUVBTELIU57R46JJZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SA6TZ7XEKUVBTELIU57R46JJZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/action/storage_attestation","attest_author":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/action/author_attestation","sign_citation":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/action/citation_signature","submit_replication":"https://pith.science/pith/SA6TZ7XEKUVBTELIU57R46JJZQ/action/replication_record"}},"created_at":"2026-05-18T03:25:47.479027+00:00","updated_at":"2026-05-18T03:25:47.479027+00:00"}