{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ACDB4EXCH7T5OBV4MSVZNJ3D42","short_pith_number":"pith:ACDB4EXC","canonical_record":{"source":{"id":"1309.5803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-20T14:38:01Z","cross_cats_sorted":["cs.DC","cs.SY","math.OC"],"title_canon_sha256":"1fb3898e4f92f5234f723cf3e7638cb787459c312bceb0b6679acd7ff17f56c3","abstract_canon_sha256":"a0b5f095d2dd015c370298590ac7f0e2b7a3b0e1bc84162e967d971055a5e6b6"},"schema_version":"1.0"},"canonical_sha256":"00861e12e23fe7d706bc64ab96a763e6b5b7ce08f1d01d28bb5ed11823a56b73","source":{"kind":"arxiv","id":"1309.5803","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5803","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5803v1","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5803","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"ACDB4EXCH7T5","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ACDB4EXCH7T5OBV4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ACDB4EXC","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ACDB4EXCH7T5OBV4MSVZNJ3D42","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-20T14:38:01Z","cross_cats_sorted":["cs.DC","cs.SY","math.OC"],"title_canon_sha256":"1fb3898e4f92f5234f723cf3e7638cb787459c312bceb0b6679acd7ff17f56c3","abstract_canon_sha256":"a0b5f095d2dd015c370298590ac7f0e2b7a3b0e1bc84162e967d971055a5e6b6"},"schema_version":"1.0"},"canonical_sha256":"00861e12e23fe7d706bc64ab96a763e6b5b7ce08f1d01d28bb5ed11823a56b73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:34.116147Z","signature_b64":"0JDmL6ZraCAUdaQ4x9OGEKgD+YTp0O9L2h65X5lZkLmUKc6z/nCBIy84GcYTHFUgek0dOEwE+f4ZsBt2juM2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00861e12e23fe7d706bc64ab96a763e6b5b7ce08f1d01d28bb5ed11823a56b73","last_reissued_at":"2026-05-18T03:12:34.115474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:34.115474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5803","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-18T03:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cB/JT8XusFuNjIeFX0AXKTWRbAKS8kgu3QJvvv/vjVU5Iy6DRpogtq3nkqa6fwiTMdNRbSs53jJyzbO0E0+1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:11:39.448674Z"},"content_sha256":"d3adc8ddf7cbf36ee48572683cac73006dd181409054bf6d3cf7bda1df3c8976","schema_version":"1.0","event_id":"sha256:d3adc8ddf7cbf36ee48572683cac73006dd181409054bf6d3cf7bda1df3c8976"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ACDB4EXCH7T5OBV4MSVZNJ3D42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Anomaly Detection in Large Homogenous Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY","math.OC"],"primary_cat":"cs.LG","authors_text":"Henrik Ohlsson, Lennart Ljung, Sina Khoshfetrat Pakazad, S. Shankar Sastry, Tianshi Chen","submitted_at":"2013-09-20T14:38:01Z","abstract_excerpt":"Anomaly detection in large populations is a challenging but highly relevant problem. The problem is essentially a multi-hypothesis problem, with a hypothesis for every division of the systems into normal and anomal systems. The number of hypothesis grows rapidly with the number of systems and approximate solutions become a necessity for any problems of practical interests. In the current paper we take an optimization approach to this multi-hypothesis problem. We first observe that the problem is equivalent to a non-convex combinatorial optimization problem. We then relax the problem to a conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5803","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-18T03:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KotWg9UhQwU4zeCGK6WTikH5gEzDydA8Pki74sbCHKqPkJBgv4Elm77JSaISRgNjs9ES94YK+6zHwGypAhbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:11:39.449334Z"},"content_sha256":"40f28431d4e301962180daa21981e7c830d8be12b169f07fe8275612c717f2a9","schema_version":"1.0","event_id":"sha256:40f28431d4e301962180daa21981e7c830d8be12b169f07fe8275612c717f2a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACDB4EXCH7T5OBV4MSVZNJ3D42/bundle.json","state_url":"https://pith.science/pith/ACDB4EXCH7T5OBV4MSVZNJ3D42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACDB4EXCH7T5OBV4MSVZNJ3D42/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-05-27T10:11:39Z","links":{"resolver":"https://pith.science/pith/ACDB4EXCH7T5OBV4MSVZNJ3D42","bundle":"https://pith.science/pith/ACDB4EXCH7T5OBV4MSVZNJ3D42/bundle.json","state":"https://pith.science/pith/ACDB4EXCH7T5OBV4MSVZNJ3D42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACDB4EXCH7T5OBV4MSVZNJ3D42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ACDB4EXCH7T5OBV4MSVZNJ3D42","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":"a0b5f095d2dd015c370298590ac7f0e2b7a3b0e1bc84162e967d971055a5e6b6","cross_cats_sorted":["cs.DC","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-20T14:38:01Z","title_canon_sha256":"1fb3898e4f92f5234f723cf3e7638cb787459c312bceb0b6679acd7ff17f56c3"},"schema_version":"1.0","source":{"id":"1309.5803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5803","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5803v1","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5803","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"ACDB4EXCH7T5","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ACDB4EXCH7T5OBV4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ACDB4EXC","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:40f28431d4e301962180daa21981e7c830d8be12b169f07fe8275612c717f2a9","target":"graph","created_at":"2026-05-18T03:12:34Z","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":"Anomaly detection in large populations is a challenging but highly relevant problem. The problem is essentially a multi-hypothesis problem, with a hypothesis for every division of the systems into normal and anomal systems. The number of hypothesis grows rapidly with the number of systems and approximate solutions become a necessity for any problems of practical interests. In the current paper we take an optimization approach to this multi-hypothesis problem. We first observe that the problem is equivalent to a non-convex combinatorial optimization problem. We then relax the problem to a conve","authors_text":"Henrik Ohlsson, Lennart Ljung, Sina Khoshfetrat Pakazad, S. Shankar Sastry, Tianshi Chen","cross_cats":["cs.DC","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-20T14:38:01Z","title":"Scalable Anomaly Detection in Large Homogenous Populations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5803","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:d3adc8ddf7cbf36ee48572683cac73006dd181409054bf6d3cf7bda1df3c8976","target":"record","created_at":"2026-05-18T03:12:34Z","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":"a0b5f095d2dd015c370298590ac7f0e2b7a3b0e1bc84162e967d971055a5e6b6","cross_cats_sorted":["cs.DC","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-20T14:38:01Z","title_canon_sha256":"1fb3898e4f92f5234f723cf3e7638cb787459c312bceb0b6679acd7ff17f56c3"},"schema_version":"1.0","source":{"id":"1309.5803","kind":"arxiv","version":1}},"canonical_sha256":"00861e12e23fe7d706bc64ab96a763e6b5b7ce08f1d01d28bb5ed11823a56b73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00861e12e23fe7d706bc64ab96a763e6b5b7ce08f1d01d28bb5ed11823a56b73","first_computed_at":"2026-05-18T03:12:34.115474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:34.115474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0JDmL6ZraCAUdaQ4x9OGEKgD+YTp0O9L2h65X5lZkLmUKc6z/nCBIy84GcYTHFUgek0dOEwE+f4ZsBt2juM2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:34.116147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3adc8ddf7cbf36ee48572683cac73006dd181409054bf6d3cf7bda1df3c8976","sha256:40f28431d4e301962180daa21981e7c830d8be12b169f07fe8275612c717f2a9"],"state_sha256":"7285b6a5a287dca71d9ed84dd327214a485e3afecb740d7e1db01cd47a1185ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5JBsR901XjPkFpjU1m49qaX3IcQU6ki/5LZY8CZLcGf8ierBKB5AM+lbwhkfJTad5ZxzdjvaGNL5ARdbMTDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:11:39.453460Z","bundle_sha256":"3d6bba4b1db25ff83009aee19268d1108a9c75ae2851444c751f55ef0ac10a1a"}}