{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EKKS3G4DJDEGYUVSU3X7B5CTRX","short_pith_number":"pith:EKKS3G4D","canonical_record":{"source":{"id":"1701.04581","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2017-01-17T09:11:14Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5a0608d4a0d50f2bb4914696ac1424d7bafb2115ae662642635c794c07c80e6f","abstract_canon_sha256":"5eeb9729d64d1d94e62db924a7fe9aeb433067cb0daf491d791cea8a5c9d13af"},"schema_version":"1.0"},"canonical_sha256":"22952d9b8348c86c52b2a6eff0f4538dc7300cc4703d9bc96aacf42d6d5de86e","source":{"kind":"arxiv","id":"1701.04581","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04581","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04581v1","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04581","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"EKKS3G4DJDEG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKKS3G4DJDEGYUVS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKKS3G4D","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EKKS3G4DJDEGYUVSU3X7B5CTRX","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04581","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2017-01-17T09:11:14Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5a0608d4a0d50f2bb4914696ac1424d7bafb2115ae662642635c794c07c80e6f","abstract_canon_sha256":"5eeb9729d64d1d94e62db924a7fe9aeb433067cb0daf491d791cea8a5c9d13af"},"schema_version":"1.0"},"canonical_sha256":"22952d9b8348c86c52b2a6eff0f4538dc7300cc4703d9bc96aacf42d6d5de86e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:37.253993Z","signature_b64":"AAIfaZHgGsxndcOBq7hIYeXMktDC3foH2ZAg9dWxp0alHVKKtYvfhExIcIj7xnC8gwoni4rgX0qQf3pEZYqyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22952d9b8348c86c52b2a6eff0f4538dc7300cc4703d9bc96aacf42d6d5de86e","last_reissued_at":"2026-05-18T00:00:37.253467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:37.253467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04581","source_version":1,"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:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MQYlLQoOpZq+pyxPFmP6LU7lsBrKPRe8250kjSPkS7iQbVwBJgphaXbC8tQRVnwXJkbuLHbZL/LeP7jcDX4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T01:25:26.869597Z"},"content_sha256":"0ad19c84066c6a51ea7460d1bb5ca197f99577ebcf38ac560ee1079c436e9c40","schema_version":"1.0","event_id":"sha256:0ad19c84066c6a51ea7460d1bb5ca197f99577ebcf38ac560ee1079c436e9c40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EKKS3G4DJDEGYUVSU3X7B5CTRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling and Performance Studies of Data Communication Networks using Dynamic Complex Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.NI","authors_text":"Anurag Singh, Suchi Kumari","submitted_at":"2017-01-17T09:11:14Z","abstract_excerpt":"All the existing real world networks are evolving, hence, study of traffic dynamics in these enlarged networks is a challenging task. The critical issue is to optimize the network structure to improve network capacity and avoid traffic congestion. We are interested in taking user's routes such that it is least congested with optimal network capacity. Network capacity may be improved either by optimizing network topology or enhancing in routing approach. In this context, we propose and design a model of the time varying data communication networks (TVCN) based on the dynamics of in-flowing link"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04581","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"},"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:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wcWUjgH8HyOH/qS1m0N6ds4GLfymQvlh1feG+RFL7NS2YE6PNiOocP+iV/1yCDwO0IBTbvKRw9a+4ZmrFKMzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T01:25:26.869939Z"},"content_sha256":"fa2f8a678e1f5289a60db39c7c4477f3ec21199dc9f0f21e99035b2ae086edb9","schema_version":"1.0","event_id":"sha256:fa2f8a678e1f5289a60db39c7c4477f3ec21199dc9f0f21e99035b2ae086edb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKKS3G4DJDEGYUVSU3X7B5CTRX/bundle.json","state_url":"https://pith.science/pith/EKKS3G4DJDEGYUVSU3X7B5CTRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKKS3G4DJDEGYUVSU3X7B5CTRX/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-06-30T01:25:26Z","links":{"resolver":"https://pith.science/pith/EKKS3G4DJDEGYUVSU3X7B5CTRX","bundle":"https://pith.science/pith/EKKS3G4DJDEGYUVSU3X7B5CTRX/bundle.json","state":"https://pith.science/pith/EKKS3G4DJDEGYUVSU3X7B5CTRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKKS3G4DJDEGYUVSU3X7B5CTRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EKKS3G4DJDEGYUVSU3X7B5CTRX","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":"5eeb9729d64d1d94e62db924a7fe9aeb433067cb0daf491d791cea8a5c9d13af","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2017-01-17T09:11:14Z","title_canon_sha256":"5a0608d4a0d50f2bb4914696ac1424d7bafb2115ae662642635c794c07c80e6f"},"schema_version":"1.0","source":{"id":"1701.04581","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04581","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04581v1","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04581","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"EKKS3G4DJDEG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKKS3G4DJDEGYUVS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKKS3G4D","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:fa2f8a678e1f5289a60db39c7c4477f3ec21199dc9f0f21e99035b2ae086edb9","target":"graph","created_at":"2026-05-18T00:00:37Z","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":"All the existing real world networks are evolving, hence, study of traffic dynamics in these enlarged networks is a challenging task. The critical issue is to optimize the network structure to improve network capacity and avoid traffic congestion. We are interested in taking user's routes such that it is least congested with optimal network capacity. Network capacity may be improved either by optimizing network topology or enhancing in routing approach. In this context, we propose and design a model of the time varying data communication networks (TVCN) based on the dynamics of in-flowing link","authors_text":"Anurag Singh, Suchi Kumari","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2017-01-17T09:11:14Z","title":"Modeling and Performance Studies of Data Communication Networks using Dynamic Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04581","kind":"arxiv","version":1},"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:0ad19c84066c6a51ea7460d1bb5ca197f99577ebcf38ac560ee1079c436e9c40","target":"record","created_at":"2026-05-18T00:00:37Z","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":"5eeb9729d64d1d94e62db924a7fe9aeb433067cb0daf491d791cea8a5c9d13af","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2017-01-17T09:11:14Z","title_canon_sha256":"5a0608d4a0d50f2bb4914696ac1424d7bafb2115ae662642635c794c07c80e6f"},"schema_version":"1.0","source":{"id":"1701.04581","kind":"arxiv","version":1}},"canonical_sha256":"22952d9b8348c86c52b2a6eff0f4538dc7300cc4703d9bc96aacf42d6d5de86e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22952d9b8348c86c52b2a6eff0f4538dc7300cc4703d9bc96aacf42d6d5de86e","first_computed_at":"2026-05-18T00:00:37.253467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:37.253467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AAIfaZHgGsxndcOBq7hIYeXMktDC3foH2ZAg9dWxp0alHVKKtYvfhExIcIj7xnC8gwoni4rgX0qQf3pEZYqyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:37.253993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04581","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ad19c84066c6a51ea7460d1bb5ca197f99577ebcf38ac560ee1079c436e9c40","sha256:fa2f8a678e1f5289a60db39c7c4477f3ec21199dc9f0f21e99035b2ae086edb9"],"state_sha256":"67babd014b97b9ce44e8c0000eaea82f078295e2b55f04b6c1e548e145836eda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odYTTxfLTFzaj95C3uRbKCMtZB0VjhkfU5MSiH1u64n93D385DoOx+dEP29kJiLpCosieHcawBpyR4nUbCygCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T01:25:26.872593Z","bundle_sha256":"46c0fa1eb7d2de39abb76370cf765adbde9ee54385cf3423f95a67dfc35af591"}}