{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NNU5NU7YNAXG7UGWQ3NMYCLDMR","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":"bad447f5aa864719b8efa5af2fc89d899c05e088914ae40387cc7b0038756485","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T07:27:08Z","title_canon_sha256":"52b593f6a90e00f98a4398dc425923483126572a42f3d86dfac000879dad29b0"},"schema_version":"1.0","source":{"id":"2004.07492","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07492","created_at":"2026-07-05T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07492v2","created_at":"2026-07-05T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07492","created_at":"2026-07-05T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"NNU5NU7YNAXG","created_at":"2026-07-05T01:59:55Z"},{"alias_kind":"pith_short_16","alias_value":"NNU5NU7YNAXG7UGW","created_at":"2026-07-05T01:59:55Z"},{"alias_kind":"pith_short_8","alias_value":"NNU5NU7Y","created_at":"2026-07-05T01:59:55Z"}],"graph_snapshots":[{"event_id":"sha256:3f8163f8e18d67f60db10d3a78b9b9149ed3531d61d74c4bf5c8dcde4d2bbb20","target":"graph","created_at":"2026-07-05T01:59:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.07492/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the classical problems (Edge) Steiner Tree and Vertex Steiner Tree after restricting the input to some class of graphs characterized by a small set of forbidden induced subgraphs. We show a dichotomy for the former problem restricted to $(H_1,H_2)$-free graphs and a dichotomy for the latter problem restricted to $H$-free graphs. We find that there exists an infinite family of graphs $H$ such that Vertex Steiner Tree is polynomial-time solvable for $H$-free graphs, whereas there exist only two graphs $H$ for which this holds for Edge Steiner Tree. We also find that Edge Steiner Tree","authors_text":"Daniel Paulusma, Erik Jan van Leeuwen, Giacomo Paesani, Hans Bodlaender, Matthew Johnson, Nick Brettell","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T07:27:08Z","title":"Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07492","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:c888629f0452b5a71d66640b3c3622d7117873d1d9d3aaf4a4f07520878fba42","target":"record","created_at":"2026-07-05T01:59:55Z","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":"bad447f5aa864719b8efa5af2fc89d899c05e088914ae40387cc7b0038756485","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-16T07:27:08Z","title_canon_sha256":"52b593f6a90e00f98a4398dc425923483126572a42f3d86dfac000879dad29b0"},"schema_version":"1.0","source":{"id":"2004.07492","kind":"arxiv","version":2}},"canonical_sha256":"6b69d6d3f8682e6fd0d686dacc0963647dc43b78639091d3c77357b9f0319eed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b69d6d3f8682e6fd0d686dacc0963647dc43b78639091d3c77357b9f0319eed","first_computed_at":"2026-07-05T01:59:55.294155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:59:55.294155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3OrRRNUI8Nr4xkWBmMFET0VVRrU5AX4MoRSyttAC1B+HRP/MWlx2CB+ZiOlle+4Yg5OFnTfyVIR6bFJzaC8HDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:59:55.294561Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.07492","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c888629f0452b5a71d66640b3c3622d7117873d1d9d3aaf4a4f07520878fba42","sha256:3f8163f8e18d67f60db10d3a78b9b9149ed3531d61d74c4bf5c8dcde4d2bbb20"],"state_sha256":"8928709aee05cc6ee0599c6d598c0214290577002ba1057d06359e9bde47b596"}