{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QBYSJJ6JG7O4L2LHUWEFTELPXW","short_pith_number":"pith:QBYSJJ6J","canonical_record":{"source":{"id":"1401.0764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-04T02:05:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cd5ebd99f6aac096aa1ba51507a9f85f0a388308eea8b912c6d348ccaa8e41d6","abstract_canon_sha256":"fd433dacebebbb44b041f3779ae11f3d1c7545d305ad0ce371b4243215a9dde3"},"schema_version":"1.0"},"canonical_sha256":"807124a7c937ddc5e967a58859916fbda02508a28d810f657228eeaab913a93e","source":{"kind":"arxiv","id":"1401.0764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0764","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0764v1","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0764","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"QBYSJJ6JG7O4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QBYSJJ6JG7O4L2LH","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QBYSJJ6J","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QBYSJJ6JG7O4L2LHUWEFTELPXW","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-04T02:05:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cd5ebd99f6aac096aa1ba51507a9f85f0a388308eea8b912c6d348ccaa8e41d6","abstract_canon_sha256":"fd433dacebebbb44b041f3779ae11f3d1c7545d305ad0ce371b4243215a9dde3"},"schema_version":"1.0"},"canonical_sha256":"807124a7c937ddc5e967a58859916fbda02508a28d810f657228eeaab913a93e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.479548Z","signature_b64":"UyKJVzbRJH4AnpxaSwnNsx5ukiaVpYF+dfDwROqWvwnCkKcrIY5psDEsVdwF/D/d2rX4UsyOdJZSLRM3qxrUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"807124a7c937ddc5e967a58859916fbda02508a28d810f657228eeaab913a93e","last_reissued_at":"2026-05-18T00:59:03.479113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.479113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0764","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-18T00:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYyeNzhMEAM7wJigK+59jpsDEBckv5EZaDvVMTEichVVz7sXG7umPb2CY+9Ro/1Cj/by+Eh9VXDt2LO8Uh4vCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:58:06.211640Z"},"content_sha256":"f1c20656174be65b07041e916a66785e09033a600376ea4777e4ebbe9427431a","schema_version":"1.0","event_id":"sha256:f1c20656174be65b07041e916a66785e09033a600376ea4777e4ebbe9427431a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QBYSJJ6JG7O4L2LHUWEFTELPXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Context-Aware Hypergraph Construction for Robust Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Anthony Dick, Chunhua Shen, Weiming Hu, Xi Li, Zhongfei Zhang","submitted_at":"2014-01-04T02:05:35Z","abstract_excerpt":"Spectral clustering is a powerful tool for unsupervised data analysis. In this paper, we propose a context-aware hypergraph similarity measure (CAHSM), which leads to robust spectral clustering in the case of noisy data. We construct three types of hypergraph---the pairwise hypergraph, the k-nearest-neighbor (kNN) hypergraph, and the high-order over-clustering hypergraph. The pairwise hypergraph captures the pairwise similarity of data points; the kNN hypergraph captures the neighborhood of each point; and the clustering hypergraph encodes high-order contexts within the dataset. By combining t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0764","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-18T00:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfcYb66+g5VtbWSnL6C+ynDQOcjGgA7uxjRDGKH0VbHOIV/Q3AsBup4ssYyrcVW+Xyu+9E3frZUx4kDO//hpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:58:06.212294Z"},"content_sha256":"3246abbf43956cf4fe30b1dd7f658018335f0e2a5aa57fe1d60236a9804c8a5a","schema_version":"1.0","event_id":"sha256:3246abbf43956cf4fe30b1dd7f658018335f0e2a5aa57fe1d60236a9804c8a5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBYSJJ6JG7O4L2LHUWEFTELPXW/bundle.json","state_url":"https://pith.science/pith/QBYSJJ6JG7O4L2LHUWEFTELPXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBYSJJ6JG7O4L2LHUWEFTELPXW/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-31T11:58:06Z","links":{"resolver":"https://pith.science/pith/QBYSJJ6JG7O4L2LHUWEFTELPXW","bundle":"https://pith.science/pith/QBYSJJ6JG7O4L2LHUWEFTELPXW/bundle.json","state":"https://pith.science/pith/QBYSJJ6JG7O4L2LHUWEFTELPXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBYSJJ6JG7O4L2LHUWEFTELPXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QBYSJJ6JG7O4L2LHUWEFTELPXW","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":"fd433dacebebbb44b041f3779ae11f3d1c7545d305ad0ce371b4243215a9dde3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-04T02:05:35Z","title_canon_sha256":"cd5ebd99f6aac096aa1ba51507a9f85f0a388308eea8b912c6d348ccaa8e41d6"},"schema_version":"1.0","source":{"id":"1401.0764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0764","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0764v1","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0764","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"QBYSJJ6JG7O4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QBYSJJ6JG7O4L2LH","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QBYSJJ6J","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:3246abbf43956cf4fe30b1dd7f658018335f0e2a5aa57fe1d60236a9804c8a5a","target":"graph","created_at":"2026-05-18T00:59:03Z","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":"Spectral clustering is a powerful tool for unsupervised data analysis. In this paper, we propose a context-aware hypergraph similarity measure (CAHSM), which leads to robust spectral clustering in the case of noisy data. We construct three types of hypergraph---the pairwise hypergraph, the k-nearest-neighbor (kNN) hypergraph, and the high-order over-clustering hypergraph. The pairwise hypergraph captures the pairwise similarity of data points; the kNN hypergraph captures the neighborhood of each point; and the clustering hypergraph encodes high-order contexts within the dataset. By combining t","authors_text":"Anthony Dick, Chunhua Shen, Weiming Hu, Xi Li, Zhongfei Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-04T02:05:35Z","title":"Context-Aware Hypergraph Construction for Robust Spectral Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0764","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:f1c20656174be65b07041e916a66785e09033a600376ea4777e4ebbe9427431a","target":"record","created_at":"2026-05-18T00:59:03Z","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":"fd433dacebebbb44b041f3779ae11f3d1c7545d305ad0ce371b4243215a9dde3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-01-04T02:05:35Z","title_canon_sha256":"cd5ebd99f6aac096aa1ba51507a9f85f0a388308eea8b912c6d348ccaa8e41d6"},"schema_version":"1.0","source":{"id":"1401.0764","kind":"arxiv","version":1}},"canonical_sha256":"807124a7c937ddc5e967a58859916fbda02508a28d810f657228eeaab913a93e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"807124a7c937ddc5e967a58859916fbda02508a28d810f657228eeaab913a93e","first_computed_at":"2026-05-18T00:59:03.479113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:03.479113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UyKJVzbRJH4AnpxaSwnNsx5ukiaVpYF+dfDwROqWvwnCkKcrIY5psDEsVdwF/D/d2rX4UsyOdJZSLRM3qxrUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:03.479548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1c20656174be65b07041e916a66785e09033a600376ea4777e4ebbe9427431a","sha256:3246abbf43956cf4fe30b1dd7f658018335f0e2a5aa57fe1d60236a9804c8a5a"],"state_sha256":"aacf32f5037b445960b39b2b8e2bd47b3c91a0a5b0cdc94d2d9bbe276c432444"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWBBJhaH82eRYorbC7AG+05KI8M4+vdJxiUUqBoiISRJcoOjfOK3osQWMlB3QgqrnLTQc5rDqiE0DPYpJ+bWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:58:06.215574Z","bundle_sha256":"38821abd187e65eb8f62d30c01850d9f29d11c0007659c01a47330c542de4c9f"}}