{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HTVZYBOHN7TNFY54PJFZLO7327","short_pith_number":"pith:HTVZYBOH","canonical_record":{"source":{"id":"1410.6621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T08:55:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bcb1d09a54e03e7b04546b2d9ead64e69ca8d219cbc1282df543e0032b48609e","abstract_canon_sha256":"64f33de8a5aa5c34f320a852a13df01d952b3926a3387c93d1a89ff389bf84c4"},"schema_version":"1.0"},"canonical_sha256":"3ceb9c05c76fe6d2e3bc7a4b95bbfbd7fb4a092bc5b4c0343600badeff318101","source":{"kind":"arxiv","id":"1410.6621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6621","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6621v1","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6621","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"HTVZYBOHN7TN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HTVZYBOHN7TNFY54","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HTVZYBOH","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HTVZYBOHN7TNFY54PJFZLO7327","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T08:55:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bcb1d09a54e03e7b04546b2d9ead64e69ca8d219cbc1282df543e0032b48609e","abstract_canon_sha256":"64f33de8a5aa5c34f320a852a13df01d952b3926a3387c93d1a89ff389bf84c4"},"schema_version":"1.0"},"canonical_sha256":"3ceb9c05c76fe6d2e3bc7a4b95bbfbd7fb4a092bc5b4c0343600badeff318101","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:24.898236Z","signature_b64":"6TgnxLX+y02/2G8QbzveXPwrPMg75/0bHJA/G8TT3RFb5nsnkJPUtc1LZ8O3p/xfsIFame2VDnPPcLRveRkICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ceb9c05c76fe6d2e3bc7a4b95bbfbd7fb4a092bc5b4c0343600badeff318101","last_reissued_at":"2026-05-18T02:39:24.897888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:24.897888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6621","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-18T02:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCGeuCNHOSlKBsQwaj0b//e/49xnoiGPS+NjjaqRAkLPYNbsW746BYdqCh0T8y0lpg1sWworHLjPZiatH++vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:50:00.814170Z"},"content_sha256":"36ce504d3e81766bd0dcaf210d68eeb49199e262f24c0d97d77ad6bf27706ac3","schema_version":"1.0","event_id":"sha256:36ce504d3e81766bd0dcaf210d68eeb49199e262f24c0d97d77ad6bf27706ac3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HTVZYBOHN7TNFY54PJFZLO7327","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Combinatorial Problems on Halin Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"K. Keerthana, M. Kavin, N. Sadagopan, R. Vinothini, Sangeetha. S","submitted_at":"2014-10-24T08:55:12Z","abstract_excerpt":"Let $T$ be a tree with no degree 2 vertices and $L(T)=\\{l_1,\\ldots,l_r\\}, r \\geq 2$ denote the set of leaves in $T$. An Halin graph $G$ is a graph obtained from $T$ such that $V(G)=V(T)$ and $E(G)=E(T) \\cup \\{\\{l_i,l_{i+1}\\} ~|~ 1 \\leq i \\leq r-1\\} \\cup \\{l_1,l_r\\}$. In this paper, we investigate combinatorial problems such as, testing whether a given graph is Halin or not, chromatic bounds, an algorithm to color Halin graphs with the minimum number of colors. Further, we present polynomial-time algorithms for testing and coloring problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6621","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-18T02:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOxgK7KVoih0KEXtuCHiwKdfc8trTLLE8xBdzKczhs9hyVY49JjoOEmByiU+Bz3mJFc5jXHa6yWBF0eZUuzvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:50:00.814875Z"},"content_sha256":"0edd24470ec2e6400bc06739f88036b622a5632f1bde01b85d3fa8a23a97b53f","schema_version":"1.0","event_id":"sha256:0edd24470ec2e6400bc06739f88036b622a5632f1bde01b85d3fa8a23a97b53f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTVZYBOHN7TNFY54PJFZLO7327/bundle.json","state_url":"https://pith.science/pith/HTVZYBOHN7TNFY54PJFZLO7327/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTVZYBOHN7TNFY54PJFZLO7327/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-30T00:50:00Z","links":{"resolver":"https://pith.science/pith/HTVZYBOHN7TNFY54PJFZLO7327","bundle":"https://pith.science/pith/HTVZYBOHN7TNFY54PJFZLO7327/bundle.json","state":"https://pith.science/pith/HTVZYBOHN7TNFY54PJFZLO7327/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTVZYBOHN7TNFY54PJFZLO7327/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HTVZYBOHN7TNFY54PJFZLO7327","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":"64f33de8a5aa5c34f320a852a13df01d952b3926a3387c93d1a89ff389bf84c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T08:55:12Z","title_canon_sha256":"bcb1d09a54e03e7b04546b2d9ead64e69ca8d219cbc1282df543e0032b48609e"},"schema_version":"1.0","source":{"id":"1410.6621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6621","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6621v1","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6621","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"HTVZYBOHN7TN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HTVZYBOHN7TNFY54","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HTVZYBOH","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:0edd24470ec2e6400bc06739f88036b622a5632f1bde01b85d3fa8a23a97b53f","target":"graph","created_at":"2026-05-18T02:39:24Z","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":"Let $T$ be a tree with no degree 2 vertices and $L(T)=\\{l_1,\\ldots,l_r\\}, r \\geq 2$ denote the set of leaves in $T$. An Halin graph $G$ is a graph obtained from $T$ such that $V(G)=V(T)$ and $E(G)=E(T) \\cup \\{\\{l_i,l_{i+1}\\} ~|~ 1 \\leq i \\leq r-1\\} \\cup \\{l_1,l_r\\}$. In this paper, we investigate combinatorial problems such as, testing whether a given graph is Halin or not, chromatic bounds, an algorithm to color Halin graphs with the minimum number of colors. Further, we present polynomial-time algorithms for testing and coloring problems.","authors_text":"K. Keerthana, M. Kavin, N. Sadagopan, R. Vinothini, Sangeetha. S","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T08:55:12Z","title":"Some Combinatorial Problems on Halin Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6621","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:36ce504d3e81766bd0dcaf210d68eeb49199e262f24c0d97d77ad6bf27706ac3","target":"record","created_at":"2026-05-18T02:39:24Z","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":"64f33de8a5aa5c34f320a852a13df01d952b3926a3387c93d1a89ff389bf84c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T08:55:12Z","title_canon_sha256":"bcb1d09a54e03e7b04546b2d9ead64e69ca8d219cbc1282df543e0032b48609e"},"schema_version":"1.0","source":{"id":"1410.6621","kind":"arxiv","version":1}},"canonical_sha256":"3ceb9c05c76fe6d2e3bc7a4b95bbfbd7fb4a092bc5b4c0343600badeff318101","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ceb9c05c76fe6d2e3bc7a4b95bbfbd7fb4a092bc5b4c0343600badeff318101","first_computed_at":"2026-05-18T02:39:24.897888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:24.897888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6TgnxLX+y02/2G8QbzveXPwrPMg75/0bHJA/G8TT3RFb5nsnkJPUtc1LZ8O3p/xfsIFame2VDnPPcLRveRkICg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:24.898236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36ce504d3e81766bd0dcaf210d68eeb49199e262f24c0d97d77ad6bf27706ac3","sha256:0edd24470ec2e6400bc06739f88036b622a5632f1bde01b85d3fa8a23a97b53f"],"state_sha256":"74415b7b4625998472038379ef7b84173490c5edf80e6860ad1de5e32851d33b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9EdclZVh1GP8VBG2RPyFED+1DoRsjtkWk5VndNmzSqWEDmqlrjJmdxHVr6GubFNRwi5PB05tld2oo081OvUJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:50:00.818606Z","bundle_sha256":"8c47d73dd5325fcaab006ba76241fd5b60d3f7629c61d8e35719d41e5beba6f1"}}