{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IWSPVFGDJCF25KN3O4HN6XGFDG","short_pith_number":"pith:IWSPVFGD","canonical_record":{"source":{"id":"1708.00186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-01T07:17:20Z","cross_cats_sorted":["cs.DM","cs.NI","math.DS"],"title_canon_sha256":"9eb0062f2cb6e84e3ca48c2e9c289657d0d042b387747490e94e930779d2429d","abstract_canon_sha256":"08ca1c5ce6b4323599c6db35827f96f828c9c1c9695b4eee3f138f95dda9f62c"},"schema_version":"1.0"},"canonical_sha256":"45a4fa94c3488baea9bb770edf5cc519ab9a54f0ae7a4595da9b64de318ad6a2","source":{"kind":"arxiv","id":"1708.00186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00186","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00186v1","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00186","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"IWSPVFGDJCF2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IWSPVFGDJCF25KN3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IWSPVFGD","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IWSPVFGDJCF25KN3O4HN6XGFDG","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-01T07:17:20Z","cross_cats_sorted":["cs.DM","cs.NI","math.DS"],"title_canon_sha256":"9eb0062f2cb6e84e3ca48c2e9c289657d0d042b387747490e94e930779d2429d","abstract_canon_sha256":"08ca1c5ce6b4323599c6db35827f96f828c9c1c9695b4eee3f138f95dda9f62c"},"schema_version":"1.0"},"canonical_sha256":"45a4fa94c3488baea9bb770edf5cc519ab9a54f0ae7a4595da9b64de318ad6a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.421459Z","signature_b64":"cQwehysPgiGBf/TNVOHY/hm3iWNOrLFeLzR7xZ6SDE2dCttEep3gy2Ytx5ZSks3ya9nOOrwFM0prRJVNKuEMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a4fa94c3488baea9bb770edf5cc519ab9a54f0ae7a4595da9b64de318ad6a2","last_reissued_at":"2026-05-18T00:38:35.421024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.421024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00186","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYlttY5Yk5ie7Rwj23kfsrWHAzCZBetH4AYp9O+HfP9WfrgpIsNct0yrJAOfFYJE05qMIy+1W5W2tCL+jqPSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:56:33.718862Z"},"content_sha256":"007e1a9a90324f5f9aa0a6bad966b4a143ba8c91b55544f3c88132e886c2b1c4","schema_version":"1.0","event_id":"sha256:007e1a9a90324f5f9aa0a6bad966b4a143ba8c91b55544f3c88132e886c2b1c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IWSPVFGDJCF25KN3O4HN6XGFDG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling and Analysis of Network Dynamics in Complex Communication Networks Using Social Network Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","math.DS"],"primary_cat":"cs.SI","authors_text":"Bisma S. Khan, Muaz A. Niazi","submitted_at":"2017-08-01T07:17:20Z","abstract_excerpt":"Modern communication networks are inherently complex in nature. First of all, they have a large number of heterogeneous components. Secondly, their connectivity is extremely dynamic. Nodes can come and go, links can be removed and added over time. Traditional modeling and simulation techniques amalgamate or ignore such dynamics and therefore, are unable to represent them. Complex communication networks are therefore better modeled as mathematical structures called graphs. Modeling as graphs allows for the application of complex techniques such as various network based analysis techniques. Whil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00186","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2jYa7443drwe4vzz2b4OyNxDVEQ1Vc/eZKG5VlGmFSZlyy+Y1hIjH+xWs5J6TCHnpldm2JAwS7+Kw3qZii0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:56:33.719675Z"},"content_sha256":"cc5c977329869ff7fdfe2041d9f3515ca76f0e9838f0a4dbf310720ba614d512","schema_version":"1.0","event_id":"sha256:cc5c977329869ff7fdfe2041d9f3515ca76f0e9838f0a4dbf310720ba614d512"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWSPVFGDJCF25KN3O4HN6XGFDG/bundle.json","state_url":"https://pith.science/pith/IWSPVFGDJCF25KN3O4HN6XGFDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWSPVFGDJCF25KN3O4HN6XGFDG/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-08-03T22:56:33Z","links":{"resolver":"https://pith.science/pith/IWSPVFGDJCF25KN3O4HN6XGFDG","bundle":"https://pith.science/pith/IWSPVFGDJCF25KN3O4HN6XGFDG/bundle.json","state":"https://pith.science/pith/IWSPVFGDJCF25KN3O4HN6XGFDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWSPVFGDJCF25KN3O4HN6XGFDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IWSPVFGDJCF25KN3O4HN6XGFDG","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":"08ca1c5ce6b4323599c6db35827f96f828c9c1c9695b4eee3f138f95dda9f62c","cross_cats_sorted":["cs.DM","cs.NI","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-01T07:17:20Z","title_canon_sha256":"9eb0062f2cb6e84e3ca48c2e9c289657d0d042b387747490e94e930779d2429d"},"schema_version":"1.0","source":{"id":"1708.00186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00186","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00186v1","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00186","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"IWSPVFGDJCF2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IWSPVFGDJCF25KN3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IWSPVFGD","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:cc5c977329869ff7fdfe2041d9f3515ca76f0e9838f0a4dbf310720ba614d512","target":"graph","created_at":"2026-05-18T00:38:35Z","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":"Modern communication networks are inherently complex in nature. First of all, they have a large number of heterogeneous components. Secondly, their connectivity is extremely dynamic. Nodes can come and go, links can be removed and added over time. Traditional modeling and simulation techniques amalgamate or ignore such dynamics and therefore, are unable to represent them. Complex communication networks are therefore better modeled as mathematical structures called graphs. Modeling as graphs allows for the application of complex techniques such as various network based analysis techniques. Whil","authors_text":"Bisma S. Khan, Muaz A. Niazi","cross_cats":["cs.DM","cs.NI","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-01T07:17:20Z","title":"Modeling and Analysis of Network Dynamics in Complex Communication Networks Using Social Network Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00186","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:007e1a9a90324f5f9aa0a6bad966b4a143ba8c91b55544f3c88132e886c2b1c4","target":"record","created_at":"2026-05-18T00:38:35Z","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":"08ca1c5ce6b4323599c6db35827f96f828c9c1c9695b4eee3f138f95dda9f62c","cross_cats_sorted":["cs.DM","cs.NI","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-01T07:17:20Z","title_canon_sha256":"9eb0062f2cb6e84e3ca48c2e9c289657d0d042b387747490e94e930779d2429d"},"schema_version":"1.0","source":{"id":"1708.00186","kind":"arxiv","version":1}},"canonical_sha256":"45a4fa94c3488baea9bb770edf5cc519ab9a54f0ae7a4595da9b64de318ad6a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45a4fa94c3488baea9bb770edf5cc519ab9a54f0ae7a4595da9b64de318ad6a2","first_computed_at":"2026-05-18T00:38:35.421024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:35.421024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cQwehysPgiGBf/TNVOHY/hm3iWNOrLFeLzR7xZ6SDE2dCttEep3gy2Ytx5ZSks3ya9nOOrwFM0prRJVNKuEMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:35.421459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:007e1a9a90324f5f9aa0a6bad966b4a143ba8c91b55544f3c88132e886c2b1c4","sha256:cc5c977329869ff7fdfe2041d9f3515ca76f0e9838f0a4dbf310720ba614d512"],"state_sha256":"12434ba14ed209545752cc33e2ca23fe1487d00b10484e91619205a68146f630"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgLul5LlZG4wlT72Q51tb3gosoP1ung7X45wyWeE1+BB6YkCJYHQOeaihJUzuG9ikKvAi9xPbryl+px0VfsmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:56:33.726142Z","bundle_sha256":"1c8fbfaa30bcee5121b9770aad5d436cf70fb6e63d137e4e76839d9061f9aff0"}}