{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FIZQI5I7AIYCPF3PTPM3AKFEGJ","short_pith_number":"pith:FIZQI5I7","canonical_record":{"source":{"id":"1511.01668","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"47f7795c08d34b91d74261d58953f7d4015ab1be7e247121ac56b16f5c97844f","abstract_canon_sha256":"a917ffd9d24e052580eba40d69d598bbc876120e459a4ab96e0b2fd3dbb5ceb5"},"schema_version":"1.0"},"canonical_sha256":"2a3304751f023027976f9bd9b028a4327dcb4b29984ab6fa830c3752f749b2ee","source":{"kind":"arxiv","id":"1511.01668","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01668","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01668v3","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01668","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"pith_short_12","alias_value":"FIZQI5I7AIYC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FIZQI5I7AIYCPF3P","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FIZQI5I7","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FIZQI5I7AIYCPF3PTPM3AKFEGJ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01668","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"47f7795c08d34b91d74261d58953f7d4015ab1be7e247121ac56b16f5c97844f","abstract_canon_sha256":"a917ffd9d24e052580eba40d69d598bbc876120e459a4ab96e0b2fd3dbb5ceb5"},"schema_version":"1.0"},"canonical_sha256":"2a3304751f023027976f9bd9b028a4327dcb4b29984ab6fa830c3752f749b2ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:38.116825Z","signature_b64":"RKHkIUy9G3ztqDy9Vxhsx9H0KHTTrjxBnUDGPTLTdRagNUI2BWjsSUQLA4Kpt9eLuG7P/c9m4jOvc1SphqwZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a3304751f023027976f9bd9b028a4327dcb4b29984ab6fa830c3752f749b2ee","last_reissued_at":"2026-05-18T00:56:38.116086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:38.116086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01668","source_version":3,"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-18T00:56:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5nPjweiwn0Z89eH5zs0X0OeNDUXPouMP/2UdVzvLKt6DdWA0Q8HCpp1o3WN9+Nt4Rtk07AYxjJDMj53d1UzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:21:44.856168Z"},"content_sha256":"017b2648e6d9806099dfba34fb9ea5ff08b4b49b08d1af0b97e5624390c9a3e0","schema_version":"1.0","event_id":"sha256:017b2648e6d9806099dfba34fb9ea5ff08b4b49b08d1af0b97e5624390c9a3e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FIZQI5I7AIYCPF3PTPM3AKFEGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Steiner Tree in Split Graphs - Dichotomy Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Madhu Illuri, N. Sadagopan, P. Renjith","submitted_at":"2015-11-05T09:33:23Z","abstract_excerpt":"Given a connected graph $G$ and a terminal set $R \\subseteq V(G)$, {\\em Steiner tree} asks for a tree that includes all of $R$ with at most $r$ edges for some integer $r \\geq 0$. It is known from [ND12,Garey et. al \\cite{steinernpc}] that Steiner tree is NP-complete in general graphs. {\\em Split graph} is a graph which can be partitioned into a clique and an independent set. K. White et. al \\cite{white} has established that Steiner tree in split graphs is NP-complete. In this paper, we present an interesting dichotomy: we show that Steiner tree on $K_{1,4}$-free split graphs is polynomial-time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01668","kind":"arxiv","version":3},"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-18T00:56:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7eqhYLAvRkTywdtVp8Fq2tNFIPyyl6H9jZzH7YS0YYaYm65TujEKUfIVlC5x/3i/79PYyl7+DOTFxwwNGvlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:21:44.856865Z"},"content_sha256":"70b37b27f88458098c0bfe3006b0279f425154536180b9860188d50955e59eb8","schema_version":"1.0","event_id":"sha256:70b37b27f88458098c0bfe3006b0279f425154536180b9860188d50955e59eb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIZQI5I7AIYCPF3PTPM3AKFEGJ/bundle.json","state_url":"https://pith.science/pith/FIZQI5I7AIYCPF3PTPM3AKFEGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIZQI5I7AIYCPF3PTPM3AKFEGJ/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-30T07:21:44Z","links":{"resolver":"https://pith.science/pith/FIZQI5I7AIYCPF3PTPM3AKFEGJ","bundle":"https://pith.science/pith/FIZQI5I7AIYCPF3PTPM3AKFEGJ/bundle.json","state":"https://pith.science/pith/FIZQI5I7AIYCPF3PTPM3AKFEGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIZQI5I7AIYCPF3PTPM3AKFEGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FIZQI5I7AIYCPF3PTPM3AKFEGJ","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":"a917ffd9d24e052580eba40d69d598bbc876120e459a4ab96e0b2fd3dbb5ceb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:33:23Z","title_canon_sha256":"47f7795c08d34b91d74261d58953f7d4015ab1be7e247121ac56b16f5c97844f"},"schema_version":"1.0","source":{"id":"1511.01668","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01668","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01668v3","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01668","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"pith_short_12","alias_value":"FIZQI5I7AIYC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FIZQI5I7AIYCPF3P","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FIZQI5I7","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:70b37b27f88458098c0bfe3006b0279f425154536180b9860188d50955e59eb8","target":"graph","created_at":"2026-05-18T00:56:38Z","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":"Given a connected graph $G$ and a terminal set $R \\subseteq V(G)$, {\\em Steiner tree} asks for a tree that includes all of $R$ with at most $r$ edges for some integer $r \\geq 0$. It is known from [ND12,Garey et. al \\cite{steinernpc}] that Steiner tree is NP-complete in general graphs. {\\em Split graph} is a graph which can be partitioned into a clique and an independent set. K. White et. al \\cite{white} has established that Steiner tree in split graphs is NP-complete. In this paper, we present an interesting dichotomy: we show that Steiner tree on $K_{1,4}$-free split graphs is polynomial-time","authors_text":"Madhu Illuri, N. Sadagopan, P. Renjith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:33:23Z","title":"Complexity of Steiner Tree in Split Graphs - Dichotomy Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01668","kind":"arxiv","version":3},"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:017b2648e6d9806099dfba34fb9ea5ff08b4b49b08d1af0b97e5624390c9a3e0","target":"record","created_at":"2026-05-18T00:56:38Z","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":"a917ffd9d24e052580eba40d69d598bbc876120e459a4ab96e0b2fd3dbb5ceb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:33:23Z","title_canon_sha256":"47f7795c08d34b91d74261d58953f7d4015ab1be7e247121ac56b16f5c97844f"},"schema_version":"1.0","source":{"id":"1511.01668","kind":"arxiv","version":3}},"canonical_sha256":"2a3304751f023027976f9bd9b028a4327dcb4b29984ab6fa830c3752f749b2ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a3304751f023027976f9bd9b028a4327dcb4b29984ab6fa830c3752f749b2ee","first_computed_at":"2026-05-18T00:56:38.116086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:38.116086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKHkIUy9G3ztqDy9Vxhsx9H0KHTTrjxBnUDGPTLTdRagNUI2BWjsSUQLA4Kpt9eLuG7P/c9m4jOvc1SphqwZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:38.116825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01668","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:017b2648e6d9806099dfba34fb9ea5ff08b4b49b08d1af0b97e5624390c9a3e0","sha256:70b37b27f88458098c0bfe3006b0279f425154536180b9860188d50955e59eb8"],"state_sha256":"b13be11dc86e5ecedcc2b3115bc2b050cdb7f839cda51bb96f9e88e0a0d33296"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDkuIR9yswsUdzzpyaAmCRRT5EItoEcvsAmO5qziVglhc3+arnOR+K2tftWA+VOuWVEQ/bYm0ItBxlSyKT2BCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:21:44.860860Z","bundle_sha256":"9ffdd8f4b0129282c4a9be35d70cd3c16dd4f61950b763affc1fec9a823c9933"}}