{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5NMIEOU5EVMSXD3GDI7VRQEULA","short_pith_number":"pith:5NMIEOU5","canonical_record":{"source":{"id":"1602.04844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-15T21:26:34Z","cross_cats_sorted":[],"title_canon_sha256":"8806a3c56358a1a679b5b3d5ee89a1ec0d1b1f2fe6fe578fec0b08ccbf35b611","abstract_canon_sha256":"bb7178cd01f85ccec7d2d0cbcda8d7d4418e886a8ac47bd224903af823209777"},"schema_version":"1.0"},"canonical_sha256":"eb58823a9d25592b8f661a3f58c0945818fd575325c43e77cadd0904c0d88906","source":{"kind":"arxiv","id":"1602.04844","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04844","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04844v2","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04844","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"5NMIEOU5EVMS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5NMIEOU5EVMSXD3G","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5NMIEOU5","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5NMIEOU5EVMSXD3GDI7VRQEULA","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-15T21:26:34Z","cross_cats_sorted":[],"title_canon_sha256":"8806a3c56358a1a679b5b3d5ee89a1ec0d1b1f2fe6fe578fec0b08ccbf35b611","abstract_canon_sha256":"bb7178cd01f85ccec7d2d0cbcda8d7d4418e886a8ac47bd224903af823209777"},"schema_version":"1.0"},"canonical_sha256":"eb58823a9d25592b8f661a3f58c0945818fd575325c43e77cadd0904c0d88906","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:16.115615Z","signature_b64":"QibkpTNUH8sXggYvWNG2YFCavzemJRc4dwHpZHzEtALcD5Lu9SVEHZqp91nwejStR3k5m2/fZyanUsHiM7bMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb58823a9d25592b8f661a3f58c0945818fd575325c43e77cadd0904c0d88906","last_reissued_at":"2026-05-18T01:20:16.114974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:16.114974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04844","source_version":2,"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-18T01:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHWBmJzbEgG9LcrNBJU/1A2gvm/KDG7fVljqGWR2LvRseAsvej+9CCuDiUfg4P/IJkbTrt852mnAKxucTqpOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:37:56.739853Z"},"content_sha256":"81f2fa0e614e6bfc6183a0d197109381928f9ab7bc721f998ad7b1a57ad79f05","schema_version":"1.0","event_id":"sha256:81f2fa0e614e6bfc6183a0d197109381928f9ab7bc721f998ad7b1a57ad79f05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5NMIEOU5EVMSXD3GDI7VRQEULA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Emaad A. Manzoor, Leman Akoglu, Sadegh Momeni, Venkat N. Venkatakrishnan","submitted_at":"2016-02-15T21:26:34Z","abstract_excerpt":"Given a stream of heterogeneous graphs containing different types of nodes and edges, how can we spot anomalous ones in real-time while consuming bounded memory? This problem is motivated by and generalizes from its application in security to host-level advanced persistent threat (APT) detection. We propose StreamSpot, a clustering based anomaly detection approach that addresses challenges in two key fronts: (1) heterogeneity, and (2) streaming nature. We introduce a new similarity function for heterogeneous graphs that compares two graphs based on their relative frequency of local substructur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04844","kind":"arxiv","version":2},"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-18T01:20:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LDx3I3bmW45O09tC3GPwuFfnRYkZm6O+/Fx2OSxkenY/pxYbJAkcCwwe8+UBUK0Scnxg6Hf4xd8W0pErdaZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:37:56.740211Z"},"content_sha256":"de7ee3e166d04970a1062e6ec55f0937fe8a16a2ac2bf79fc56acb021e951269","schema_version":"1.0","event_id":"sha256:de7ee3e166d04970a1062e6ec55f0937fe8a16a2ac2bf79fc56acb021e951269"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NMIEOU5EVMSXD3GDI7VRQEULA/bundle.json","state_url":"https://pith.science/pith/5NMIEOU5EVMSXD3GDI7VRQEULA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NMIEOU5EVMSXD3GDI7VRQEULA/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-02T21:37:56Z","links":{"resolver":"https://pith.science/pith/5NMIEOU5EVMSXD3GDI7VRQEULA","bundle":"https://pith.science/pith/5NMIEOU5EVMSXD3GDI7VRQEULA/bundle.json","state":"https://pith.science/pith/5NMIEOU5EVMSXD3GDI7VRQEULA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NMIEOU5EVMSXD3GDI7VRQEULA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5NMIEOU5EVMSXD3GDI7VRQEULA","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":"bb7178cd01f85ccec7d2d0cbcda8d7d4418e886a8ac47bd224903af823209777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-15T21:26:34Z","title_canon_sha256":"8806a3c56358a1a679b5b3d5ee89a1ec0d1b1f2fe6fe578fec0b08ccbf35b611"},"schema_version":"1.0","source":{"id":"1602.04844","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04844","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04844v2","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04844","created_at":"2026-05-18T01:20:16Z"},{"alias_kind":"pith_short_12","alias_value":"5NMIEOU5EVMS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5NMIEOU5EVMSXD3G","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5NMIEOU5","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:de7ee3e166d04970a1062e6ec55f0937fe8a16a2ac2bf79fc56acb021e951269","target":"graph","created_at":"2026-05-18T01:20:16Z","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":"Given a stream of heterogeneous graphs containing different types of nodes and edges, how can we spot anomalous ones in real-time while consuming bounded memory? This problem is motivated by and generalizes from its application in security to host-level advanced persistent threat (APT) detection. We propose StreamSpot, a clustering based anomaly detection approach that addresses challenges in two key fronts: (1) heterogeneity, and (2) streaming nature. We introduce a new similarity function for heterogeneous graphs that compares two graphs based on their relative frequency of local substructur","authors_text":"Emaad A. Manzoor, Leman Akoglu, Sadegh Momeni, Venkat N. Venkatakrishnan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-15T21:26:34Z","title":"Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04844","kind":"arxiv","version":2},"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:81f2fa0e614e6bfc6183a0d197109381928f9ab7bc721f998ad7b1a57ad79f05","target":"record","created_at":"2026-05-18T01:20:16Z","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":"bb7178cd01f85ccec7d2d0cbcda8d7d4418e886a8ac47bd224903af823209777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-15T21:26:34Z","title_canon_sha256":"8806a3c56358a1a679b5b3d5ee89a1ec0d1b1f2fe6fe578fec0b08ccbf35b611"},"schema_version":"1.0","source":{"id":"1602.04844","kind":"arxiv","version":2}},"canonical_sha256":"eb58823a9d25592b8f661a3f58c0945818fd575325c43e77cadd0904c0d88906","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb58823a9d25592b8f661a3f58c0945818fd575325c43e77cadd0904c0d88906","first_computed_at":"2026-05-18T01:20:16.114974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:16.114974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QibkpTNUH8sXggYvWNG2YFCavzemJRc4dwHpZHzEtALcD5Lu9SVEHZqp91nwejStR3k5m2/fZyanUsHiM7bMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:16.115615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04844","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81f2fa0e614e6bfc6183a0d197109381928f9ab7bc721f998ad7b1a57ad79f05","sha256:de7ee3e166d04970a1062e6ec55f0937fe8a16a2ac2bf79fc56acb021e951269"],"state_sha256":"e2abfc1b9f80f170b696b30d1fca9de1d1319f7e05b460b596f46757fed090fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4HFeBICsXee7dWTUtExiuI5HGjz6dtyzSlsFJmP48wtYFuzxM1iKuHjpxLuC2lPmKwP9hnxFOpTgMEH5s8JCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:37:56.742379Z","bundle_sha256":"0569bd9543a3362cada7bffe2bb6830b08768b229e53a8aa1a631e3da2eec501"}}