{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:36GZY6KXNMQLAEKUQNQCQM4XFW","short_pith_number":"pith:36GZY6KX","schema_version":"1.0","canonical_sha256":"df8d9c79576b20b0115483602833972db93da1768cdfa7617b05416da527093a","source":{"kind":"arxiv","id":"1801.07889","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.07889","created_at":"2026-05-18T00:24:28.346238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07889v3","created_at":"2026-05-18T00:24:28.346238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07889","created_at":"2026-05-18T00:24:28.346238+00:00"},{"alias_kind":"pith_short_12","alias_value":"36GZY6KXNMQL","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"36GZY6KXNMQLAEKU","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"36GZY6KX","created_at":"2026-05-18T12:32:02.567920+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/36GZY6KXNMQLAEKUQNQCQM4XFW","json":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW.json","graph_json":"https://pith.science/api/pith-number/36GZY6KXNMQLAEKUQNQCQM4XFW/graph.json","events_json":"https://pith.science/api/pith-number/36GZY6KXNMQLAEKUQNQCQM4XFW/events.json","paper":"https://pith.science/paper/36GZY6KX"},"agent_actions":{"view_html":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW","download_json":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW.json","view_paper":"https://pith.science/paper/36GZY6KX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07889&json=true","fetch_graph":"https://pith.science/api/pith-number/36GZY6KXNMQLAEKUQNQCQM4XFW/graph.json","fetch_events":"https://pith.science/api/pith-number/36GZY6KXNMQLAEKUQNQCQM4XFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/action/storage_attestation","attest_author":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/action/author_attestation","sign_citation":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/action/citation_signature","submit_replication":"https://pith.science/pith/36GZY6KXNMQLAEKUQNQCQM4XFW/action/replication_record"}},"created_at":"2026-05-18T00:24:28.346238+00:00","updated_at":"2026-05-18T00:24:28.346238+00:00"}