{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6LSFGJGR2V2WBLJMWFLF65YM7H","short_pith_number":"pith:6LSFGJGR","canonical_record":{"source":{"id":"1904.11352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-24T07:51:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6885299c7cb30d11c6a5fc6942d90c975b79cd2f007018b0a35bd7200eebd8ee","abstract_canon_sha256":"7696fa6267558ab368ce3f9fbfddd832b4758bc1a2ab6855573d9d8d6a4d8db3"},"schema_version":"1.0"},"canonical_sha256":"f2e45324d1d57560ad2cb1565f770cf9c444ac36005942ff51f6e0906627d42b","source":{"kind":"arxiv","id":"1904.11352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11352","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11352v1","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11352","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"6LSFGJGR2V2W","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6LSFGJGR2V2WBLJM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6LSFGJGR","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6LSFGJGR2V2WBLJMWFLF65YM7H","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-24T07:51:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6885299c7cb30d11c6a5fc6942d90c975b79cd2f007018b0a35bd7200eebd8ee","abstract_canon_sha256":"7696fa6267558ab368ce3f9fbfddd832b4758bc1a2ab6855573d9d8d6a4d8db3"},"schema_version":"1.0"},"canonical_sha256":"f2e45324d1d57560ad2cb1565f770cf9c444ac36005942ff51f6e0906627d42b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:45.147669Z","signature_b64":"DttFv0kEoz06rT4VCsqRd5JcHWNyQSpdAy2px9m+xVKCEwONCDZ+D4o8FPDqtA/dVm1OONoukBAX6ixEatcRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2e45324d1d57560ad2cb1565f770cf9c444ac36005942ff51f6e0906627d42b","last_reissued_at":"2026-05-17T23:47:45.147237Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:45.147237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11352","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-17T23:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fxx/gGjSxmwXjIKfyf6+ljsOl2wS37TCvE/N3c0xlHKnxyrUthkMcwHn5jP/h+TxCdFNEeh+YueE5iUj5FAKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:20:42.092611Z"},"content_sha256":"184d8c4391218db68211be4b279da12c6ff5ee852a8214e6cacdacf57e4f990d","schema_version":"1.0","event_id":"sha256:184d8c4391218db68211be4b279da12c6ff5ee852a8214e6cacdacf57e4f990d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6LSFGJGR2V2WBLJMWFLF65YM7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of the similarity matrix for the spectral clustering method: numerical experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.NA","authors_text":"Francesco Romani, Grazia Lotti, Ornella Menchi, Paola Favati","submitted_at":"2019-04-24T07:51:59Z","abstract_excerpt":"Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors of a similarity matrix. It often outperforms traditional clustering algorithms such as $k$-means when the structure of the individual clusters is highly non-convex. Its accuracy depends on how the similarity between pairs of data points is defined. Two important items contribute to the construction of the similarity matrix: the sparsity of the underlying weighted graph, which depends mainly on the distances among data points, and the similarity function. When a Gaussian similarity function is u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11352","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-17T23:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uq6M6Llaul7DNLBcEtUbagIZDpjUO6oykzBYe0uoGFjHQT0EZyyPYmvCOG3DlPmLH1z1scxpGyg4kHwLJ1IbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:20:42.093297Z"},"content_sha256":"5900cc41f0d4fd07e0326174d73a4abf0e5aefcb2be5ef2d3fb1555a660b11e0","schema_version":"1.0","event_id":"sha256:5900cc41f0d4fd07e0326174d73a4abf0e5aefcb2be5ef2d3fb1555a660b11e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LSFGJGR2V2WBLJMWFLF65YM7H/bundle.json","state_url":"https://pith.science/pith/6LSFGJGR2V2WBLJMWFLF65YM7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LSFGJGR2V2WBLJMWFLF65YM7H/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-26T03:20:42Z","links":{"resolver":"https://pith.science/pith/6LSFGJGR2V2WBLJMWFLF65YM7H","bundle":"https://pith.science/pith/6LSFGJGR2V2WBLJMWFLF65YM7H/bundle.json","state":"https://pith.science/pith/6LSFGJGR2V2WBLJMWFLF65YM7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LSFGJGR2V2WBLJMWFLF65YM7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6LSFGJGR2V2WBLJMWFLF65YM7H","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":"7696fa6267558ab368ce3f9fbfddd832b4758bc1a2ab6855573d9d8d6a4d8db3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-24T07:51:59Z","title_canon_sha256":"6885299c7cb30d11c6a5fc6942d90c975b79cd2f007018b0a35bd7200eebd8ee"},"schema_version":"1.0","source":{"id":"1904.11352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11352","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11352v1","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11352","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"6LSFGJGR2V2W","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6LSFGJGR2V2WBLJM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6LSFGJGR","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:5900cc41f0d4fd07e0326174d73a4abf0e5aefcb2be5ef2d3fb1555a660b11e0","target":"graph","created_at":"2026-05-17T23:47:45Z","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 method for finding structure in a dataset through the eigenvectors of a similarity matrix. It often outperforms traditional clustering algorithms such as $k$-means when the structure of the individual clusters is highly non-convex. Its accuracy depends on how the similarity between pairs of data points is defined. Two important items contribute to the construction of the similarity matrix: the sparsity of the underlying weighted graph, which depends mainly on the distances among data points, and the similarity function. When a Gaussian similarity function is u","authors_text":"Francesco Romani, Grazia Lotti, Ornella Menchi, Paola Favati","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-24T07:51:59Z","title":"Construction of the similarity matrix for the spectral clustering method: numerical experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11352","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:184d8c4391218db68211be4b279da12c6ff5ee852a8214e6cacdacf57e4f990d","target":"record","created_at":"2026-05-17T23:47:45Z","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":"7696fa6267558ab368ce3f9fbfddd832b4758bc1a2ab6855573d9d8d6a4d8db3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-24T07:51:59Z","title_canon_sha256":"6885299c7cb30d11c6a5fc6942d90c975b79cd2f007018b0a35bd7200eebd8ee"},"schema_version":"1.0","source":{"id":"1904.11352","kind":"arxiv","version":1}},"canonical_sha256":"f2e45324d1d57560ad2cb1565f770cf9c444ac36005942ff51f6e0906627d42b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2e45324d1d57560ad2cb1565f770cf9c444ac36005942ff51f6e0906627d42b","first_computed_at":"2026-05-17T23:47:45.147237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:45.147237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DttFv0kEoz06rT4VCsqRd5JcHWNyQSpdAy2px9m+xVKCEwONCDZ+D4o8FPDqtA/dVm1OONoukBAX6ixEatcRBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:45.147669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:184d8c4391218db68211be4b279da12c6ff5ee852a8214e6cacdacf57e4f990d","sha256:5900cc41f0d4fd07e0326174d73a4abf0e5aefcb2be5ef2d3fb1555a660b11e0"],"state_sha256":"b3cc0da3c8bbb08c1d1f42ec0fb6300ef2f3ea7ad7ecc2edbe6986df74a5290f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCBJuz7LO+il+QCi2FzHqC3aakqmaC9g5Sd5j+LUch57aPHF4PWktjZCB+fn2bqFvdNUvGxfF1Q051AiQCYfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:20:42.096900Z","bundle_sha256":"71622e7b5b615d1fd248ec6977d5e64959c195cc3e519c97c127a45bfa131bad"}}