{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6HUKGJYPTG54Q4KUT3HQV7RTML","short_pith_number":"pith:6HUKGJYP","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"},"canonical_sha256":"f1e8a3270f99bbc871549ecf0afe3362fdf1981b27ad80da482717365e5ec666","source":{"kind":"arxiv","id":"1806.02000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02000","created_at":"2026-05-18T00:14:03Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02000v1","created_at":"2026-05-18T00:14:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02000","created_at":"2026-05-18T00:14:03Z"},{"alias_kind":"pith_short_12","alias_value":"6HUKGJYPTG54","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HUKGJYPTG54Q4KU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HUKGJYP","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6HUKGJYPTG54Q4KUT3HQV7RTML","target":"record","payload":{"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"},"canonical_sha256":"f1e8a3270f99bbc871549ecf0afe3362fdf1981b27ad80da482717365e5ec666","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"},"source_kind":"arxiv","source_id":"1806.02000","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+lvgzBmHW4idiTVTjZMmDf7tpJ3+3iFlmuDzu+TpNTnK0cIloT+8thpvc/NCkEjggyKOzJgmzygHzUvnA0yaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T00:43:33.885688Z"},"content_sha256":"d077538179c63f2dd84ded33624c2e604eb5ca97f02f7b56ca5901b146119757","schema_version":"1.0","event_id":"sha256:d077538179c63f2dd84ded33624c2e604eb5ca97f02f7b56ca5901b146119757"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6HUKGJYPTG54Q4KUT3HQV7RTML","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FnGRDHIJyeSkZteI6J3tHMnYr/Vj+9FFjHyqZC1souYhgROa0wBBl4X9FTtyMPNz7OEwGGZSQESIZ1YkokSPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T00:43:33.886235Z"},"content_sha256":"9f6e93d0ae63ed3e9ab4b5bd7268453b6d31cc382d384ab7479079f642e72f19","schema_version":"1.0","event_id":"sha256:9f6e93d0ae63ed3e9ab4b5bd7268453b6d31cc382d384ab7479079f642e72f19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/bundle.json","state_url":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T00:43:33Z","links":{"resolver":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML","bundle":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/bundle.json","state":"https://pith.science/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HUKGJYPTG54Q4KUT3HQV7RTML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6HUKGJYPTG54Q4KUT3HQV7RTML","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"22498d2f672342023c0424a3fc2fa4271f25235fe31c565baafe41c5370ba967","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-06T04:00:08Z","title_canon_sha256":"ee9415140de904e13c74a7ac92022c08f6a251fd41542e47f345a6220fe9c7c8"},"schema_version":"1.0","source":{"id":"1806.02000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02000","created_at":"2026-05-18T00:14:03Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02000v1","created_at":"2026-05-18T00:14:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02000","created_at":"2026-05-18T00:14:03Z"},{"alias_kind":"pith_short_12","alias_value":"6HUKGJYPTG54","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HUKGJYPTG54Q4KU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HUKGJYP","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:9f6e93d0ae63ed3e9ab4b5bd7268453b6d31cc382d384ab7479079f642e72f19","target":"graph","created_at":"2026-05-18T00:14:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dimosthenis Anagnostopoulos, Moin Nadeem, Patrick Carretas, Vibhor Nigam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-06T04:00:08Z","title":"Automating Network Error Detection using Long-Short Term Memory Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02000","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d077538179c63f2dd84ded33624c2e604eb5ca97f02f7b56ca5901b146119757","target":"record","created_at":"2026-05-18T00:14:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"22498d2f672342023c0424a3fc2fa4271f25235fe31c565baafe41c5370ba967","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-06T04:00:08Z","title_canon_sha256":"ee9415140de904e13c74a7ac92022c08f6a251fd41542e47f345a6220fe9c7c8"},"schema_version":"1.0","source":{"id":"1806.02000","kind":"arxiv","version":1}},"canonical_sha256":"f1e8a3270f99bbc871549ecf0afe3362fdf1981b27ad80da482717365e5ec666","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1e8a3270f99bbc871549ecf0afe3362fdf1981b27ad80da482717365e5ec666","first_computed_at":"2026-05-18T00:14:03.056020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:03.056020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fm3VmhTrKE1XYyGzr3c0XElDRHzUdjcmqGRPxmPexYnf0YOzCFJ0+ABuVvy4cvTDzKxbvuMMi8UqXbMqrnTaAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:03.056728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d077538179c63f2dd84ded33624c2e604eb5ca97f02f7b56ca5901b146119757","sha256:9f6e93d0ae63ed3e9ab4b5bd7268453b6d31cc382d384ab7479079f642e72f19"],"state_sha256":"3db8f2769bdb679f4b81cf397cdd4efa9c7a8b68b841c31fbcafdd120d2dc3e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsE5/0erfdalQVu7Fu0qL5JMicSMgbeL47zNqE83gqNyHbAtiJ2JR4bmQorr/z6ywpEdYnklBjJka/bJEFD4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T00:43:33.888979Z","bundle_sha256":"6871b4bd79ed3dbda416763be7de1746394d8acce9d95603d627e3697a726edc"}}