{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AZEDOO6X322S5RB6SHX3FRBCII","short_pith_number":"pith:AZEDOO6X","canonical_record":{"source":{"id":"1709.05246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-15T14:58:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5550be187ec309140775911a81d75e2ed490a7cb3ca5776a9e86cf86e16b0f9b","abstract_canon_sha256":"1f8c1708460f15a71a13529f1f6d9f15166d67ba914f35594400b7564a9b7ea2"},"schema_version":"1.0"},"canonical_sha256":"0648373bd7deb52ec43e91efb2c422423b666b1e203193c67ad8232d03017c35","source":{"kind":"arxiv","id":"1709.05246","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05246","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05246v2","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05246","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"AZEDOO6X322S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AZEDOO6X322S5RB6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AZEDOO6X","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AZEDOO6X322S5RB6SHX3FRBCII","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-15T14:58:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5550be187ec309140775911a81d75e2ed490a7cb3ca5776a9e86cf86e16b0f9b","abstract_canon_sha256":"1f8c1708460f15a71a13529f1f6d9f15166d67ba914f35594400b7564a9b7ea2"},"schema_version":"1.0"},"canonical_sha256":"0648373bd7deb52ec43e91efb2c422423b666b1e203193c67ad8232d03017c35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.673368Z","signature_b64":"7rugCMe0gn5EGKaFdYCYPBGN2jtPed0zmktsLKbR3LGXZeMT8Vx9dfr7gDTHrJHSjhe2K0r7ofsops4WVBp5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0648373bd7deb52ec43e91efb2c422423b666b1e203193c67ad8232d03017c35","last_reissued_at":"2026-05-18T00:05:19.672839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.672839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05246","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-18T00:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bccy/yFxDJCNow5776oTzM37VNGP/KRoi1eM21Fe2AMmJU0HLC6l+78Z5cTvjZ90Jgyfqiyv4YcrxSb68GpGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:47.887024Z"},"content_sha256":"639c9f1238fb96d3b69bb398e40a4bd3f850368ec9c2339260fa98298930fd22","schema_version":"1.0","event_id":"sha256:639c9f1238fb96d3b69bb398e40a4bd3f850368ec9c2339260fa98298930fd22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AZEDOO6X322S5RB6SHX3FRBCII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generic Framework for Interesting Subspace Cluster Detection in Multi-attributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Adil Alim, Baojian Zhou, Feng Chen, Liang Zhao","submitted_at":"2017-09-15T14:58:49Z","abstract_excerpt":"Detection of interesting (e.g., coherent or anomalous) clusters has been studied extensively on plain or univariate networks, with various applications. Recently, algorithms have been extended to networks with multiple attributes for each node in the real-world. In a multi-attributed network, often, a cluster of nodes is only interesting for a subset (subspace) of attributes, and this type of clusters is called subspace clusters. However, in the current literature, few methods are capable of detecting subspace clusters, which involves concurrent feature selection and network cluster detection."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05246","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-18T00:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7GHgcZti91aSycX8Bq6auISg+3KufLhEhAHU1jahRUraGDNtm7dh00BkZByzD8xoPxsrx14R+1UqF+Yg70kDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:47.887381Z"},"content_sha256":"4806339eb2ea94203caf87686f289365dfd3bdf42a74173c3a7f00db542e0362","schema_version":"1.0","event_id":"sha256:4806339eb2ea94203caf87686f289365dfd3bdf42a74173c3a7f00db542e0362"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZEDOO6X322S5RB6SHX3FRBCII/bundle.json","state_url":"https://pith.science/pith/AZEDOO6X322S5RB6SHX3FRBCII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZEDOO6X322S5RB6SHX3FRBCII/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-01T16:44:47Z","links":{"resolver":"https://pith.science/pith/AZEDOO6X322S5RB6SHX3FRBCII","bundle":"https://pith.science/pith/AZEDOO6X322S5RB6SHX3FRBCII/bundle.json","state":"https://pith.science/pith/AZEDOO6X322S5RB6SHX3FRBCII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZEDOO6X322S5RB6SHX3FRBCII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AZEDOO6X322S5RB6SHX3FRBCII","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":"1f8c1708460f15a71a13529f1f6d9f15166d67ba914f35594400b7564a9b7ea2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-15T14:58:49Z","title_canon_sha256":"5550be187ec309140775911a81d75e2ed490a7cb3ca5776a9e86cf86e16b0f9b"},"schema_version":"1.0","source":{"id":"1709.05246","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05246","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05246v2","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05246","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"AZEDOO6X322S","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AZEDOO6X322S5RB6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AZEDOO6X","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:4806339eb2ea94203caf87686f289365dfd3bdf42a74173c3a7f00db542e0362","target":"graph","created_at":"2026-05-18T00:05:19Z","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":"Detection of interesting (e.g., coherent or anomalous) clusters has been studied extensively on plain or univariate networks, with various applications. Recently, algorithms have been extended to networks with multiple attributes for each node in the real-world. In a multi-attributed network, often, a cluster of nodes is only interesting for a subset (subspace) of attributes, and this type of clusters is called subspace clusters. However, in the current literature, few methods are capable of detecting subspace clusters, which involves concurrent feature selection and network cluster detection.","authors_text":"Adil Alim, Baojian Zhou, Feng Chen, Liang Zhao","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-15T14:58:49Z","title":"A Generic Framework for Interesting Subspace Cluster Detection in Multi-attributed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05246","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:639c9f1238fb96d3b69bb398e40a4bd3f850368ec9c2339260fa98298930fd22","target":"record","created_at":"2026-05-18T00:05:19Z","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":"1f8c1708460f15a71a13529f1f6d9f15166d67ba914f35594400b7564a9b7ea2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-15T14:58:49Z","title_canon_sha256":"5550be187ec309140775911a81d75e2ed490a7cb3ca5776a9e86cf86e16b0f9b"},"schema_version":"1.0","source":{"id":"1709.05246","kind":"arxiv","version":2}},"canonical_sha256":"0648373bd7deb52ec43e91efb2c422423b666b1e203193c67ad8232d03017c35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0648373bd7deb52ec43e91efb2c422423b666b1e203193c67ad8232d03017c35","first_computed_at":"2026-05-18T00:05:19.672839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:19.672839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7rugCMe0gn5EGKaFdYCYPBGN2jtPed0zmktsLKbR3LGXZeMT8Vx9dfr7gDTHrJHSjhe2K0r7ofsops4WVBp5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:19.673368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05246","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:639c9f1238fb96d3b69bb398e40a4bd3f850368ec9c2339260fa98298930fd22","sha256:4806339eb2ea94203caf87686f289365dfd3bdf42a74173c3a7f00db542e0362"],"state_sha256":"7e1b50ebe9a65186f0e38026a5535d213d6d834f4f89b5aa6299dd95ea67133c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0vIZu705iISK0H0thlpJtqXp6a6/OvIFMNGYb8XpodilQa/RoR97WVJkksmdLGqPjDFmazFY1zkQ0D3kFbZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:44:47.889382Z","bundle_sha256":"29b9804a14e9751ac6d75d51e3300158455fd833fbfeffb4938e0d4b0a2e8629"}}