{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:L36NMTVI5ILZDQ6L2PU5HADSW5","short_pith_number":"pith:L36NMTVI","schema_version":"1.0","canonical_sha256":"5efcd64ea8ea1791c3cbd3e9d38072b776411b7a69006d9376a79eb5327ab6d7","source":{"kind":"arxiv","id":"2401.00429","version":1},"attestation_state":"computed","paper":{"title":"Deeper and Wider Networks for Performance Metrics Prediction in Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.NI","authors_text":"Aijia Liu, Shiqing Liu, Xiaobing Pei","submitted_at":"2023-12-31T08:59:59Z","abstract_excerpt":"In today's era, users have increasingly high expectations regarding the performance and efficiency of communication networks. Network operators aspire to achieve efficient network planning, operation, and optimization through Digital Twin Networks (DTN). The effectiveness of DTN heavily relies on the network model, with graph neural networks (GNN) playing a crucial role in network modeling. However, existing network modeling methods still lack a comprehensive understanding of communication networks. In this paper, we propose DWNet (Deeper and Wider Networks), a heterogeneous graph neural netwo"},"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":"2401.00429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-12-31T08:59:59Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"826cb0db3cb94b4af2b6131fe60cf25e26a104757fe9a554631743d7a85cc0a1","abstract_canon_sha256":"48a692d1d694c2efb77577505443454f44b56330fb23ed4f3ce0e0dbebd3a3e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:18.418874Z","signature_b64":"ytqBgmKTTjuyVkmYnIEeWi7fqfoRDUHj6jTrC8OYSmYceRnZ0Zifz61vjeWI1+fA2aZKMuP6/Hf3UBU02O/tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5efcd64ea8ea1791c3cbd3e9d38072b776411b7a69006d9376a79eb5327ab6d7","last_reissued_at":"2026-07-05T07:29:18.418356Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:18.418356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deeper and Wider Networks for Performance Metrics Prediction in Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.NI","authors_text":"Aijia Liu, Shiqing Liu, Xiaobing Pei","submitted_at":"2023-12-31T08:59:59Z","abstract_excerpt":"In today's era, users have increasingly high expectations regarding the performance and efficiency of communication networks. Network operators aspire to achieve efficient network planning, operation, and optimization through Digital Twin Networks (DTN). The effectiveness of DTN heavily relies on the network model, with graph neural networks (GNN) playing a crucial role in network modeling. However, existing network modeling methods still lack a comprehensive understanding of communication networks. In this paper, we propose DWNet (Deeper and Wider Networks), a heterogeneous graph neural netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00429","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.00429/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":"2401.00429","created_at":"2026-07-05T07:29:18.418426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.00429v1","created_at":"2026-07-05T07:29:18.418426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00429","created_at":"2026-07-05T07:29:18.418426+00:00"},{"alias_kind":"pith_short_12","alias_value":"L36NMTVI5ILZ","created_at":"2026-07-05T07:29:18.418426+00:00"},{"alias_kind":"pith_short_16","alias_value":"L36NMTVI5ILZDQ6L","created_at":"2026-07-05T07:29:18.418426+00:00"},{"alias_kind":"pith_short_8","alias_value":"L36NMTVI","created_at":"2026-07-05T07:29:18.418426+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00787","citing_title":"Mathematical Modeling for Network Upgrades in Internet Service Provider Infrastructure","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5","json":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5.json","graph_json":"https://pith.science/api/pith-number/L36NMTVI5ILZDQ6L2PU5HADSW5/graph.json","events_json":"https://pith.science/api/pith-number/L36NMTVI5ILZDQ6L2PU5HADSW5/events.json","paper":"https://pith.science/paper/L36NMTVI"},"agent_actions":{"view_html":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5","download_json":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5.json","view_paper":"https://pith.science/paper/L36NMTVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.00429&json=true","fetch_graph":"https://pith.science/api/pith-number/L36NMTVI5ILZDQ6L2PU5HADSW5/graph.json","fetch_events":"https://pith.science/api/pith-number/L36NMTVI5ILZDQ6L2PU5HADSW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5/action/storage_attestation","attest_author":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5/action/author_attestation","sign_citation":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5/action/citation_signature","submit_replication":"https://pith.science/pith/L36NMTVI5ILZDQ6L2PU5HADSW5/action/replication_record"}},"created_at":"2026-07-05T07:29:18.418426+00:00","updated_at":"2026-07-05T07:29:18.418426+00:00"}