{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LGCCRLI276T5EBIKCGGGHDF7N4","short_pith_number":"pith:LGCCRLI2","canonical_record":{"source":{"id":"2506.11704","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T12:19:18Z","cross_cats_sorted":[],"title_canon_sha256":"af5790437b2b9762e3e3d8e638382702e0660a22ebbeacce79b9152e9b54afda","abstract_canon_sha256":"ba10166f0eaf523bca9683a311880c77bd4e5b8c05c6dc6f3a7337886f972952"},"schema_version":"1.0"},"canonical_sha256":"598428ad1affa7d2050a118c638cbf6f03409a607b054a80093af72f7f176c39","source":{"kind":"arxiv","id":"2506.11704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.11704","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"2506.11704v2","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11704","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"LGCCRLI276T5","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"pith_short_16","alias_value":"LGCCRLI276T5EBIK","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"pith_short_8","alias_value":"LGCCRLI2","created_at":"2026-07-05T11:22:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LGCCRLI276T5EBIKCGGGHDF7N4","target":"record","payload":{"canonical_record":{"source":{"id":"2506.11704","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T12:19:18Z","cross_cats_sorted":[],"title_canon_sha256":"af5790437b2b9762e3e3d8e638382702e0660a22ebbeacce79b9152e9b54afda","abstract_canon_sha256":"ba10166f0eaf523bca9683a311880c77bd4e5b8c05c6dc6f3a7337886f972952"},"schema_version":"1.0"},"canonical_sha256":"598428ad1affa7d2050a118c638cbf6f03409a607b054a80093af72f7f176c39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:19.124638Z","signature_b64":"MEA/71rdS3ggCc5x5YdCOqY8f/aihDMMkdr0rbs6vr4ZT2PJHWPeh+iLjowPaX/oktKVrdcFCNSQfwzj8Y0hCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"598428ad1affa7d2050a118c638cbf6f03409a607b054a80093af72f7f176c39","last_reissued_at":"2026-07-05T11:22:19.124144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:19.124144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.11704","source_version":2,"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-07-05T11:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7Srd0ZVrWEMypVWHATkb8C0zYBXC5rxh2rGDvzGly6b3yNlzQ3vDgR6CULaKCzTB8OU1nsyY94qUpMo6iM1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:54:08.086655Z"},"content_sha256":"239e1a98a8d5773e9f27baae440ecd90521ad1cf3233af9522d7169643dd600a","schema_version":"1.0","event_id":"sha256:239e1a98a8d5773e9f27baae440ecd90521ad1cf3233af9522d7169643dd600a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LGCCRLI276T5EBIKCGGGHDF7N4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Isometric-Universal Graphs for Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cyril Gavoille, Edgar Baucher, Fran\\c{c}ois Dross","submitted_at":"2025-06-13T12:19:18Z","abstract_excerpt":"We consider the problem of finding the smallest graph that contains two input trees each with at most $n$ vertices preserving their distances. In other words, we look for an isometric-universal graph with the minimum number of vertices for two given trees. We prove that this problem can be solved in time $O(n^{5/2}\\log{n})$. We extend this result to forests instead of trees, and propose an algorithm with running time $O(n^{7/2}\\log{n})$. As a key ingredient, we show that a smallest isometric-universal graph of two trees essentially is a tree. Furthermore, we prove that these results cannot be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11704","kind":"arxiv","version":2},"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/2506.11704/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"},"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-07-05T11:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDLQI2kc4xTL4IWBboVcNQg3AHhqgvGroQ5nDcLmZZJz+/a9V3RJPlQLqzCwz//bC66ZIQ24tPRUc+uR2/rsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:54:08.087256Z"},"content_sha256":"2608e8438d2874e3bcab7bbc973caac0285f29609d6f1229c66e03160798b0a4","schema_version":"1.0","event_id":"sha256:2608e8438d2874e3bcab7bbc973caac0285f29609d6f1229c66e03160798b0a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGCCRLI276T5EBIKCGGGHDF7N4/bundle.json","state_url":"https://pith.science/pith/LGCCRLI276T5EBIKCGGGHDF7N4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGCCRLI276T5EBIKCGGGHDF7N4/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-08-13T15:54:08Z","links":{"resolver":"https://pith.science/pith/LGCCRLI276T5EBIKCGGGHDF7N4","bundle":"https://pith.science/pith/LGCCRLI276T5EBIKCGGGHDF7N4/bundle.json","state":"https://pith.science/pith/LGCCRLI276T5EBIKCGGGHDF7N4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGCCRLI276T5EBIKCGGGHDF7N4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LGCCRLI276T5EBIKCGGGHDF7N4","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":"ba10166f0eaf523bca9683a311880c77bd4e5b8c05c6dc6f3a7337886f972952","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T12:19:18Z","title_canon_sha256":"af5790437b2b9762e3e3d8e638382702e0660a22ebbeacce79b9152e9b54afda"},"schema_version":"1.0","source":{"id":"2506.11704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.11704","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"2506.11704v2","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11704","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"LGCCRLI276T5","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"pith_short_16","alias_value":"LGCCRLI276T5EBIK","created_at":"2026-07-05T11:22:19Z"},{"alias_kind":"pith_short_8","alias_value":"LGCCRLI2","created_at":"2026-07-05T11:22:19Z"}],"graph_snapshots":[{"event_id":"sha256:2608e8438d2874e3bcab7bbc973caac0285f29609d6f1229c66e03160798b0a4","target":"graph","created_at":"2026-07-05T11:22: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.11704/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of finding the smallest graph that contains two input trees each with at most $n$ vertices preserving their distances. In other words, we look for an isometric-universal graph with the minimum number of vertices for two given trees. We prove that this problem can be solved in time $O(n^{5/2}\\log{n})$. We extend this result to forests instead of trees, and propose an algorithm with running time $O(n^{7/2}\\log{n})$. As a key ingredient, we show that a smallest isometric-universal graph of two trees essentially is a tree. Furthermore, we prove that these results cannot be ","authors_text":"Cyril Gavoille, Edgar Baucher, Fran\\c{c}ois Dross","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11704","kind":"arxiv","version":2},"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:239e1a98a8d5773e9f27baae440ecd90521ad1cf3233af9522d7169643dd600a","target":"record","created_at":"2026-07-05T11:22: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":"ba10166f0eaf523bca9683a311880c77bd4e5b8c05c6dc6f3a7337886f972952","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T12:19:18Z","title_canon_sha256":"af5790437b2b9762e3e3d8e638382702e0660a22ebbeacce79b9152e9b54afda"},"schema_version":"1.0","source":{"id":"2506.11704","kind":"arxiv","version":2}},"canonical_sha256":"598428ad1affa7d2050a118c638cbf6f03409a607b054a80093af72f7f176c39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"598428ad1affa7d2050a118c638cbf6f03409a607b054a80093af72f7f176c39","first_computed_at":"2026-07-05T11:22:19.124144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:19.124144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MEA/71rdS3ggCc5x5YdCOqY8f/aihDMMkdr0rbs6vr4ZT2PJHWPeh+iLjowPaX/oktKVrdcFCNSQfwzj8Y0hCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:19.124638Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.11704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:239e1a98a8d5773e9f27baae440ecd90521ad1cf3233af9522d7169643dd600a","sha256:2608e8438d2874e3bcab7bbc973caac0285f29609d6f1229c66e03160798b0a4"],"state_sha256":"0b34858698fca61d5cc540879fbcaf8b0c1b5c62a95b72d97b114094c2d424f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LrXg11KxkW7x6qdaKjPy0twBhaOyiSk1I+iBlipvhnJteNWkasAvjRS73cKyOtaDZapA4Rk2p2LEwlgUlDQgDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:54:08.108729Z","bundle_sha256":"6578fb00148a53222bb070620098877474dfb09676691dc63f1e10e8f6af1cad"}}