{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:56LCD4MQG5MKMIK3PAPF3APQJC","short_pith_number":"pith:56LCD4MQ","canonical_record":{"source":{"id":"1803.08037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-21T17:55:02Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7c42925c126f359117e18a62481a0a3d4d3869f34f87d62cd862800c1fc9c793","abstract_canon_sha256":"c9957d67f10c2393f53def720d84bd82bf3ee86c23e4de7f880330d8c4e4ed96"},"schema_version":"1.0"},"canonical_sha256":"ef9621f1903758a6215b781e5d81f0489bace9436271d65a5793ed4d2bf34743","source":{"kind":"arxiv","id":"1803.08037","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08037","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08037v2","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08037","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"56LCD4MQG5MK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"56LCD4MQG5MKMIK3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"56LCD4MQ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:56LCD4MQG5MKMIK3PAPF3APQJC","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-21T17:55:02Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7c42925c126f359117e18a62481a0a3d4d3869f34f87d62cd862800c1fc9c793","abstract_canon_sha256":"c9957d67f10c2393f53def720d84bd82bf3ee86c23e4de7f880330d8c4e4ed96"},"schema_version":"1.0"},"canonical_sha256":"ef9621f1903758a6215b781e5d81f0489bace9436271d65a5793ed4d2bf34743","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:13.286360Z","signature_b64":"YxDj8SRHrexfHx5xYh0OGTHJYfhMLrByUA6EdpjOTfif6i+YfKs0LkZVNnrpEXYwbIT8mC64zj7mMr145j2tAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef9621f1903758a6215b781e5d81f0489bace9436271d65a5793ed4d2bf34743","last_reissued_at":"2026-05-18T00:20:13.285743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:13.285743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08037","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-18T00:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HEJ55PRneveXvQ5T7QVOjeRClkOhj0JDhAyMBYAdccP8FEpidSnJijOYC44omDJb+h/zhId73raDTkXG6pYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:29:14.127337Z"},"content_sha256":"315a46be91c63cd9be8d05092ce18d86bba4ecb5e744ad0feadedb716d3eaedd","schema_version":"1.0","event_id":"sha256:315a46be91c63cd9be8d05092ce18d86bba4ecb5e744ad0feadedb716d3eaedd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:56LCD4MQG5MKMIK3PAPF3APQJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Similar Elements and Metric Labeling on Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Pedro F. Felzenszwalb","submitted_at":"2018-03-21T17:55:02Z","abstract_excerpt":"We consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition. We formulate the similar elements problem as an optimization and give an efficient approximation algorithm that finds a solution within a factor of 2 of the optimal. The similar elements problem is a special case of the metric labeling problem and we also give an efficient 2-approximation algorithm for the metric labeling problem on complete graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08037","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-18T00:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTCUkg6QqznD0twzFYVB7Hizzvc4bsxWlquuRT1v+vpghyKuwefzjQIaG9doWEsypcYJoy/m1xHnIytL3i1zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:29:14.127680Z"},"content_sha256":"b315c3f1e6cbf1654307c64f685bcb2392fbb5b8ec5bc182fed5cdb3869fc0ab","schema_version":"1.0","event_id":"sha256:b315c3f1e6cbf1654307c64f685bcb2392fbb5b8ec5bc182fed5cdb3869fc0ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56LCD4MQG5MKMIK3PAPF3APQJC/bundle.json","state_url":"https://pith.science/pith/56LCD4MQG5MKMIK3PAPF3APQJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56LCD4MQG5MKMIK3PAPF3APQJC/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-23T17:29:14Z","links":{"resolver":"https://pith.science/pith/56LCD4MQG5MKMIK3PAPF3APQJC","bundle":"https://pith.science/pith/56LCD4MQG5MKMIK3PAPF3APQJC/bundle.json","state":"https://pith.science/pith/56LCD4MQG5MKMIK3PAPF3APQJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56LCD4MQG5MKMIK3PAPF3APQJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:56LCD4MQG5MKMIK3PAPF3APQJC","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":"c9957d67f10c2393f53def720d84bd82bf3ee86c23e4de7f880330d8c4e4ed96","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-21T17:55:02Z","title_canon_sha256":"7c42925c126f359117e18a62481a0a3d4d3869f34f87d62cd862800c1fc9c793"},"schema_version":"1.0","source":{"id":"1803.08037","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08037","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08037v2","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08037","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"56LCD4MQG5MK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"56LCD4MQG5MKMIK3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"56LCD4MQ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:b315c3f1e6cbf1654307c64f685bcb2392fbb5b8ec5bc182fed5cdb3869fc0ab","target":"graph","created_at":"2026-05-18T00:20:13Z","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 consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition. We formulate the similar elements problem as an optimization and give an efficient approximation algorithm that finds a solution within a factor of 2 of the optimal. The similar elements problem is a special case of the metric labeling problem and we also give an efficient 2-approximation algorithm for the metric labeling problem on complete graphs.","authors_text":"Pedro F. Felzenszwalb","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-21T17:55:02Z","title":"Similar Elements and Metric Labeling on Complete Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08037","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:315a46be91c63cd9be8d05092ce18d86bba4ecb5e744ad0feadedb716d3eaedd","target":"record","created_at":"2026-05-18T00:20:13Z","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":"c9957d67f10c2393f53def720d84bd82bf3ee86c23e4de7f880330d8c4e4ed96","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-21T17:55:02Z","title_canon_sha256":"7c42925c126f359117e18a62481a0a3d4d3869f34f87d62cd862800c1fc9c793"},"schema_version":"1.0","source":{"id":"1803.08037","kind":"arxiv","version":2}},"canonical_sha256":"ef9621f1903758a6215b781e5d81f0489bace9436271d65a5793ed4d2bf34743","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef9621f1903758a6215b781e5d81f0489bace9436271d65a5793ed4d2bf34743","first_computed_at":"2026-05-18T00:20:13.285743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:13.285743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YxDj8SRHrexfHx5xYh0OGTHJYfhMLrByUA6EdpjOTfif6i+YfKs0LkZVNnrpEXYwbIT8mC64zj7mMr145j2tAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:13.286360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08037","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:315a46be91c63cd9be8d05092ce18d86bba4ecb5e744ad0feadedb716d3eaedd","sha256:b315c3f1e6cbf1654307c64f685bcb2392fbb5b8ec5bc182fed5cdb3869fc0ab"],"state_sha256":"595bfbdc57d85fa57a6a9a367500fcefdefa87693db1dfa68c404875c6ee9168"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19P06NNjjQvrmYCudc9JmYW5Q79tpklLS3oz+nEU+GU0lZ1+UZ1W4LoLy/k58k3m4Dr/XHDntyAmkxRX7OaPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:29:14.129601Z","bundle_sha256":"95f554c43a34e52f06cbf7f5aa8862aa65fa0f6d8d8e59819c9b101891348bc5"}}