{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:O2SYXJFUUMMAQ3YJJFB4OPO6SE","short_pith_number":"pith:O2SYXJFU","canonical_record":{"source":{"id":"1903.08926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2019-03-21T11:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"e4b50a998934a17b965c24dc90ae99d5f7cbe24a34640e6543a339abf3d265e1","abstract_canon_sha256":"60b8029d442145611673af0c8668b211fcba2f8146114e9cab5b9cd0df68610f"},"schema_version":"1.0"},"canonical_sha256":"76a58ba4b4a318086f094943c73dde9103efbd908052579c253711a8fde74aa7","source":{"kind":"arxiv","id":"1903.08926","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08926","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08926v2","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08926","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"pith_short_12","alias_value":"O2SYXJFUUMMA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O2SYXJFUUMMAQ3YJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O2SYXJFU","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:O2SYXJFUUMMAQ3YJJFB4OPO6SE","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2019-03-21T11:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"e4b50a998934a17b965c24dc90ae99d5f7cbe24a34640e6543a339abf3d265e1","abstract_canon_sha256":"60b8029d442145611673af0c8668b211fcba2f8146114e9cab5b9cd0df68610f"},"schema_version":"1.0"},"canonical_sha256":"76a58ba4b4a318086f094943c73dde9103efbd908052579c253711a8fde74aa7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:14.419023Z","signature_b64":"kfdbkAQ0M9B32lshz/h0p1ZKIJVo4snATJsaqrrDMgQLT3C27j4t7MmhHz9qVAbfoawrbdjYSF/ZKY80K7RXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a58ba4b4a318086f094943c73dde9103efbd908052579c253711a8fde74aa7","last_reissued_at":"2026-05-17T23:49:14.418280Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:14.418280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08926","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-17T23:49:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWkysUZwR3cBMufdyay2THUig+qOtJ9W2Edqpdru834PeY00IGmPZoLuUhu+TGAAqNyscB3NK7A6jtWzMHYUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:19:25.609084Z"},"content_sha256":"224589366e6ae83b9683f6741ad6eaf04b7600fdf9fade56dc1ee803e1cb8901","schema_version":"1.0","event_id":"sha256:224589366e6ae83b9683f6741ad6eaf04b7600fdf9fade56dc1ee803e1cb8901"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:O2SYXJFUUMMAQ3YJJFB4OPO6SE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the Steiner Tree Problem in Graphs using Physarum-inspired Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Yahui Sun","submitted_at":"2019-03-21T11:22:20Z","abstract_excerpt":"Some biological experiments show that the tubular structures of Physarum polycephalum are often analogous to those of Steiner trees. Therefore, the emerging Physarum-inspired Algorithms (PAs) have the potential of computing Steiner trees. In this paper, we propose two PAs to solve the Steiner Tree Problem in Graphs (STPG). We apply some widely-used artificial and real-world VLSI design instances to evaluate the performance of our PAs. The experimental results show that: 1) for instances with hundreds of vertices, our first PA can find feasible solutions with an average error of 0.19%, while th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08926","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-17T23:49:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4G8rGBCA+EHA6lV8FrFmxVXszUcCvMh/AK3g5phN1NmO4tpEmYLTnlv2uVvMCpbggjjXHuHfi/+PvzcviW1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:19:25.609439Z"},"content_sha256":"e98c8d674c81abce67e251f5f6b584b4ccd96cee873fe19e4b751900e42b88f9","schema_version":"1.0","event_id":"sha256:e98c8d674c81abce67e251f5f6b584b4ccd96cee873fe19e4b751900e42b88f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2SYXJFUUMMAQ3YJJFB4OPO6SE/bundle.json","state_url":"https://pith.science/pith/O2SYXJFUUMMAQ3YJJFB4OPO6SE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2SYXJFUUMMAQ3YJJFB4OPO6SE/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-26T22:19:25Z","links":{"resolver":"https://pith.science/pith/O2SYXJFUUMMAQ3YJJFB4OPO6SE","bundle":"https://pith.science/pith/O2SYXJFUUMMAQ3YJJFB4OPO6SE/bundle.json","state":"https://pith.science/pith/O2SYXJFUUMMAQ3YJJFB4OPO6SE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2SYXJFUUMMAQ3YJJFB4OPO6SE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:O2SYXJFUUMMAQ3YJJFB4OPO6SE","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":"60b8029d442145611673af0c8668b211fcba2f8146114e9cab5b9cd0df68610f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2019-03-21T11:22:20Z","title_canon_sha256":"e4b50a998934a17b965c24dc90ae99d5f7cbe24a34640e6543a339abf3d265e1"},"schema_version":"1.0","source":{"id":"1903.08926","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08926","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08926v2","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08926","created_at":"2026-05-17T23:49:14Z"},{"alias_kind":"pith_short_12","alias_value":"O2SYXJFUUMMA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O2SYXJFUUMMAQ3YJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O2SYXJFU","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:e98c8d674c81abce67e251f5f6b584b4ccd96cee873fe19e4b751900e42b88f9","target":"graph","created_at":"2026-05-17T23:49: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":"Some biological experiments show that the tubular structures of Physarum polycephalum are often analogous to those of Steiner trees. Therefore, the emerging Physarum-inspired Algorithms (PAs) have the potential of computing Steiner trees. In this paper, we propose two PAs to solve the Steiner Tree Problem in Graphs (STPG). We apply some widely-used artificial and real-world VLSI design instances to evaluate the performance of our PAs. The experimental results show that: 1) for instances with hundreds of vertices, our first PA can find feasible solutions with an average error of 0.19%, while th","authors_text":"Yahui Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2019-03-21T11:22:20Z","title":"Solving the Steiner Tree Problem in Graphs using Physarum-inspired Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08926","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:224589366e6ae83b9683f6741ad6eaf04b7600fdf9fade56dc1ee803e1cb8901","target":"record","created_at":"2026-05-17T23:49: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":"60b8029d442145611673af0c8668b211fcba2f8146114e9cab5b9cd0df68610f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2019-03-21T11:22:20Z","title_canon_sha256":"e4b50a998934a17b965c24dc90ae99d5f7cbe24a34640e6543a339abf3d265e1"},"schema_version":"1.0","source":{"id":"1903.08926","kind":"arxiv","version":2}},"canonical_sha256":"76a58ba4b4a318086f094943c73dde9103efbd908052579c253711a8fde74aa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76a58ba4b4a318086f094943c73dde9103efbd908052579c253711a8fde74aa7","first_computed_at":"2026-05-17T23:49:14.418280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:14.418280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kfdbkAQ0M9B32lshz/h0p1ZKIJVo4snATJsaqrrDMgQLT3C27j4t7MmhHz9qVAbfoawrbdjYSF/ZKY80K7RXBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:14.419023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08926","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:224589366e6ae83b9683f6741ad6eaf04b7600fdf9fade56dc1ee803e1cb8901","sha256:e98c8d674c81abce67e251f5f6b584b4ccd96cee873fe19e4b751900e42b88f9"],"state_sha256":"9ab65c11e17353991c8fbc099059161b2506b009ac4868fb95546d2292544766"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQBNWIsrNRlWj6CcmYv6i68ICoJAJdm2oYuNmv8ahjt5WpfLmxPYmmjelWi+Fjc/bhEgTBYaPa1OHqsYqLHQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T22:19:25.611301Z","bundle_sha256":"5886273edc99e80751483a798dd443a6ab6c81a0d10c02227aed441075d1c720"}}