{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C4WXMBYLB4GRBKYZ6F3EMMIE32","short_pith_number":"pith:C4WXMBYL","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"},"canonical_sha256":"172d76070b0f0d10ab19f176463104debb3ed2a96a02d765cb42b97498ae02ff","source":{"kind":"arxiv","id":"1308.4915","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4915","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4915v2","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4915","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"C4WXMBYLB4GR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C4WXMBYLB4GRBKYZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C4WXMBYL","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C4WXMBYLB4GRBKYZ6F3EMMIE32","target":"record","payload":{"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"},"canonical_sha256":"172d76070b0f0d10ab19f176463104debb3ed2a96a02d765cb42b97498ae02ff","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"},"source_kind":"arxiv","source_id":"1308.4915","source_version":2,"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-18T01:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nH8A/TeT5EeGbpHeixL81wKWk1mLPoBfTagudY3wphnKlJk8fKwZhz92wQHK369xWHGjcdce1GsJ9MQqWfGzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:51:47.719516Z"},"content_sha256":"4a645cd1376417d78f40ab9997e7b9374eab388bcb10c5af8811f4351dbc4b91","schema_version":"1.0","event_id":"sha256:4a645cd1376417d78f40ab9997e7b9374eab388bcb10c5af8811f4351dbc4b91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C4WXMBYLB4GRBKYZ6F3EMMIE32","target":"graph","payload":{"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"},"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-18T01:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9ZCoaLMrKrlfMIq8vpTSy+wimU8sgzhSvIoZoWn7QYD/8DBxlayC9VuJff4x+cQRih3LcbB3HpEZFnFABoADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:51:47.720182Z"},"content_sha256":"d1110ba3b93fea887811cd52ead0553731e8fbd101c701f520c903135c0d5365","schema_version":"1.0","event_id":"sha256:d1110ba3b93fea887811cd52ead0553731e8fbd101c701f520c903135c0d5365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/bundle.json","state_url":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/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-26T15:51:47Z","links":{"resolver":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32","bundle":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/bundle.json","state":"https://pith.science/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4WXMBYLB4GRBKYZ6F3EMMIE32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C4WXMBYLB4GRBKYZ6F3EMMIE32","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":"6b86c783d9e5526335543439deed178401c142af4a43973746cea4533c0f8dcf","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T17:02:57Z","title_canon_sha256":"cf8aedfab58d97eb35b2b79c007240771fed0faea06860ea821f22ce16c24104"},"schema_version":"1.0","source":{"id":"1308.4915","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4915","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4915v2","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4915","created_at":"2026-05-18T01:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"C4WXMBYLB4GR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C4WXMBYLB4GRBKYZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C4WXMBYL","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:d1110ba3b93fea887811cd52ead0553731e8fbd101c701f520c903135c0d5365","target":"graph","created_at":"2026-05-18T01:18:15Z","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":"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","authors_text":"Braxton Osting, Chris D. White, Edouard Oudet","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T17:02:57Z","title":"Minimal Dirichlet energy partitions for graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4915","kind":"arxiv","version":2},"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:4a645cd1376417d78f40ab9997e7b9374eab388bcb10c5af8811f4351dbc4b91","target":"record","created_at":"2026-05-18T01:18:15Z","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":"6b86c783d9e5526335543439deed178401c142af4a43973746cea4533c0f8dcf","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T17:02:57Z","title_canon_sha256":"cf8aedfab58d97eb35b2b79c007240771fed0faea06860ea821f22ce16c24104"},"schema_version":"1.0","source":{"id":"1308.4915","kind":"arxiv","version":2}},"canonical_sha256":"172d76070b0f0d10ab19f176463104debb3ed2a96a02d765cb42b97498ae02ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"172d76070b0f0d10ab19f176463104debb3ed2a96a02d765cb42b97498ae02ff","first_computed_at":"2026-05-18T01:18:15.251828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:15.251828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h/4GbPZjnn3eejoZW1EG1hz9RI8MxyfhJQyP+sRht061FKoL94Zf1fAbcSa+Z7cO0sYlnY/kZwtjtvADKwdDCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:15.252355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4915","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a645cd1376417d78f40ab9997e7b9374eab388bcb10c5af8811f4351dbc4b91","sha256:d1110ba3b93fea887811cd52ead0553731e8fbd101c701f520c903135c0d5365"],"state_sha256":"3dc960e3578d3eb65bcafc8fe8849d987bc896e9cb340e8a65f65b623d4b91a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMcFq4nU2ylkX/FTmHzM/bKOWOI4O9RCZyqVBL3XC0fUuBdx/dO4hiLsHNTD0+sYueIq6dZV9a3t8tNS+1veDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:51:47.722708Z","bundle_sha256":"e754552fcf9c661967c4c0de38abd13ec52ec765e294f003fd358ce6273adbfe"}}