{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TOF2BCZP35TMWTIXUZPZAWIUB7","short_pith_number":"pith:TOF2BCZP","schema_version":"1.0","canonical_sha256":"9b8ba08b2fdf66cb4d17a65f9059140fc7fc4c13a651b94eb9ba915322e4ffcf","source":{"kind":"arxiv","id":"1601.04746","version":1},"attestation_state":"computed","paper":{"title":"Scalable Constrained Clustering: A Generalized Spectral Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Gary Miller, Ioannis Koutis, Mihai Cucuringu, Richard Peng, Sanjay Chawla","submitted_at":"2016-01-18T22:44:26Z","abstract_excerpt":"We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides concrete guarantees for the quality of the clusters, at least for the case of 2-way partitioning. In practice this translates to a very fast implementation that consistently outperforms existing spectral approaches both in speed and quality."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1601.04746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-18T22:44:26Z","cross_cats_sorted":[],"title_canon_sha256":"abd8375c84e44010fcea796c061b8439bf2f18824adc1d72b6d24d9c62beb110","abstract_canon_sha256":"fb64701b8c1d8779964876a2eadadd209c0e001016d341d0356365b710118861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:31.909734Z","signature_b64":"4NYi5VI0ia4rPKt+weDlAQrKy3mb3QwkB6lwuW5/9a6IYbXuNe11oyvufv1YoYCenPVx0zjyem/QILZi5fThAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b8ba08b2fdf66cb4d17a65f9059140fc7fc4c13a651b94eb9ba915322e4ffcf","last_reissued_at":"2026-05-18T01:22:31.909106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:31.909106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Constrained Clustering: A Generalized Spectral Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Gary Miller, Ioannis Koutis, Mihai Cucuringu, Richard Peng, Sanjay Chawla","submitted_at":"2016-01-18T22:44:26Z","abstract_excerpt":"We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides concrete guarantees for the quality of the clusters, at least for the case of 2-way partitioning. In practice this translates to a very fast implementation that consistently outperforms existing spectral approaches both in speed and quality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04746","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04746","created_at":"2026-05-18T01:22:31.909204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04746v1","created_at":"2026-05-18T01:22:31.909204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04746","created_at":"2026-05-18T01:22:31.909204+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOF2BCZP35TM","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOF2BCZP35TMWTIX","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOF2BCZP","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.05949","citing_title":"Generalized Spectral Clustering of Low-Inertia Power Networks","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7","json":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7.json","graph_json":"https://pith.science/api/pith-number/TOF2BCZP35TMWTIXUZPZAWIUB7/graph.json","events_json":"https://pith.science/api/pith-number/TOF2BCZP35TMWTIXUZPZAWIUB7/events.json","paper":"https://pith.science/paper/TOF2BCZP"},"agent_actions":{"view_html":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7","download_json":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7.json","view_paper":"https://pith.science/paper/TOF2BCZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04746&json=true","fetch_graph":"https://pith.science/api/pith-number/TOF2BCZP35TMWTIXUZPZAWIUB7/graph.json","fetch_events":"https://pith.science/api/pith-number/TOF2BCZP35TMWTIXUZPZAWIUB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7/action/storage_attestation","attest_author":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7/action/author_attestation","sign_citation":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7/action/citation_signature","submit_replication":"https://pith.science/pith/TOF2BCZP35TMWTIXUZPZAWIUB7/action/replication_record"}},"created_at":"2026-05-18T01:22:31.909204+00:00","updated_at":"2026-05-18T01:22:31.909204+00:00"}