{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C4WXMBYLB4GRBKYZ6F3EMMIE32","short_pith_number":"pith:C4WXMBYL","schema_version":"1.0","canonical_sha256":"172d76070b0f0d10ab19f176463104debb3ed2a96a02d765cb42b97498ae02ff","source":{"kind":"arxiv","id":"1308.4915","version":2},"attestation_state":"computed","paper":{"title":"Minimal Dirichlet energy partitions for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Braxton Osting, Chris D. White, Edouard Oudet","submitted_at":"2013-08-22T17:02:57Z","abstract_excerpt":"Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified and a novel rearrangement algorithm is proposed, which we show is strictly decreasing and converges in a finite number of iterations to a local minimum of the relaxed objective function. Our method is applied to several clustering problems on graphs constructed from synthetic data, MNIST handwritten digits, and manifold discretizations. The model has a semi-su"},"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":"1308.4915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T17:02:57Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"cf8aedfab58d97eb35b2b79c007240771fed0faea06860ea821f22ce16c24104","abstract_canon_sha256":"6b86c783d9e5526335543439deed178401c142af4a43973746cea4533c0f8dcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:15.252355Z","signature_b64":"h/4GbPZjnn3eejoZW1EG1hz9RI8MxyfhJQyP+sRht061FKoL94Zf1fAbcSa+Z7cO0sYlnY/kZwtjtvADKwdDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172d76070b0f0d10ab19f176463104debb3ed2a96a02d765cb42b97498ae02ff","last_reissued_at":"2026-05-18T01:18:15.251828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:15.251828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Dirichlet energy partitions for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Braxton Osting, Chris D. White, Edouard Oudet","submitted_at":"2013-08-22T17:02:57Z","abstract_excerpt":"Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified and a novel rearrangement algorithm is proposed, which we show is strictly decreasing and converges in a finite number of iterations to a local minimum of the relaxed objective function. Our method is applied to several clustering problems on graphs constructed from synthetic data, MNIST handwritten digits, and manifold discretizations. The model has a semi-su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4915","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":"1308.4915","created_at":"2026-05-18T01:18:15.251911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4915v2","created_at":"2026-05-18T01:18:15.251911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4915","created_at":"2026-05-18T01:18:15.251911+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4WXMBYLB4GR","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4WXMBYLB4GRBKYZ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4WXMBYL","created_at":"2026-05-18T12:27:40.988391+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/C4WXMBYLB4GRBKYZ6F3EMMIE32","json":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32.json","graph_json":"https://pith.science/api/pith-number/C4WXMBYLB4GRBKYZ6F3EMMIE32/graph.json","events_json":"https://pith.science/api/pith-number/C4WXMBYLB4GRBKYZ6F3EMMIE32/events.json","paper":"https://pith.science/paper/C4WXMBYL"},"agent_actions":{"view_html":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32","download_json":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32.json","view_paper":"https://pith.science/paper/C4WXMBYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4915&json=true","fetch_graph":"https://pith.science/api/pith-number/C4WXMBYLB4GRBKYZ6F3EMMIE32/graph.json","fetch_events":"https://pith.science/api/pith-number/C4WXMBYLB4GRBKYZ6F3EMMIE32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/action/storage_attestation","attest_author":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/action/author_attestation","sign_citation":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/action/citation_signature","submit_replication":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/action/replication_record"}},"created_at":"2026-05-18T01:18:15.251911+00:00","updated_at":"2026-05-18T01:18:15.251911+00:00"}