{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XGXOJCE5LOZKS2IL3MYVYBQUOE","short_pith_number":"pith:XGXOJCE5","schema_version":"1.0","canonical_sha256":"b9aee4889d5bb2a9690bdb315c0614711380677cf816adf6c04306044a655470","source":{"kind":"arxiv","id":"1807.03337","version":2},"attestation_state":"computed","paper":{"title":"Optimum Transmission Delay for Function Computation in NFV-based Networks: the role of Network Coding and Redundant Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hossein Khalaj, Behrooz Tahmasebi, Mohammad Ali Maddah-Ali, Saeedeh Parsaeefard","submitted_at":"2018-07-09T18:51:07Z","abstract_excerpt":"In this paper, we study the problem of delay minimization in NFV-based networks. In such systems, the ultimate goal of any request is to compute a sequence of functions in the network, where each function can be computed at only a specific subset of network nodes. In conventional approaches, for each function, we choose one node from the corresponding subset of the nodes to compute that function. In contrast, in this work, we allow each function to be computed in more than one node, redundantly in parallel, to respond to a given request. We argue that such redundancy in computation not only im"},"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":"1807.03337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-09T18:51:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c4e71d1274ab0dfb2fd26b76184790ae09aa0c5946be5429ca61f119e8b9b4b","abstract_canon_sha256":"cac3ad9e35e9a9245893bb93e05be8bc42307044ba7e66a7597fb2e5f5ae143d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:01.342115Z","signature_b64":"gmtcFWB8t8QuAN0pUCtbB+yWmOaXnvCdT0/JjFfPk1G2HnSyWSqmVMe+dymn9MAvPOTqehzEN4s217hX50USCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9aee4889d5bb2a9690bdb315c0614711380677cf816adf6c04306044a655470","last_reissued_at":"2026-05-18T00:06:01.341653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:01.341653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimum Transmission Delay for Function Computation in NFV-based Networks: the role of Network Coding and Redundant Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hossein Khalaj, Behrooz Tahmasebi, Mohammad Ali Maddah-Ali, Saeedeh Parsaeefard","submitted_at":"2018-07-09T18:51:07Z","abstract_excerpt":"In this paper, we study the problem of delay minimization in NFV-based networks. In such systems, the ultimate goal of any request is to compute a sequence of functions in the network, where each function can be computed at only a specific subset of network nodes. In conventional approaches, for each function, we choose one node from the corresponding subset of the nodes to compute that function. In contrast, in this work, we allow each function to be computed in more than one node, redundantly in parallel, to respond to a given request. We argue that such redundancy in computation not only im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03337","kind":"arxiv","version":2},"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":"1807.03337","created_at":"2026-05-18T00:06:01.341722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03337v2","created_at":"2026-05-18T00:06:01.341722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03337","created_at":"2026-05-18T00:06:01.341722+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGXOJCE5LOZK","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGXOJCE5LOZKS2IL","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGXOJCE5","created_at":"2026-05-18T12:33:01.666342+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/XGXOJCE5LOZKS2IL3MYVYBQUOE","json":"https://pith.science/pith/XGXOJCE5LOZKS2IL3MYVYBQUOE.json","graph_json":"https://pith.science/api/pith-number/XGXOJCE5LOZKS2IL3MYVYBQUOE/graph.json","events_json":"https://pith.science/api/pith-number/XGXOJCE5LOZKS2IL3MYVYBQUOE/events.json","paper":"https://pith.science/paper/XGXOJCE5"},"agent_actions":{"view_html":"https://pith.science/pith/XGXOJCE5LOZKS2IL3MYVYBQUOE","download_json":"https://pith.science/pith/XGXOJCE5LOZKS2IL3MYVYBQUOE.json","view_paper":"https://pith.science/paper/XGXOJCE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03337&json=true","fetch_graph":"https://pith.science/api/pith-number/XGXOJCE5LOZKS2IL3MYVYBQUOE/graph.json","fetch_events":"https://pith.science/api/pith-number/XGXOJCE5LOZKS2IL3MYVYBQUOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGXOJCE5LOZKS2IL3MYVYBQUOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGXOJCE5LOZKS2IL3MYVYBQUOE/action/storage_attestation","attest_author":"https://pith.science/pith/XGXOJCE5LOZKS2IL3MYVYBQUOE/action/author_attestation","sign_citation":"https://pith.science/pith/XGXOJCE5LOZKS2IL3MYVYBQUOE/action/citation_signature","submit_replication":"https://pith.science/pith/XGXOJCE5LOZKS2IL3MYVYBQUOE/action/replication_record"}},"created_at":"2026-05-18T00:06:01.341722+00:00","updated_at":"2026-05-18T00:06:01.341722+00:00"}