{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OLLLOZCT7CUND5JDR4RKFQRJRG","short_pith_number":"pith:OLLLOZCT","canonical_record":{"source":{"id":"2509.09652","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-11T17:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"2729a637c49c2673308f054d1735fc4ab965ce3347301512dcfecd435af3a2df","abstract_canon_sha256":"354bf301c6fe96ff4985a4db13f59048ba91050b5a04fd5a9d57100e7db1eeef"},"schema_version":"1.0"},"canonical_sha256":"72d6b76453f8a8d1f5238f22a2c22989bd0da2318193ba9d59370bf6554df4f4","source":{"kind":"arxiv","id":"2509.09652","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09652","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09652v1","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09652","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"OLLLOZCT7CUN","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"pith_short_16","alias_value":"OLLLOZCT7CUND5JD","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"pith_short_8","alias_value":"OLLLOZCT","created_at":"2026-07-05T12:09:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OLLLOZCT7CUND5JDR4RKFQRJRG","target":"record","payload":{"canonical_record":{"source":{"id":"2509.09652","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-11T17:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"2729a637c49c2673308f054d1735fc4ab965ce3347301512dcfecd435af3a2df","abstract_canon_sha256":"354bf301c6fe96ff4985a4db13f59048ba91050b5a04fd5a9d57100e7db1eeef"},"schema_version":"1.0"},"canonical_sha256":"72d6b76453f8a8d1f5238f22a2c22989bd0da2318193ba9d59370bf6554df4f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:40.280522Z","signature_b64":"rFepscSiaM/vQXLIPH5NxyT4nb3o5yjejNVSeM6vAb1WlqZkmarAeTLpzEXHlijlC4ItocYPhgqseaS8SJiMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72d6b76453f8a8d1f5238f22a2c22989bd0da2318193ba9d59370bf6554df4f4","last_reissued_at":"2026-07-05T12:09:40.279998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:40.279998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.09652","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-05T12:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIm2S7b0rMsbSErcWrCkYKTSkxIZi8J3plfAJ0yiqxGrlUeaUdcdj2V6L7YgFM0+kHl7jviy7IQgWwK0NaKrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T04:30:49.824206Z"},"content_sha256":"5d14326f8010e0271ecee14ab93f1510829f20b30b043f9041d220aaead09756","schema_version":"1.0","event_id":"sha256:5d14326f8010e0271ecee14ab93f1510829f20b30b043f9041d220aaead09756"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OLLLOZCT7CUND5JDR4RKFQRJRG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Additive Approximation Schemes for Low-Dimensional Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ainesh Bakshi, Prashanti Anderson, Samuel B. Hopkins","submitted_at":"2025-09-11T17:45:21Z","abstract_excerpt":"We consider the task of fitting low-dimensional embeddings to high-dimensional data. In particular, we study the $k$-Euclidean Metric Violation problem ($\\textsf{$k$-EMV}$), where the input is $D \\in \\mathbb{R}^{\\binom{n}{2}}_{\\geq 0}$ and the goal is to find the closest vector $X \\in \\mathbb{M}_{k}$, where $\\mathbb{M}_k \\subset \\mathbb{R}^{\\binom{n}{2}}_{\\geq 0}$ is the set of all $k$-dimensional Euclidean metrics on $n$ points, and closeness is formulated as the following optimization problem, where $\\| \\cdot \\|$ is the entry-wise $\\ell_2$ norm: \\[\n  \\textsf{OPT}_{\\textrm{EMV}} = \\min_{X \\in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09652","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/2509.09652/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-05T12:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQiiGUp51TsndLgdzB+3EfuYIP6Z9jFKPp4AdXe/kQTBCfdMmxPywiee289y7kihX5CF5JuEjuAMMxx7PCY6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T04:30:49.824768Z"},"content_sha256":"ee045708e345b180a3f86fa5cac6dd0a6205ddaf3ae82a4e50177e93db533e93","schema_version":"1.0","event_id":"sha256:ee045708e345b180a3f86fa5cac6dd0a6205ddaf3ae82a4e50177e93db533e93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLLLOZCT7CUND5JDR4RKFQRJRG/bundle.json","state_url":"https://pith.science/pith/OLLLOZCT7CUND5JDR4RKFQRJRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLLLOZCT7CUND5JDR4RKFQRJRG/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-18T04:30:49Z","links":{"resolver":"https://pith.science/pith/OLLLOZCT7CUND5JDR4RKFQRJRG","bundle":"https://pith.science/pith/OLLLOZCT7CUND5JDR4RKFQRJRG/bundle.json","state":"https://pith.science/pith/OLLLOZCT7CUND5JDR4RKFQRJRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLLLOZCT7CUND5JDR4RKFQRJRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OLLLOZCT7CUND5JDR4RKFQRJRG","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":"354bf301c6fe96ff4985a4db13f59048ba91050b5a04fd5a9d57100e7db1eeef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-11T17:45:21Z","title_canon_sha256":"2729a637c49c2673308f054d1735fc4ab965ce3347301512dcfecd435af3a2df"},"schema_version":"1.0","source":{"id":"2509.09652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09652","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09652v1","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09652","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"OLLLOZCT7CUN","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"pith_short_16","alias_value":"OLLLOZCT7CUND5JD","created_at":"2026-07-05T12:09:40Z"},{"alias_kind":"pith_short_8","alias_value":"OLLLOZCT","created_at":"2026-07-05T12:09:40Z"}],"graph_snapshots":[{"event_id":"sha256:ee045708e345b180a3f86fa5cac6dd0a6205ddaf3ae82a4e50177e93db533e93","target":"graph","created_at":"2026-07-05T12:09:40Z","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/2509.09652/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the task of fitting low-dimensional embeddings to high-dimensional data. In particular, we study the $k$-Euclidean Metric Violation problem ($\\textsf{$k$-EMV}$), where the input is $D \\in \\mathbb{R}^{\\binom{n}{2}}_{\\geq 0}$ and the goal is to find the closest vector $X \\in \\mathbb{M}_{k}$, where $\\mathbb{M}_k \\subset \\mathbb{R}^{\\binom{n}{2}}_{\\geq 0}$ is the set of all $k$-dimensional Euclidean metrics on $n$ points, and closeness is formulated as the following optimization problem, where $\\| \\cdot \\|$ is the entry-wise $\\ell_2$ norm: \\[\n  \\textsf{OPT}_{\\textrm{EMV}} = \\min_{X \\in","authors_text":"Ainesh Bakshi, Prashanti Anderson, Samuel B. Hopkins","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-11T17:45:21Z","title":"Additive Approximation Schemes for Low-Dimensional Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09652","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:5d14326f8010e0271ecee14ab93f1510829f20b30b043f9041d220aaead09756","target":"record","created_at":"2026-07-05T12:09:40Z","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":"354bf301c6fe96ff4985a4db13f59048ba91050b5a04fd5a9d57100e7db1eeef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-11T17:45:21Z","title_canon_sha256":"2729a637c49c2673308f054d1735fc4ab965ce3347301512dcfecd435af3a2df"},"schema_version":"1.0","source":{"id":"2509.09652","kind":"arxiv","version":1}},"canonical_sha256":"72d6b76453f8a8d1f5238f22a2c22989bd0da2318193ba9d59370bf6554df4f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72d6b76453f8a8d1f5238f22a2c22989bd0da2318193ba9d59370bf6554df4f4","first_computed_at":"2026-07-05T12:09:40.279998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:09:40.279998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rFepscSiaM/vQXLIPH5NxyT4nb3o5yjejNVSeM6vAb1WlqZkmarAeTLpzEXHlijlC4ItocYPhgqseaS8SJiMAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:09:40.280522Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.09652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d14326f8010e0271ecee14ab93f1510829f20b30b043f9041d220aaead09756","sha256:ee045708e345b180a3f86fa5cac6dd0a6205ddaf3ae82a4e50177e93db533e93"],"state_sha256":"11bf3fd3ece92de0cf67155fff5cddd4d372abfaaff939191d428b66dda8b0f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OR7VHWW4bSqEAPiTn4DYG7+cszWlm6Ywhfg6VFdl2sut25G2eG5SNMH0821wavxqXmnKFyV3/E0Cc0oNndY+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T04:30:49.829679Z","bundle_sha256":"ba4fcc0cbf158a4419087d3e4b31abaf787041c033323ce1e22ed9b1fcd2b220"}}