{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:32PLZ2UHBVGAQP34BJ24HH3NIX","short_pith_number":"pith:32PLZ2UH","canonical_record":{"source":{"id":"2508.06774","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-09T02:00:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c88ba7b572d8c8546c4e510df3aec22c3068a9fc271f1e9bef9c85b7142badfd","abstract_canon_sha256":"5cb40df2ab14d038370479bc8815d0b5bd7a7e01368802dff1528053613e261f"},"schema_version":"1.0"},"canonical_sha256":"de9ebcea870d4c083f7c0a75c39f6d45d4de3114f9a4677e5bc40636117da509","source":{"kind":"arxiv","id":"2508.06774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.06774","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"2508.06774v1","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06774","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"32PLZ2UHBVGA","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"pith_short_16","alias_value":"32PLZ2UHBVGAQP34","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"pith_short_8","alias_value":"32PLZ2UH","created_at":"2026-07-05T11:59:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:32PLZ2UHBVGAQP34BJ24HH3NIX","target":"record","payload":{"canonical_record":{"source":{"id":"2508.06774","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-09T02:00:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c88ba7b572d8c8546c4e510df3aec22c3068a9fc271f1e9bef9c85b7142badfd","abstract_canon_sha256":"5cb40df2ab14d038370479bc8815d0b5bd7a7e01368802dff1528053613e261f"},"schema_version":"1.0"},"canonical_sha256":"de9ebcea870d4c083f7c0a75c39f6d45d4de3114f9a4677e5bc40636117da509","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:19.638376Z","signature_b64":"QLphhqJ0zliYp9BwhzTR0cvl6WFx7rqWDD9mLtt8ff9EeE/rpBYnQi2j4QCHeMslH5jVZqQJyrohUYkddXmSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de9ebcea870d4c083f7c0a75c39f6d45d4de3114f9a4677e5bc40636117da509","last_reissued_at":"2026-07-05T11:59:19.637928Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:19.637928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.06774","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-05T11:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiIy68zEBhkyJItY+yKbBuNig66Eg4VemeMmqp1hYQjyUOIps0HPlDoZsXpp9mcj8TqS5Oz84BqVlc5oMU4WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:58:23.065672Z"},"content_sha256":"902c47b3cb023348bb67f2575503d9e8cdaf64fcd0a607932903589babc05769","schema_version":"1.0","event_id":"sha256:902c47b3cb023348bb67f2575503d9e8cdaf64fcd0a607932903589babc05769"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:32PLZ2UHBVGAQP34BJ24HH3NIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Erik Waingarten, Lorenzo Beretta, Rajesh Jayaram, Vincent Cohen-Addad","submitted_at":"2025-08-09T02:00:53Z","abstract_excerpt":"We give a reduction from $(1+\\varepsilon)$-approximate Earth Mover's Distance (EMD) to $(1+\\varepsilon)$-approximate Closest Pair (CP). As a consequence, we improve the fastest known approximation algorithm for high-dimensional EMD. Here, given $p\\in [1, 2]$ and two sets of $n$ points $X,Y \\subseteq (\\mathbb R^d,\\ell_p)$, their EMD is the minimum cost of a perfect matching between $X$ and $Y$, where the cost of matching two vectors is their $\\ell_p$ distance. Further, CP is the basic problem of finding a pair of points realizing $\\min_{x \\in X, y\\in Y} ||x-y||_p$. Our contribution is twofold: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06774","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/2508.06774/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-05T11:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NbgiFvGaKxVAVu7q98zxakCq9FolZOdjRlHE+w+LBTAIHSgU3VINIG2LSlzeup/qaJ8LMXLPO5bA9KVP0wyfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:58:23.066233Z"},"content_sha256":"8f01e6f84b2b6a0064c131b1a598fd21d9fd2d52dccf1515c77cdd58c703ae70","schema_version":"1.0","event_id":"sha256:8f01e6f84b2b6a0064c131b1a598fd21d9fd2d52dccf1515c77cdd58c703ae70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/bundle.json","state_url":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/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-05T03:58:23Z","links":{"resolver":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX","bundle":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/bundle.json","state":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:32PLZ2UHBVGAQP34BJ24HH3NIX","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":"5cb40df2ab14d038370479bc8815d0b5bd7a7e01368802dff1528053613e261f","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-09T02:00:53Z","title_canon_sha256":"c88ba7b572d8c8546c4e510df3aec22c3068a9fc271f1e9bef9c85b7142badfd"},"schema_version":"1.0","source":{"id":"2508.06774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.06774","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"2508.06774v1","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06774","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"32PLZ2UHBVGA","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"pith_short_16","alias_value":"32PLZ2UHBVGAQP34","created_at":"2026-07-05T11:59:19Z"},{"alias_kind":"pith_short_8","alias_value":"32PLZ2UH","created_at":"2026-07-05T11:59:19Z"}],"graph_snapshots":[{"event_id":"sha256:8f01e6f84b2b6a0064c131b1a598fd21d9fd2d52dccf1515c77cdd58c703ae70","target":"graph","created_at":"2026-07-05T11:59:19Z","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/2508.06774/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a reduction from $(1+\\varepsilon)$-approximate Earth Mover's Distance (EMD) to $(1+\\varepsilon)$-approximate Closest Pair (CP). As a consequence, we improve the fastest known approximation algorithm for high-dimensional EMD. Here, given $p\\in [1, 2]$ and two sets of $n$ points $X,Y \\subseteq (\\mathbb R^d,\\ell_p)$, their EMD is the minimum cost of a perfect matching between $X$ and $Y$, where the cost of matching two vectors is their $\\ell_p$ distance. Further, CP is the basic problem of finding a pair of points realizing $\\min_{x \\in X, y\\in Y} ||x-y||_p$. Our contribution is twofold: ","authors_text":"Erik Waingarten, Lorenzo Beretta, Rajesh Jayaram, Vincent Cohen-Addad","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06774","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:902c47b3cb023348bb67f2575503d9e8cdaf64fcd0a607932903589babc05769","target":"record","created_at":"2026-07-05T11:59:19Z","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":"5cb40df2ab14d038370479bc8815d0b5bd7a7e01368802dff1528053613e261f","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-09T02:00:53Z","title_canon_sha256":"c88ba7b572d8c8546c4e510df3aec22c3068a9fc271f1e9bef9c85b7142badfd"},"schema_version":"1.0","source":{"id":"2508.06774","kind":"arxiv","version":1}},"canonical_sha256":"de9ebcea870d4c083f7c0a75c39f6d45d4de3114f9a4677e5bc40636117da509","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de9ebcea870d4c083f7c0a75c39f6d45d4de3114f9a4677e5bc40636117da509","first_computed_at":"2026-07-05T11:59:19.637928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:59:19.637928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QLphhqJ0zliYp9BwhzTR0cvl6WFx7rqWDD9mLtt8ff9EeE/rpBYnQi2j4QCHeMslH5jVZqQJyrohUYkddXmSCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:59:19.638376Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.06774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:902c47b3cb023348bb67f2575503d9e8cdaf64fcd0a607932903589babc05769","sha256:8f01e6f84b2b6a0064c131b1a598fd21d9fd2d52dccf1515c77cdd58c703ae70"],"state_sha256":"e2015b3e5bd8c8c8dee536f06372f80f5ccb193dbb452df39fe354e33e6b6307"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Lyvr8tUJgtrdYVYN7Mpc6xvJFKUlmL8rahFhVYBg7yZ9q+x5ZnKfTpHy8Ku6pI4ip4ty3y7GIfsF7qNDATDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:58:23.071486Z","bundle_sha256":"da1762e492d96f87d4064f18e70d37e338e53803084b243e81067a3a8d0b50ae"}}