{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B3JBA66TRPEX3LQYJKXIEMYYO7","short_pith_number":"pith:B3JBA66T","schema_version":"1.0","canonical_sha256":"0ed2107bd38bc97dae184aae82331877f54a5017696b898ec5b91bf8d86fc24b","source":{"kind":"arxiv","id":"1704.00885","version":3},"attestation_state":"computed","paper":{"title":"Modeling and Routing for Predictable Dynamic Networks: This paper is only for copyright protection, and unpublished to the top-level version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hewu Li, Jianping Wu, Qian Wu, Zengyin Yang, Zhize Li","submitted_at":"2017-04-04T06:22:00Z","abstract_excerpt":"The topologies of predictable dynamic networks are continuously dynamic in terms of node position, network connectivity and link metric. However, their dynamics are almost predictable compared with the ad-hoc network. The existing routing protocols specific to static or ad-hoc network do not consider this predictability and thus are not very efficient for some cases.\n  We present a topology model based on Divide-and-Merge methodology to formulate the dynamic topology into the series of static topologies, which can reflect the topology dynamics correctly with the least number of static topologi"},"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":"1704.00885","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-04T06:22:00Z","cross_cats_sorted":[],"title_canon_sha256":"1f0c7dca7cef62a5c8b42fedf7c9ccc877bf96e0dc72efd457f0f63773047e70","abstract_canon_sha256":"5fc2c0cdd9688daec86f8b2e8f8a3bd626854382ff19f72b4cf3bf39b29340cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:55.633542Z","signature_b64":"fOlFOPnN66W9Akc4mFzY07nSlXlqAwoE2xZ4xcfBo9oseDyg+SKqoYJT5/KGZLOWObs+ws4Yh2mvUgq6725QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ed2107bd38bc97dae184aae82331877f54a5017696b898ec5b91bf8d86fc24b","last_reissued_at":"2026-05-18T00:07:55.632872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:55.632872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling and Routing for Predictable Dynamic Networks: This paper is only for copyright protection, and unpublished to the top-level version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hewu Li, Jianping Wu, Qian Wu, Zengyin Yang, Zhize Li","submitted_at":"2017-04-04T06:22:00Z","abstract_excerpt":"The topologies of predictable dynamic networks are continuously dynamic in terms of node position, network connectivity and link metric. However, their dynamics are almost predictable compared with the ad-hoc network. The existing routing protocols specific to static or ad-hoc network do not consider this predictability and thus are not very efficient for some cases.\n  We present a topology model based on Divide-and-Merge methodology to formulate the dynamic topology into the series of static topologies, which can reflect the topology dynamics correctly with the least number of static topologi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00885","kind":"arxiv","version":3},"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":"1704.00885","created_at":"2026-05-18T00:07:55.632979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00885v3","created_at":"2026-05-18T00:07:55.632979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00885","created_at":"2026-05-18T00:07:55.632979+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3JBA66TRPEX","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3JBA66TRPEX3LQY","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3JBA66T","created_at":"2026-05-18T12:31:08.081275+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/B3JBA66TRPEX3LQYJKXIEMYYO7","json":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7.json","graph_json":"https://pith.science/api/pith-number/B3JBA66TRPEX3LQYJKXIEMYYO7/graph.json","events_json":"https://pith.science/api/pith-number/B3JBA66TRPEX3LQYJKXIEMYYO7/events.json","paper":"https://pith.science/paper/B3JBA66T"},"agent_actions":{"view_html":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7","download_json":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7.json","view_paper":"https://pith.science/paper/B3JBA66T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00885&json=true","fetch_graph":"https://pith.science/api/pith-number/B3JBA66TRPEX3LQYJKXIEMYYO7/graph.json","fetch_events":"https://pith.science/api/pith-number/B3JBA66TRPEX3LQYJKXIEMYYO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/action/storage_attestation","attest_author":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/action/author_attestation","sign_citation":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/action/citation_signature","submit_replication":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/action/replication_record"}},"created_at":"2026-05-18T00:07:55.632979+00:00","updated_at":"2026-05-18T00:07:55.632979+00:00"}