{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N6LJZBM5H76NA7UHA7RLYJPKXS","short_pith_number":"pith:N6LJZBM5","schema_version":"1.0","canonical_sha256":"6f969c859d3ffcd07e8707e2bc25eabca4b1e785d415b34717a40132f8d6aedd","source":{"kind":"arxiv","id":"2606.11532","version":1},"attestation_state":"computed","paper":{"title":"Hiding the Trees in the Forest: Building Network Covert Channels with Hash-Based Covert Carrier Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Baoxu Liu, Yan Zhang, Yuyang Han, Zexiao Zou, Zhiqiang Wang","submitted_at":"2026-06-10T00:29:26Z","abstract_excerpt":"As an effective anti-censorship mechanism, network covert channels can provide data privacy protection and ensure communication security. However, the covertness of existing network covert channels primarily depends on the secrecy of their covert algorithms. With the increasing depth of research in this field, the difficulty of breaking such algorithms has gradually decreased. Once the algorithm is exposed, the network covert channel can be easily detected by adversaries. To address this issue, this paper proposes a covert carrier filtering strategy based on the hash. In this strategy, a key-d"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.11532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-10T00:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"c94e0cbfdd9addc255881442f150a84acc005d667d07451d51c28686ff1890d8","abstract_canon_sha256":"8b6b5814a272b64a1f88d19608a44cf82e66881343175bf4d3437b3c72f8b65b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:54.590033Z","signature_b64":"TuoQ0FLJv7lArPJOVoqgUqeC4oMTUOjpnSpyy4O+G+lJkCSfvrj3gUSw65MU208k+Od2U/N14J4VLCBcB5HOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f969c859d3ffcd07e8707e2bc25eabca4b1e785d415b34717a40132f8d6aedd","last_reissued_at":"2026-06-11T01:09:54.589236Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:54.589236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hiding the Trees in the Forest: Building Network Covert Channels with Hash-Based Covert Carrier Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Baoxu Liu, Yan Zhang, Yuyang Han, Zexiao Zou, Zhiqiang Wang","submitted_at":"2026-06-10T00:29:26Z","abstract_excerpt":"As an effective anti-censorship mechanism, network covert channels can provide data privacy protection and ensure communication security. However, the covertness of existing network covert channels primarily depends on the secrecy of their covert algorithms. With the increasing depth of research in this field, the difficulty of breaking such algorithms has gradually decreased. Once the algorithm is exposed, the network covert channel can be easily detected by adversaries. To address this issue, this paper proposes a covert carrier filtering strategy based on the hash. In this strategy, a key-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11532","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.11532/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.11532","created_at":"2026-06-11T01:09:54.589380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11532v1","created_at":"2026-06-11T01:09:54.589380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11532","created_at":"2026-06-11T01:09:54.589380+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6LJZBM5H76N","created_at":"2026-06-11T01:09:54.589380+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6LJZBM5H76NA7UH","created_at":"2026-06-11T01:09:54.589380+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6LJZBM5","created_at":"2026-06-11T01:09:54.589380+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS","json":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS.json","graph_json":"https://pith.science/api/pith-number/N6LJZBM5H76NA7UHA7RLYJPKXS/graph.json","events_json":"https://pith.science/api/pith-number/N6LJZBM5H76NA7UHA7RLYJPKXS/events.json","paper":"https://pith.science/paper/N6LJZBM5"},"agent_actions":{"view_html":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS","download_json":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS.json","view_paper":"https://pith.science/paper/N6LJZBM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11532&json=true","fetch_graph":"https://pith.science/api/pith-number/N6LJZBM5H76NA7UHA7RLYJPKXS/graph.json","fetch_events":"https://pith.science/api/pith-number/N6LJZBM5H76NA7UHA7RLYJPKXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS/action/storage_attestation","attest_author":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS/action/author_attestation","sign_citation":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS/action/citation_signature","submit_replication":"https://pith.science/pith/N6LJZBM5H76NA7UHA7RLYJPKXS/action/replication_record"}},"created_at":"2026-06-11T01:09:54.589380+00:00","updated_at":"2026-06-11T01:09:54.589380+00:00"}