{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:36GZY6KXNMQLAEKUQNQCQM4XFW","short_pith_number":"pith:36GZY6KX","canonical_record":{"source":{"id":"1801.07889","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-24T07:58:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"84c04d49eef18c7937aed79b237e375e7b51b027d35db54026b1dbd56b3ea426","abstract_canon_sha256":"fa8e0a458bc8a760ef2cc6c65f0d0f230c91328717e802367c42a655fa8741a6"},"schema_version":"1.0"},"canonical_sha256":"df8d9c79576b20b0115483602833972db93da1768cdfa7617b05416da527093a","source":{"kind":"arxiv","id":"1801.07889","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07889","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07889v3","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07889","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"36GZY6KXNMQL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"36GZY6KXNMQLAEKU","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"36GZY6KX","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:36GZY6KXNMQLAEKUQNQCQM4XFW","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07889","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-24T07:58:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"84c04d49eef18c7937aed79b237e375e7b51b027d35db54026b1dbd56b3ea426","abstract_canon_sha256":"fa8e0a458bc8a760ef2cc6c65f0d0f230c91328717e802367c42a655fa8741a6"},"schema_version":"1.0"},"canonical_sha256":"df8d9c79576b20b0115483602833972db93da1768cdfa7617b05416da527093a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:28.346678Z","signature_b64":"OYUXt9T+EMLet+Z7BmAEXgE1fd93SegZXXN+om2HK/qVkAwa4wkR4YRYl2/J465J1EsLNgnovjLK4qdeXUeWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df8d9c79576b20b0115483602833972db93da1768cdfa7617b05416da527093a","last_reissued_at":"2026-05-18T00:24:28.346149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:28.346149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07889","source_version":3,"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:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALusdaE3BHYvHzqXDzYNXu0HbfDA6e0x91ZxbVwi7A4mzWWXMmdZL/KbttbNWAp3AXo7noyMB0ZUEUxWfBW2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:50:42.946814Z"},"content_sha256":"007c4ca5f93fe85dbfd886387237eef05afddf6589c86b284dd5ac4e1423eab5","schema_version":"1.0","event_id":"sha256:007c4ca5f93fe85dbfd886387237eef05afddf6589c86b284dd5ac4e1423eab5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:36GZY6KXNMQLAEKUQNQCQM4XFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Theoretical Investigation of Graph Degree as an Unsupervised Normality Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Caglar Aytekin, Emre Aksu, Francesco Cricri, Lixin Fan","submitted_at":"2018-01-24T07:58:34Z","abstract_excerpt":"For a graph representation of a dataset, a straightforward normality measure for a sample can be its graph degree. Considering a weighted graph, degree of a sample is the sum of the corresponding row's values in a similarity matrix. The measure is intuitive given the abnormal samples are usually rare and they are dissimilar to the rest of the data. In order to have an in-depth theoretical understanding, in this manuscript, we investigate the graph degree in spectral graph clustering based and kernel based point of views and draw connections to a recent kernel method for the two sample problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07889","kind":"arxiv","version":3},"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:24:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDP9WDY2JTJDGIOngn/WTj2UFsSP/b5S8Hxn4aat/34LL4tMIIKNwpZRnN7ggx8HjPSfUso00AgmNM/UYU/kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:50:42.947483Z"},"content_sha256":"8d6b00504d9754ef2d81ae373638eb40f1f34fd55aba86fb93457b0d111b407c","schema_version":"1.0","event_id":"sha256:8d6b00504d9754ef2d81ae373638eb40f1f34fd55aba86fb93457b0d111b407c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/bundle.json","state_url":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/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-26T01:50:42Z","links":{"resolver":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW","bundle":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/bundle.json","state":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:36GZY6KXNMQLAEKUQNQCQM4XFW","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":"fa8e0a458bc8a760ef2cc6c65f0d0f230c91328717e802367c42a655fa8741a6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-24T07:58:34Z","title_canon_sha256":"84c04d49eef18c7937aed79b237e375e7b51b027d35db54026b1dbd56b3ea426"},"schema_version":"1.0","source":{"id":"1801.07889","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07889","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07889v3","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07889","created_at":"2026-05-18T00:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"36GZY6KXNMQL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"36GZY6KXNMQLAEKU","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"36GZY6KX","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:8d6b00504d9754ef2d81ae373638eb40f1f34fd55aba86fb93457b0d111b407c","target":"graph","created_at":"2026-05-18T00:24:28Z","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":"For a graph representation of a dataset, a straightforward normality measure for a sample can be its graph degree. Considering a weighted graph, degree of a sample is the sum of the corresponding row's values in a similarity matrix. The measure is intuitive given the abnormal samples are usually rare and they are dissimilar to the rest of the data. In order to have an in-depth theoretical understanding, in this manuscript, we investigate the graph degree in spectral graph clustering based and kernel based point of views and draw connections to a recent kernel method for the two sample problem.","authors_text":"Caglar Aytekin, Emre Aksu, Francesco Cricri, Lixin Fan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-24T07:58:34Z","title":"A Theoretical Investigation of Graph Degree as an Unsupervised Normality Measure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07889","kind":"arxiv","version":3},"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:007c4ca5f93fe85dbfd886387237eef05afddf6589c86b284dd5ac4e1423eab5","target":"record","created_at":"2026-05-18T00:24:28Z","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":"fa8e0a458bc8a760ef2cc6c65f0d0f230c91328717e802367c42a655fa8741a6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-24T07:58:34Z","title_canon_sha256":"84c04d49eef18c7937aed79b237e375e7b51b027d35db54026b1dbd56b3ea426"},"schema_version":"1.0","source":{"id":"1801.07889","kind":"arxiv","version":3}},"canonical_sha256":"df8d9c79576b20b0115483602833972db93da1768cdfa7617b05416da527093a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df8d9c79576b20b0115483602833972db93da1768cdfa7617b05416da527093a","first_computed_at":"2026-05-18T00:24:28.346149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:28.346149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OYUXt9T+EMLet+Z7BmAEXgE1fd93SegZXXN+om2HK/qVkAwa4wkR4YRYl2/J465J1EsLNgnovjLK4qdeXUeWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:28.346678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07889","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:007c4ca5f93fe85dbfd886387237eef05afddf6589c86b284dd5ac4e1423eab5","sha256:8d6b00504d9754ef2d81ae373638eb40f1f34fd55aba86fb93457b0d111b407c"],"state_sha256":"563b086726ff5444d68d7199b753b77ce31d3dc4f6a1a2bead25194507c8a822"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/CQmJKyVQEgv7yJZAGylaUTY4qBKW8kW6HuihO21WpZ/Z21HUdQwvWLKlxY0vIWA3fpAKwpSmRdGJN+xZlJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:50:42.951057Z","bundle_sha256":"6cd4d849170b67875986b558239923b1fdd3d834c5998915b48145be9e4a1b8b"}}