{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IL7JW2YJ6PRHS775ET6D7ERPJR","short_pith_number":"pith:IL7JW2YJ","schema_version":"1.0","canonical_sha256":"42fe9b6b09f3e2797ffd24fc3f922f4c566e852e99f41e58567a30a67fabf831","source":{"kind":"arxiv","id":"2606.04517","version":1},"attestation_state":"computed","paper":{"title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Guang Cheng, Jun Tao, Linxiao Yu, Yuantu Luo","submitted_at":"2026-06-03T06:52:29Z","abstract_excerpt":"Graph-based deep learning methods have been widely employed in encrypted traffic analysis to exploit latent correlations across different granularities. However, while complex preprocessing pipelines and sophisticated model structures often achieve strong performance, they may obscure inherent protocol semantics during representation learning. Moreover, the hierarchical structure of protocol layers and their corresponding fields, defined by protocol specifications and routinely utilized in manual traffic analysis, remains underexplored in existing learning frameworks. In this paper, we propose"},"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.04517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-06-03T06:52:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c0c39eb6abb7353680597b137edd86f15f5f0ce3197fea65a8dbb6dd3ad5b0d3","abstract_canon_sha256":"9e55f91572e8ece2fb3effaac149bbe3b58f786efd8371ff368a1017a051bbd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:15.689799Z","signature_b64":"THXcvkUeYtbzYEjdqSxWWlZayLaXd+zYA0TVvziFySTMLeMxOrW8aiLhI/63MEVE0+bpQ0kYu5Lqof3s/P7eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42fe9b6b09f3e2797ffd24fc3f922f4c566e852e99f41e58567a30a67fabf831","last_reissued_at":"2026-06-04T01:09:15.689000Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:15.689000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Guang Cheng, Jun Tao, Linxiao Yu, Yuantu Luo","submitted_at":"2026-06-03T06:52:29Z","abstract_excerpt":"Graph-based deep learning methods have been widely employed in encrypted traffic analysis to exploit latent correlations across different granularities. However, while complex preprocessing pipelines and sophisticated model structures often achieve strong performance, they may obscure inherent protocol semantics during representation learning. Moreover, the hierarchical structure of protocol layers and their corresponding fields, defined by protocol specifications and routinely utilized in manual traffic analysis, remains underexplored in existing learning frameworks. In this paper, we propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04517","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.04517/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.04517","created_at":"2026-06-04T01:09:15.689126+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04517v1","created_at":"2026-06-04T01:09:15.689126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04517","created_at":"2026-06-04T01:09:15.689126+00:00"},{"alias_kind":"pith_short_12","alias_value":"IL7JW2YJ6PRH","created_at":"2026-06-04T01:09:15.689126+00:00"},{"alias_kind":"pith_short_16","alias_value":"IL7JW2YJ6PRHS775","created_at":"2026-06-04T01:09:15.689126+00:00"},{"alias_kind":"pith_short_8","alias_value":"IL7JW2YJ","created_at":"2026-06-04T01:09:15.689126+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/IL7JW2YJ6PRHS775ET6D7ERPJR","json":"https://pith.science/pith/IL7JW2YJ6PRHS775ET6D7ERPJR.json","graph_json":"https://pith.science/api/pith-number/IL7JW2YJ6PRHS775ET6D7ERPJR/graph.json","events_json":"https://pith.science/api/pith-number/IL7JW2YJ6PRHS775ET6D7ERPJR/events.json","paper":"https://pith.science/paper/IL7JW2YJ"},"agent_actions":{"view_html":"https://pith.science/pith/IL7JW2YJ6PRHS775ET6D7ERPJR","download_json":"https://pith.science/pith/IL7JW2YJ6PRHS775ET6D7ERPJR.json","view_paper":"https://pith.science/paper/IL7JW2YJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04517&json=true","fetch_graph":"https://pith.science/api/pith-number/IL7JW2YJ6PRHS775ET6D7ERPJR/graph.json","fetch_events":"https://pith.science/api/pith-number/IL7JW2YJ6PRHS775ET6D7ERPJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IL7JW2YJ6PRHS775ET6D7ERPJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IL7JW2YJ6PRHS775ET6D7ERPJR/action/storage_attestation","attest_author":"https://pith.science/pith/IL7JW2YJ6PRHS775ET6D7ERPJR/action/author_attestation","sign_citation":"https://pith.science/pith/IL7JW2YJ6PRHS775ET6D7ERPJR/action/citation_signature","submit_replication":"https://pith.science/pith/IL7JW2YJ6PRHS775ET6D7ERPJR/action/replication_record"}},"created_at":"2026-06-04T01:09:15.689126+00:00","updated_at":"2026-06-04T01:09:15.689126+00:00"}