{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V2H3RLZ6RRWHCY42GMCDFXOYOA","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":"e15d01c5137112c9c1098eb16f63b397c913f277be7c00866b80e1f4d264f6f3","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-08T15:05:14Z","title_canon_sha256":"6e746f6b26c725c0865e694b95d7b6dd84a02695392ba7dd8381e09d1b94ca15"},"schema_version":"1.0","source":{"id":"2501.04555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04555","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04555v1","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04555","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"V2H3RLZ6RRWH","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_16","alias_value":"V2H3RLZ6RRWHCY42","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_8","alias_value":"V2H3RLZ6","created_at":"2026-07-05T09:58:37Z"}],"graph_snapshots":[{"event_id":"sha256:f0a3c09af709ebbee4cf73e733a6e4349ee2499bbef9b13359c019076e9c64bf","target":"graph","created_at":"2026-07-05T09:58:37Z","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/2501.04555/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Satyabrata Jana, Tanmay Inamdar","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-08T15:05:14Z","title":"Multivariate Exploration of Metric Dilation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04555","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:3f746aff1a73008a1927b92a3331c265174f2d57d8d145fa3a1ca70813bd2b12","target":"record","created_at":"2026-07-05T09:58:37Z","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":"e15d01c5137112c9c1098eb16f63b397c913f277be7c00866b80e1f4d264f6f3","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-08T15:05:14Z","title_canon_sha256":"6e746f6b26c725c0865e694b95d7b6dd84a02695392ba7dd8381e09d1b94ca15"},"schema_version":"1.0","source":{"id":"2501.04555","kind":"arxiv","version":1}},"canonical_sha256":"ae8fb8af3e8c6c71639a330432ddd8701a255a0c5beed905692cd8b1d66ba8ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae8fb8af3e8c6c71639a330432ddd8701a255a0c5beed905692cd8b1d66ba8ed","first_computed_at":"2026-07-05T09:58:37.254074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:37.254074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LVZ/kFffV+MT8bMcXo/zKX7mZTUJ6xiRf9Pf1QZqal1dBfV8Blxi8KsgypfbvoB+YNKZYnatifypeyonz5NtCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:37.254466Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.04555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f746aff1a73008a1927b92a3331c265174f2d57d8d145fa3a1ca70813bd2b12","sha256:f0a3c09af709ebbee4cf73e733a6e4349ee2499bbef9b13359c019076e9c64bf"],"state_sha256":"a43f182d524c2a05d0e4106f687d3648c8a703f62b8b57f97a22c402b0ad268d"}