{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HBDIH7OEPL5D76YPMKXVZGIQL5","short_pith_number":"pith:HBDIH7OE","canonical_record":{"source":{"id":"1801.08196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T19:04:35Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"999c4ede19551895f241b4b697947f3052e44e09458dc671466217c916157ca3","abstract_canon_sha256":"ba4bc6d3a1c9a6f7c3ea00f3cbc849324c2fb87cac20fd6c66d678fc77fc343d"},"schema_version":"1.0"},"canonical_sha256":"384683fdc47afa3ffb0f62af5c99105f56a80c42104ac180089f1468b5008993","source":{"kind":"arxiv","id":"1801.08196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08196","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08196v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08196","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"HBDIH7OEPL5D","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HBDIH7OEPL5D76YP","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HBDIH7OE","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HBDIH7OEPL5D76YPMKXVZGIQL5","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T19:04:35Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"999c4ede19551895f241b4b697947f3052e44e09458dc671466217c916157ca3","abstract_canon_sha256":"ba4bc6d3a1c9a6f7c3ea00f3cbc849324c2fb87cac20fd6c66d678fc77fc343d"},"schema_version":"1.0"},"canonical_sha256":"384683fdc47afa3ffb0f62af5c99105f56a80c42104ac180089f1468b5008993","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.864406Z","signature_b64":"dBdqyPLG6x83Gcw+MiFXkfGoPO5dV/AG0JKjWySdD4fmynWAadFTqK83HTRPHMo1QdjdmgQjb6IJvFwvjMjLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"384683fdc47afa3ffb0f62af5c99105f56a80c42104ac180089f1468b5008993","last_reissued_at":"2026-05-18T00:25:06.863979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.863979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08196","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:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZnPZC0PD+3m80Dn+nYMQ5UA5Gg8pEdtq8GeEQqhATEoR4/f5rAD3uNVjrxfNY5UW1JfXR8TB9qL2K+VqwEQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:41:33.324432Z"},"content_sha256":"d3e3725d07440d7503905e27636267b5555cc1bb0ea72fef9742eeec9481345a","schema_version":"1.0","event_id":"sha256:d3e3725d07440d7503905e27636267b5555cc1bb0ea72fef9742eeec9481345a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HBDIH7OEPL5D76YPMKXVZGIQL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Eigenpair Computation for Graph Laplacian Matrices: Theory and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Baichuan Zhang, Mohammad Al Hasan, Pin-Yu Chen","submitted_at":"2017-12-13T19:04:35Z","abstract_excerpt":"The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used in spectral clustering and community detection. However, in real-life applications the number of clusters or communities (say, $K$) is generally unknown a-priori. Consequently, the majority of the existing methods either choose $K$ heuristically or they repeat the clustering method with different choices of $K$ and accept the best clustering result. The first option, more often, yields suboptimal result, while the second option is computationally expensive. In this work"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08196","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:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L91bky9AFf8Ypc3J9ZG7jr2khPxLaZSVpO1EEYlwc2ni4J6Tg9IGDc3MJgG594xUb/JX/jpNFk6m4GIAht4PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:41:33.324834Z"},"content_sha256":"1821e41cf285cd2665e986e61fa1cf85604a9abd4407cdf3c0b0c5e18015b1ce","schema_version":"1.0","event_id":"sha256:1821e41cf285cd2665e986e61fa1cf85604a9abd4407cdf3c0b0c5e18015b1ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBDIH7OEPL5D76YPMKXVZGIQL5/bundle.json","state_url":"https://pith.science/pith/HBDIH7OEPL5D76YPMKXVZGIQL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBDIH7OEPL5D76YPMKXVZGIQL5/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-26T09:41:33Z","links":{"resolver":"https://pith.science/pith/HBDIH7OEPL5D76YPMKXVZGIQL5","bundle":"https://pith.science/pith/HBDIH7OEPL5D76YPMKXVZGIQL5/bundle.json","state":"https://pith.science/pith/HBDIH7OEPL5D76YPMKXVZGIQL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBDIH7OEPL5D76YPMKXVZGIQL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HBDIH7OEPL5D76YPMKXVZGIQL5","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":"ba4bc6d3a1c9a6f7c3ea00f3cbc849324c2fb87cac20fd6c66d678fc77fc343d","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T19:04:35Z","title_canon_sha256":"999c4ede19551895f241b4b697947f3052e44e09458dc671466217c916157ca3"},"schema_version":"1.0","source":{"id":"1801.08196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08196","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08196v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08196","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"HBDIH7OEPL5D","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HBDIH7OEPL5D76YP","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HBDIH7OE","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:1821e41cf285cd2665e986e61fa1cf85604a9abd4407cdf3c0b0c5e18015b1ce","target":"graph","created_at":"2026-05-18T00:25:06Z","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":"The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used in spectral clustering and community detection. However, in real-life applications the number of clusters or communities (say, $K$) is generally unknown a-priori. Consequently, the majority of the existing methods either choose $K$ heuristically or they repeat the clustering method with different choices of $K$ and accept the best clustering result. The first option, more often, yields suboptimal result, while the second option is computationally expensive. In this work","authors_text":"Baichuan Zhang, Mohammad Al Hasan, Pin-Yu Chen","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T19:04:35Z","title":"Incremental Eigenpair Computation for Graph Laplacian Matrices: Theory and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08196","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:d3e3725d07440d7503905e27636267b5555cc1bb0ea72fef9742eeec9481345a","target":"record","created_at":"2026-05-18T00:25:06Z","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":"ba4bc6d3a1c9a6f7c3ea00f3cbc849324c2fb87cac20fd6c66d678fc77fc343d","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T19:04:35Z","title_canon_sha256":"999c4ede19551895f241b4b697947f3052e44e09458dc671466217c916157ca3"},"schema_version":"1.0","source":{"id":"1801.08196","kind":"arxiv","version":1}},"canonical_sha256":"384683fdc47afa3ffb0f62af5c99105f56a80c42104ac180089f1468b5008993","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"384683fdc47afa3ffb0f62af5c99105f56a80c42104ac180089f1468b5008993","first_computed_at":"2026-05-18T00:25:06.863979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:06.863979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dBdqyPLG6x83Gcw+MiFXkfGoPO5dV/AG0JKjWySdD4fmynWAadFTqK83HTRPHMo1QdjdmgQjb6IJvFwvjMjLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:06.864406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3e3725d07440d7503905e27636267b5555cc1bb0ea72fef9742eeec9481345a","sha256:1821e41cf285cd2665e986e61fa1cf85604a9abd4407cdf3c0b0c5e18015b1ce"],"state_sha256":"2de9d79f02b23d30625b452d817b271eac57a44063f51bfddd6476433815bceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wt4UlTG/6ef6lqCCv/a1hKvM0J1fsh/s/2kZPWT8P5T3uOklU5IXQs3dzgU8pguLA2iopNq2CwmQUVzZQ+9pCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:41:33.328468Z","bundle_sha256":"6ec98f01126defa08be9729902f13e6602650a29e456a35cc92dccd028dccdae"}}