{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M6VEOFZ3FNASNAID2TTOEMMM56","short_pith_number":"pith:M6VEOFZ3","schema_version":"1.0","canonical_sha256":"67aa47173b2b41268103d4e6e2318cefa85a25a0891ea55d2072066dabea835d","source":{"kind":"arxiv","id":"1601.04692","version":1},"attestation_state":"computed","paper":{"title":"Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Jean Gallier","submitted_at":"2016-01-18T20:57:41Z","abstract_excerpt":"This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi and Malik, including complete proofs. The main thrust of this paper is the method of normalized cuts. I give a detailed account for K = 2 clusters, and also for K > 2 clusters, based on the work of Yu and Shi. I also show how both graph drawing and normalized cut K-clustering can be easily generalized to handle signed graphs, which are weighted graphs in whi"},"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.04692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-18T20:57:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a4dc19d5b7d6072d50475b7e3bd990caa19750bc7582ca4c81a6357e17897fb1","abstract_canon_sha256":"c2cd6aae71954dedba4dfbf4adbbc04dc33b3d2e4ec07325e3fd609c6d36fef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:44.418392Z","signature_b64":"3O5xol5nnuTSGvuOV9dNggs42xikw44Aox3+zRfMd+CLcpcadoWf+Q2Gaq1+EpnV0QLG65kw0c2mkw9BKkU5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67aa47173b2b41268103d4e6e2318cefa85a25a0891ea55d2072066dabea835d","last_reissued_at":"2026-05-18T01:22:44.417778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:44.417778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Jean Gallier","submitted_at":"2016-01-18T20:57:41Z","abstract_excerpt":"This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi and Malik, including complete proofs. The main thrust of this paper is the method of normalized cuts. I give a detailed account for K = 2 clusters, and also for K > 2 clusters, based on the work of Yu and Shi. I also show how both graph drawing and normalized cut K-clustering can be easily generalized to handle signed graphs, which are weighted graphs in whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04692","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.04692","created_at":"2026-05-18T01:22:44.417861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04692v1","created_at":"2026-05-18T01:22:44.417861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04692","created_at":"2026-05-18T01:22:44.417861+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6VEOFZ3FNAS","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6VEOFZ3FNASNAID","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6VEOFZ3","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04349","citing_title":"Open problems in the spectral theory of signed graphs","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56","json":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56.json","graph_json":"https://pith.science/api/pith-number/M6VEOFZ3FNASNAID2TTOEMMM56/graph.json","events_json":"https://pith.science/api/pith-number/M6VEOFZ3FNASNAID2TTOEMMM56/events.json","paper":"https://pith.science/paper/M6VEOFZ3"},"agent_actions":{"view_html":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56","download_json":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56.json","view_paper":"https://pith.science/paper/M6VEOFZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04692&json=true","fetch_graph":"https://pith.science/api/pith-number/M6VEOFZ3FNASNAID2TTOEMMM56/graph.json","fetch_events":"https://pith.science/api/pith-number/M6VEOFZ3FNASNAID2TTOEMMM56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56/action/storage_attestation","attest_author":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56/action/author_attestation","sign_citation":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56/action/citation_signature","submit_replication":"https://pith.science/pith/M6VEOFZ3FNASNAID2TTOEMMM56/action/replication_record"}},"created_at":"2026-05-18T01:22:44.417861+00:00","updated_at":"2026-05-18T01:22:44.417861+00:00"}