{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B3JBA66TRPEX3LQYJKXIEMYYO7","short_pith_number":"pith:B3JBA66T","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"},"canonical_sha256":"0ed2107bd38bc97dae184aae82331877f54a5017696b898ec5b91bf8d86fc24b","source":{"kind":"arxiv","id":"1704.00885","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00885","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00885v3","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00885","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"B3JBA66TRPEX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B3JBA66TRPEX3LQY","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B3JBA66T","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B3JBA66TRPEX3LQYJKXIEMYYO7","target":"record","payload":{"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"},"canonical_sha256":"0ed2107bd38bc97dae184aae82331877f54a5017696b898ec5b91bf8d86fc24b","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"},"source_kind":"arxiv","source_id":"1704.00885","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrGc5BmsNUYA86jDYpV/cpFn6ZNmoVIZO09ypa0e0YWYkFBPJ6TttvLzFKn1rJjcmg6QFTjRkzxouNtwd87TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:36:37.692187Z"},"content_sha256":"47a8e0ed63d8e29ebec0eeb5d248814a11b05a371d8e46872b61ba47ab9c28e7","schema_version":"1.0","event_id":"sha256:47a8e0ed63d8e29ebec0eeb5d248814a11b05a371d8e46872b61ba47ab9c28e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B3JBA66TRPEX3LQYJKXIEMYYO7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7K/RuFDLwryYWxRvh+cTgDUlhHnugh/7lThtjG43/YsmFE0DFUgYoPN8crHLM+XY7estU4qJY4PPg5FEt6zAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:36:37.692787Z"},"content_sha256":"8e6aae5e4ecd67666fa9a059210d1217008acc78c18cfb62df0920dc8b9a932b","schema_version":"1.0","event_id":"sha256:8e6aae5e4ecd67666fa9a059210d1217008acc78c18cfb62df0920dc8b9a932b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/bundle.json","state_url":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T14:36:37Z","links":{"resolver":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7","bundle":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/bundle.json","state":"https://pith.science/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3JBA66TRPEX3LQYJKXIEMYYO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B3JBA66TRPEX3LQYJKXIEMYYO7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5fc2c0cdd9688daec86f8b2e8f8a3bd626854382ff19f72b4cf3bf39b29340cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-04T06:22:00Z","title_canon_sha256":"1f0c7dca7cef62a5c8b42fedf7c9ccc877bf96e0dc72efd457f0f63773047e70"},"schema_version":"1.0","source":{"id":"1704.00885","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00885","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00885v3","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00885","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"B3JBA66TRPEX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B3JBA66TRPEX3LQY","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B3JBA66T","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:8e6aae5e4ecd67666fa9a059210d1217008acc78c18cfb62df0920dc8b9a932b","target":"graph","created_at":"2026-05-18T00:07:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hewu Li, Jianping Wu, Qian Wu, Zengyin Yang, Zhize Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-04T06:22:00Z","title":"Modeling and Routing for Predictable Dynamic Networks: This paper is only for copyright protection, and unpublished to the top-level version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00885","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:47a8e0ed63d8e29ebec0eeb5d248814a11b05a371d8e46872b61ba47ab9c28e7","target":"record","created_at":"2026-05-18T00:07:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5fc2c0cdd9688daec86f8b2e8f8a3bd626854382ff19f72b4cf3bf39b29340cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-04T06:22:00Z","title_canon_sha256":"1f0c7dca7cef62a5c8b42fedf7c9ccc877bf96e0dc72efd457f0f63773047e70"},"schema_version":"1.0","source":{"id":"1704.00885","kind":"arxiv","version":3}},"canonical_sha256":"0ed2107bd38bc97dae184aae82331877f54a5017696b898ec5b91bf8d86fc24b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ed2107bd38bc97dae184aae82331877f54a5017696b898ec5b91bf8d86fc24b","first_computed_at":"2026-05-18T00:07:55.632872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:55.632872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fOlFOPnN66W9Akc4mFzY07nSlXlqAwoE2xZ4xcfBo9oseDyg+SKqoYJT5/KGZLOWObs+ws4Yh2mvUgq6725QDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:55.633542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00885","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47a8e0ed63d8e29ebec0eeb5d248814a11b05a371d8e46872b61ba47ab9c28e7","sha256:8e6aae5e4ecd67666fa9a059210d1217008acc78c18cfb62df0920dc8b9a932b"],"state_sha256":"e9bde669c06aa907f0437970c3e816aa8ca4740384a88d84e61de4ea3c9911da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qg0o7rdb5CNJXVs50wE+iFO2vzInswctnJD+CaKjjK7CJKSi8RStnomr8m5vLMT5KccUOYvPZowxn6orftnhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:36:37.696356Z","bundle_sha256":"78e51daddf08b8a0dbd7eed51701284422a8989d5d4302bdcd3a60f9e5b7fdeb"}}