{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6HUKGJYPTG54Q4KUT3HQV7RTML","short_pith_number":"pith:6HUKGJYP","schema_version":"1.0","canonical_sha256":"f1e8a3270f99bbc871549ecf0afe3362fdf1981b27ad80da482717365e5ec666","source":{"kind":"arxiv","id":"1806.02000","version":1},"attestation_state":"computed","paper":{"title":"Automating Network Error Detection using Long-Short Term Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dimosthenis Anagnostopoulos, Moin Nadeem, Patrick Carretas, Vibhor Nigam","submitted_at":"2018-06-06T04:00:08Z","abstract_excerpt":"In this work, we investigate the current flaws with identifying network-related errors, and examine how K-Means and Long-Short Term Memory Networks solve these problems. We demonstrate that K-Means is able to classify messages, but not necessary provide meaningful clusters. However, Long-Short Term Memory Networks are able to meet our goals of providing an intelligent clustering of messages by grouping messages that are temporally related. Additionally, Long-Short Term Memory Networks can provide the ability to understand and visualize temporal causality, which unlocks the ability to warn abou"},"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":"1806.02000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-06T04:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"ee9415140de904e13c74a7ac92022c08f6a251fd41542e47f345a6220fe9c7c8","abstract_canon_sha256":"22498d2f672342023c0424a3fc2fa4271f25235fe31c565baafe41c5370ba967"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:03.056728Z","signature_b64":"fm3VmhTrKE1XYyGzr3c0XElDRHzUdjcmqGRPxmPexYnf0YOzCFJ0+ABuVvy4cvTDzKxbvuMMi8UqXbMqrnTaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1e8a3270f99bbc871549ecf0afe3362fdf1981b27ad80da482717365e5ec666","last_reissued_at":"2026-05-18T00:14:03.056020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:03.056020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automating Network Error Detection using Long-Short Term Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dimosthenis Anagnostopoulos, Moin Nadeem, Patrick Carretas, Vibhor Nigam","submitted_at":"2018-06-06T04:00:08Z","abstract_excerpt":"In this work, we investigate the current flaws with identifying network-related errors, and examine how K-Means and Long-Short Term Memory Networks solve these problems. We demonstrate that K-Means is able to classify messages, but not necessary provide meaningful clusters. However, Long-Short Term Memory Networks are able to meet our goals of providing an intelligent clustering of messages by grouping messages that are temporally related. Additionally, Long-Short Term Memory Networks can provide the ability to understand and visualize temporal causality, which unlocks the ability to warn abou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02000","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":""},"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":"1806.02000","created_at":"2026-05-18T00:14:03.056135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02000v1","created_at":"2026-05-18T00:14:03.056135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02000","created_at":"2026-05-18T00:14:03.056135+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HUKGJYPTG54","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HUKGJYPTG54Q4KU","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HUKGJYP","created_at":"2026-05-18T12:32:08.215937+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/6HUKGJYPTG54Q4KUT3HQV7RTML","json":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML.json","graph_json":"https://pith.science/api/pith-number/6HUKGJYPTG54Q4KUT3HQV7RTML/graph.json","events_json":"https://pith.science/api/pith-number/6HUKGJYPTG54Q4KUT3HQV7RTML/events.json","paper":"https://pith.science/paper/6HUKGJYP"},"agent_actions":{"view_html":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML","download_json":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML.json","view_paper":"https://pith.science/paper/6HUKGJYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02000&json=true","fetch_graph":"https://pith.science/api/pith-number/6HUKGJYPTG54Q4KUT3HQV7RTML/graph.json","fetch_events":"https://pith.science/api/pith-number/6HUKGJYPTG54Q4KUT3HQV7RTML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/action/storage_attestation","attest_author":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/action/author_attestation","sign_citation":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/action/citation_signature","submit_replication":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/action/replication_record"}},"created_at":"2026-05-18T00:14:03.056135+00:00","updated_at":"2026-05-18T00:14:03.056135+00:00"}