{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z4GTYOW74BZN22RG4UTMRR5MWP","short_pith_number":"pith:Z4GTYOW7","canonical_record":{"source":{"id":"1807.03331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-09T18:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"444793a7cefebfde42900ce68164fb814ae9be4a88efed4e4ad64fe1792c8221","abstract_canon_sha256":"77cee623531ea05f397366a0cced7e63b764f1aec8b42cb3605d3c3643a4c9c2"},"schema_version":"1.0"},"canonical_sha256":"cf0d3c3adfe072dd6a26e526c8c7acb3d342d150b52d7a9a4c2df5eb860bf3b9","source":{"kind":"arxiv","id":"1807.03331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03331","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03331v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03331","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"Z4GTYOW74BZN","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4GTYOW74BZN22RG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4GTYOW7","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z4GTYOW74BZN22RG4UTMRR5MWP","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-09T18:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"444793a7cefebfde42900ce68164fb814ae9be4a88efed4e4ad64fe1792c8221","abstract_canon_sha256":"77cee623531ea05f397366a0cced7e63b764f1aec8b42cb3605d3c3643a4c9c2"},"schema_version":"1.0"},"canonical_sha256":"cf0d3c3adfe072dd6a26e526c8c7acb3d342d150b52d7a9a4c2df5eb860bf3b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:10.803983Z","signature_b64":"fi0Of/FQ+E6wJ3PgDXlfZl6MPF/KctBkrJJ1ep2NHpYnISfAgw/N6q9bH3D8b/bBaCYGk1lcJ7QVI9Y2j2oMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf0d3c3adfe072dd6a26e526c8c7acb3d342d150b52d7a9a4c2df5eb860bf3b9","last_reissued_at":"2026-05-18T00:11:10.803247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:10.803247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03331","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-18T00:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJb4tsn14InOsel/yF331D0oUMmjR+vIZpZjAlFYachaNDFmIpMpT0xzva0+HD57MDF0VDbBmeGr0MMPGem9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:26:28.056470Z"},"content_sha256":"815caeed1a3a8d3aafd10c44743722df279c342980b0e49c9724f2df00d57820","schema_version":"1.0","event_id":"sha256:815caeed1a3a8d3aafd10c44743722df279c342980b0e49c9724f2df00d57820"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z4GTYOW74BZN22RG4UTMRR5MWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Davide Bil\\`o, Kleitos Papadopoulos","submitted_at":"2018-07-09T18:34:50Z","abstract_excerpt":"In this draft we prove an interesting structural property related to the problem of computing {\\em all the best swap edges} of a {\\em tree spanner} in unweighted graphs. Previous papers show that the maximum stretch factor of the tree where a failing edge is temporarily swapped with any other available edge that reconnects the tree depends only on the {\\em critical edge}. However, in principle, each of the $O(n^2)$ swap edges, where $n$ is the number of vertices of the tree, may have its own critical edge. In this draft we show that there are at most 6 critical edges, i.e., each tree edge $e$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03331","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-18T00:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4D4ijIF1XZqNgqtEFHmz3MKP5Vr4jQ/KNlpCveCtY2H3AFBERj+U8iP545Y1WtwkIgYvXj0Xq4iB8rYUkedJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:26:28.057112Z"},"content_sha256":"6e672faa7e2cc7ab863b533556ffa5a4b77202d1eee1c957775b4e3df0c5211c","schema_version":"1.0","event_id":"sha256:6e672faa7e2cc7ab863b533556ffa5a4b77202d1eee1c957775b4e3df0c5211c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4GTYOW74BZN22RG4UTMRR5MWP/bundle.json","state_url":"https://pith.science/pith/Z4GTYOW74BZN22RG4UTMRR5MWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4GTYOW74BZN22RG4UTMRR5MWP/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-06-01T10:26:28Z","links":{"resolver":"https://pith.science/pith/Z4GTYOW74BZN22RG4UTMRR5MWP","bundle":"https://pith.science/pith/Z4GTYOW74BZN22RG4UTMRR5MWP/bundle.json","state":"https://pith.science/pith/Z4GTYOW74BZN22RG4UTMRR5MWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4GTYOW74BZN22RG4UTMRR5MWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z4GTYOW74BZN22RG4UTMRR5MWP","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":"77cee623531ea05f397366a0cced7e63b764f1aec8b42cb3605d3c3643a4c9c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-09T18:34:50Z","title_canon_sha256":"444793a7cefebfde42900ce68164fb814ae9be4a88efed4e4ad64fe1792c8221"},"schema_version":"1.0","source":{"id":"1807.03331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03331","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03331v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03331","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"Z4GTYOW74BZN","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4GTYOW74BZN22RG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4GTYOW7","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:6e672faa7e2cc7ab863b533556ffa5a4b77202d1eee1c957775b4e3df0c5211c","target":"graph","created_at":"2026-05-18T00:11:10Z","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":"In this draft we prove an interesting structural property related to the problem of computing {\\em all the best swap edges} of a {\\em tree spanner} in unweighted graphs. Previous papers show that the maximum stretch factor of the tree where a failing edge is temporarily swapped with any other available edge that reconnects the tree depends only on the {\\em critical edge}. However, in principle, each of the $O(n^2)$ swap edges, where $n$ is the number of vertices of the tree, may have its own critical edge. In this draft we show that there are at most 6 critical edges, i.e., each tree edge $e$ ","authors_text":"Davide Bil\\`o, Kleitos Papadopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-09T18:34:50Z","title":"An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03331","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:815caeed1a3a8d3aafd10c44743722df279c342980b0e49c9724f2df00d57820","target":"record","created_at":"2026-05-18T00:11:10Z","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":"77cee623531ea05f397366a0cced7e63b764f1aec8b42cb3605d3c3643a4c9c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-09T18:34:50Z","title_canon_sha256":"444793a7cefebfde42900ce68164fb814ae9be4a88efed4e4ad64fe1792c8221"},"schema_version":"1.0","source":{"id":"1807.03331","kind":"arxiv","version":1}},"canonical_sha256":"cf0d3c3adfe072dd6a26e526c8c7acb3d342d150b52d7a9a4c2df5eb860bf3b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf0d3c3adfe072dd6a26e526c8c7acb3d342d150b52d7a9a4c2df5eb860bf3b9","first_computed_at":"2026-05-18T00:11:10.803247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:10.803247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fi0Of/FQ+E6wJ3PgDXlfZl6MPF/KctBkrJJ1ep2NHpYnISfAgw/N6q9bH3D8b/bBaCYGk1lcJ7QVI9Y2j2oMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:10.803983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:815caeed1a3a8d3aafd10c44743722df279c342980b0e49c9724f2df00d57820","sha256:6e672faa7e2cc7ab863b533556ffa5a4b77202d1eee1c957775b4e3df0c5211c"],"state_sha256":"ee7076e2f80963f126306dc420781c09de2c41ca5add445d2b79251138b7da1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfTW6s3ywqrSwTOhRWwQlLD9/B3iOyguSQzPE5bVPelIAcisn9NzF+yVwE1L5SVIP6j3gtHo6u1ljlZPloL/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:26:28.060098Z","bundle_sha256":"ec47a6848ad5e96ebb57b0da08bc27ef754dd0f2f31e03cb6ae056f1e5b3e111"}}