{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FLUMPXSMQ45XXOCULZWPBF6CH7","short_pith_number":"pith:FLUMPXSM","canonical_record":{"source":{"id":"1905.08339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-20T20:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"59bc026306c8f2859efc10ad2a3b711731d19970af0057f418b7109c96d2f440","abstract_canon_sha256":"d70a071b3c3434e83f78a17b489836d4317802916a4bbc161b956c861b63fdb2"},"schema_version":"1.0"},"canonical_sha256":"2ae8c7de4c873b7bb8545e6cf097c23fd04ba00522893d606cad4f9afc550d6c","source":{"kind":"arxiv","id":"1905.08339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08339","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08339v1","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08339","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"FLUMPXSMQ45X","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLUMPXSMQ45XXOCU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLUMPXSM","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FLUMPXSMQ45XXOCULZWPBF6CH7","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-20T20:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"59bc026306c8f2859efc10ad2a3b711731d19970af0057f418b7109c96d2f440","abstract_canon_sha256":"d70a071b3c3434e83f78a17b489836d4317802916a4bbc161b956c861b63fdb2"},"schema_version":"1.0"},"canonical_sha256":"2ae8c7de4c873b7bb8545e6cf097c23fd04ba00522893d606cad4f9afc550d6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:43.573363Z","signature_b64":"Dn/14Yloiol4YQjg/qJT+z0bp5Lgn0z+cw5AdH8zDgfuu2yAUNXvMH3/RRG48BesKCnoiBTKdcseWsv6MvtmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ae8c7de4c873b7bb8545e6cf097c23fd04ba00522893d606cad4f9afc550d6c","last_reissued_at":"2026-05-17T23:45:43.572556Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:43.572556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08339","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-17T23:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHKMNC/32qSpYDyITLUOiowDuD94Ig1ZsPL+hblR4ySTkhjNJRMeT+jCtey4gKmjSNle77LSniY2lVDPDcjZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:01:01.944683Z"},"content_sha256":"0ec0b7f0a3bb4737527bda62ac7a2799cdb2a7acefdf13fbdc25b76f0857fdfd","schema_version":"1.0","event_id":"sha256:0ec0b7f0a3bb4737527bda62ac7a2799cdb2a7acefdf13fbdc25b76f0857fdfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FLUMPXSMQ45XXOCULZWPBF6CH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Measuring the Complexity of Packet Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chen Avin, Chen Griner, Manya Ghobadi, Stefan Schmid","submitted_at":"2019-05-20T20:45:15Z","abstract_excerpt":"This paper studies the structure of several real-world traces (including Facebook, High-Performance Computing, Machine Learning, and simulation generated traces) and presents a systematic approach to quantify and compare the structure of packet traces based on the entropy contained in the trace file. Insights into the structure of packet traces can lead to improved network algorithms that are optimized toward specific traffic patterns. We then present a methodology to quantify the temporal and non-temporal components of entropy contained in a packet trace, called the trace complexity, using ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08339","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-17T23:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1DdJf7lr5EiWiB3AuR987UzFlCHhkvqKFcAkArNC447D8qR9IzaEsuTXGjpEMTMhZwyVZyinhVtxaMXgAo3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:01:01.945031Z"},"content_sha256":"0352c9809061e39e677f2e758dca81851f52efe8d9712b0dc19579f0423f9a75","schema_version":"1.0","event_id":"sha256:0352c9809061e39e677f2e758dca81851f52efe8d9712b0dc19579f0423f9a75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLUMPXSMQ45XXOCULZWPBF6CH7/bundle.json","state_url":"https://pith.science/pith/FLUMPXSMQ45XXOCULZWPBF6CH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLUMPXSMQ45XXOCULZWPBF6CH7/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-01T14:01:01Z","links":{"resolver":"https://pith.science/pith/FLUMPXSMQ45XXOCULZWPBF6CH7","bundle":"https://pith.science/pith/FLUMPXSMQ45XXOCULZWPBF6CH7/bundle.json","state":"https://pith.science/pith/FLUMPXSMQ45XXOCULZWPBF6CH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLUMPXSMQ45XXOCULZWPBF6CH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FLUMPXSMQ45XXOCULZWPBF6CH7","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":"d70a071b3c3434e83f78a17b489836d4317802916a4bbc161b956c861b63fdb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-20T20:45:15Z","title_canon_sha256":"59bc026306c8f2859efc10ad2a3b711731d19970af0057f418b7109c96d2f440"},"schema_version":"1.0","source":{"id":"1905.08339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08339","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08339v1","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08339","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"FLUMPXSMQ45X","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLUMPXSMQ45XXOCU","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLUMPXSM","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:0352c9809061e39e677f2e758dca81851f52efe8d9712b0dc19579f0423f9a75","target":"graph","created_at":"2026-05-17T23:45:43Z","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":"This paper studies the structure of several real-world traces (including Facebook, High-Performance Computing, Machine Learning, and simulation generated traces) and presents a systematic approach to quantify and compare the structure of packet traces based on the entropy contained in the trace file. Insights into the structure of packet traces can lead to improved network algorithms that are optimized toward specific traffic patterns. We then present a methodology to quantify the temporal and non-temporal components of entropy contained in a packet trace, called the trace complexity, using ra","authors_text":"Chen Avin, Chen Griner, Manya Ghobadi, Stefan Schmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-20T20:45:15Z","title":"Measuring the Complexity of Packet Traces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08339","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:0ec0b7f0a3bb4737527bda62ac7a2799cdb2a7acefdf13fbdc25b76f0857fdfd","target":"record","created_at":"2026-05-17T23:45:43Z","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":"d70a071b3c3434e83f78a17b489836d4317802916a4bbc161b956c861b63fdb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-20T20:45:15Z","title_canon_sha256":"59bc026306c8f2859efc10ad2a3b711731d19970af0057f418b7109c96d2f440"},"schema_version":"1.0","source":{"id":"1905.08339","kind":"arxiv","version":1}},"canonical_sha256":"2ae8c7de4c873b7bb8545e6cf097c23fd04ba00522893d606cad4f9afc550d6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ae8c7de4c873b7bb8545e6cf097c23fd04ba00522893d606cad4f9afc550d6c","first_computed_at":"2026-05-17T23:45:43.572556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:43.572556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dn/14Yloiol4YQjg/qJT+z0bp5Lgn0z+cw5AdH8zDgfuu2yAUNXvMH3/RRG48BesKCnoiBTKdcseWsv6MvtmDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:43.573363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ec0b7f0a3bb4737527bda62ac7a2799cdb2a7acefdf13fbdc25b76f0857fdfd","sha256:0352c9809061e39e677f2e758dca81851f52efe8d9712b0dc19579f0423f9a75"],"state_sha256":"cf9430694e8fc5d726de72b9ba93490cf9cd1f8ffd5691c3788cf353e7ca1a73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQrgEtLZh+ZlNpwFx6rCZ26NoataxeYFULT/Ad4Av+Qr5XCTxKzR1eBDSMMD1WI587s1uw4sf9hyLW1K1rj9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:01:01.947074Z","bundle_sha256":"4e4af56241fee9801c178c3930dddff16d9146e1366e51dd453f12dbcf2b9cbb"}}