{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IINHD77DZBREBVBUVV2B7R5QB3","short_pith_number":"pith:IINHD77D","canonical_record":{"source":{"id":"1702.07297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-23T17:06:39Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"6f87bbd4835776ae5eddbde8792743712cbbb6d09bffeb8047a2d0f37b52d34f","abstract_canon_sha256":"a30c79c5384142eb78fe57cfe9db6d2b8e5c54e083077b19fdf55267f8f1ce0c"},"schema_version":"1.0"},"canonical_sha256":"421a71ffe3c86240d434ad741fc7b00edead3273010ea3440f40fb4a40fae378","source":{"kind":"arxiv","id":"1702.07297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07297","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07297v1","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07297","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"IINHD77DZBRE","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IINHD77DZBREBVBU","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IINHD77D","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IINHD77DZBREBVBUVV2B7R5QB3","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-23T17:06:39Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"6f87bbd4835776ae5eddbde8792743712cbbb6d09bffeb8047a2d0f37b52d34f","abstract_canon_sha256":"a30c79c5384142eb78fe57cfe9db6d2b8e5c54e083077b19fdf55267f8f1ce0c"},"schema_version":"1.0"},"canonical_sha256":"421a71ffe3c86240d434ad741fc7b00edead3273010ea3440f40fb4a40fae378","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:07.570605Z","signature_b64":"lROLmo5zufRY4TooLFQq1LLlj+O9uCJYFmukPKtVECvrfoAgN49W50A6oxXd+QE0lCK3MhOtZ/ix8jIpb1YFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"421a71ffe3c86240d434ad741fc7b00edead3273010ea3440f40fb4a40fae378","last_reissued_at":"2026-05-18T00:50:07.569886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:07.569886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07297","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:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQaSGy6IeeNiDKt1vb36w5pl8HYJ8ZJWxtjLtLl1LLsU59q5igA0MOH3B8bQRqbOfHdlenhhRzBhbYTNEyTXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:25:59.802950Z"},"content_sha256":"2703a67aaff040dc82edb3614904a78b8363890dc1cd145c6b4c0feec42946f1","schema_version":"1.0","event_id":"sha256:2703a67aaff040dc82edb3614904a78b8363890dc1cd145c6b4c0feec42946f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IINHD77DZBREBVBUVV2B7R5QB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Optimally Allocate Resources for Coded Distributed Computing?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu, Songze Li","submitted_at":"2017-02-23T17:06:39Z","abstract_excerpt":"Today's data centers have an abundance of computing resources, hosting server clusters consisting of as many as tens or hundreds of thousands of machines. To execute a complex computing task over a data center, it is natural to distribute computations across many nodes to take advantage of parallel processing. However, as we allocate more and more computing resources to a computation task and further distribute the computations, large amounts of (partially) computed data must be moved between consecutive stages of computation tasks among the nodes, hence the communication load can become the b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07297","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:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTUQxWKgzaBKxEqSFtdPB6A12iJNe6y3L15bXFtoGenfaw/fMuHF3NwF6iKOzrVOMcuH04+/emEQvjuNgQjtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:25:59.803657Z"},"content_sha256":"d446b8a2c2d44178e81b1ee67833feb96ac9ba2af9527441f00f2ba88c429deb","schema_version":"1.0","event_id":"sha256:d446b8a2c2d44178e81b1ee67833feb96ac9ba2af9527441f00f2ba88c429deb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IINHD77DZBREBVBUVV2B7R5QB3/bundle.json","state_url":"https://pith.science/pith/IINHD77DZBREBVBUVV2B7R5QB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IINHD77DZBREBVBUVV2B7R5QB3/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-25T18:25:59Z","links":{"resolver":"https://pith.science/pith/IINHD77DZBREBVBUVV2B7R5QB3","bundle":"https://pith.science/pith/IINHD77DZBREBVBUVV2B7R5QB3/bundle.json","state":"https://pith.science/pith/IINHD77DZBREBVBUVV2B7R5QB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IINHD77DZBREBVBUVV2B7R5QB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IINHD77DZBREBVBUVV2B7R5QB3","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":"a30c79c5384142eb78fe57cfe9db6d2b8e5c54e083077b19fdf55267f8f1ce0c","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-23T17:06:39Z","title_canon_sha256":"6f87bbd4835776ae5eddbde8792743712cbbb6d09bffeb8047a2d0f37b52d34f"},"schema_version":"1.0","source":{"id":"1702.07297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07297","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07297v1","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07297","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"IINHD77DZBRE","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IINHD77DZBREBVBU","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IINHD77D","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:d446b8a2c2d44178e81b1ee67833feb96ac9ba2af9527441f00f2ba88c429deb","target":"graph","created_at":"2026-05-18T00:50:07Z","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":"Today's data centers have an abundance of computing resources, hosting server clusters consisting of as many as tens or hundreds of thousands of machines. To execute a complex computing task over a data center, it is natural to distribute computations across many nodes to take advantage of parallel processing. However, as we allocate more and more computing resources to a computation task and further distribute the computations, large amounts of (partially) computed data must be moved between consecutive stages of computation tasks among the nodes, hence the communication load can become the b","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu, Songze Li","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-23T17:06:39Z","title":"How to Optimally Allocate Resources for Coded Distributed Computing?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07297","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:2703a67aaff040dc82edb3614904a78b8363890dc1cd145c6b4c0feec42946f1","target":"record","created_at":"2026-05-18T00:50:07Z","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":"a30c79c5384142eb78fe57cfe9db6d2b8e5c54e083077b19fdf55267f8f1ce0c","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-23T17:06:39Z","title_canon_sha256":"6f87bbd4835776ae5eddbde8792743712cbbb6d09bffeb8047a2d0f37b52d34f"},"schema_version":"1.0","source":{"id":"1702.07297","kind":"arxiv","version":1}},"canonical_sha256":"421a71ffe3c86240d434ad741fc7b00edead3273010ea3440f40fb4a40fae378","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"421a71ffe3c86240d434ad741fc7b00edead3273010ea3440f40fb4a40fae378","first_computed_at":"2026-05-18T00:50:07.569886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:07.569886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lROLmo5zufRY4TooLFQq1LLlj+O9uCJYFmukPKtVECvrfoAgN49W50A6oxXd+QE0lCK3MhOtZ/ix8jIpb1YFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:07.570605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2703a67aaff040dc82edb3614904a78b8363890dc1cd145c6b4c0feec42946f1","sha256:d446b8a2c2d44178e81b1ee67833feb96ac9ba2af9527441f00f2ba88c429deb"],"state_sha256":"fb754e2b37c38cfde84d4d43999336063ca4f64276c821e65a2155473055b0f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j25DnNeUysTI7SRLH67sZ+Dv/o0FWYG0MANn2IpcLP44ua4JczeAsqGtqeDuYSDxAE1w2CkiEUtvWKbhsobwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:25:59.807372Z","bundle_sha256":"5b1a900395d79bc50b906c2acb40375acb160bd6eb9391a472de450325c2e4f5"}}