{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GFJ5Q5EZ5GA6MPUXENG3KOFLSQ","short_pith_number":"pith:GFJ5Q5EZ","canonical_record":{"source":{"id":"1205.3605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T09:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"5cfbd0b0c43f7c248be5503aa63e4767d19cb5bdda112c04269bad59af10060f","abstract_canon_sha256":"c868e88199160dc46530b127ae6c37eac641426da236694da17a960b8f082fb1"},"schema_version":"1.0"},"canonical_sha256":"3153d87499e981e63e97234db538ab940d92ae739952481ac0a490bed6b50372","source":{"kind":"arxiv","id":"1205.3605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3605","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3605v1","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3605","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"GFJ5Q5EZ5GA6","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GFJ5Q5EZ5GA6MPUX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GFJ5Q5EZ","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GFJ5Q5EZ5GA6MPUXENG3KOFLSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T09:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"5cfbd0b0c43f7c248be5503aa63e4767d19cb5bdda112c04269bad59af10060f","abstract_canon_sha256":"c868e88199160dc46530b127ae6c37eac641426da236694da17a960b8f082fb1"},"schema_version":"1.0"},"canonical_sha256":"3153d87499e981e63e97234db538ab940d92ae739952481ac0a490bed6b50372","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:34.608305Z","signature_b64":"eoRccFi7SGRAfPJL2A5iGVI9iVWBOghiGqTQnq5M3EmlMuG0vDHvXaZLobsJCdSyW9Y3ZnIv9yMJ3fcWB69YAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3153d87499e981e63e97234db538ab940d92ae739952481ac0a490bed6b50372","last_reissued_at":"2026-05-18T03:55:34.607542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:34.607542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3605","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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2bnM2QA2/EGPI7sgVr3LTwYmc8+o9kiMS1n4I7a9F62FRt0q2iMnWn1h9S8g2Cn8QepOCupIJaQyvPeQqleDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:02:12.996071Z"},"content_sha256":"6d90e2f6462a57df4992865139437d50327d9f62f637f1b1fa7aa49bbab1c36c","schema_version":"1.0","event_id":"sha256:6d90e2f6462a57df4992865139437d50327d9f62f637f1b1fa7aa49bbab1c36c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GFJ5Q5EZ5GA6MPUXENG3KOFLSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Min-Power Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Grandoni","submitted_at":"2012-05-16T09:16:39Z","abstract_excerpt":"In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power version of the problem, which is better suited for wireless applications. Here, the goal is to minimize the total power consumption of nodes, where the power of a node v is the maximum cost of any edge of S incident to v. Intuitively, nodes are antennas (part of which are terminals that we need to connect) and edge costs define the power to connect their endpoints"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3605","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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+kGMysoSYdR9fIDpY2td9TE0OJNyNe7JJluwM0G3eiB9guSZ569Dmz1/nUuRM0h6wlrBIwjz9hKjZKzwCdzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:02:12.996752Z"},"content_sha256":"0efa9fbe28939899d4ee6eff3f08c7c458e19d7575f66e99f7617c51c0e6b291","schema_version":"1.0","event_id":"sha256:0efa9fbe28939899d4ee6eff3f08c7c458e19d7575f66e99f7617c51c0e6b291"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFJ5Q5EZ5GA6MPUXENG3KOFLSQ/bundle.json","state_url":"https://pith.science/pith/GFJ5Q5EZ5GA6MPUXENG3KOFLSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFJ5Q5EZ5GA6MPUXENG3KOFLSQ/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-25T19:02:12Z","links":{"resolver":"https://pith.science/pith/GFJ5Q5EZ5GA6MPUXENG3KOFLSQ","bundle":"https://pith.science/pith/GFJ5Q5EZ5GA6MPUXENG3KOFLSQ/bundle.json","state":"https://pith.science/pith/GFJ5Q5EZ5GA6MPUXENG3KOFLSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFJ5Q5EZ5GA6MPUXENG3KOFLSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GFJ5Q5EZ5GA6MPUXENG3KOFLSQ","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":"c868e88199160dc46530b127ae6c37eac641426da236694da17a960b8f082fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T09:16:39Z","title_canon_sha256":"5cfbd0b0c43f7c248be5503aa63e4767d19cb5bdda112c04269bad59af10060f"},"schema_version":"1.0","source":{"id":"1205.3605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3605","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3605v1","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3605","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"GFJ5Q5EZ5GA6","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GFJ5Q5EZ5GA6MPUX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GFJ5Q5EZ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:0efa9fbe28939899d4ee6eff3f08c7c458e19d7575f66e99f7617c51c0e6b291","target":"graph","created_at":"2026-05-18T03:55:34Z","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 the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power version of the problem, which is better suited for wireless applications. Here, the goal is to minimize the total power consumption of nodes, where the power of a node v is the maximum cost of any edge of S incident to v. Intuitively, nodes are antennas (part of which are terminals that we need to connect) and edge costs define the power to connect their endpoints","authors_text":"Fabrizio Grandoni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T09:16:39Z","title":"On Min-Power Steiner Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3605","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:6d90e2f6462a57df4992865139437d50327d9f62f637f1b1fa7aa49bbab1c36c","target":"record","created_at":"2026-05-18T03:55:34Z","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":"c868e88199160dc46530b127ae6c37eac641426da236694da17a960b8f082fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-16T09:16:39Z","title_canon_sha256":"5cfbd0b0c43f7c248be5503aa63e4767d19cb5bdda112c04269bad59af10060f"},"schema_version":"1.0","source":{"id":"1205.3605","kind":"arxiv","version":1}},"canonical_sha256":"3153d87499e981e63e97234db538ab940d92ae739952481ac0a490bed6b50372","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3153d87499e981e63e97234db538ab940d92ae739952481ac0a490bed6b50372","first_computed_at":"2026-05-18T03:55:34.607542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:34.607542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eoRccFi7SGRAfPJL2A5iGVI9iVWBOghiGqTQnq5M3EmlMuG0vDHvXaZLobsJCdSyW9Y3ZnIv9yMJ3fcWB69YAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:34.608305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d90e2f6462a57df4992865139437d50327d9f62f637f1b1fa7aa49bbab1c36c","sha256:0efa9fbe28939899d4ee6eff3f08c7c458e19d7575f66e99f7617c51c0e6b291"],"state_sha256":"1d23d43353f9348811cf6a3d8ed9f2308fab553a1bcc4cf443c301d63315e4c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FDoPTGIfBZpxxhprQG/EJWpBWAoAiqjC8oR4VnmS6ASKY8UGY6Axvzh586Q+FXk6PvE5h6yOl+Bit223yyoQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:02:13.000117Z","bundle_sha256":"d1d1baef08da7c1b3754de3806b265bfde4fe69e67c24feb1ba1416eb26b470b"}}