{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RA3VGELDPMJGYXIVG7JQREDIID","short_pith_number":"pith:RA3VGELD","schema_version":"1.0","canonical_sha256":"88375311637b126c5d1537d308906840e38d77c4dd74e54a0d9ea41e39938f7f","source":{"kind":"arxiv","id":"2410.18002","version":2},"attestation_state":"computed","paper":{"title":"Digital Network Twins for Next-generation Wireless: Creation, Optimization, and Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hanzhi Yu, Mingzhe Chen, Yuchen Liu, Zhiyuan Peng, Zifan Zhang","submitted_at":"2024-10-23T16:25:22Z","abstract_excerpt":"Digital network twins (DNTs), by representing a physical network using a virtual model, offer significant benefits such as streamlined network development, enhanced productivity, and cost reduction for next-generation (nextG) communication infrastructure. Existing works mainly describe the deployment of DNT technologies in various service sections.The full life cycle of DNTs for telecommunication has not yet been comprehensively studied, particularly in the aspects of fine-grained creation, real-time adaptation, resource-efficient deployment, and security protection. This article presents an i"},"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":"2410.18002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2024-10-23T16:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"e57b22744b65514e9c6580735ba0bfb0c93bdeb2c2dd95c4b014adceb1a1b522","abstract_canon_sha256":"5a91c95f82791c24f5db30059d66b9d7bdfbc52b0e0874b137992b34602d0472"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:43.817835Z","signature_b64":"k4UJBNb9dItof10GI6kv717OGThyGc2VtLhiqWZYwcvKbcHpZml+QjFMdxAgR7eViBH8CoQJWP80X3TBGDiCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88375311637b126c5d1537d308906840e38d77c4dd74e54a0d9ea41e39938f7f","last_reissued_at":"2026-07-05T12:03:43.817340Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:43.817340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Digital Network Twins for Next-generation Wireless: Creation, Optimization, and Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hanzhi Yu, Mingzhe Chen, Yuchen Liu, Zhiyuan Peng, Zifan Zhang","submitted_at":"2024-10-23T16:25:22Z","abstract_excerpt":"Digital network twins (DNTs), by representing a physical network using a virtual model, offer significant benefits such as streamlined network development, enhanced productivity, and cost reduction for next-generation (nextG) communication infrastructure. Existing works mainly describe the deployment of DNT technologies in various service sections.The full life cycle of DNTs for telecommunication has not yet been comprehensively studied, particularly in the aspects of fine-grained creation, real-time adaptation, resource-efficient deployment, and security protection. This article presents an i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18002","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/2410.18002/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":"2410.18002","created_at":"2026-07-05T12:03:43.817407+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.18002v2","created_at":"2026-07-05T12:03:43.817407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18002","created_at":"2026-07-05T12:03:43.817407+00:00"},{"alias_kind":"pith_short_12","alias_value":"RA3VGELDPMJG","created_at":"2026-07-05T12:03:43.817407+00:00"},{"alias_kind":"pith_short_16","alias_value":"RA3VGELDPMJGYXIV","created_at":"2026-07-05T12:03:43.817407+00:00"},{"alias_kind":"pith_short_8","alias_value":"RA3VGELD","created_at":"2026-07-05T12:03:43.817407+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29014","citing_title":"Customized Generative AI Agent for Transportation Engineering Practice: A Development and Continued Pre-training Guideline","ref_index":112,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24662","citing_title":"OpenTwin: Digital Twin Driven Closed Loop KPM Inference and Control for Open RAN","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID","json":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID.json","graph_json":"https://pith.science/api/pith-number/RA3VGELDPMJGYXIVG7JQREDIID/graph.json","events_json":"https://pith.science/api/pith-number/RA3VGELDPMJGYXIVG7JQREDIID/events.json","paper":"https://pith.science/paper/RA3VGELD"},"agent_actions":{"view_html":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID","download_json":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID.json","view_paper":"https://pith.science/paper/RA3VGELD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.18002&json=true","fetch_graph":"https://pith.science/api/pith-number/RA3VGELDPMJGYXIVG7JQREDIID/graph.json","fetch_events":"https://pith.science/api/pith-number/RA3VGELDPMJGYXIVG7JQREDIID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID/action/storage_attestation","attest_author":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID/action/author_attestation","sign_citation":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID/action/citation_signature","submit_replication":"https://pith.science/pith/RA3VGELDPMJGYXIVG7JQREDIID/action/replication_record"}},"created_at":"2026-07-05T12:03:43.817407+00:00","updated_at":"2026-07-05T12:03:43.817407+00:00"}