{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IK3RLMFLQUTOQKT3BCO7URKHL3","short_pith_number":"pith:IK3RLMFL","schema_version":"1.0","canonical_sha256":"42b715b0ab8526e82a7b089dfa45475ef7d3bb873b3d2ee8c4bc8537b2a6a65c","source":{"kind":"arxiv","id":"1503.02332","version":1},"attestation_state":"computed","paper":{"title":"Robust Anomaly Detection in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.NI","authors_text":"Ioannis Ch. Paschalidis, Jing Wang","submitted_at":"2015-03-08T22:14:02Z","abstract_excerpt":"We propose two robust methods for anomaly detection in dynamic networks in which the properties of normal traffic are time-varying. We formulate the robust anomaly detection problem as a binary composite hypothesis testing problem and propose two methods: a model-free and a model-based one, leveraging techniques from the theory of large deviations. Both methods require a family of Probability Laws (PLs) that represent normal properties of traffic. We devise a two-step procedure to estimate this family of PLs. We compare the performance of our robust methods and their vanilla counterparts, whic"},"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":"1503.02332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-08T22:14:02Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"97baea30430d6126004829b5d91ff52af9ec845f2885c06b22a609e265f8c8b8","abstract_canon_sha256":"475cff4d66cc91aabfed192cca4493eb97f76af9604fe4fec16d7e8103906b3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:25.346848Z","signature_b64":"Y48A0Sl9b2CQIIqgvLgz/NZDcMKJ5dg1T9Bsj9vmVGH0zaxKtw+cvctUAuCl6bbO5odNDi6vkSj+Uc9PGtzKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b715b0ab8526e82a7b089dfa45475ef7d3bb873b3d2ee8c4bc8537b2a6a65c","last_reissued_at":"2026-05-18T02:25:25.346420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:25.346420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Anomaly Detection in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.NI","authors_text":"Ioannis Ch. Paschalidis, Jing Wang","submitted_at":"2015-03-08T22:14:02Z","abstract_excerpt":"We propose two robust methods for anomaly detection in dynamic networks in which the properties of normal traffic are time-varying. We formulate the robust anomaly detection problem as a binary composite hypothesis testing problem and propose two methods: a model-free and a model-based one, leveraging techniques from the theory of large deviations. Both methods require a family of Probability Laws (PLs) that represent normal properties of traffic. We devise a two-step procedure to estimate this family of PLs. We compare the performance of our robust methods and their vanilla counterparts, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02332","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":"1503.02332","created_at":"2026-05-18T02:25:25.346487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02332v1","created_at":"2026-05-18T02:25:25.346487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02332","created_at":"2026-05-18T02:25:25.346487+00:00"},{"alias_kind":"pith_short_12","alias_value":"IK3RLMFLQUTO","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IK3RLMFLQUTOQKT3","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IK3RLMFL","created_at":"2026-05-18T12:29:25.134429+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/IK3RLMFLQUTOQKT3BCO7URKHL3","json":"https://pith.science/pith/IK3RLMFLQUTOQKT3BCO7URKHL3.json","graph_json":"https://pith.science/api/pith-number/IK3RLMFLQUTOQKT3BCO7URKHL3/graph.json","events_json":"https://pith.science/api/pith-number/IK3RLMFLQUTOQKT3BCO7URKHL3/events.json","paper":"https://pith.science/paper/IK3RLMFL"},"agent_actions":{"view_html":"https://pith.science/pith/IK3RLMFLQUTOQKT3BCO7URKHL3","download_json":"https://pith.science/pith/IK3RLMFLQUTOQKT3BCO7URKHL3.json","view_paper":"https://pith.science/paper/IK3RLMFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02332&json=true","fetch_graph":"https://pith.science/api/pith-number/IK3RLMFLQUTOQKT3BCO7URKHL3/graph.json","fetch_events":"https://pith.science/api/pith-number/IK3RLMFLQUTOQKT3BCO7URKHL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IK3RLMFLQUTOQKT3BCO7URKHL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IK3RLMFLQUTOQKT3BCO7URKHL3/action/storage_attestation","attest_author":"https://pith.science/pith/IK3RLMFLQUTOQKT3BCO7URKHL3/action/author_attestation","sign_citation":"https://pith.science/pith/IK3RLMFLQUTOQKT3BCO7URKHL3/action/citation_signature","submit_replication":"https://pith.science/pith/IK3RLMFLQUTOQKT3BCO7URKHL3/action/replication_record"}},"created_at":"2026-05-18T02:25:25.346487+00:00","updated_at":"2026-05-18T02:25:25.346487+00:00"}