{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JLFJIGDNWIM64UR44CE44IKID3","short_pith_number":"pith:JLFJIGDN","canonical_record":{"source":{"id":"1707.07234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-23T00:25:11Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"8b9f62eba32250616867c24352d5d0e0f95d1229ea3a9b8b7cf356ef5e027f85","abstract_canon_sha256":"ab8cebf604366a8b982fcce0c4ea3af467b34eddd8b81ea8a34ea59e6da3bb44"},"schema_version":"1.0"},"canonical_sha256":"4aca94186db219ee523ce089ce21481ed0bd62c1caaf2154e01c019a2825bdcf","source":{"kind":"arxiv","id":"1707.07234","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07234","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07234v2","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07234","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"JLFJIGDNWIM6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLFJIGDNWIM64UR4","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLFJIGDN","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JLFJIGDNWIM64UR44CE44IKID3","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-23T00:25:11Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"8b9f62eba32250616867c24352d5d0e0f95d1229ea3a9b8b7cf356ef5e027f85","abstract_canon_sha256":"ab8cebf604366a8b982fcce0c4ea3af467b34eddd8b81ea8a34ea59e6da3bb44"},"schema_version":"1.0"},"canonical_sha256":"4aca94186db219ee523ce089ce21481ed0bd62c1caaf2154e01c019a2825bdcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:36.542270Z","signature_b64":"QGY5ODj64FLsLPRAIjN5excNuk5hIWVC9ei3dgjqFnq1fshx6nObLgCAWQDEQQ9GeCWDKVlN77FdbBDs/pqCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aca94186db219ee523ce089ce21481ed0bd62c1caaf2154e01c019a2825bdcf","last_reissued_at":"2026-05-18T00:09:36.541670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:36.541670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07234","source_version":2,"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:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFoktlHFiuJ8MCUI1qp1Eg21YeIVQhsA8kgJP5Vm35K+NX8aLSFTFTue1T1HJCj97aC7S2jXVu+lZSYBtd7bBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:02:14.013283Z"},"content_sha256":"b88886ffb880e2cec5ea0375a72202df31dff5080f6dedfd562aff63d1b3490f","schema_version":"1.0","event_id":"sha256:b88886ffb880e2cec5ea0375a72202df31dff5080f6dedfd562aff63d1b3490f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JLFJIGDNWIM64UR44CE44IKID3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Covert Queueing Channel in FCFS Schedulers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"AmirEmad Ghassami, Negar Kiyavash","submitted_at":"2017-07-23T00:25:11Z","abstract_excerpt":"We study covert queueing channels (CQCs), which are a kind of covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user sends messages to another user via his pattern of access to the shared resource, which serves the users according to a first come first served (FCFS) policy. One example of such a channel is the cross-virtual network covert channel in data center networks, resulting from the queueing effects of the shared resource. First, we study a system comprising a transmitter and a receiver that share a deterministic and wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07234","kind":"arxiv","version":2},"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:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qWrzE+poLx4I7mPOKJfLdPqFPnG5fUvl1DVWbb/UekOiOClqECjZpCtwmdVLIruQNr4B3r+Y/3cRxldKchqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:02:14.013640Z"},"content_sha256":"c4f9bcd028c567d5e7fdfc8a8325c4d57b8fa91547f51338cf061abbfb78fe18","schema_version":"1.0","event_id":"sha256:c4f9bcd028c567d5e7fdfc8a8325c4d57b8fa91547f51338cf061abbfb78fe18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLFJIGDNWIM64UR44CE44IKID3/bundle.json","state_url":"https://pith.science/pith/JLFJIGDNWIM64UR44CE44IKID3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLFJIGDNWIM64UR44CE44IKID3/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-27T20:02:14Z","links":{"resolver":"https://pith.science/pith/JLFJIGDNWIM64UR44CE44IKID3","bundle":"https://pith.science/pith/JLFJIGDNWIM64UR44CE44IKID3/bundle.json","state":"https://pith.science/pith/JLFJIGDNWIM64UR44CE44IKID3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLFJIGDNWIM64UR44CE44IKID3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JLFJIGDNWIM64UR44CE44IKID3","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":"ab8cebf604366a8b982fcce0c4ea3af467b34eddd8b81ea8a34ea59e6da3bb44","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-23T00:25:11Z","title_canon_sha256":"8b9f62eba32250616867c24352d5d0e0f95d1229ea3a9b8b7cf356ef5e027f85"},"schema_version":"1.0","source":{"id":"1707.07234","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07234","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07234v2","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07234","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"JLFJIGDNWIM6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLFJIGDNWIM64UR4","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLFJIGDN","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:c4f9bcd028c567d5e7fdfc8a8325c4d57b8fa91547f51338cf061abbfb78fe18","target":"graph","created_at":"2026-05-18T00:09:36Z","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":"We study covert queueing channels (CQCs), which are a kind of covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user sends messages to another user via his pattern of access to the shared resource, which serves the users according to a first come first served (FCFS) policy. One example of such a channel is the cross-virtual network covert channel in data center networks, resulting from the queueing effects of the shared resource. First, we study a system comprising a transmitter and a receiver that share a deterministic and wo","authors_text":"AmirEmad Ghassami, Negar Kiyavash","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-23T00:25:11Z","title":"A Covert Queueing Channel in FCFS Schedulers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07234","kind":"arxiv","version":2},"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:b88886ffb880e2cec5ea0375a72202df31dff5080f6dedfd562aff63d1b3490f","target":"record","created_at":"2026-05-18T00:09:36Z","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":"ab8cebf604366a8b982fcce0c4ea3af467b34eddd8b81ea8a34ea59e6da3bb44","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-23T00:25:11Z","title_canon_sha256":"8b9f62eba32250616867c24352d5d0e0f95d1229ea3a9b8b7cf356ef5e027f85"},"schema_version":"1.0","source":{"id":"1707.07234","kind":"arxiv","version":2}},"canonical_sha256":"4aca94186db219ee523ce089ce21481ed0bd62c1caaf2154e01c019a2825bdcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4aca94186db219ee523ce089ce21481ed0bd62c1caaf2154e01c019a2825bdcf","first_computed_at":"2026-05-18T00:09:36.541670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:36.541670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QGY5ODj64FLsLPRAIjN5excNuk5hIWVC9ei3dgjqFnq1fshx6nObLgCAWQDEQQ9GeCWDKVlN77FdbBDs/pqCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:36.542270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07234","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b88886ffb880e2cec5ea0375a72202df31dff5080f6dedfd562aff63d1b3490f","sha256:c4f9bcd028c567d5e7fdfc8a8325c4d57b8fa91547f51338cf061abbfb78fe18"],"state_sha256":"4a7bf91c1b768e15a5c7d4e3f5d5e9ead56a4648970983df06e0b98bfd44e015"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lokT6OdE9Z8G54FzoO+KqYjYRq3Y3CXAMCpdgnXy69zaFI8gKqeZv2KjydTwZD7LdLsowG5SkYnVjq6cvmSnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:02:14.015440Z","bundle_sha256":"e8fce7ca2e88d2f41a61d589ba22f78c61b62503979aeb3af6dc5279977e2da8"}}