{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JNY5DDD65THYN6H3QFCIYXA4OC","short_pith_number":"pith:JNY5DDD6","canonical_record":{"source":{"id":"1308.3842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-18T07:46:14Z","cross_cats_sorted":[],"title_canon_sha256":"ee0b4f0994d240f96231b285f892e9694a1a3a6be1f6a7eb1615c6b46875add9","abstract_canon_sha256":"0860df04738f50559aafecbb516fd2ba2afdf664d07050709fa90161df5f9fa9"},"schema_version":"1.0"},"canonical_sha256":"4b71d18c7eeccf86f8fb81448c5c1c7090c849d06a6771f741b0e69dc4a06506","source":{"kind":"arxiv","id":"1308.3842","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3842","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3842v1","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3842","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"JNY5DDD65THY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JNY5DDD65THYN6H3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JNY5DDD6","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JNY5DDD65THYN6H3QFCIYXA4OC","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-18T07:46:14Z","cross_cats_sorted":[],"title_canon_sha256":"ee0b4f0994d240f96231b285f892e9694a1a3a6be1f6a7eb1615c6b46875add9","abstract_canon_sha256":"0860df04738f50559aafecbb516fd2ba2afdf664d07050709fa90161df5f9fa9"},"schema_version":"1.0"},"canonical_sha256":"4b71d18c7eeccf86f8fb81448c5c1c7090c849d06a6771f741b0e69dc4a06506","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:42.374867Z","signature_b64":"k0Ll+z7kzNp7MbTIDu0emy/bcUWWxDxxOC4m8TWif41ppYNfJokfPBM91lmjSvtNGtN52dVs3ZK/8wG240B/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b71d18c7eeccf86f8fb81448c5c1c7090c849d06a6771f741b0e69dc4a06506","last_reissued_at":"2026-05-18T03:15:42.374272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:42.374272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3842","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-18T03:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBNSncvjqFSmS+PeDt+n08UNbRLPPZQwOjW4DlcM2ql9z537EX2OOrSV69ig1+QXJMg2N274OFEukQdQs/wKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:11:01.696527Z"},"content_sha256":"5ae1ed670da11fac9146889dc77e0dc03e7ac1aef819ffd0f0db479abed91be3","schema_version":"1.0","event_id":"sha256:5ae1ed670da11fac9146889dc77e0dc03e7ac1aef819ffd0f0db479abed91be3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JNY5DDD65THYN6H3QFCIYXA4OC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling Self-Similar Traffic for Network Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abdallah Shami, Xiaofeng Bai","submitted_at":"2013-08-18T07:46:14Z","abstract_excerpt":"In order to closely simulate the real network scenario thereby verify the effectiveness of protocol designs, it is necessary to model the traffic flows carried over realistic networks. Extensive studies [1] showed that the actual traffic in access and local area networks (e.g., those generated by ftp and video streams) exhibits the property of self-similarity and long-range dependency (LRD) [2]. In this appendix we briefly introduce the property of self-similarity and suggest a practical approach for modeling self-similar traces with specified traffic intensity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3842","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-18T03:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SsCQOzhnZQsVwmKap3iqCcus0lZZr0otDDSSmR208AdVdInjp2Ep2qAjopDjpBTdyGrjIsOekxLhOgbKKF2DBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:11:01.697059Z"},"content_sha256":"af2eece7c4e9b045867a2d065a8e63fbd88aa234efd92cde79723aca12972ca4","schema_version":"1.0","event_id":"sha256:af2eece7c4e9b045867a2d065a8e63fbd88aa234efd92cde79723aca12972ca4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNY5DDD65THYN6H3QFCIYXA4OC/bundle.json","state_url":"https://pith.science/pith/JNY5DDD65THYN6H3QFCIYXA4OC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNY5DDD65THYN6H3QFCIYXA4OC/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-05T03:11:01Z","links":{"resolver":"https://pith.science/pith/JNY5DDD65THYN6H3QFCIYXA4OC","bundle":"https://pith.science/pith/JNY5DDD65THYN6H3QFCIYXA4OC/bundle.json","state":"https://pith.science/pith/JNY5DDD65THYN6H3QFCIYXA4OC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNY5DDD65THYN6H3QFCIYXA4OC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JNY5DDD65THYN6H3QFCIYXA4OC","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":"0860df04738f50559aafecbb516fd2ba2afdf664d07050709fa90161df5f9fa9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-18T07:46:14Z","title_canon_sha256":"ee0b4f0994d240f96231b285f892e9694a1a3a6be1f6a7eb1615c6b46875add9"},"schema_version":"1.0","source":{"id":"1308.3842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3842","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3842v1","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3842","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"JNY5DDD65THY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JNY5DDD65THYN6H3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JNY5DDD6","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:af2eece7c4e9b045867a2d065a8e63fbd88aa234efd92cde79723aca12972ca4","target":"graph","created_at":"2026-05-18T03:15:42Z","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":"In order to closely simulate the real network scenario thereby verify the effectiveness of protocol designs, it is necessary to model the traffic flows carried over realistic networks. Extensive studies [1] showed that the actual traffic in access and local area networks (e.g., those generated by ftp and video streams) exhibits the property of self-similarity and long-range dependency (LRD) [2]. In this appendix we briefly introduce the property of self-similarity and suggest a practical approach for modeling self-similar traces with specified traffic intensity.","authors_text":"Abdallah Shami, Xiaofeng Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-18T07:46:14Z","title":"Modeling Self-Similar Traffic for Network Simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3842","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:5ae1ed670da11fac9146889dc77e0dc03e7ac1aef819ffd0f0db479abed91be3","target":"record","created_at":"2026-05-18T03:15:42Z","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":"0860df04738f50559aafecbb516fd2ba2afdf664d07050709fa90161df5f9fa9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-18T07:46:14Z","title_canon_sha256":"ee0b4f0994d240f96231b285f892e9694a1a3a6be1f6a7eb1615c6b46875add9"},"schema_version":"1.0","source":{"id":"1308.3842","kind":"arxiv","version":1}},"canonical_sha256":"4b71d18c7eeccf86f8fb81448c5c1c7090c849d06a6771f741b0e69dc4a06506","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b71d18c7eeccf86f8fb81448c5c1c7090c849d06a6771f741b0e69dc4a06506","first_computed_at":"2026-05-18T03:15:42.374272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:42.374272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k0Ll+z7kzNp7MbTIDu0emy/bcUWWxDxxOC4m8TWif41ppYNfJokfPBM91lmjSvtNGtN52dVs3ZK/8wG240B/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:42.374867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ae1ed670da11fac9146889dc77e0dc03e7ac1aef819ffd0f0db479abed91be3","sha256:af2eece7c4e9b045867a2d065a8e63fbd88aa234efd92cde79723aca12972ca4"],"state_sha256":"40d9e082c03d70badee41bb8fdbd2837c19efd4547d2a526a0f3a77b26fdf6b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQE6jSvZ4vwAUF89ATm4HfHtrqoekR0fQFSl/W8kM09exBbDHIfeUlBjpu/6Y+8oRru7gK8q2XwX0s0MzRfYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:11:01.699864Z","bundle_sha256":"d41fad22546ec935d14fb5d4e05e9127c2ca5ef0191904c27109a1dc83c91d02"}}