{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NBBBVOUB5IGMEMNVWOOQQIJISB","short_pith_number":"pith:NBBBVOUB","canonical_record":{"source":{"id":"1412.2787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-08T21:48:26Z","cross_cats_sorted":[],"title_canon_sha256":"13716c4a8d6cf31b301f36f8e57cd5ac66f7dba72fa2b52b6a40754c4c1d3798","abstract_canon_sha256":"d5d0be35d1780d2d2d7082bc09c9abc1c4b887c4fd3c020b74c3392a8332f887"},"schema_version":"1.0"},"canonical_sha256":"68421aba81ea0cc231b5b39d0821289057b959d6de85f976b1451fdf2d71e631","source":{"kind":"arxiv","id":"1412.2787","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2787","created_at":"2026-05-18T02:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2787v2","created_at":"2026-05-18T02:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2787","created_at":"2026-05-18T02:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"NBBBVOUB5IGM","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NBBBVOUB5IGMEMNV","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NBBBVOUB","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NBBBVOUB5IGMEMNVWOOQQIJISB","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-08T21:48:26Z","cross_cats_sorted":[],"title_canon_sha256":"13716c4a8d6cf31b301f36f8e57cd5ac66f7dba72fa2b52b6a40754c4c1d3798","abstract_canon_sha256":"d5d0be35d1780d2d2d7082bc09c9abc1c4b887c4fd3c020b74c3392a8332f887"},"schema_version":"1.0"},"canonical_sha256":"68421aba81ea0cc231b5b39d0821289057b959d6de85f976b1451fdf2d71e631","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:37.581031Z","signature_b64":"ob9V11xsAzgRyhX0ps8xKHtfM1BCg/ClkVFTqegnRhe53K+1teeW6Hu/6tSqH8OpLrlKBWfDt84w29VKJ4dWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68421aba81ea0cc231b5b39d0821289057b959d6de85f976b1451fdf2d71e631","last_reissued_at":"2026-05-18T02:31:37.580444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:37.580444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2787","source_version":2,"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-18T02:31:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alqKoZe/wCeYQ6YCP89fZnLkWptr1EMdPTjvbcWOmTyOYdsvctU2UA9kF00G9wXeI1u0nb8geNwh8hKgq8N6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:18:04.993642Z"},"content_sha256":"b225213a2fe25e2c218b5d9c5e54816e2cd05dc769fe75a71672093e6f64488c","schema_version":"1.0","event_id":"sha256:b225213a2fe25e2c218b5d9c5e54816e2cd05dc769fe75a71672093e6f64488c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NBBBVOUB5IGMEMNVWOOQQIJISB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust and Scalable Algorithm for the Steiner Problem in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduardo Uchoa, Renato F. Werneck, Thomas Pajor","submitted_at":"2014-12-08T21:48:26Z","abstract_excerpt":"We present an effective heuristic for the Steiner Problem in Graphs. Its main elements are a multistart algorithm coupled with aggressive combination of elite solutions, both leveraging recently-proposed fast local searches. We also propose a fast implementation of a well-known dual ascent algorithm that not only makes our heuristics more robust (by quickly dealing with easier cases), but can also be used as a building block of an exact (branch-and-bound) algorithm that is quite effective for some inputs. On all graph classes we consider, our heuristic is competitive with (and sometimes more e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2787","kind":"arxiv","version":2},"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-18T02:31:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkuKCSz1fqVHkXywZbmbdEKcgM/q6PYiu9BKLagNKjXLIg7ckYEarKMISaIzHXZqq7NGmqXTFtA5lAYqbvR4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:18:04.994305Z"},"content_sha256":"30c22ab7d7f9f221621e9d1ba956f6563d247193a2bdefda33f303ff3e710452","schema_version":"1.0","event_id":"sha256:30c22ab7d7f9f221621e9d1ba956f6563d247193a2bdefda33f303ff3e710452"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBBBVOUB5IGMEMNVWOOQQIJISB/bundle.json","state_url":"https://pith.science/pith/NBBBVOUB5IGMEMNVWOOQQIJISB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBBBVOUB5IGMEMNVWOOQQIJISB/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-04T23:18:04Z","links":{"resolver":"https://pith.science/pith/NBBBVOUB5IGMEMNVWOOQQIJISB","bundle":"https://pith.science/pith/NBBBVOUB5IGMEMNVWOOQQIJISB/bundle.json","state":"https://pith.science/pith/NBBBVOUB5IGMEMNVWOOQQIJISB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBBBVOUB5IGMEMNVWOOQQIJISB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NBBBVOUB5IGMEMNVWOOQQIJISB","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":"d5d0be35d1780d2d2d7082bc09c9abc1c4b887c4fd3c020b74c3392a8332f887","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-08T21:48:26Z","title_canon_sha256":"13716c4a8d6cf31b301f36f8e57cd5ac66f7dba72fa2b52b6a40754c4c1d3798"},"schema_version":"1.0","source":{"id":"1412.2787","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2787","created_at":"2026-05-18T02:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2787v2","created_at":"2026-05-18T02:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2787","created_at":"2026-05-18T02:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"NBBBVOUB5IGM","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NBBBVOUB5IGMEMNV","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NBBBVOUB","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:30c22ab7d7f9f221621e9d1ba956f6563d247193a2bdefda33f303ff3e710452","target":"graph","created_at":"2026-05-18T02:31:37Z","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 present an effective heuristic for the Steiner Problem in Graphs. Its main elements are a multistart algorithm coupled with aggressive combination of elite solutions, both leveraging recently-proposed fast local searches. We also propose a fast implementation of a well-known dual ascent algorithm that not only makes our heuristics more robust (by quickly dealing with easier cases), but can also be used as a building block of an exact (branch-and-bound) algorithm that is quite effective for some inputs. On all graph classes we consider, our heuristic is competitive with (and sometimes more e","authors_text":"Eduardo Uchoa, Renato F. Werneck, Thomas Pajor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-08T21:48:26Z","title":"A Robust and Scalable Algorithm for the Steiner Problem in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2787","kind":"arxiv","version":2},"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:b225213a2fe25e2c218b5d9c5e54816e2cd05dc769fe75a71672093e6f64488c","target":"record","created_at":"2026-05-18T02:31:37Z","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":"d5d0be35d1780d2d2d7082bc09c9abc1c4b887c4fd3c020b74c3392a8332f887","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-08T21:48:26Z","title_canon_sha256":"13716c4a8d6cf31b301f36f8e57cd5ac66f7dba72fa2b52b6a40754c4c1d3798"},"schema_version":"1.0","source":{"id":"1412.2787","kind":"arxiv","version":2}},"canonical_sha256":"68421aba81ea0cc231b5b39d0821289057b959d6de85f976b1451fdf2d71e631","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68421aba81ea0cc231b5b39d0821289057b959d6de85f976b1451fdf2d71e631","first_computed_at":"2026-05-18T02:31:37.580444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:37.580444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ob9V11xsAzgRyhX0ps8xKHtfM1BCg/ClkVFTqegnRhe53K+1teeW6Hu/6tSqH8OpLrlKBWfDt84w29VKJ4dWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:37.581031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2787","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b225213a2fe25e2c218b5d9c5e54816e2cd05dc769fe75a71672093e6f64488c","sha256:30c22ab7d7f9f221621e9d1ba956f6563d247193a2bdefda33f303ff3e710452"],"state_sha256":"797c29474b4e71f307e06fa594b31940ade9a8617a17cb309f7e7329f7fed1df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnuhlKZcQ4wHUTpWeThRTKKmIWTIwKN3Gu9St11DfDmFPKce27MUlPAmFZv/1p8LWWx9wb7lIg0E+Iyfi//AAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:18:04.998271Z","bundle_sha256":"293833cbdcc167b65330f00e059b70adea97b85f6367077ba6681af91009d058"}}