{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PIL6UGWHIMVKYFFQZB4QVEPCP7","short_pith_number":"pith:PIL6UGWH","schema_version":"1.0","canonical_sha256":"7a17ea1ac7432aac14b0c8790a91e27febe0f3049123a3a72766e7502b4f6ca5","source":{"kind":"arxiv","id":"2306.06022","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Partial Computation Offloading for the Metaverse in In-Network Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.DC","authors_text":"Ibrahim Aliyu, Jinsul Kim, Namseok Ko, Seungmin Oh, Tai-Won Um","submitted_at":"2023-06-09T16:41:34Z","abstract_excerpt":"The computing in the network (COIN) paradigm is a promising solution that leverages unused network resources to perform tasks to meet computation-demanding applications, such as the metaverse. In this vein, we consider the partial computation offloading problem in the metaverse for multiple subtasks in a COIN environment to minimize energy consumption and delay while dynamically adjusting the offloading policy based on the changing computational resource status. The problem is NP-hard, and we transform it into two subproblems: the task-splitting problem (TSP) on the user side and the task-offl"},"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":"2306.06022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-06-09T16:41:34Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"67fd0b2028a644e516d08293b227163bac2efeb020daac2e54ebdcb77d13bc38","abstract_canon_sha256":"50e2c76c791b720a5b2132e128bda1c96c9a0eda05094a66f29438765581f5c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:29.355651Z","signature_b64":"FYiZPZsuz0PkVbtHRmEu2wQr/fs/1PPx7qRT3rtopJMm9a7VySLTVsGxC7MQUDdLB1JlU2+W8pnOxx2efKQnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a17ea1ac7432aac14b0c8790a91e27febe0f3049123a3a72766e7502b4f6ca5","last_reissued_at":"2026-07-05T07:51:29.355143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:29.355143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Partial Computation Offloading for the Metaverse in In-Network Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.DC","authors_text":"Ibrahim Aliyu, Jinsul Kim, Namseok Ko, Seungmin Oh, Tai-Won Um","submitted_at":"2023-06-09T16:41:34Z","abstract_excerpt":"The computing in the network (COIN) paradigm is a promising solution that leverages unused network resources to perform tasks to meet computation-demanding applications, such as the metaverse. In this vein, we consider the partial computation offloading problem in the metaverse for multiple subtasks in a COIN environment to minimize energy consumption and delay while dynamically adjusting the offloading policy based on the changing computational resource status. The problem is NP-hard, and we transform it into two subproblems: the task-splitting problem (TSP) on the user side and the task-offl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06022","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.06022/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.06022","created_at":"2026-07-05T07:51:29.355201+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.06022v2","created_at":"2026-07-05T07:51:29.355201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06022","created_at":"2026-07-05T07:51:29.355201+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIL6UGWHIMVK","created_at":"2026-07-05T07:51:29.355201+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIL6UGWHIMVKYFFQ","created_at":"2026-07-05T07:51:29.355201+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIL6UGWH","created_at":"2026-07-05T07:51:29.355201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09923","citing_title":"Conformal Prediction for Neural Operators: Distribution-Free Uncertainty Quantification in Physics Simulation","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7","json":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7.json","graph_json":"https://pith.science/api/pith-number/PIL6UGWHIMVKYFFQZB4QVEPCP7/graph.json","events_json":"https://pith.science/api/pith-number/PIL6UGWHIMVKYFFQZB4QVEPCP7/events.json","paper":"https://pith.science/paper/PIL6UGWH"},"agent_actions":{"view_html":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7","download_json":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7.json","view_paper":"https://pith.science/paper/PIL6UGWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.06022&json=true","fetch_graph":"https://pith.science/api/pith-number/PIL6UGWHIMVKYFFQZB4QVEPCP7/graph.json","fetch_events":"https://pith.science/api/pith-number/PIL6UGWHIMVKYFFQZB4QVEPCP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7/action/storage_attestation","attest_author":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7/action/author_attestation","sign_citation":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7/action/citation_signature","submit_replication":"https://pith.science/pith/PIL6UGWHIMVKYFFQZB4QVEPCP7/action/replication_record"}},"created_at":"2026-07-05T07:51:29.355201+00:00","updated_at":"2026-07-05T07:51:29.355201+00:00"}