{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:V2H3RLZ6RRWHCY42GMCDFXOYOA","short_pith_number":"pith:V2H3RLZ6","schema_version":"1.0","canonical_sha256":"ae8fb8af3e8c6c71639a330432ddd8701a255a0c5beed905692cd8b1d66ba8ed","source":{"kind":"arxiv","id":"2501.04555","version":1},"attestation_state":"computed","paper":{"title":"Multivariate Exploration of Metric Dilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Satyabrata Jana, Tanmay Inamdar","submitted_at":"2025-01-08T15:05:14Z","abstract_excerpt":"Let $G$ be a weighted graph embedded in a metric space $(M, d_M )$. The vertices of $G$ correspond to the points in $M$ , with the weight of each edge $uv$ being the distance $d_M (u, v)$ between their respective points in $M$ . The dilation (or stretch) of $G$ is defined as the minimum factor $t$ such that, for any pair of vertices $u, v$, the distance between $u$ and $v$-represented by the weight of a shortest $u$, $v$-path is at most $ t \\cdot d_M (u, v)$. We study Dilation t-Augmentation, where the objective is, given a metric $M $, a graph $G$, and numerical values $k$ and $t$, to determi"},"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":"2501.04555","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-08T15:05:14Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"6e746f6b26c725c0865e694b95d7b6dd84a02695392ba7dd8381e09d1b94ca15","abstract_canon_sha256":"e15d01c5137112c9c1098eb16f63b397c913f277be7c00866b80e1f4d264f6f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:37.254466Z","signature_b64":"LVZ/kFffV+MT8bMcXo/zKX7mZTUJ6xiRf9Pf1QZqal1dBfV8Blxi8KsgypfbvoB+YNKZYnatifypeyonz5NtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae8fb8af3e8c6c71639a330432ddd8701a255a0c5beed905692cd8b1d66ba8ed","last_reissued_at":"2026-07-05T09:58:37.254074Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:37.254074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multivariate Exploration of Metric Dilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Satyabrata Jana, Tanmay Inamdar","submitted_at":"2025-01-08T15:05:14Z","abstract_excerpt":"Let $G$ be a weighted graph embedded in a metric space $(M, d_M )$. The vertices of $G$ correspond to the points in $M$ , with the weight of each edge $uv$ being the distance $d_M (u, v)$ between their respective points in $M$ . The dilation (or stretch) of $G$ is defined as the minimum factor $t$ such that, for any pair of vertices $u, v$, the distance between $u$ and $v$-represented by the weight of a shortest $u$, $v$-path is at most $ t \\cdot d_M (u, v)$. We study Dilation t-Augmentation, where the objective is, given a metric $M $, a graph $G$, and numerical values $k$ and $t$, to determi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04555","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/2501.04555/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.04555","created_at":"2026-07-05T09:58:37.254129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04555v1","created_at":"2026-07-05T09:58:37.254129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04555","created_at":"2026-07-05T09:58:37.254129+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2H3RLZ6RRWH","created_at":"2026-07-05T09:58:37.254129+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2H3RLZ6RRWHCY42","created_at":"2026-07-05T09:58:37.254129+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2H3RLZ6","created_at":"2026-07-05T09:58:37.254129+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/V2H3RLZ6RRWHCY42GMCDFXOYOA","json":"https://pith.science/pith/V2H3RLZ6RRWHCY42GMCDFXOYOA.json","graph_json":"https://pith.science/api/pith-number/V2H3RLZ6RRWHCY42GMCDFXOYOA/graph.json","events_json":"https://pith.science/api/pith-number/V2H3RLZ6RRWHCY42GMCDFXOYOA/events.json","paper":"https://pith.science/paper/V2H3RLZ6"},"agent_actions":{"view_html":"https://pith.science/pith/V2H3RLZ6RRWHCY42GMCDFXOYOA","download_json":"https://pith.science/pith/V2H3RLZ6RRWHCY42GMCDFXOYOA.json","view_paper":"https://pith.science/paper/V2H3RLZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04555&json=true","fetch_graph":"https://pith.science/api/pith-number/V2H3RLZ6RRWHCY42GMCDFXOYOA/graph.json","fetch_events":"https://pith.science/api/pith-number/V2H3RLZ6RRWHCY42GMCDFXOYOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2H3RLZ6RRWHCY42GMCDFXOYOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2H3RLZ6RRWHCY42GMCDFXOYOA/action/storage_attestation","attest_author":"https://pith.science/pith/V2H3RLZ6RRWHCY42GMCDFXOYOA/action/author_attestation","sign_citation":"https://pith.science/pith/V2H3RLZ6RRWHCY42GMCDFXOYOA/action/citation_signature","submit_replication":"https://pith.science/pith/V2H3RLZ6RRWHCY42GMCDFXOYOA/action/replication_record"}},"created_at":"2026-07-05T09:58:37.254129+00:00","updated_at":"2026-07-05T09:58:37.254129+00:00"}