{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H5Q2TBUHJMAAAHD4OE47NN7YZE","short_pith_number":"pith:H5Q2TBUH","schema_version":"1.0","canonical_sha256":"3f61a986874b00001c7c7139f6b7f8c93a86cbf7e98279398a03df7050d4c0d8","source":{"kind":"arxiv","id":"2409.08111","version":1},"attestation_state":"computed","paper":{"title":"Towards a graph-based foundation model for network traffic analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CR","cs.NI"],"primary_cat":"cs.LG","authors_text":"Ismael Castell-Uroz, Louis Van Langendonck, Pere Barlet-Ros","submitted_at":"2024-09-12T15:04:34Z","abstract_excerpt":"Foundation models have shown great promise in various fields of study. A potential application of such models is in computer network traffic analysis, where these models can grasp the complexities of network traffic dynamics and adapt to any specific task or network environment with minimal fine-tuning. Previous approaches have used tokenized hex-level packet data and the model architecture of large language transformer models. We propose a new, efficient graph-based alternative at the flow-level. Our approach represents network traffic as a dynamic spatio-temporal graph, employing a self-supe"},"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":"2409.08111","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-12T15:04:34Z","cross_cats_sorted":["cs.AI","cs.CR","cs.NI"],"title_canon_sha256":"e620eaa05bf7301b7c84d36378b6dabc0f9443f6e7f64a6284cf333d6ff736e2","abstract_canon_sha256":"5e764eb42fd9ee814a2da65afa328e71dfa7a5391b7bcc82e93517921301531a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:20.343302Z","signature_b64":"5AONBCxYOBe+2fpTLxtyl28aCkSZwy8mujpBFdG7D8Dl/vtAJAb1PXbMvVb+KrkWdiTNTZuf4hgoT7vPRECGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f61a986874b00001c7c7139f6b7f8c93a86cbf7e98279398a03df7050d4c0d8","last_reissued_at":"2026-07-05T09:06:20.342906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:20.342906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a graph-based foundation model for network traffic analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CR","cs.NI"],"primary_cat":"cs.LG","authors_text":"Ismael Castell-Uroz, Louis Van Langendonck, Pere Barlet-Ros","submitted_at":"2024-09-12T15:04:34Z","abstract_excerpt":"Foundation models have shown great promise in various fields of study. A potential application of such models is in computer network traffic analysis, where these models can grasp the complexities of network traffic dynamics and adapt to any specific task or network environment with minimal fine-tuning. Previous approaches have used tokenized hex-level packet data and the model architecture of large language transformer models. We propose a new, efficient graph-based alternative at the flow-level. Our approach represents network traffic as a dynamic spatio-temporal graph, employing a self-supe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08111","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/2409.08111/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":"2409.08111","created_at":"2026-07-05T09:06:20.342960+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.08111v1","created_at":"2026-07-05T09:06:20.342960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08111","created_at":"2026-07-05T09:06:20.342960+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5Q2TBUHJMAA","created_at":"2026-07-05T09:06:20.342960+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5Q2TBUHJMAAAHD4","created_at":"2026-07-05T09:06:20.342960+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5Q2TBUH","created_at":"2026-07-05T09:06:20.342960+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09084","citing_title":"Application of Tabular Transformer Architectures for Operating System Fingerprinting","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE","json":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE.json","graph_json":"https://pith.science/api/pith-number/H5Q2TBUHJMAAAHD4OE47NN7YZE/graph.json","events_json":"https://pith.science/api/pith-number/H5Q2TBUHJMAAAHD4OE47NN7YZE/events.json","paper":"https://pith.science/paper/H5Q2TBUH"},"agent_actions":{"view_html":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE","download_json":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE.json","view_paper":"https://pith.science/paper/H5Q2TBUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.08111&json=true","fetch_graph":"https://pith.science/api/pith-number/H5Q2TBUHJMAAAHD4OE47NN7YZE/graph.json","fetch_events":"https://pith.science/api/pith-number/H5Q2TBUHJMAAAHD4OE47NN7YZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE/action/storage_attestation","attest_author":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE/action/author_attestation","sign_citation":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE/action/citation_signature","submit_replication":"https://pith.science/pith/H5Q2TBUHJMAAAHD4OE47NN7YZE/action/replication_record"}},"created_at":"2026-07-05T09:06:20.342960+00:00","updated_at":"2026-07-05T09:06:20.342960+00:00"}