{"as_of":"2026-08-07T07:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:89068c353c8ca5515ffc6d7ebefac3c912fc17a07f1a35ae3ff41ee62c02ab12","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T04:25:27.524541Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.04517/citation-record","integrity":"/paper/2606.04517/integrity","json":"/paper/2606.04517/citation-record.json","paper":"/paper/2606.04517"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"A survey on encrypted network traffic analysis applications, techniques, and countermeasures,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:e29dbac87c8d73ae95dc41664678429b77acf6e0596a7f1c61333c71e7662797","observation_id":"5adc616e-e7c4-4f7b-9da9-a30735812bd5","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"A comprehensive symbolic analysis of tls 1.3,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:1b50643fc9951b7cac5dedfd2458b7f3c18e2537493e1e485a77ba1b0fc8d984","observation_id":"c38ab2cd-97c5-4c6c-8a77-6a04c9c1eff0","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"A symbolic analysis of privacy for tls 1.3 with encrypted client hello,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:80fad2c460474c9e2921c70ce5be02f0c50cb2ff684f404988133968c6cb71ba","observation_id":"fe34d28d-fd29-4d5e-90cb-2a73bbe90e68","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"The Transport Layer Security (TLS) Protocol Version 1.3,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:2f0976f44ef8d19a5d1413cc1ab190cd9f278a3afd5eea9308ae991a7685b96e","observation_id":"e563e831-88f6-44e2-9fea-3ad68b347c8d","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Gspb: a global-statistic and packet-byte fusion framework for encrypted traffic classification,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:6c28a8c27efce9e9254fb879ea1aca789874d0c5b398a7acfc4ba0a1d8b79acf","observation_id":"cf0a1132-cc3d-4ec8-8fa9-1031b28bbd63","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Attention-guided multi-view feature fusion for proxy traffic classification,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:c6b352c43fe64efab74725c5fe8fb75110112ad3f42066281d540f5d931b6275","observation_id":"c9ec97d2-a117-4c30-a191-dfc258bba6ed","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Graph attention networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:18b8f3b2ceac96c3e8ed9406fd753555786b60e21569038e80200717490517ed","observation_id":"22b95e9c-a325-43c6-997e-790b723fbd4b","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Accurate compressed traffic detection via traffic analysis using graph convolutional network based on graph structure feature,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:9f79fef39f77b4ae60cf8375df9453fceef2409dfcf6e203063331699995f949","observation_id":"4c6ca564-7f3d-46a5-9ff2-d614dfc2f0f4","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Adding information to the dissection tree,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:b9fe76fcad304466001bdcd24fb43c0e7cc8fbb83a8f3060e2dbeb582b1a78b3","observation_id":"984f4ce3-8898-4590-b36f-d7f34348e6f1","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"A survey on mixture of experts in large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:dad7f67c0987b22562c869350ad17638aafc74eafde2bcd59f8648a238f68302","observation_id":"abc22946-f96b-47c0-8571-9a1a0c06ba9a","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Kitsune: An ensemble of autoencoders for online network intrusion detection,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:a45a8dbd4426cd684a1a84a6223c750bb0da2f5fca37645153caae4ad79120b1","observation_id":"500b2294-f909-4dfc-aaf6-c75e3e04a593","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:ba0a247c561fb371473168b2ce28621bfc4419caaa727018ce7cff6409036019","observation_id":"f7da80df-2d03-4747-ba89-12b6517b294f","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Fs-net: A flow sequence network for encrypted traffic classification,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:ab4dc604e6afd12951421ebb82452bc6a3e77b098c095dc4ceff4bb0d1f14571","observation_id":"71683b02-bc8d-4137-81bb-74bd1156ca33","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Et-bert: A contextualized datagram representation with pre-training transformers for encrypted traffic classification,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:99d9c40a08f837816e83a976f4f9fa2ad4c248a85652559a345c141080421225","observation_id":"24ec1d3b-e380-4c62-ac5c-d4f464357e8b","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Yet another traffic classifier: A masked autoencoder based traffic transformer with multi-level flow representation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:e89a772d7d65dcf4cae882dc2f406aa949244e96d404c7f35fe8d1bded4cd1ae","observation_id":"9bf0d0ee-776e-4289-a6a6-5694ebfdf333","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Trafficformer: an efficient pre-trained model for traffic data,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:930879ef22970a2af61226cea46040add9c18be81b55cc33d0f594d85e8b15e4","observation_id":"2b8fd1bd-6180-4dc7-b91c-1c588053e44f","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Realistic website fingerprinting by augmenting network traces,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:3828b6f369d7f59cd1f5c38268b9bf6de8291eccac30b50590678b4eebfb23a7","observation_id":"d664fde2-8371-465f-be7b-a7a0624d6d61","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Detecting tunneled flooding traffic via deep semantic analysis of packet length patterns,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:efdbc2cabc7eadc761eb8485681c8369a61ed69f3c92708490ba2ba51a7ebcd8","observation_id":"8a32e339-49ef-43a5-b32f-284610aef3ad","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"You do (not) belong here: detecting dpi evasion attacks with context learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:fe66a4c0d00450d42ec6348198af4fd3875779cdc68681c68784414628484516","observation_id":"dba80bea-a428-4325-b4ae-7be88c9f227c","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Tantra: Timing-based adversarial network traffic reshaping attack,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:c56123a82877ca9cdee486984a5c1b35890adb9d84888ddc5f59f612531d01b0","observation_id":"6e9817ec-c728-4a66-80fa-4a3fa552dfce","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Rbljan: Robust byte-label joint attention network for network traffic classification,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:1fd8dff94c6c81c60d1055d0e99c68283a55e037284d304f04767ad11e59bb89","observation_id":"b8ce2751-e346-4755-848d-e566784342c3","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Dgnn: Accurate darknet application classification adopting attention graph neural network,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:1e1c1986193f30f5545458731f17d5242b5a52853dafc0b0d9bbb39cb896dff1","observation_id":"1ab8282b-4ec4-4f2a-8ac5-868693f9dee8","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Flow-based encrypted network traffic classification with graph neural networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:c0710c330c0880718423e7101d65453931219dae12a769a22f8bb5299e8203b1","observation_id":"f2829323-aa3e-411c-9530-301b492e3362","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Dual-channel interactive graph transformer for traffic classification with message-aware flow JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2021 13 representation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:169674418e6c23e32975f23894fdbec088a40e83832727ec33e58b76fa180980","observation_id":"0a601045-9274-4739-a46f-241ecbe15327","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20534","last_updated":"2026-02-03T04:57:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-28T05:35:43Z","title":"Kimi K2: Open Agentic Intelligence","version":2},"cited_work":{"arxiv_id":"2507.20534","doi":"10.1145/3448609","metadata_source":"pith","pith_arxiv_id":"2507.20534","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kimi K2: Open Agentic Intelligence","venue":"cs.LG","work_id":"7f18284c-12d3-4137-bea1-1da97e8cf3c1","year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"cited_paper":"/paper/2507.20534","citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:4d5b2e83b829558e944fa54ce074f39e6abedcbace52139ff7514873571b8626","observation_id":"b3b2ce85-2313-4966-97c1-b2c5a9ecc103","resolution":{"observed_at":"2026-07-02T11:16:53.080213Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-05-25T01:23:16.170083+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T01:23:16.170083+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Scaling vision with sparse mixture of experts,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:ee211011303fd88dd32c12ded745a48c0d0f47bd42fdfbf30ed1901b5a6dc65a","observation_id":"44ddd250-24f9-44ff-a947-f9e864b73f39","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07608","last_updated":"2025-06-05T11:49:09Z","snapshot_observed_at":"2026-07-06T21:22:35.652600Z","submitted_at":"2025-05-12T14:30:11Z","title":"MiMo: Unlocking the Reasoning Potential of Language Model -- From Pretraining to Posttraining","version":2},"cited_work":{"arxiv_id":"2505.07608","doi":"10.48550/arxiv.2505.07608","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.07608","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"MiMo: Unlocking the reasoning potential of language model–from pretraining to posttraining","venue":"ArXiv.org","work_id":"c6dfcaff-bd30-4b3d-a25f-f9a09176940c","year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"cited_paper":"/paper/2505.07608","citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:8feaaa44fadad98ec28019b5dc274f7101050d0db4570599406a74b9dff5b8ee","observation_id":"141466a4-7172-459c-869a-497992832f3f","resolution":{"observed_at":"2026-07-02T11:16:53.080348Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.21631","last_updated":"2025-11-27T12:16:54Z","snapshot_observed_at":"2026-07-06T22:37:03.716474Z","submitted_at":"2025-11-26T17:59:08Z","title":"Qwen3-VL Technical Report","version":2},"cited_work":{"arxiv_id":"2511.21631","doi":"10.1016/j.neunet.2025.107777","metadata_source":"pith","pith_arxiv_id":"2511.21631","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen3-VL Technical Report","venue":"cs.CV","work_id":"1fe243aa-e3c0-4da6-b391-4cbcfc88d5c0","year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"cited_paper":"/paper/2511.21631","citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:7c35b7c0360e46be0cfe068c35c44fcbfdadb00024119be599ef5aecb0dd9cd7","observation_id":"489cc917-79c6-4554-a753-b5fad982540b","resolution":{"observed_at":"2026-07-02T11:16:53.083011Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:75c928d1b056d80c612e7f75420772142002c3430cfb36338ef94b87eff54cde","observation_id":"3076f3ab-520a-42af-b747-6bdd6dcc6554","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Time-moe: Billion-scale time series foundation models with mixture of experts,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:b5a0a2556e3f96c4b07e5270a29a567bb860c92a6a0be01045f6754e0ac2c4da","observation_id":"13a799c5-4476-487b-91be-02bd247ab312","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Moirai-moe: Empowering time series foundation models with sparse mixture of experts,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:be1ad70eab16bd262af7ceec45c9e754a4c09f78b281bb14314a6fcf2e1f67dc","observation_id":"5499d29d-3da4-4815-8c0d-4d359305d2bc","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Cl-vime: Contrastive learning and vision mixture of experts for encrypted traffic classifica- tion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:01a78d3e9f4fc16f2b4b10d92e416995335b6b369705ca92405290d8da9b00d8","observation_id":"479b9da5-f860-448d-9fe0-64079023299f","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Sok: Decoding the enigma of encrypted network traffic classifiers,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:2429e806b6dd7cb28ee98a9bc96ff1caac2ebbd558507d729da7285aaaf6637c","observation_id":"e262056c-627d-4a81-b1cc-a32041796026","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"The sweet danger of sugar: Debunking representation learning for encrypted traffic classification,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:4f1b7a07dae95ada08f313fe311897b62baa2cf4dc1413d7b5484fc2c12fe00b","observation_id":"da94d654-0447-4cfa-9610-aa2874dd75f7","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T04:25:27.524541Z","title":"Accelerating distributed dlrm training with optimized tt decomposition and micro- batching,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T04:25:27.524541Z"},"links":{"citing_paper":"/paper/2606.04517"},"observation_digest":"sha256:f92640482284f3367bb41a1c75fc59bccaa1e334eadcd955f0e9ec988beca68d","observation_id":"d12ddd79-9847-411e-8518-38249ef201ef","resolution":{"observed_at":"2026-06-28T04:25:27.524541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.04517","last_updated":"2026-06-03T06:52:29Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-03T05:27:47.106136Z","submitted_at":"2026-06-03T06:52:29Z","title":"Treat Traffic Like Trees: A Semantic-Preserving Hierarchical Graph-Based Expert Framework for Encrypted Traffic Analysis"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2606.04517."}