{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EHAHCWZTFUAXAE77WOQ3SCCBKW","short_pith_number":"pith:EHAHCWZT","canonical_record":{"source":{"id":"1604.08342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T08:31:45Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7434915b80e74d99cb8f5eda6d2172e6749bb55ab91c10b673a58f680982e054","abstract_canon_sha256":"74eeae2e7d296be1e457d52e1d27ba113bea4ac074dc9c401a19ccf3148678c0"},"schema_version":"1.0"},"canonical_sha256":"21c0715b332d017013ffb3a1b9084155b0ee3ffa31cf9654e3702069f402d061","source":{"kind":"arxiv","id":"1604.08342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08342","created_at":"2026-05-18T00:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08342v1","created_at":"2026-05-18T00:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08342","created_at":"2026-05-18T00:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"EHAHCWZTFUAX","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHAHCWZTFUAXAE77","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHAHCWZT","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EHAHCWZTFUAXAE77WOQ3SCCBKW","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T08:31:45Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7434915b80e74d99cb8f5eda6d2172e6749bb55ab91c10b673a58f680982e054","abstract_canon_sha256":"74eeae2e7d296be1e457d52e1d27ba113bea4ac074dc9c401a19ccf3148678c0"},"schema_version":"1.0"},"canonical_sha256":"21c0715b332d017013ffb3a1b9084155b0ee3ffa31cf9654e3702069f402d061","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:50.963028Z","signature_b64":"+szIhN4U5xq7Hz6XzWLiT5JUDRVdyWn/f3vpoWROwTAc9/Yn1JWcWyCqC/e2dJ/D9ic5rdHUHWHWXBA4eB/wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21c0715b332d017013ffb3a1b9084155b0ee3ffa31cf9654e3702069f402d061","last_reissued_at":"2026-05-18T00:53:50.962686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:50.962686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08342","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:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNv5+PFhwqiamkwc/Yxdqpb0Qf0PeOa+84rvKaMyrHhiC/yhptguDd3sQ7+Ve1dHyIj2dnmZgUeLMOpdg1e+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:44:12.989702Z"},"content_sha256":"c509c3a1dd653d7d58004c22d7f8ed14e64dc86ee885953337b077bae60b296a","schema_version":"1.0","event_id":"sha256:c509c3a1dd653d7d58004c22d7f8ed14e64dc86ee885953337b077bae60b296a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EHAHCWZTFUAXAE77WOQ3SCCBKW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Monika Henzinger, Yun Kuen Cheung","submitted_at":"2016-04-28T08:31:45Z","abstract_excerpt":"Given a graph where vertices are partitioned into $k$ terminals and non-terminals, the goal is to compress the graph (i.e., reduce the number of non-terminals) using minor operations while preserving terminal distances approximately.The distortion of a compressed graph is the maximum multiplicative blow-up of distances between all pairs of terminals. We study the trade-off between the number of non-terminals and the distortion. This problem generalizes the Steiner Point Removal (SPR) problem, in which all non-terminals must be removed.\n  We introduce a novel black-box reduction to convert any "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08342","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:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWpc1EmXLlROimOK3V2qt11MnFGX2o552GPZ9L1BZV/sju/hf3uE6V4OPMPmAXCI4D76/I6g70colsnuPE/YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:44:12.990330Z"},"content_sha256":"1ca0436bac077686428c55cad312e31b29620949c5614dc80808b49853b7c616","schema_version":"1.0","event_id":"sha256:1ca0436bac077686428c55cad312e31b29620949c5614dc80808b49853b7c616"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/bundle.json","state_url":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/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-05-30T22:44:12Z","links":{"resolver":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW","bundle":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/bundle.json","state":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EHAHCWZTFUAXAE77WOQ3SCCBKW","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":"74eeae2e7d296be1e457d52e1d27ba113bea4ac074dc9c401a19ccf3148678c0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T08:31:45Z","title_canon_sha256":"7434915b80e74d99cb8f5eda6d2172e6749bb55ab91c10b673a58f680982e054"},"schema_version":"1.0","source":{"id":"1604.08342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08342","created_at":"2026-05-18T00:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08342v1","created_at":"2026-05-18T00:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08342","created_at":"2026-05-18T00:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"EHAHCWZTFUAX","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHAHCWZTFUAXAE77","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHAHCWZT","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:1ca0436bac077686428c55cad312e31b29620949c5614dc80808b49853b7c616","target":"graph","created_at":"2026-05-18T00:53:50Z","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":"Given a graph where vertices are partitioned into $k$ terminals and non-terminals, the goal is to compress the graph (i.e., reduce the number of non-terminals) using minor operations while preserving terminal distances approximately.The distortion of a compressed graph is the maximum multiplicative blow-up of distances between all pairs of terminals. We study the trade-off between the number of non-terminals and the distortion. This problem generalizes the Steiner Point Removal (SPR) problem, in which all non-terminals must be removed.\n  We introduce a novel black-box reduction to convert any ","authors_text":"Gramoz Goranci, Monika Henzinger, Yun Kuen Cheung","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T08:31:45Z","title":"Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08342","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:c509c3a1dd653d7d58004c22d7f8ed14e64dc86ee885953337b077bae60b296a","target":"record","created_at":"2026-05-18T00:53:50Z","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":"74eeae2e7d296be1e457d52e1d27ba113bea4ac074dc9c401a19ccf3148678c0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T08:31:45Z","title_canon_sha256":"7434915b80e74d99cb8f5eda6d2172e6749bb55ab91c10b673a58f680982e054"},"schema_version":"1.0","source":{"id":"1604.08342","kind":"arxiv","version":1}},"canonical_sha256":"21c0715b332d017013ffb3a1b9084155b0ee3ffa31cf9654e3702069f402d061","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21c0715b332d017013ffb3a1b9084155b0ee3ffa31cf9654e3702069f402d061","first_computed_at":"2026-05-18T00:53:50.962686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:50.962686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+szIhN4U5xq7Hz6XzWLiT5JUDRVdyWn/f3vpoWROwTAc9/Yn1JWcWyCqC/e2dJ/D9ic5rdHUHWHWXBA4eB/wCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:50.963028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c509c3a1dd653d7d58004c22d7f8ed14e64dc86ee885953337b077bae60b296a","sha256:1ca0436bac077686428c55cad312e31b29620949c5614dc80808b49853b7c616"],"state_sha256":"0dc4d3994dd9a7ca18ffef656a4e7800a8e3fbd16e958a3014d53d75febaf020"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prFEimM49PPoahkzFKxLCdYetcUT3zKCnsT/fGn/GFpMLt0SxKdRaaVjBOOGrSoPtBdLnxF+DR6i0QxxPtLNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:44:12.994824Z","bundle_sha256":"8bbaa0500feaa60f3e2e7f2037dbea842c8524ad98aa8e24bd4ad84d1b7a6d78"}}