{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3KR6OHLXGG7IJ2XBKV5N7PTPB5","short_pith_number":"pith:3KR6OHLX","canonical_record":{"source":{"id":"1806.01678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-05T13:25:30Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"edda2933277d36d65199128366f5b68573c71cd890a42533d0182217087a1feb","abstract_canon_sha256":"5a4f1f3fe4cc9bb88a0f57e4a29f746e39dd25340197aa10356327160881389f"},"schema_version":"1.0"},"canonical_sha256":"daa3e71d7731be84eae1557adfbe6f0f6182090ace67288e3e339de58234d36c","source":{"kind":"arxiv","id":"1806.01678","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01678","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01678v1","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01678","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"3KR6OHLXGG7I","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3KR6OHLXGG7IJ2XB","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3KR6OHLX","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3KR6OHLXGG7IJ2XBKV5N7PTPB5","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-05T13:25:30Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"edda2933277d36d65199128366f5b68573c71cd890a42533d0182217087a1feb","abstract_canon_sha256":"5a4f1f3fe4cc9bb88a0f57e4a29f746e39dd25340197aa10356327160881389f"},"schema_version":"1.0"},"canonical_sha256":"daa3e71d7731be84eae1557adfbe6f0f6182090ace67288e3e339de58234d36c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:12.066122Z","signature_b64":"MYBGuI4ViVxY75rh5+AX6u6XZOkIipfJ4YXF5sdMmozfI2aMkigE5rlEGuXGDhe6YDH5itPBzGarURQRAVhoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daa3e71d7731be84eae1557adfbe6f0f6182090ace67288e3e339de58234d36c","last_reissued_at":"2026-05-18T00:14:12.065427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:12.065427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01678","source_version":1,"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-18T00:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WMBJdy7Ax9YyMCVALmwVMAY7UtXhAmbUtwdEuwosy2pVtv8WIjIwH4og43kv1pFDu+6NEwdT/e/2A4R1kh9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:20:15.190934Z"},"content_sha256":"2a9b14172e2d985876041eb583c211c6a9fed61478b1a5df52c2f85e677d200c","schema_version":"1.0","event_id":"sha256:2a9b14172e2d985876041eb583c211c6a9fed61478b1a5df52c2f85e677d200c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3KR6OHLXGG7IJ2XBKV5N7PTPB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Projection Method for Metric-Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Anthony Wirth, David Gleich, James Saunderson, Nate Veldt","submitted_at":"2018-06-05T13:25:30Z","abstract_excerpt":"We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables. We refer to this as metric-constrained optimization, and give several examples where problems of this form arise in machine learning applications and theoretical approximation algorithms for graph clustering. Although these problem are interesting from a theoretical perspective, they are challenging to solve in practice due to the high memory requirement of black-box solvers. In order to address this challenge we first prove that the metric-constrained linear program relaxation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01678","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"},"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-18T00:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYfYTnmliVDAsOOpG1guq4GcWoaEJhnMqh+IzYDdBC55ADh9CJ6Ui9zJMg2uISOXLQxdkUTgEZ6QXI8sdCg+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:20:15.191753Z"},"content_sha256":"b33f8d28324720ce4c363c4417be328a8662801a98a9614c6767f88c336008bb","schema_version":"1.0","event_id":"sha256:b33f8d28324720ce4c363c4417be328a8662801a98a9614c6767f88c336008bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KR6OHLXGG7IJ2XBKV5N7PTPB5/bundle.json","state_url":"https://pith.science/pith/3KR6OHLXGG7IJ2XBKV5N7PTPB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KR6OHLXGG7IJ2XBKV5N7PTPB5/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-30T17:20:15Z","links":{"resolver":"https://pith.science/pith/3KR6OHLXGG7IJ2XBKV5N7PTPB5","bundle":"https://pith.science/pith/3KR6OHLXGG7IJ2XBKV5N7PTPB5/bundle.json","state":"https://pith.science/pith/3KR6OHLXGG7IJ2XBKV5N7PTPB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KR6OHLXGG7IJ2XBKV5N7PTPB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3KR6OHLXGG7IJ2XBKV5N7PTPB5","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":"5a4f1f3fe4cc9bb88a0f57e4a29f746e39dd25340197aa10356327160881389f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-05T13:25:30Z","title_canon_sha256":"edda2933277d36d65199128366f5b68573c71cd890a42533d0182217087a1feb"},"schema_version":"1.0","source":{"id":"1806.01678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01678","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01678v1","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01678","created_at":"2026-05-18T00:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"3KR6OHLXGG7I","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3KR6OHLXGG7IJ2XB","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3KR6OHLX","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:b33f8d28324720ce4c363c4417be328a8662801a98a9614c6767f88c336008bb","target":"graph","created_at":"2026-05-18T00:14:12Z","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":"We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables. We refer to this as metric-constrained optimization, and give several examples where problems of this form arise in machine learning applications and theoretical approximation algorithms for graph clustering. Although these problem are interesting from a theoretical perspective, they are challenging to solve in practice due to the high memory requirement of black-box solvers. In order to address this challenge we first prove that the metric-constrained linear program relaxation ","authors_text":"Anthony Wirth, David Gleich, James Saunderson, Nate Veldt","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-05T13:25:30Z","title":"A Projection Method for Metric-Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01678","kind":"arxiv","version":1},"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:2a9b14172e2d985876041eb583c211c6a9fed61478b1a5df52c2f85e677d200c","target":"record","created_at":"2026-05-18T00:14:12Z","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":"5a4f1f3fe4cc9bb88a0f57e4a29f746e39dd25340197aa10356327160881389f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-06-05T13:25:30Z","title_canon_sha256":"edda2933277d36d65199128366f5b68573c71cd890a42533d0182217087a1feb"},"schema_version":"1.0","source":{"id":"1806.01678","kind":"arxiv","version":1}},"canonical_sha256":"daa3e71d7731be84eae1557adfbe6f0f6182090ace67288e3e339de58234d36c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daa3e71d7731be84eae1557adfbe6f0f6182090ace67288e3e339de58234d36c","first_computed_at":"2026-05-18T00:14:12.065427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:12.065427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MYBGuI4ViVxY75rh5+AX6u6XZOkIipfJ4YXF5sdMmozfI2aMkigE5rlEGuXGDhe6YDH5itPBzGarURQRAVhoBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:12.066122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a9b14172e2d985876041eb583c211c6a9fed61478b1a5df52c2f85e677d200c","sha256:b33f8d28324720ce4c363c4417be328a8662801a98a9614c6767f88c336008bb"],"state_sha256":"f4f3e6035c4e3720a0b69852338c53aecbac0757042254f43c7a9539945c5ab2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEr4rq+YsAmK6Opls9U4hCzAeEim1jHMDbvczEX6fHQR3VvoupbCoWh6ctqTqmbGkELYCTZyjoLt5OGCmPnHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:20:15.196199Z","bundle_sha256":"a8be302823bc711c6171f8266041a31f9d9e9bb06b4a828ffa9e1e0b80ee3c5e"}}