{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6W6XVVCCHHRYYGWG2MQJMRCCSW","short_pith_number":"pith:6W6XVVCC","canonical_record":{"source":{"id":"1307.2987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-11T06:28:12Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"2ff2a83feb7c291f379c66843754ac0166f2669e2b097f2c4526fb6dee3deb9f","abstract_canon_sha256":"dcde3cd877854698c977373158448bbc59fab7bffad77a02975ab6e5a4f3d003"},"schema_version":"1.0"},"canonical_sha256":"f5bd7ad44239e38c1ac6d32096444295b76d57a659a7872991c1e9c06e28711c","source":{"kind":"arxiv","id":"1307.2987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2987","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2987v1","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2987","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"6W6XVVCCHHRY","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6W6XVVCCHHRYYGWG","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6W6XVVCC","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6W6XVVCCHHRYYGWG2MQJMRCCSW","target":"record","payload":{"canonical_record":{"source":{"id":"1307.2987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-11T06:28:12Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"2ff2a83feb7c291f379c66843754ac0166f2669e2b097f2c4526fb6dee3deb9f","abstract_canon_sha256":"dcde3cd877854698c977373158448bbc59fab7bffad77a02975ab6e5a4f3d003"},"schema_version":"1.0"},"canonical_sha256":"f5bd7ad44239e38c1ac6d32096444295b76d57a659a7872991c1e9c06e28711c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:47.998578Z","signature_b64":"fUf/n3dDdaXiZWw8s8GNunreB66ibZT+y3s8usXJTZEza69rsfsO/Ld+JJXVykVZfvhV9Q2c+cKCURD9IehuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5bd7ad44239e38c1ac6d32096444295b76d57a659a7872991c1e9c06e28711c","last_reissued_at":"2026-05-18T03:09:47.997729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:47.997729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.2987","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-18T03:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5nTX7+U7NqsKhufKzhVdh37vVmGX+2fT508c/Ynnk39qPRMABEynmDqUs26w8TAEasOvNd3vb3iLt/LBLIs4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:52:28.202645Z"},"content_sha256":"a61039bc54b4bcd17cda18bc9b851508fbb40422f7aef04d8b5094f5d2fd2ce3","schema_version":"1.0","event_id":"sha256:a61039bc54b4bcd17cda18bc9b851508fbb40422f7aef04d8b5094f5d2fd2ce3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6W6XVVCCHHRYYGWG2MQJMRCCSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Minimum Steiner Point Trees in Minkowski Planes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.OC","authors_text":"C. J. Ras, D. A. Thomas, M. Brazil","submitted_at":"2013-07-11T06:28:12Z","abstract_excerpt":"Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance difference of at most $2n-4$, where $n$ is the number of terminals. We show that this difference is best possible in the Euclidean plane, but not in Minkowski planes with parallelogram unit balls. We also intro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2987","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-18T03:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+LbLSAxlLeWpoX87cOj8xgZ69xOhKsL38r2gBlzN3UUAPcnCxWkgi2ixuOCEKEX4zJW9bCUcXPwT3DkGxYHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:52:28.202991Z"},"content_sha256":"aa4739f5b00e0f505eb8d8606d7955170fb90b9d8b6d81a2b66fc5d8afee196f","schema_version":"1.0","event_id":"sha256:aa4739f5b00e0f505eb8d8606d7955170fb90b9d8b6d81a2b66fc5d8afee196f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6W6XVVCCHHRYYGWG2MQJMRCCSW/bundle.json","state_url":"https://pith.science/pith/6W6XVVCCHHRYYGWG2MQJMRCCSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6W6XVVCCHHRYYGWG2MQJMRCCSW/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-24T23:52:28Z","links":{"resolver":"https://pith.science/pith/6W6XVVCCHHRYYGWG2MQJMRCCSW","bundle":"https://pith.science/pith/6W6XVVCCHHRYYGWG2MQJMRCCSW/bundle.json","state":"https://pith.science/pith/6W6XVVCCHHRYYGWG2MQJMRCCSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6W6XVVCCHHRYYGWG2MQJMRCCSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6W6XVVCCHHRYYGWG2MQJMRCCSW","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":"dcde3cd877854698c977373158448bbc59fab7bffad77a02975ab6e5a4f3d003","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-11T06:28:12Z","title_canon_sha256":"2ff2a83feb7c291f379c66843754ac0166f2669e2b097f2c4526fb6dee3deb9f"},"schema_version":"1.0","source":{"id":"1307.2987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2987","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2987v1","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2987","created_at":"2026-05-18T03:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"6W6XVVCCHHRY","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6W6XVVCCHHRYYGWG","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6W6XVVCC","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:aa4739f5b00e0f505eb8d8606d7955170fb90b9d8b6d81a2b66fc5d8afee196f","target":"graph","created_at":"2026-05-18T03:09:47Z","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":"Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance difference of at most $2n-4$, where $n$ is the number of terminals. We show that this difference is best possible in the Euclidean plane, but not in Minkowski planes with parallelogram unit balls. We also intro","authors_text":"C. J. Ras, D. A. Thomas, M. Brazil","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-11T06:28:12Z","title":"Approximating Minimum Steiner Point Trees in Minkowski Planes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2987","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:a61039bc54b4bcd17cda18bc9b851508fbb40422f7aef04d8b5094f5d2fd2ce3","target":"record","created_at":"2026-05-18T03:09:47Z","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":"dcde3cd877854698c977373158448bbc59fab7bffad77a02975ab6e5a4f3d003","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-11T06:28:12Z","title_canon_sha256":"2ff2a83feb7c291f379c66843754ac0166f2669e2b097f2c4526fb6dee3deb9f"},"schema_version":"1.0","source":{"id":"1307.2987","kind":"arxiv","version":1}},"canonical_sha256":"f5bd7ad44239e38c1ac6d32096444295b76d57a659a7872991c1e9c06e28711c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5bd7ad44239e38c1ac6d32096444295b76d57a659a7872991c1e9c06e28711c","first_computed_at":"2026-05-18T03:09:47.997729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:47.997729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fUf/n3dDdaXiZWw8s8GNunreB66ibZT+y3s8usXJTZEza69rsfsO/Ld+JJXVykVZfvhV9Q2c+cKCURD9IehuCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:47.998578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a61039bc54b4bcd17cda18bc9b851508fbb40422f7aef04d8b5094f5d2fd2ce3","sha256:aa4739f5b00e0f505eb8d8606d7955170fb90b9d8b6d81a2b66fc5d8afee196f"],"state_sha256":"8e5f951cd36f046ac86fd5203f77939cfc89be7efb75b3dab63723c7f5a3b1c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0u+d3IzoRX9CGgGu6+uWpLvSi0WuWKZEXcudPLso+HjIp+Ay1MaOrJZoJVXuJ/6VvQsMu4t42xzhkMkzOTjNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:52:28.204942Z","bundle_sha256":"b4de89998b2515b7d8fb211f5b36bef802b032de998b95c1a96b88d47dbed2c6"}}