{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PRHZLK3ZGQHZCW67VC2ELBVH4P","short_pith_number":"pith:PRHZLK3Z","canonical_record":{"source":{"id":"1610.00054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T23:13:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"72c90342ffecb90bde91debd33c0279a72b99932feb09d9cbe3942d4a392bdd7","abstract_canon_sha256":"c6317a2f3f4c9a468d1e1a6b6215f0ed77a2dae20d1b8322b99ca1f142c51ae4"},"schema_version":"1.0"},"canonical_sha256":"7c4f95ab79340f915bdfa8b44586a7e3dd01756a163c10181d40f3874969345b","source":{"kind":"arxiv","id":"1610.00054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00054","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00054v1","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00054","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"PRHZLK3ZGQHZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRHZLK3ZGQHZCW67","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRHZLK3Z","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PRHZLK3ZGQHZCW67VC2ELBVH4P","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T23:13:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"72c90342ffecb90bde91debd33c0279a72b99932feb09d9cbe3942d4a392bdd7","abstract_canon_sha256":"c6317a2f3f4c9a468d1e1a6b6215f0ed77a2dae20d1b8322b99ca1f142c51ae4"},"schema_version":"1.0"},"canonical_sha256":"7c4f95ab79340f915bdfa8b44586a7e3dd01756a163c10181d40f3874969345b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:32.025040Z","signature_b64":"G9rT8OpWYvo7W8/G4gYcCAmcFrLqZTTtvZrn8LbUdljwrLgLLsDiaC6oOOFDeD3L4XygPcfCo7RcjWDrjS5wBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c4f95ab79340f915bdfa8b44586a7e3dd01756a163c10181d40f3874969345b","last_reissued_at":"2026-05-18T01:03:32.024409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:32.024409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00054","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-18T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJuOizqurPKsscKBGl1FlWuKQd4GHOzWgfrhf3WuXl6E+igdSer4iNXeSRpqFug0obcXz9hVF6sw4ZEubj68Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:33:20.916597Z"},"content_sha256":"e312245e8f030235a1712b2e4cd376840e90dd924f242fa0de728099cbe03dda","schema_version":"1.0","event_id":"sha256:e312245e8f030235a1712b2e4cd376840e90dd924f242fa0de728099cbe03dda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PRHZLK3ZGQHZCW67VC2ELBVH4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Outlier Detection from Network Data with Subnetwork Interpretation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Ambuj Singh, Ananthram Swami, Arlei Silva, Prithwish Basu, Xuan-Hong Dang","submitted_at":"2016-09-30T23:13:28Z","abstract_excerpt":"Detecting a small number of outliers from a set of data observations is always challenging. This problem is more difficult in the setting of multiple network samples, where computing the anomalous degree of a network sample is generally not sufficient. In fact, explaining why the network is exceptional, expressed in the form of subnetwork, is also equally important. In this paper, we develop a novel algorithm to address these two key problems. We treat each network sample as a potential outlier and identify subnetworks that mostly discriminate it from nearby regular samples. The algorithm is d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00054","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-18T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOvWVSXugfIQi0hwkbqjf8lvucEt00pAROWdNzhFaKkZCKzJct9EpzMeHvkwrbyn8eUdqIPZfeZTtiOooT64BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:33:20.917352Z"},"content_sha256":"5a28b1037e3069a130449fa952b84ef8afc0b2275135b1ced690a77964b10fde","schema_version":"1.0","event_id":"sha256:5a28b1037e3069a130449fa952b84ef8afc0b2275135b1ced690a77964b10fde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PRHZLK3ZGQHZCW67VC2ELBVH4P/bundle.json","state_url":"https://pith.science/pith/PRHZLK3ZGQHZCW67VC2ELBVH4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PRHZLK3ZGQHZCW67VC2ELBVH4P/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-19T08:33:20Z","links":{"resolver":"https://pith.science/pith/PRHZLK3ZGQHZCW67VC2ELBVH4P","bundle":"https://pith.science/pith/PRHZLK3ZGQHZCW67VC2ELBVH4P/bundle.json","state":"https://pith.science/pith/PRHZLK3ZGQHZCW67VC2ELBVH4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PRHZLK3ZGQHZCW67VC2ELBVH4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PRHZLK3ZGQHZCW67VC2ELBVH4P","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":"c6317a2f3f4c9a468d1e1a6b6215f0ed77a2dae20d1b8322b99ca1f142c51ae4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T23:13:28Z","title_canon_sha256":"72c90342ffecb90bde91debd33c0279a72b99932feb09d9cbe3942d4a392bdd7"},"schema_version":"1.0","source":{"id":"1610.00054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00054","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00054v1","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00054","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"PRHZLK3ZGQHZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRHZLK3ZGQHZCW67","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRHZLK3Z","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:5a28b1037e3069a130449fa952b84ef8afc0b2275135b1ced690a77964b10fde","target":"graph","created_at":"2026-05-18T01:03:32Z","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":"Detecting a small number of outliers from a set of data observations is always challenging. This problem is more difficult in the setting of multiple network samples, where computing the anomalous degree of a network sample is generally not sufficient. In fact, explaining why the network is exceptional, expressed in the form of subnetwork, is also equally important. In this paper, we develop a novel algorithm to address these two key problems. We treat each network sample as a potential outlier and identify subnetworks that mostly discriminate it from nearby regular samples. The algorithm is d","authors_text":"Ambuj Singh, Ananthram Swami, Arlei Silva, Prithwish Basu, Xuan-Hong Dang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T23:13:28Z","title":"Outlier Detection from Network Data with Subnetwork Interpretation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00054","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:e312245e8f030235a1712b2e4cd376840e90dd924f242fa0de728099cbe03dda","target":"record","created_at":"2026-05-18T01:03:32Z","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":"c6317a2f3f4c9a468d1e1a6b6215f0ed77a2dae20d1b8322b99ca1f142c51ae4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T23:13:28Z","title_canon_sha256":"72c90342ffecb90bde91debd33c0279a72b99932feb09d9cbe3942d4a392bdd7"},"schema_version":"1.0","source":{"id":"1610.00054","kind":"arxiv","version":1}},"canonical_sha256":"7c4f95ab79340f915bdfa8b44586a7e3dd01756a163c10181d40f3874969345b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c4f95ab79340f915bdfa8b44586a7e3dd01756a163c10181d40f3874969345b","first_computed_at":"2026-05-18T01:03:32.024409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:32.024409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G9rT8OpWYvo7W8/G4gYcCAmcFrLqZTTtvZrn8LbUdljwrLgLLsDiaC6oOOFDeD3L4XygPcfCo7RcjWDrjS5wBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:32.025040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e312245e8f030235a1712b2e4cd376840e90dd924f242fa0de728099cbe03dda","sha256:5a28b1037e3069a130449fa952b84ef8afc0b2275135b1ced690a77964b10fde"],"state_sha256":"197df47bc9598e32fb3a2ed7a7148fd3accaaff412dd96e4ed19f45204d9c971"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4XA+CzVBTSUCQLQgmlQjE+Lh6qY2F1jSp0AhtO8ouFe4P1184y5b7M8fj5++EpQ193aAtDi1+8laLzwgy9FAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:33:20.920404Z","bundle_sha256":"64d02891452cadfef081b59904da47f1aa366843edd671c6c67c59f2ae9fbc9e"}}