{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U5LZ5EKYLSRAXWH5BWEFNPDTUM","short_pith_number":"pith:U5LZ5EKY","schema_version":"1.0","canonical_sha256":"a7579e91585ca20bd8fd0d8856bc73a32ccff230e640a19baebb88784f5dec3f","source":{"kind":"arxiv","id":"1409.7984","version":1},"attestation_state":"computed","paper":{"title":"Weighted Shortest Path Models: A Revisit to the Simulation of Internet Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jichang Zhao, Ke Xu, Mingming Chen, Xiao Liang","submitted_at":"2014-09-29T03:00:06Z","abstract_excerpt":"Understanding how packets are routed in Internet is significantly important to Internet measurement and modeling. The conventional solution for route simulation is based on the assumption of unweighted shortest path. However, it has been found and widely accepted that a packet in Internet is usually not transmitted along the unweighted shortest path between its source and destination. To better simulate the routing behavior of a packet, we thoroughly explore the real-world Internet routes and present a novel local information based simulation model, with a tuning parameter, which assigns weigh"},"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":"1409.7984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-09-29T03:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"3e1683d34b9deb9fbdc5d3f4e3fa36f96a2a50c10bc4d062d3e9cdc2a5f489b2","abstract_canon_sha256":"51e744e3bb220a78b7c63183b58733c79be875eb0883fffe31ffafec860ab204"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:33.903001Z","signature_b64":"Rmjq8mgtodHfCQU7/ncdt0/8lFV6vl16FkD5D21/jLI4BbkDcMjTyAgKQMrtPTek9Z6dQPdVdo6EefmpA93xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7579e91585ca20bd8fd0d8856bc73a32ccff230e640a19baebb88784f5dec3f","last_reissued_at":"2026-05-18T02:41:33.902516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:33.902516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Shortest Path Models: A Revisit to the Simulation of Internet Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jichang Zhao, Ke Xu, Mingming Chen, Xiao Liang","submitted_at":"2014-09-29T03:00:06Z","abstract_excerpt":"Understanding how packets are routed in Internet is significantly important to Internet measurement and modeling. The conventional solution for route simulation is based on the assumption of unweighted shortest path. However, it has been found and widely accepted that a packet in Internet is usually not transmitted along the unweighted shortest path between its source and destination. To better simulate the routing behavior of a packet, we thoroughly explore the real-world Internet routes and present a novel local information based simulation model, with a tuning parameter, which assigns weigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7984","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.7984","created_at":"2026-05-18T02:41:33.902591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7984v1","created_at":"2026-05-18T02:41:33.902591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7984","created_at":"2026-05-18T02:41:33.902591+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5LZ5EKYLSRA","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5LZ5EKYLSRAXWH5","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5LZ5EKY","created_at":"2026-05-18T12:28:52.271510+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/U5LZ5EKYLSRAXWH5BWEFNPDTUM","json":"https://pith.science/pith/U5LZ5EKYLSRAXWH5BWEFNPDTUM.json","graph_json":"https://pith.science/api/pith-number/U5LZ5EKYLSRAXWH5BWEFNPDTUM/graph.json","events_json":"https://pith.science/api/pith-number/U5LZ5EKYLSRAXWH5BWEFNPDTUM/events.json","paper":"https://pith.science/paper/U5LZ5EKY"},"agent_actions":{"view_html":"https://pith.science/pith/U5LZ5EKYLSRAXWH5BWEFNPDTUM","download_json":"https://pith.science/pith/U5LZ5EKYLSRAXWH5BWEFNPDTUM.json","view_paper":"https://pith.science/paper/U5LZ5EKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7984&json=true","fetch_graph":"https://pith.science/api/pith-number/U5LZ5EKYLSRAXWH5BWEFNPDTUM/graph.json","fetch_events":"https://pith.science/api/pith-number/U5LZ5EKYLSRAXWH5BWEFNPDTUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5LZ5EKYLSRAXWH5BWEFNPDTUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5LZ5EKYLSRAXWH5BWEFNPDTUM/action/storage_attestation","attest_author":"https://pith.science/pith/U5LZ5EKYLSRAXWH5BWEFNPDTUM/action/author_attestation","sign_citation":"https://pith.science/pith/U5LZ5EKYLSRAXWH5BWEFNPDTUM/action/citation_signature","submit_replication":"https://pith.science/pith/U5LZ5EKYLSRAXWH5BWEFNPDTUM/action/replication_record"}},"created_at":"2026-05-18T02:41:33.902591+00:00","updated_at":"2026-05-18T02:41:33.902591+00:00"}