{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BTOUSOS5JTJ6ZAJQ34XNUPH2BR","short_pith_number":"pith:BTOUSOS5","canonical_record":{"source":{"id":"1907.03474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-08T09:26:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cbe6086ef129b46f8be0d1d4d251fc4fe8b9d87318691f5038cfe262d8f8d4e2","abstract_canon_sha256":"b40353631a9af2c5fc9a88781891c20b8e6653f945246d2088046b3c68e211ba"},"schema_version":"1.0"},"canonical_sha256":"0cdd493a5d4cd3ec8130df2eda3cfa0c4ab6a973e995f8ff9c67da9d24748b4b","source":{"kind":"arxiv","id":"1907.03474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03474","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03474v1","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03474","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"BTOUSOS5JTJ6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BTOUSOS5JTJ6ZAJQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BTOUSOS5","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BTOUSOS5JTJ6ZAJQ34XNUPH2BR","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-08T09:26:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cbe6086ef129b46f8be0d1d4d251fc4fe8b9d87318691f5038cfe262d8f8d4e2","abstract_canon_sha256":"b40353631a9af2c5fc9a88781891c20b8e6653f945246d2088046b3c68e211ba"},"schema_version":"1.0"},"canonical_sha256":"0cdd493a5d4cd3ec8130df2eda3cfa0c4ab6a973e995f8ff9c67da9d24748b4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:14.511393Z","signature_b64":"DkZ96Msoxb2eBDEkqX1iaoZtkE5dmg/OZig410uaQWDLu3sMATC6ky5wuybFYgRXMWbuADZq4RPMl8ny0J2lDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cdd493a5d4cd3ec8130df2eda3cfa0c4ab6a973e995f8ff9c67da9d24748b4b","last_reissued_at":"2026-05-17T23:41:14.510909Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:14.510909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03474","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-17T23:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpLlmW5+VR1wXZitHLkkSkKm64RKIU2PBmgyhFwBDYvrFAW/SaCsS5iT7AOnCkz6M1fEnFsVoMxWiMseoonwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:42:56.888473Z"},"content_sha256":"5ee6e89fe439745daad6ddac7d6d0de584251b9647496817b940be989c22bcdf","schema_version":"1.0","event_id":"sha256:5ee6e89fe439745daad6ddac7d6d0de584251b9647496817b940be989c22bcdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BTOUSOS5JTJ6ZAJQ34XNUPH2BR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $2$-connected bottleneck Steiner network problem is NP-hard in any $\\ell_p$ plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"C Ras, D Thomas, G Xu, M Brazil","submitted_at":"2019-07-08T09:26:09Z","abstract_excerpt":"Bottleneck Steiner networks model energy consumption in wireless ad-hoc networks. The task is to design a network spanning a given set of terminals and at most $k$ Steiner points such that the length of the longest edge is minimised. The problem has been extensively studied for the case where an optimal solution is a tree in the Euclidean plane. However, in order to model a wider range of applications, including fault-tolerant networks, it is necessary to consider multi-connectivity constraints for networks embedded in more general metrics. We show that the $2$-connected bottleneck Steiner net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03474","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-17T23:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMrsKD4NjBo47fEmRWPOrkrw1Wi2dREohScMydgxLLcPBFHGGtah7cB7tThDLHBKXjMoUnhD+6AkyehKKFkvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:42:56.889110Z"},"content_sha256":"5c6d8ee6771f9a0a0632ed8f92bab110d10f5386932da198e4ffdde1aae6331a","schema_version":"1.0","event_id":"sha256:5c6d8ee6771f9a0a0632ed8f92bab110d10f5386932da198e4ffdde1aae6331a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTOUSOS5JTJ6ZAJQ34XNUPH2BR/bundle.json","state_url":"https://pith.science/pith/BTOUSOS5JTJ6ZAJQ34XNUPH2BR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTOUSOS5JTJ6ZAJQ34XNUPH2BR/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-27T00:42:56Z","links":{"resolver":"https://pith.science/pith/BTOUSOS5JTJ6ZAJQ34XNUPH2BR","bundle":"https://pith.science/pith/BTOUSOS5JTJ6ZAJQ34XNUPH2BR/bundle.json","state":"https://pith.science/pith/BTOUSOS5JTJ6ZAJQ34XNUPH2BR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTOUSOS5JTJ6ZAJQ34XNUPH2BR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BTOUSOS5JTJ6ZAJQ34XNUPH2BR","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":"b40353631a9af2c5fc9a88781891c20b8e6653f945246d2088046b3c68e211ba","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-08T09:26:09Z","title_canon_sha256":"cbe6086ef129b46f8be0d1d4d251fc4fe8b9d87318691f5038cfe262d8f8d4e2"},"schema_version":"1.0","source":{"id":"1907.03474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03474","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03474v1","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03474","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"BTOUSOS5JTJ6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BTOUSOS5JTJ6ZAJQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BTOUSOS5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5c6d8ee6771f9a0a0632ed8f92bab110d10f5386932da198e4ffdde1aae6331a","target":"graph","created_at":"2026-05-17T23:41:14Z","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":"Bottleneck Steiner networks model energy consumption in wireless ad-hoc networks. The task is to design a network spanning a given set of terminals and at most $k$ Steiner points such that the length of the longest edge is minimised. The problem has been extensively studied for the case where an optimal solution is a tree in the Euclidean plane. However, in order to model a wider range of applications, including fault-tolerant networks, it is necessary to consider multi-connectivity constraints for networks embedded in more general metrics. We show that the $2$-connected bottleneck Steiner net","authors_text":"C Ras, D Thomas, G Xu, M Brazil","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-08T09:26:09Z","title":"The $2$-connected bottleneck Steiner network problem is NP-hard in any $\\ell_p$ plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03474","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:5ee6e89fe439745daad6ddac7d6d0de584251b9647496817b940be989c22bcdf","target":"record","created_at":"2026-05-17T23:41:14Z","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":"b40353631a9af2c5fc9a88781891c20b8e6653f945246d2088046b3c68e211ba","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-08T09:26:09Z","title_canon_sha256":"cbe6086ef129b46f8be0d1d4d251fc4fe8b9d87318691f5038cfe262d8f8d4e2"},"schema_version":"1.0","source":{"id":"1907.03474","kind":"arxiv","version":1}},"canonical_sha256":"0cdd493a5d4cd3ec8130df2eda3cfa0c4ab6a973e995f8ff9c67da9d24748b4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cdd493a5d4cd3ec8130df2eda3cfa0c4ab6a973e995f8ff9c67da9d24748b4b","first_computed_at":"2026-05-17T23:41:14.510909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:14.510909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DkZ96Msoxb2eBDEkqX1iaoZtkE5dmg/OZig410uaQWDLu3sMATC6ky5wuybFYgRXMWbuADZq4RPMl8ny0J2lDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:14.511393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ee6e89fe439745daad6ddac7d6d0de584251b9647496817b940be989c22bcdf","sha256:5c6d8ee6771f9a0a0632ed8f92bab110d10f5386932da198e4ffdde1aae6331a"],"state_sha256":"f7b2729b0a4e304774bd15f76cce472097a8b27fadd38d64a0c51d153ebb8ff9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Ev5HJMVNFjOOYYnN5SQOWZHiV93zbSfbNrehlkjiivZ2GY4G8z1+dwpxqsUqWCTnbf031HVdJq1C+6LC4bGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:42:56.892571Z","bundle_sha256":"ae596c2a1f7f902a70c5fd402622c5f221dbb5a722c58a69dc79d3828aeef4fc"}}