{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LDHSQPC46PN7HUBPFF7LVNJI5R","short_pith_number":"pith:LDHSQPC4","canonical_record":{"source":{"id":"1904.05522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-11T04:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"09e159ef31ce93501bdd1277336b96aa4622fad26e112d82d910c70b2f5583b7","abstract_canon_sha256":"4762357e1a2e4496ae1a90982d5d4a4f266181b74009cf86f1bc958e6339a188"},"schema_version":"1.0"},"canonical_sha256":"58cf283c5cf3dbf3d02f297ebab528ec6537fbfc7f20ee6d8f794db036a525fe","source":{"kind":"arxiv","id":"1904.05522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05522","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05522v1","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05522","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"LDHSQPC46PN7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LDHSQPC46PN7HUBP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LDHSQPC4","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LDHSQPC46PN7HUBPFF7LVNJI5R","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-11T04:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"09e159ef31ce93501bdd1277336b96aa4622fad26e112d82d910c70b2f5583b7","abstract_canon_sha256":"4762357e1a2e4496ae1a90982d5d4a4f266181b74009cf86f1bc958e6339a188"},"schema_version":"1.0"},"canonical_sha256":"58cf283c5cf3dbf3d02f297ebab528ec6537fbfc7f20ee6d8f794db036a525fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:49.279687Z","signature_b64":"zOR7ICky0hzOW9WITS+cE+CoHWvAIFA1iU3P0P2SYHSKOPhwZJA1JxP/ErPBfu6Dvq/LbGxuSa4omWiilTXEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58cf283c5cf3dbf3d02f297ebab528ec6537fbfc7f20ee6d8f794db036a525fe","last_reissued_at":"2026-05-17T23:48:49.279152Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:49.279152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05522","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:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1NnXfg8ILCyK32orNSUUINuoG5T9WLVKaALULR/yV2rCOb7pXocpGHaLkGcky6PMSXw6rWaChdUBCTMZPSpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:18:13.376005Z"},"content_sha256":"01ae5abe132fc7753b32d27cead626c550dee0ef3f9ca666e96e3c178a26748a","schema_version":"1.0","event_id":"sha256:01ae5abe132fc7753b32d27cead626c550dee0ef3f9ca666e96e3c178a26748a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LDHSQPC46PN7HUBPFF7LVNJI5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Timely-Throughput Optimal Coded Computing over Cloud Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"A. Salman Avestimehr, Chien-Sheng Yang, Ramtin Pedarsani","submitted_at":"2019-04-11T04:16:00Z","abstract_excerpt":"In modern distributed computing systems, unpredictable and unreliable infrastructures result in high variability of computing resources. Meanwhile, there is significantly increasing demand for timely and event-driven services with deadline constraints. Motivated by measurements over Amazon EC2 clusters, we consider a two-state Markov model for variability of computing speed in cloud networks. In this model, each worker can be either in a good state or a bad state in terms of the computation speed, and the transition between these states is modeled as a Markov chain which is unknown to the sche"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05522","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:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUXpDcGdAXDeiP8vlDj4bralMc6GiIEoIWM09t8CXYjSC9nPk4aQWhZRbyCpoPQOrzraDer/3H0d9SBNP8yEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:18:13.376365Z"},"content_sha256":"e037fbc1b776f73426eca621277768e047a16f1e28be58a0c45bc257bfbd107e","schema_version":"1.0","event_id":"sha256:e037fbc1b776f73426eca621277768e047a16f1e28be58a0c45bc257bfbd107e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDHSQPC46PN7HUBPFF7LVNJI5R/bundle.json","state_url":"https://pith.science/pith/LDHSQPC46PN7HUBPFF7LVNJI5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDHSQPC46PN7HUBPFF7LVNJI5R/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-21T13:18:13Z","links":{"resolver":"https://pith.science/pith/LDHSQPC46PN7HUBPFF7LVNJI5R","bundle":"https://pith.science/pith/LDHSQPC46PN7HUBPFF7LVNJI5R/bundle.json","state":"https://pith.science/pith/LDHSQPC46PN7HUBPFF7LVNJI5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDHSQPC46PN7HUBPFF7LVNJI5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LDHSQPC46PN7HUBPFF7LVNJI5R","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":"4762357e1a2e4496ae1a90982d5d4a4f266181b74009cf86f1bc958e6339a188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-11T04:16:00Z","title_canon_sha256":"09e159ef31ce93501bdd1277336b96aa4622fad26e112d82d910c70b2f5583b7"},"schema_version":"1.0","source":{"id":"1904.05522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05522","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05522v1","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05522","created_at":"2026-05-17T23:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"LDHSQPC46PN7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LDHSQPC46PN7HUBP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LDHSQPC4","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:e037fbc1b776f73426eca621277768e047a16f1e28be58a0c45bc257bfbd107e","target":"graph","created_at":"2026-05-17T23:48:49Z","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":"In modern distributed computing systems, unpredictable and unreliable infrastructures result in high variability of computing resources. Meanwhile, there is significantly increasing demand for timely and event-driven services with deadline constraints. Motivated by measurements over Amazon EC2 clusters, we consider a two-state Markov model for variability of computing speed in cloud networks. In this model, each worker can be either in a good state or a bad state in terms of the computation speed, and the transition between these states is modeled as a Markov chain which is unknown to the sche","authors_text":"A. Salman Avestimehr, Chien-Sheng Yang, Ramtin Pedarsani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-11T04:16:00Z","title":"Timely-Throughput Optimal Coded Computing over Cloud Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05522","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:01ae5abe132fc7753b32d27cead626c550dee0ef3f9ca666e96e3c178a26748a","target":"record","created_at":"2026-05-17T23:48:49Z","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":"4762357e1a2e4496ae1a90982d5d4a4f266181b74009cf86f1bc958e6339a188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-11T04:16:00Z","title_canon_sha256":"09e159ef31ce93501bdd1277336b96aa4622fad26e112d82d910c70b2f5583b7"},"schema_version":"1.0","source":{"id":"1904.05522","kind":"arxiv","version":1}},"canonical_sha256":"58cf283c5cf3dbf3d02f297ebab528ec6537fbfc7f20ee6d8f794db036a525fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58cf283c5cf3dbf3d02f297ebab528ec6537fbfc7f20ee6d8f794db036a525fe","first_computed_at":"2026-05-17T23:48:49.279152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:49.279152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zOR7ICky0hzOW9WITS+cE+CoHWvAIFA1iU3P0P2SYHSKOPhwZJA1JxP/ErPBfu6Dvq/LbGxuSa4omWiilTXEAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:49.279687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01ae5abe132fc7753b32d27cead626c550dee0ef3f9ca666e96e3c178a26748a","sha256:e037fbc1b776f73426eca621277768e047a16f1e28be58a0c45bc257bfbd107e"],"state_sha256":"03a5b74ad9e08e1d776b2a8f15fc6228a1a16229b18f43d8fc94ce836f86951e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8sVjnguy+b/K2UF5kQmMExyHEgVz8lp0E+g57Y45ebU+5IC1cH6cLCFPiV3N5nc+7113E0O8phDdGU6PgvgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:18:13.378654Z","bundle_sha256":"9790136720a6acbca8397388965dd44865818ad643e6ef675b5f58752fc9c0c5"}}