{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3GKFAOCENGSXGXXLYU4KHX3KIR","short_pith_number":"pith:3GKFAOCE","canonical_record":{"source":{"id":"1908.02096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T12:06:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"12c04fb61fbe0f7ab99e0849bccd8dce3360b53bd2ae82d3e73048cfe406443a","abstract_canon_sha256":"b55f29766a32e10ac40380061b5c774ab8c4365a09763f5328315f5c05081d9a"},"schema_version":"1.0"},"canonical_sha256":"d99450384469a5735eebc538a3df6a4450541e58056f078737404e9a706c4805","source":{"kind":"arxiv","id":"1908.02096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02096","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02096v1","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02096","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"3GKFAOCENGSX","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GKFAOCENGSXGXXL","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GKFAOCE","created_at":"2026-07-04T23:51:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3GKFAOCENGSXGXXLYU4KHX3KIR","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T12:06:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"12c04fb61fbe0f7ab99e0849bccd8dce3360b53bd2ae82d3e73048cfe406443a","abstract_canon_sha256":"b55f29766a32e10ac40380061b5c774ab8c4365a09763f5328315f5c05081d9a"},"schema_version":"1.0"},"canonical_sha256":"d99450384469a5735eebc538a3df6a4450541e58056f078737404e9a706c4805","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:50.873210Z","signature_b64":"T+G8Ui+6bj0wiz42YtJAVAZTLqqsjpQR8Ptx8qZaaRY85yp9CQja6pySh7Dsh5UfDqTLrNUnU0okvg41mG9qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d99450384469a5735eebc538a3df6a4450541e58056f078737404e9a706c4805","last_reissued_at":"2026-07-04T23:51:50.872769Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:50.872769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02096","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-07-04T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBbMoreHNfIIr6GdO7JXGxZD2q0/Xh2OSKH9z44LtKWY2dgB0KKoumL3zU04TAlIuxyrum63Lv4IccOZdjgnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:09:13.826563Z"},"content_sha256":"34249590aede4981358edf5a6304ca66579d9a42908ce8b7ff58415e5331885e","schema_version":"1.0","event_id":"sha256:34249590aede4981358edf5a6304ca66579d9a42908ce8b7ff58415e5331885e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3GKFAOCENGSXGXXLYU4KHX3KIR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hermitian matrices for clustering directed graphs: insights and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"He Sun, Huan Li, Luca Zanetti, Mihai Cucuringu","submitted_at":"2019-08-06T12:06:44Z","abstract_excerpt":"Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for clustering undirected graphs, the performance of spectral clustering algorithms for directed graphs (digraphs) is not in general satisfactory: these algorithms usually require symmetrising the matrix representing a digraph, and typical objective functions for undirected graph clustering do not capture cluster-structures in which the information given by the direction of the edges is crucial. To overcome these downsides, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02096","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02096/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4fldUPpv0LQE96Z+uTV+3BZw+PMCT/R0pHj2RCADOx7oDUOQoKz+hgOCOOX8iz5KJsjfS7TOI0rn8GDaO66Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:09:13.827118Z"},"content_sha256":"c9b3b956294762487bd2006461cce1436f1b1862b4d1985aff8d895cd196f46f","schema_version":"1.0","event_id":"sha256:c9b3b956294762487bd2006461cce1436f1b1862b4d1985aff8d895cd196f46f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GKFAOCENGSXGXXLYU4KHX3KIR/bundle.json","state_url":"https://pith.science/pith/3GKFAOCENGSXGXXLYU4KHX3KIR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GKFAOCENGSXGXXLYU4KHX3KIR/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-08-16T12:09:13Z","links":{"resolver":"https://pith.science/pith/3GKFAOCENGSXGXXLYU4KHX3KIR","bundle":"https://pith.science/pith/3GKFAOCENGSXGXXLYU4KHX3KIR/bundle.json","state":"https://pith.science/pith/3GKFAOCENGSXGXXLYU4KHX3KIR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GKFAOCENGSXGXXLYU4KHX3KIR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3GKFAOCENGSXGXXLYU4KHX3KIR","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":"b55f29766a32e10ac40380061b5c774ab8c4365a09763f5328315f5c05081d9a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T12:06:44Z","title_canon_sha256":"12c04fb61fbe0f7ab99e0849bccd8dce3360b53bd2ae82d3e73048cfe406443a"},"schema_version":"1.0","source":{"id":"1908.02096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02096","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02096v1","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02096","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"3GKFAOCENGSX","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GKFAOCENGSXGXXL","created_at":"2026-07-04T23:51:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GKFAOCE","created_at":"2026-07-04T23:51:50Z"}],"graph_snapshots":[{"event_id":"sha256:c9b3b956294762487bd2006461cce1436f1b1862b4d1985aff8d895cd196f46f","target":"graph","created_at":"2026-07-04T23:51:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02096/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for clustering undirected graphs, the performance of spectral clustering algorithms for directed graphs (digraphs) is not in general satisfactory: these algorithms usually require symmetrising the matrix representing a digraph, and typical objective functions for undirected graph clustering do not capture cluster-structures in which the information given by the direction of the edges is crucial. To overcome these downsides, we","authors_text":"He Sun, Huan Li, Luca Zanetti, Mihai Cucuringu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T12:06:44Z","title":"Hermitian matrices for clustering directed graphs: insights and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02096","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:34249590aede4981358edf5a6304ca66579d9a42908ce8b7ff58415e5331885e","target":"record","created_at":"2026-07-04T23:51:50Z","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":"b55f29766a32e10ac40380061b5c774ab8c4365a09763f5328315f5c05081d9a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-06T12:06:44Z","title_canon_sha256":"12c04fb61fbe0f7ab99e0849bccd8dce3360b53bd2ae82d3e73048cfe406443a"},"schema_version":"1.0","source":{"id":"1908.02096","kind":"arxiv","version":1}},"canonical_sha256":"d99450384469a5735eebc538a3df6a4450541e58056f078737404e9a706c4805","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d99450384469a5735eebc538a3df6a4450541e58056f078737404e9a706c4805","first_computed_at":"2026-07-04T23:51:50.872769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:50.872769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T+G8Ui+6bj0wiz42YtJAVAZTLqqsjpQR8Ptx8qZaaRY85yp9CQja6pySh7Dsh5UfDqTLrNUnU0okvg41mG9qAA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:50.873210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34249590aede4981358edf5a6304ca66579d9a42908ce8b7ff58415e5331885e","sha256:c9b3b956294762487bd2006461cce1436f1b1862b4d1985aff8d895cd196f46f"],"state_sha256":"9263d1cd7ec5d55c35e1f7bce5f7539f0e32c6d5c389a7dd9bdc8d5dfaaddc37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAStnNL3D8YluZLYiwGBWqOSyQ7zpzkoGQ8aQfoJaYOaXMDDlZrsWCaJBYiDyuwdDdBd5degdwITpCqykZ+wDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:09:13.833187Z","bundle_sha256":"0f22be5dcbf1bf16112a2ca4e8b1c8da384c85b64829b019f64b8b07af066c45"}}