{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EHAHCWZTFUAXAE77WOQ3SCCBKW","short_pith_number":"pith:EHAHCWZT","schema_version":"1.0","canonical_sha256":"21c0715b332d017013ffb3a1b9084155b0ee3ffa31cf9654e3702069f402d061","source":{"kind":"arxiv","id":"1604.08342","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.08342","created_at":"2026-05-18T00:53:50.962736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08342v1","created_at":"2026-05-18T00:53:50.962736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08342","created_at":"2026-05-18T00:53:50.962736+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHAHCWZTFUAX","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHAHCWZTFUAXAE77","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHAHCWZT","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW","json":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW.json","graph_json":"https://pith.science/api/pith-number/EHAHCWZTFUAXAE77WOQ3SCCBKW/graph.json","events_json":"https://pith.science/api/pith-number/EHAHCWZTFUAXAE77WOQ3SCCBKW/events.json","paper":"https://pith.science/paper/EHAHCWZT"},"agent_actions":{"view_html":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW","download_json":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW.json","view_paper":"https://pith.science/paper/EHAHCWZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08342&json=true","fetch_graph":"https://pith.science/api/pith-number/EHAHCWZTFUAXAE77WOQ3SCCBKW/graph.json","fetch_events":"https://pith.science/api/pith-number/EHAHCWZTFUAXAE77WOQ3SCCBKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/action/storage_attestation","attest_author":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/action/author_attestation","sign_citation":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/action/citation_signature","submit_replication":"https://pith.science/pith/EHAHCWZTFUAXAE77WOQ3SCCBKW/action/replication_record"}},"created_at":"2026-05-18T00:53:50.962736+00:00","updated_at":"2026-05-18T00:53:50.962736+00:00"}