{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LP2WRROVBMXHLLSKELYID7P4UZ","short_pith_number":"pith:LP2WRROV","canonical_record":{"source":{"id":"1901.10084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-29T03:14:24Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"f10cdefce5f3f7644b5d3c77161c613be4f857544844492313600bed9d144e7e","abstract_canon_sha256":"bb7ce52066da3353757897015230c2b1f81daf35c32b4f656f345417338aea25"},"schema_version":"1.0"},"canonical_sha256":"5bf568c5d50b2e75ae4a22f081fdfca6475de55fced0df56edffc19791e864cf","source":{"kind":"arxiv","id":"1901.10084","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10084","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10084v1","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10084","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"pith_short_12","alias_value":"LP2WRROVBMXH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LP2WRROVBMXHLLSK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LP2WRROV","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LP2WRROVBMXHLLSKELYID7P4UZ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-29T03:14:24Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"f10cdefce5f3f7644b5d3c77161c613be4f857544844492313600bed9d144e7e","abstract_canon_sha256":"bb7ce52066da3353757897015230c2b1f81daf35c32b4f656f345417338aea25"},"schema_version":"1.0"},"canonical_sha256":"5bf568c5d50b2e75ae4a22f081fdfca6475de55fced0df56edffc19791e864cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:16.209238Z","signature_b64":"AYM7TdwtmtstGOjlhn5xpRZWSFyVxfHFZ45zxwUvgLzT9agoqSth0OdSTVDP6W1Vs56ROttod90zw9Cd34rTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bf568c5d50b2e75ae4a22f081fdfca6475de55fced0df56edffc19791e864cf","last_reissued_at":"2026-05-17T23:55:16.208781Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:16.208781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10084","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-17T23:55:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Kh+O0z7qxCVlfl2jV+srxi5twq12T2avLs9tStXvNWAyfqdYdE4tv4Xjxb2tB4pasd3IDQpdy4BsSNC6D0MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:21:35.355220Z"},"content_sha256":"6852edad157f6adc26e2ac585b8c09310ac7a8b1e18f9b43d690f39d4815f176","schema_version":"1.0","event_id":"sha256:6852edad157f6adc26e2ac585b8c09310ac7a8b1e18f9b43d690f39d4815f176"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LP2WRROVBMXHLLSKELYID7P4UZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parallel Projection Method for Metric Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.DC","authors_text":"Cameron Ruggles, David F. Gleich, Nate Veldt","submitted_at":"2019-01-29T03:14:24Z","abstract_excerpt":"Many clustering applications in machine learning and data mining rely on solving metric-constrained optimization problems. These problems are characterized by $O(n^3)$ constraints that enforce triangle inequalities on distance variables associated with $n$ objects in a large dataset. Despite its usefulness, metric-constrained optimization is challenging in practice due to the cubic number of constraints and the high-memory requirements of standard optimization software. Recent work has shown that iterative projection methods are able to solve metric-constrained optimization problems on a much "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10084","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-17T23:55:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NR9Hug65l8RelGWduAiFnTvvjFgEvgyn0GsPj6XzH3ctGV7yr+X5R7qypdu41h5Nr+XebtEbPkO+D4/AfnQ6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:21:35.355589Z"},"content_sha256":"f34aebe52c4a89d68f47324e9f6668cf1a75af0dce1a4b61eccf5fdcf8fb97c2","schema_version":"1.0","event_id":"sha256:f34aebe52c4a89d68f47324e9f6668cf1a75af0dce1a4b61eccf5fdcf8fb97c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/bundle.json","state_url":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LP2WRROVBMXHLLSKELYID7P4UZ/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-06-21T22:21:35Z","links":{"resolver":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ","bundle":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/bundle.json","state":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LP2WRROVBMXHLLSKELYID7P4UZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LP2WRROVBMXHLLSKELYID7P4UZ","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":"bb7ce52066da3353757897015230c2b1f81daf35c32b4f656f345417338aea25","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-29T03:14:24Z","title_canon_sha256":"f10cdefce5f3f7644b5d3c77161c613be4f857544844492313600bed9d144e7e"},"schema_version":"1.0","source":{"id":"1901.10084","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10084","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10084v1","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10084","created_at":"2026-05-17T23:55:16Z"},{"alias_kind":"pith_short_12","alias_value":"LP2WRROVBMXH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LP2WRROVBMXHLLSK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LP2WRROV","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:f34aebe52c4a89d68f47324e9f6668cf1a75af0dce1a4b61eccf5fdcf8fb97c2","target":"graph","created_at":"2026-05-17T23:55:16Z","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":"Many clustering applications in machine learning and data mining rely on solving metric-constrained optimization problems. These problems are characterized by $O(n^3)$ constraints that enforce triangle inequalities on distance variables associated with $n$ objects in a large dataset. Despite its usefulness, metric-constrained optimization is challenging in practice due to the cubic number of constraints and the high-memory requirements of standard optimization software. Recent work has shown that iterative projection methods are able to solve metric-constrained optimization problems on a much ","authors_text":"Cameron Ruggles, David F. Gleich, Nate Veldt","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-29T03:14:24Z","title":"A Parallel Projection Method for Metric Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10084","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:6852edad157f6adc26e2ac585b8c09310ac7a8b1e18f9b43d690f39d4815f176","target":"record","created_at":"2026-05-17T23:55:16Z","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":"bb7ce52066da3353757897015230c2b1f81daf35c32b4f656f345417338aea25","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-29T03:14:24Z","title_canon_sha256":"f10cdefce5f3f7644b5d3c77161c613be4f857544844492313600bed9d144e7e"},"schema_version":"1.0","source":{"id":"1901.10084","kind":"arxiv","version":1}},"canonical_sha256":"5bf568c5d50b2e75ae4a22f081fdfca6475de55fced0df56edffc19791e864cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bf568c5d50b2e75ae4a22f081fdfca6475de55fced0df56edffc19791e864cf","first_computed_at":"2026-05-17T23:55:16.208781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:16.208781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AYM7TdwtmtstGOjlhn5xpRZWSFyVxfHFZ45zxwUvgLzT9agoqSth0OdSTVDP6W1Vs56ROttod90zw9Cd34rTDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:16.209238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10084","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6852edad157f6adc26e2ac585b8c09310ac7a8b1e18f9b43d690f39d4815f176","sha256:f34aebe52c4a89d68f47324e9f6668cf1a75af0dce1a4b61eccf5fdcf8fb97c2"],"state_sha256":"6c36e9e714d95cabc431d9019fddc2d82f90623247a707cba83e8b758de510cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z57GaEXbThntPAfadDx85iQdrvuRVaZ7lxc9P4Qgreom8IvEQooLSviYLwo719oD5B4f85ox5EyOIOsZzZ5fCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:21:35.357555Z","bundle_sha256":"09f1ddaba51986ee4b8d5b8fb5dd6406fac0bc9d16754a7ae17e69b87255f5ff"}}