{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QS7YF2U6X6WUT5BFRAZRXEAQO2","short_pith_number":"pith:QS7YF2U6","canonical_record":{"source":{"id":"1607.05547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T12:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"6ee9b8862892dcfaee821245db901ed798726343680fea26cdb231ce59b40720","abstract_canon_sha256":"054045fb479e70d61e87418c0fb2a52f32d15e89d20b2c5e57d2cd4e2734a1fd"},"schema_version":"1.0"},"canonical_sha256":"84bf82ea9ebfad49f42588331b9010768703b772e516455a009bb7c0031e4d22","source":{"kind":"arxiv","id":"1607.05547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05547","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05547v1","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05547","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"QS7YF2U6X6WU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QS7YF2U6X6WUT5BF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QS7YF2U6","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QS7YF2U6X6WUT5BFRAZRXEAQO2","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T12:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"6ee9b8862892dcfaee821245db901ed798726343680fea26cdb231ce59b40720","abstract_canon_sha256":"054045fb479e70d61e87418c0fb2a52f32d15e89d20b2c5e57d2cd4e2734a1fd"},"schema_version":"1.0"},"canonical_sha256":"84bf82ea9ebfad49f42588331b9010768703b772e516455a009bb7c0031e4d22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:46.582301Z","signature_b64":"oY+CAe1P/GKkLNHh4q4Rj2jXhcJnnXsU94IS6ovg/8VMP7AL6E1Xq+OvHhistquU5NBqzFAwslxOTKFfYsWjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84bf82ea9ebfad49f42588331b9010768703b772e516455a009bb7c0031e4d22","last_reissued_at":"2026-05-18T01:10:46.581746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:46.581746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05547","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-18T01:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbpOm5qPCM5XG9XBJh6GM6nKypltGI0evnBnedVLCcp7OcRMegdH11vXyDyOlv/eSxVWK7T3BM/d37h8k3IjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:19:36.099140Z"},"content_sha256":"3b3b9412d40839c73fa2e10950b08900b48b5600bb4e50971682c54bb26bf2d1","schema_version":"1.0","event_id":"sha256:3b3b9412d40839c73fa2e10950b08900b48b5600bb4e50971682c54bb26bf2d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QS7YF2U6X6WUT5BFRAZRXEAQO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel Smid, Ulrike Gro{\\ss}e","submitted_at":"2016-07-19T12:36:49Z","abstract_excerpt":"We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in O(n \\log^3 n) time, and (ii) the input graph is a tree, running in O(n^2 \\log n) time. We also present an algorithm that computes a (1+\\eps)-approximation in O(n + 1/\\eps^3) time, for paths in R^d, where d is a constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05547","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-18T01:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msW3tLPTr1oj13P418t/I9CEH0v5fQdRg+smelLZLgnGuG2+g1sCAspdR/B8SQldORuZCPHTVJN13pY3DgxqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:19:36.099558Z"},"content_sha256":"4460797fb72f4b90e87214d95624e3e8e671fb1f070502dfac6afbf051c108d9","schema_version":"1.0","event_id":"sha256:4460797fb72f4b90e87214d95624e3e8e671fb1f070502dfac6afbf051c108d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QS7YF2U6X6WUT5BFRAZRXEAQO2/bundle.json","state_url":"https://pith.science/pith/QS7YF2U6X6WUT5BFRAZRXEAQO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QS7YF2U6X6WUT5BFRAZRXEAQO2/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-26T10:19:36Z","links":{"resolver":"https://pith.science/pith/QS7YF2U6X6WUT5BFRAZRXEAQO2","bundle":"https://pith.science/pith/QS7YF2U6X6WUT5BFRAZRXEAQO2/bundle.json","state":"https://pith.science/pith/QS7YF2U6X6WUT5BFRAZRXEAQO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QS7YF2U6X6WUT5BFRAZRXEAQO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QS7YF2U6X6WUT5BFRAZRXEAQO2","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":"054045fb479e70d61e87418c0fb2a52f32d15e89d20b2c5e57d2cd4e2734a1fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T12:36:49Z","title_canon_sha256":"6ee9b8862892dcfaee821245db901ed798726343680fea26cdb231ce59b40720"},"schema_version":"1.0","source":{"id":"1607.05547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05547","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05547v1","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05547","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"QS7YF2U6X6WU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QS7YF2U6X6WUT5BF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QS7YF2U6","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:4460797fb72f4b90e87214d95624e3e8e671fb1f070502dfac6afbf051c108d9","target":"graph","created_at":"2026-05-18T01:10:46Z","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":"We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in O(n \\log^3 n) time, and (ii) the input graph is a tree, running in O(n^2 \\log n) time. We also present an algorithm that computes a (1+\\eps)-approximation in O(n + 1/\\eps^3) time, for paths in R^d, where d is a constant.","authors_text":"Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel Smid, Ulrike Gro{\\ss}e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T12:36:49Z","title":"Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05547","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:3b3b9412d40839c73fa2e10950b08900b48b5600bb4e50971682c54bb26bf2d1","target":"record","created_at":"2026-05-18T01:10:46Z","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":"054045fb479e70d61e87418c0fb2a52f32d15e89d20b2c5e57d2cd4e2734a1fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T12:36:49Z","title_canon_sha256":"6ee9b8862892dcfaee821245db901ed798726343680fea26cdb231ce59b40720"},"schema_version":"1.0","source":{"id":"1607.05547","kind":"arxiv","version":1}},"canonical_sha256":"84bf82ea9ebfad49f42588331b9010768703b772e516455a009bb7c0031e4d22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84bf82ea9ebfad49f42588331b9010768703b772e516455a009bb7c0031e4d22","first_computed_at":"2026-05-18T01:10:46.581746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:46.581746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oY+CAe1P/GKkLNHh4q4Rj2jXhcJnnXsU94IS6ovg/8VMP7AL6E1Xq+OvHhistquU5NBqzFAwslxOTKFfYsWjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:46.582301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b3b9412d40839c73fa2e10950b08900b48b5600bb4e50971682c54bb26bf2d1","sha256:4460797fb72f4b90e87214d95624e3e8e671fb1f070502dfac6afbf051c108d9"],"state_sha256":"7d40221eb118daadf3b294771430ce4b1f8be6c1a74107e973490c64dcbcd467"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzmPBx9GNBaPwS8noVkYxbu0Jqi/fa83ZgsCpo0jyutbOB6IJhC3xEZizIDqMWn2y1GfIun/17L36i/+Wa3WCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:19:36.103943Z","bundle_sha256":"21cd9722ddf467e047a6b6f30dcfc11d025a51685de10c425bbe072438981ee1"}}