{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MY6FUT4TEKJZC2Y7N2HHPN3G4Z","short_pith_number":"pith:MY6FUT4T","schema_version":"1.0","canonical_sha256":"663c5a4f932293916b1f6e8e77b766e65d16a41742f39491b9afeb22d2bf6c23","source":{"kind":"arxiv","id":"1411.1971","version":2},"attestation_state":"computed","paper":{"title":"Power-Law Graph Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Brian Kulis, Jiaxin Zhang, Xiangyang Zhou","submitted_at":"2014-10-29T20:46:20Z","abstract_excerpt":"Algorithms based on spectral graph cut objectives such as normalized cuts, ratio cuts and ratio association have become popular in recent years because they are widely applicable and simple to implement via standard eigenvector computations. Despite strong performance for a number of clustering tasks, spectral graph cut algorithms still suffer from several limitations: first, they require the number of clusters to be known in advance, but this information is often unknown a priori; second, they tend to produce clusters with uniform sizes. In some cases, the true clusters exhibit a known size d"},"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":"1411.1971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-29T20:46:20Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ebd6c7c9317d861bc69185f28dbbd27377c0e8988f225c6fc5a96146d9e814de","abstract_canon_sha256":"3eb0802be53b50dc21f37371e331e3a7948bae06364a913af51e293396adc0f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:45.645526Z","signature_b64":"Bu8D6Tzqg4R5ZzpZNVe4bSNOzBmeHzRwUwy89AL/MvxlnagN5HLu1MygB+MFEo2O7ds3HY5DPwca4AJ2UKwYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"663c5a4f932293916b1f6e8e77b766e65d16a41742f39491b9afeb22d2bf6c23","last_reissued_at":"2026-05-18T02:32:45.644987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:45.644987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power-Law Graph Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Brian Kulis, Jiaxin Zhang, Xiangyang Zhou","submitted_at":"2014-10-29T20:46:20Z","abstract_excerpt":"Algorithms based on spectral graph cut objectives such as normalized cuts, ratio cuts and ratio association have become popular in recent years because they are widely applicable and simple to implement via standard eigenvector computations. Despite strong performance for a number of clustering tasks, spectral graph cut algorithms still suffer from several limitations: first, they require the number of clusters to be known in advance, but this information is often unknown a priori; second, they tend to produce clusters with uniform sizes. In some cases, the true clusters exhibit a known size d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1971","kind":"arxiv","version":2},"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":"1411.1971","created_at":"2026-05-18T02:32:45.645055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1971v2","created_at":"2026-05-18T02:32:45.645055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1971","created_at":"2026-05-18T02:32:45.645055+00:00"},{"alias_kind":"pith_short_12","alias_value":"MY6FUT4TEKJZ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MY6FUT4TEKJZC2Y7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MY6FUT4T","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z","json":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z.json","graph_json":"https://pith.science/api/pith-number/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/graph.json","events_json":"https://pith.science/api/pith-number/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/events.json","paper":"https://pith.science/paper/MY6FUT4T"},"agent_actions":{"view_html":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z","download_json":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z.json","view_paper":"https://pith.science/paper/MY6FUT4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1971&json=true","fetch_graph":"https://pith.science/api/pith-number/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/action/storage_attestation","attest_author":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/action/author_attestation","sign_citation":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/action/citation_signature","submit_replication":"https://pith.science/pith/MY6FUT4TEKJZC2Y7N2HHPN3G4Z/action/replication_record"}},"created_at":"2026-05-18T02:32:45.645055+00:00","updated_at":"2026-05-18T02:32:45.645055+00:00"}