{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KNJF2XSLQMP34UXWYI7XURTUWT","short_pith_number":"pith:KNJF2XSL","canonical_record":{"source":{"id":"1908.08411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T17:14:52Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"251450cf920dd92e8b0b5a5ec1681322d082815d6faf5c08979f60bc110cb64c","abstract_canon_sha256":"50135f8ef88d3e0334c98aaa8fac98c3a0ddaadd69a72a29b8f97ae38a52f3ef"},"schema_version":"1.0"},"canonical_sha256":"53525d5e4b831fbe52f6c23f7a4674b4d87b8b86e9c23075b566f55698217c0a","source":{"kind":"arxiv","id":"1908.08411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08411","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08411v1","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08411","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"KNJF2XSLQMP3","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_16","alias_value":"KNJF2XSLQMP34UXW","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_8","alias_value":"KNJF2XSL","created_at":"2026-07-04T23:59:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KNJF2XSLQMP34UXWYI7XURTUWT","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T17:14:52Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"251450cf920dd92e8b0b5a5ec1681322d082815d6faf5c08979f60bc110cb64c","abstract_canon_sha256":"50135f8ef88d3e0334c98aaa8fac98c3a0ddaadd69a72a29b8f97ae38a52f3ef"},"schema_version":"1.0"},"canonical_sha256":"53525d5e4b831fbe52f6c23f7a4674b4d87b8b86e9c23075b566f55698217c0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:12.595484Z","signature_b64":"7fkz1lXVcHgAmofFvwUFhgo0tXsuYtIIUhHHvDsqIBkGHVjObQF1Z6ZdiydxwbJ5vo9VGBG8Yd+wgyGOsMg2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53525d5e4b831fbe52f6c23f7a4674b4d87b8b86e9c23075b566f55698217c0a","last_reissued_at":"2026-07-04T23:59:12.595051Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:12.595051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08411","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-07-04T23:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brKYdMy/SVwySmSUvZ0h6rOKiyp+NZwmTFhHJZOXUcAP3wq/sHyGKBfY4u7qV0/PtU9eI5OJmUKM1o4kfrHtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:37:39.432366Z"},"content_sha256":"b791151315ea6a080dd6899a76cd70ae6ac8fe91602542ab51928af1a80df6e9","schema_version":"1.0","event_id":"sha256:b791151315ea6a080dd6899a76cd70ae6ac8fe91602542ab51928af1a80df6e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KNJF2XSLQMP34UXWYI7XURTUWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Metric Repair on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Anna C. Gilbert, Benjamin Raichel, Chenglin Fan, Gregory Van Buskirk, Rishi Sonthalia","submitted_at":"2019-08-21T17:14:52Z","abstract_excerpt":"Many modern data analysis algorithms either assume or are considerably more efficient if the distances between the data points satisfy a metric. These algorithms include metric learning, clustering, and dimension reduction. As real data sets are noisy, distances often fail to satisfy a metric. For this reason, Gilbert and Jain and Fan et al. introduced the closely related sparse metric repair and metric violation distance problems. The goal of these problems is to repair as few distances as possible to ensure they satisfy a metric. Three variants were considered, one admitting a polynomial tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08411","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08411/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eApdN8KQWQISqxB6BKwO6bxUdoqhYMWOzunLinxibvirWqzYg0Hg4W+afHDgHP+36pJBz8bbPP2OmLR3fAn1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:37:39.433925Z"},"content_sha256":"00d786757bf2c033ce8fc7b36f6f8053ee57d1f7ee4af08cb4a6c760afba5e5d","schema_version":"1.0","event_id":"sha256:00d786757bf2c033ce8fc7b36f6f8053ee57d1f7ee4af08cb4a6c760afba5e5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNJF2XSLQMP34UXWYI7XURTUWT/bundle.json","state_url":"https://pith.science/pith/KNJF2XSLQMP34UXWYI7XURTUWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNJF2XSLQMP34UXWYI7XURTUWT/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-08-16T12:37:39Z","links":{"resolver":"https://pith.science/pith/KNJF2XSLQMP34UXWYI7XURTUWT","bundle":"https://pith.science/pith/KNJF2XSLQMP34UXWYI7XURTUWT/bundle.json","state":"https://pith.science/pith/KNJF2XSLQMP34UXWYI7XURTUWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNJF2XSLQMP34UXWYI7XURTUWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KNJF2XSLQMP34UXWYI7XURTUWT","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":"50135f8ef88d3e0334c98aaa8fac98c3a0ddaadd69a72a29b8f97ae38a52f3ef","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T17:14:52Z","title_canon_sha256":"251450cf920dd92e8b0b5a5ec1681322d082815d6faf5c08979f60bc110cb64c"},"schema_version":"1.0","source":{"id":"1908.08411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08411","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08411v1","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08411","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"KNJF2XSLQMP3","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_16","alias_value":"KNJF2XSLQMP34UXW","created_at":"2026-07-04T23:59:12Z"},{"alias_kind":"pith_short_8","alias_value":"KNJF2XSL","created_at":"2026-07-04T23:59:12Z"}],"graph_snapshots":[{"event_id":"sha256:00d786757bf2c033ce8fc7b36f6f8053ee57d1f7ee4af08cb4a6c760afba5e5d","target":"graph","created_at":"2026-07-04T23:59: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08411/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many modern data analysis algorithms either assume or are considerably more efficient if the distances between the data points satisfy a metric. These algorithms include metric learning, clustering, and dimension reduction. As real data sets are noisy, distances often fail to satisfy a metric. For this reason, Gilbert and Jain and Fan et al. introduced the closely related sparse metric repair and metric violation distance problems. The goal of these problems is to repair as few distances as possible to ensure they satisfy a metric. Three variants were considered, one admitting a polynomial tim","authors_text":"Anna C. Gilbert, Benjamin Raichel, Chenglin Fan, Gregory Van Buskirk, Rishi Sonthalia","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T17:14:52Z","title":"Generalized Metric Repair on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08411","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:b791151315ea6a080dd6899a76cd70ae6ac8fe91602542ab51928af1a80df6e9","target":"record","created_at":"2026-07-04T23:59: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":"50135f8ef88d3e0334c98aaa8fac98c3a0ddaadd69a72a29b8f97ae38a52f3ef","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-21T17:14:52Z","title_canon_sha256":"251450cf920dd92e8b0b5a5ec1681322d082815d6faf5c08979f60bc110cb64c"},"schema_version":"1.0","source":{"id":"1908.08411","kind":"arxiv","version":1}},"canonical_sha256":"53525d5e4b831fbe52f6c23f7a4674b4d87b8b86e9c23075b566f55698217c0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53525d5e4b831fbe52f6c23f7a4674b4d87b8b86e9c23075b566f55698217c0a","first_computed_at":"2026-07-04T23:59:12.595051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:12.595051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7fkz1lXVcHgAmofFvwUFhgo0tXsuYtIIUhHHvDsqIBkGHVjObQF1Z6ZdiydxwbJ5vo9VGBG8Yd+wgyGOsMg2AQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:12.595484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b791151315ea6a080dd6899a76cd70ae6ac8fe91602542ab51928af1a80df6e9","sha256:00d786757bf2c033ce8fc7b36f6f8053ee57d1f7ee4af08cb4a6c760afba5e5d"],"state_sha256":"239ba55c1166ef9dcf338e2d22e37653d5a64747423beb5d0ed85d6d3f85638f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNClhMKKIyZF7+8dWwSkRQIdKSXIlc4NaaCZYFtANi2u7wgV4oeL5xshjJ06/hmcfY3+jo6wzbia0/GK2cQdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:37:39.449691Z","bundle_sha256":"185049bf5c9fc55bdbedc39a500fcb22e3a097dcebfdc447d1480abe43e180bf"}}