{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RC3EV2NY2LL2V56AHR2HKSCKEG","short_pith_number":"pith:RC3EV2NY","canonical_record":{"source":{"id":"1707.08769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T08:05:45Z","cross_cats_sorted":[],"title_canon_sha256":"826e3cf62e757b8ef0c8a30d43d72284c996a04247c4dbd494effab45c903019","abstract_canon_sha256":"dba1454cf8196022622fa9556ca38506418202dd5a9af1d82678337433884f60"},"schema_version":"1.0"},"canonical_sha256":"88b64ae9b8d2d7aaf7c03c7475484a21839c00e69f1d41b6872eda25cf1c59aa","source":{"kind":"arxiv","id":"1707.08769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08769","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08769v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08769","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"RC3EV2NY2LL2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RC3EV2NY2LL2V56A","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RC3EV2NY","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RC3EV2NY2LL2V56AHR2HKSCKEG","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T08:05:45Z","cross_cats_sorted":[],"title_canon_sha256":"826e3cf62e757b8ef0c8a30d43d72284c996a04247c4dbd494effab45c903019","abstract_canon_sha256":"dba1454cf8196022622fa9556ca38506418202dd5a9af1d82678337433884f60"},"schema_version":"1.0"},"canonical_sha256":"88b64ae9b8d2d7aaf7c03c7475484a21839c00e69f1d41b6872eda25cf1c59aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:19.524855Z","signature_b64":"4QZJOyAl1KUbmSz2BwDMHlWgloDtjO9NucBkaaJ693ZI4TpXHKUXVKbuO7g6U8pW/YLGZqhyrFRTfsReuiDMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b64ae9b8d2d7aaf7c03c7475484a21839c00e69f1d41b6872eda25cf1c59aa","last_reissued_at":"2026-05-18T00:39:19.524119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:19.524119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08769","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-18T00:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKNJGYP19E8a8keNV3G9yS2x8wXxrS76GTYlgRGYjJWsTHaaZwjKlqoTAdyGETO1magvsjthra9IZB71EMu0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:19.168419Z"},"content_sha256":"39fe44528139c452b43c72ab4a7d1ef8b74133ed6095ceffed514ee326f99ad5","schema_version":"1.0","event_id":"sha256:39fe44528139c452b43c72ab4a7d1ef8b74133ed6095ceffed514ee326f99ad5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RC3EV2NY2LL2V56AHR2HKSCKEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey Spanning Trees and their Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Ittai Abraham, Michael Elkin, Ofer Neiman, Shiri Chechik","submitted_at":"2017-07-27T08:05:45Z","abstract_excerpt":"The metric Ramsey problem asks for the largest subset $S$ of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem. Mendel and Naor 2007 devised the so called Ramsey Partitions to address this problem, and showed the algorithmic applications of their techniques to approximate distance oracles and ranking problems.\n  In this paper we study the natural extension of the metric Ramsey problem to graphs, and introduce the notion of Ramsey Spanning Trees. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08769","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-18T00:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfSwWWHAjK1B8YhKUO6dMMmT4R+IgNuM48U3S6O7+TEHPW/npxvR/0AicvDLnnoiYN0ZPwXPeSMy1ZxWSgaHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:19.168758Z"},"content_sha256":"11c78cdf151b5d06862cc9617d8f2e9c3388a89d6ee57f38f4edc92679c01c73","schema_version":"1.0","event_id":"sha256:11c78cdf151b5d06862cc9617d8f2e9c3388a89d6ee57f38f4edc92679c01c73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RC3EV2NY2LL2V56AHR2HKSCKEG/bundle.json","state_url":"https://pith.science/pith/RC3EV2NY2LL2V56AHR2HKSCKEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RC3EV2NY2LL2V56AHR2HKSCKEG/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-04T19:17:19Z","links":{"resolver":"https://pith.science/pith/RC3EV2NY2LL2V56AHR2HKSCKEG","bundle":"https://pith.science/pith/RC3EV2NY2LL2V56AHR2HKSCKEG/bundle.json","state":"https://pith.science/pith/RC3EV2NY2LL2V56AHR2HKSCKEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RC3EV2NY2LL2V56AHR2HKSCKEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RC3EV2NY2LL2V56AHR2HKSCKEG","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":"dba1454cf8196022622fa9556ca38506418202dd5a9af1d82678337433884f60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T08:05:45Z","title_canon_sha256":"826e3cf62e757b8ef0c8a30d43d72284c996a04247c4dbd494effab45c903019"},"schema_version":"1.0","source":{"id":"1707.08769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08769","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08769v1","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08769","created_at":"2026-05-18T00:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"RC3EV2NY2LL2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RC3EV2NY2LL2V56A","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RC3EV2NY","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:11c78cdf151b5d06862cc9617d8f2e9c3388a89d6ee57f38f4edc92679c01c73","target":"graph","created_at":"2026-05-18T00:39: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"},"paper":{"abstract_excerpt":"The metric Ramsey problem asks for the largest subset $S$ of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem. Mendel and Naor 2007 devised the so called Ramsey Partitions to address this problem, and showed the algorithmic applications of their techniques to approximate distance oracles and ranking problems.\n  In this paper we study the natural extension of the metric Ramsey problem to graphs, and introduce the notion of Ramsey Spanning Trees. ","authors_text":"Arnold Filtser, Ittai Abraham, Michael Elkin, Ofer Neiman, Shiri Chechik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T08:05:45Z","title":"Ramsey Spanning Trees and their Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08769","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:39fe44528139c452b43c72ab4a7d1ef8b74133ed6095ceffed514ee326f99ad5","target":"record","created_at":"2026-05-18T00:39: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":"dba1454cf8196022622fa9556ca38506418202dd5a9af1d82678337433884f60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T08:05:45Z","title_canon_sha256":"826e3cf62e757b8ef0c8a30d43d72284c996a04247c4dbd494effab45c903019"},"schema_version":"1.0","source":{"id":"1707.08769","kind":"arxiv","version":1}},"canonical_sha256":"88b64ae9b8d2d7aaf7c03c7475484a21839c00e69f1d41b6872eda25cf1c59aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88b64ae9b8d2d7aaf7c03c7475484a21839c00e69f1d41b6872eda25cf1c59aa","first_computed_at":"2026-05-18T00:39:19.524119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:19.524119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4QZJOyAl1KUbmSz2BwDMHlWgloDtjO9NucBkaaJ693ZI4TpXHKUXVKbuO7g6U8pW/YLGZqhyrFRTfsReuiDMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:19.524855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39fe44528139c452b43c72ab4a7d1ef8b74133ed6095ceffed514ee326f99ad5","sha256:11c78cdf151b5d06862cc9617d8f2e9c3388a89d6ee57f38f4edc92679c01c73"],"state_sha256":"e5a319fe23043d9da50ccf0a27be9ba62d725bc6529b9b50f578033ce43db202"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okvDttAUYkkYy/+ZLll7mJ4dDHMgAeOepOUor10z1oEA0s0gRhFntvmOBW1ljBHJf0sfuc1GndRJ8R5mQh1xCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:17:19.170633Z","bundle_sha256":"d6604b722cd9ed7ba5bb25b59868115d5ca05080a5a21e3842c40be5975de2ad"}}