{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RCHZIWS4AW2ATDDRSVZSK2H3XZ","short_pith_number":"pith:RCHZIWS4","canonical_record":{"source":{"id":"1512.07372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-12-23T07:13:27Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"f5f23181315a191dc246005ede566cb0a7004f03212003164cce595d039366b7","abstract_canon_sha256":"1a340a65c249fe8f1b3053058b8bb9e0065db140d4e06921254c83c73c9fd02b"},"schema_version":"1.0"},"canonical_sha256":"888f945a5c05b4098c7195732568fbbe7f2b5d8ea111219179c9662220280f88","source":{"kind":"arxiv","id":"1512.07372","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07372","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07372v2","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07372","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"RCHZIWS4AW2A","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCHZIWS4AW2ATDDR","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCHZIWS4","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RCHZIWS4AW2ATDDRSVZSK2H3XZ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-12-23T07:13:27Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"f5f23181315a191dc246005ede566cb0a7004f03212003164cce595d039366b7","abstract_canon_sha256":"1a340a65c249fe8f1b3053058b8bb9e0065db140d4e06921254c83c73c9fd02b"},"schema_version":"1.0"},"canonical_sha256":"888f945a5c05b4098c7195732568fbbe7f2b5d8ea111219179c9662220280f88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:18.307651Z","signature_b64":"BWzW/TCjK9XRk1HJmW7Ncquie1gJTuy63F1F7PSZoKvZ5ZPqxejhedZ20sSTxoxPdAUymBrMoYTQh8nXOfmtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"888f945a5c05b4098c7195732568fbbe7f2b5d8ea111219179c9662220280f88","last_reissued_at":"2026-05-18T01:19:18.307174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:18.307174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07372","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:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsBuSMoN8q0oK1TZZXZsdQeIgIqUHLmet6H39ncAzTH2I7Iha50xds79Thp/flzbtPPKt0BGA6Ooyp0aiLUGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:53:02.811068Z"},"content_sha256":"19c8b34185fa156e610ad89be355053060f9dffb23675c77420fba099d4c802e","schema_version":"1.0","event_id":"sha256:19c8b34185fa156e610ad89be355053060f9dffb23675c77420fba099d4c802e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RCHZIWS4AW2ATDDRSVZSK2H3XZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-centrality Graph Spectral Decompositions and their Application to Cyber Intrusion Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.SI","authors_text":"Alfred O. Hero, Pin-Yu Chen, Sutanay Choudhury","submitted_at":"2015-12-23T07:13:27Z","abstract_excerpt":"Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the Fiedler vector of centered graph adjacency matrix (graph Laplacian), we propose spectral decomposition approaches to graph PCA and graph dictionary learning that integrate multiple features, including graph walk statistics, centrality measures and graph distances to reference nodes. In this paper we propose a new PCA method "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07372","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:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlFmTBvM+pQhdSGrNzFPUaw+WuZFC8XpdWlnOO/A8OGYEs6HXqxMRZf/Cjpd07lydpRBAH7bkV50ei96PXeqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:53:02.811448Z"},"content_sha256":"3dd9a491767f658358750846bd024ce98e4e382bf92eadd9a0f1f0bff30bd4f1","schema_version":"1.0","event_id":"sha256:3dd9a491767f658358750846bd024ce98e4e382bf92eadd9a0f1f0bff30bd4f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCHZIWS4AW2ATDDRSVZSK2H3XZ/bundle.json","state_url":"https://pith.science/pith/RCHZIWS4AW2ATDDRSVZSK2H3XZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCHZIWS4AW2ATDDRSVZSK2H3XZ/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-26T18:53:02Z","links":{"resolver":"https://pith.science/pith/RCHZIWS4AW2ATDDRSVZSK2H3XZ","bundle":"https://pith.science/pith/RCHZIWS4AW2ATDDRSVZSK2H3XZ/bundle.json","state":"https://pith.science/pith/RCHZIWS4AW2ATDDRSVZSK2H3XZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCHZIWS4AW2ATDDRSVZSK2H3XZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RCHZIWS4AW2ATDDRSVZSK2H3XZ","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":"1a340a65c249fe8f1b3053058b8bb9e0065db140d4e06921254c83c73c9fd02b","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-12-23T07:13:27Z","title_canon_sha256":"f5f23181315a191dc246005ede566cb0a7004f03212003164cce595d039366b7"},"schema_version":"1.0","source":{"id":"1512.07372","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07372","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07372v2","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07372","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"RCHZIWS4AW2A","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCHZIWS4AW2ATDDR","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCHZIWS4","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:3dd9a491767f658358750846bd024ce98e4e382bf92eadd9a0f1f0bff30bd4f1","target":"graph","created_at":"2026-05-18T01:19:18Z","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":"Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the Fiedler vector of centered graph adjacency matrix (graph Laplacian), we propose spectral decomposition approaches to graph PCA and graph dictionary learning that integrate multiple features, including graph walk statistics, centrality measures and graph distances to reference nodes. In this paper we propose a new PCA method ","authors_text":"Alfred O. Hero, Pin-Yu Chen, Sutanay Choudhury","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-12-23T07:13:27Z","title":"Multi-centrality Graph Spectral Decompositions and their Application to Cyber Intrusion Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07372","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:19c8b34185fa156e610ad89be355053060f9dffb23675c77420fba099d4c802e","target":"record","created_at":"2026-05-18T01:19:18Z","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":"1a340a65c249fe8f1b3053058b8bb9e0065db140d4e06921254c83c73c9fd02b","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-12-23T07:13:27Z","title_canon_sha256":"f5f23181315a191dc246005ede566cb0a7004f03212003164cce595d039366b7"},"schema_version":"1.0","source":{"id":"1512.07372","kind":"arxiv","version":2}},"canonical_sha256":"888f945a5c05b4098c7195732568fbbe7f2b5d8ea111219179c9662220280f88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"888f945a5c05b4098c7195732568fbbe7f2b5d8ea111219179c9662220280f88","first_computed_at":"2026-05-18T01:19:18.307174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:18.307174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BWzW/TCjK9XRk1HJmW7Ncquie1gJTuy63F1F7PSZoKvZ5ZPqxejhedZ20sSTxoxPdAUymBrMoYTQh8nXOfmtAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:18.307651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07372","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19c8b34185fa156e610ad89be355053060f9dffb23675c77420fba099d4c802e","sha256:3dd9a491767f658358750846bd024ce98e4e382bf92eadd9a0f1f0bff30bd4f1"],"state_sha256":"d24ec84cefca68295d715a0ce0792ba49808aa0bb4cd55b08eebb0c2d33ce457"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVHRyuKYonJnD9XCcsErv/y/GkFQYeboHctB905yUerCjdbu9DEszjG+zUKTwhAOJeNHyHnGDHaVdRB7hG62BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:53:02.814323Z","bundle_sha256":"31df420f8045ddb191000175a8c5503e58aeecc7369defa040ba39cdd1a4578b"}}