{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VEOFRJWHOOVDO4XRK2N5CGG4RL","short_pith_number":"pith:VEOFRJWH","canonical_record":{"source":{"id":"1511.01696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T11:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"3d76fe52b817c16e0967a3db0ba366a68ec2fb1c5c8c42c8863b26a13e7ac919","abstract_canon_sha256":"51d083d7ec4ff54357fca30eff69bdfd61bb0adfe08cc3bacf10766f6383d0f0"},"schema_version":"1.0"},"canonical_sha256":"a91c58a6c773aa3772f1569bd118dc8ac2827efbe83d1064474ae163744dc70d","source":{"kind":"arxiv","id":"1511.01696","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01696","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01696v2","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01696","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"VEOFRJWHOOVD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VEOFRJWHOOVDO4XR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VEOFRJWH","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VEOFRJWHOOVDO4XRK2N5CGG4RL","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T11:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"3d76fe52b817c16e0967a3db0ba366a68ec2fb1c5c8c42c8863b26a13e7ac919","abstract_canon_sha256":"51d083d7ec4ff54357fca30eff69bdfd61bb0adfe08cc3bacf10766f6383d0f0"},"schema_version":"1.0"},"canonical_sha256":"a91c58a6c773aa3772f1569bd118dc8ac2827efbe83d1064474ae163744dc70d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:45.838213Z","signature_b64":"JVZ20IcZZ2OYsEQCEvjx57IVCyq9otnwJoYVJ4t9MmqYCi9MPR34wB96F7AjporLTPdFVUmOJe4S/sHMQfyuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a91c58a6c773aa3772f1569bd118dc8ac2827efbe83d1064474ae163744dc70d","last_reissued_at":"2026-05-18T01:10:45.837816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:45.837816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01696","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-18T01:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ets2feLyz/cx5W8joEaKPEV0dSZYZKeNqqYIEcSkH2rlDjz+gnMNrVD6Kf//2iNdCyBOA4OzFuqqh+YWYtgMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:49:16.950005Z"},"content_sha256":"e4a7ce8ab890f5e38ad08c48b7409f97a8008a05845a6395b5b35f62730a30b5","schema_version":"1.0","event_id":"sha256:e4a7ce8ab890f5e38ad08c48b7409f97a8008a05845a6395b5b35f62730a30b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VEOFRJWHOOVDO4XRK2N5CGG4RL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"K. Krishna Mohan Reddy, N. Sadagopan, P. Renjith","submitted_at":"2015-11-05T11:03:49Z","abstract_excerpt":"For a connected labelled graph $G$, a {\\em spanning tree} $T$ is a connected and an acyclic subgraph that spans all vertices of $G$. In this paper, we consider a classical combinatorial problem which is to list all spanning trees of $G$. A Halin graph is a graph obtained from a tree with no degree two vertices and by joining all leaves with a cycle. We present a sequential and parallel algorithm to enumerate all spanning trees in Halin graphs. Our approach enumerates without repetitions and we make use of $O((2pd)^{p})$ processors for parallel algorithmics, where $d$ and $p$ are the depth, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01696","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-18T01:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81ylKytN2kV7dKpR6oIeNtzOZ5U/BEXLk083WdboojiTEgfi3iMAP8JO0rYF8WVSpqWZIU7/sLsndvWXmnokCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:49:16.950366Z"},"content_sha256":"360d682940fee49111b6607c01bdd7aa31380e90276169937cc1b6fbcb29c42b","schema_version":"1.0","event_id":"sha256:360d682940fee49111b6607c01bdd7aa31380e90276169937cc1b6fbcb29c42b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/bundle.json","state_url":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/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:49:16Z","links":{"resolver":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL","bundle":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/bundle.json","state":"https://pith.science/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEOFRJWHOOVDO4XRK2N5CGG4RL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VEOFRJWHOOVDO4XRK2N5CGG4RL","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":"51d083d7ec4ff54357fca30eff69bdfd61bb0adfe08cc3bacf10766f6383d0f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T11:03:49Z","title_canon_sha256":"3d76fe52b817c16e0967a3db0ba366a68ec2fb1c5c8c42c8863b26a13e7ac919"},"schema_version":"1.0","source":{"id":"1511.01696","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01696","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01696v2","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01696","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"VEOFRJWHOOVD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VEOFRJWHOOVDO4XR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VEOFRJWH","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:360d682940fee49111b6607c01bdd7aa31380e90276169937cc1b6fbcb29c42b","target":"graph","created_at":"2026-05-18T01:10:45Z","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":"For a connected labelled graph $G$, a {\\em spanning tree} $T$ is a connected and an acyclic subgraph that spans all vertices of $G$. In this paper, we consider a classical combinatorial problem which is to list all spanning trees of $G$. A Halin graph is a graph obtained from a tree with no degree two vertices and by joining all leaves with a cycle. We present a sequential and parallel algorithm to enumerate all spanning trees in Halin graphs. Our approach enumerates without repetitions and we make use of $O((2pd)^{p})$ processors for parallel algorithmics, where $d$ and $p$ are the depth, the","authors_text":"K. Krishna Mohan Reddy, N. Sadagopan, P. Renjith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T11:03:49Z","title":"Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01696","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:e4a7ce8ab890f5e38ad08c48b7409f97a8008a05845a6395b5b35f62730a30b5","target":"record","created_at":"2026-05-18T01:10:45Z","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":"51d083d7ec4ff54357fca30eff69bdfd61bb0adfe08cc3bacf10766f6383d0f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T11:03:49Z","title_canon_sha256":"3d76fe52b817c16e0967a3db0ba366a68ec2fb1c5c8c42c8863b26a13e7ac919"},"schema_version":"1.0","source":{"id":"1511.01696","kind":"arxiv","version":2}},"canonical_sha256":"a91c58a6c773aa3772f1569bd118dc8ac2827efbe83d1064474ae163744dc70d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a91c58a6c773aa3772f1569bd118dc8ac2827efbe83d1064474ae163744dc70d","first_computed_at":"2026-05-18T01:10:45.837816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:45.837816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JVZ20IcZZ2OYsEQCEvjx57IVCyq9otnwJoYVJ4t9MmqYCi9MPR34wB96F7AjporLTPdFVUmOJe4S/sHMQfyuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:45.838213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01696","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4a7ce8ab890f5e38ad08c48b7409f97a8008a05845a6395b5b35f62730a30b5","sha256:360d682940fee49111b6607c01bdd7aa31380e90276169937cc1b6fbcb29c42b"],"state_sha256":"590d23837594d2a042235640aed4035f509160f974a09a84782c636305273abf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LDWk/T7+QVWohIRdXNs5Pl3Zwojy98V7GdKJiJuwCezbO3diHzL/ENjmsx6v0NgcuVhjQryl8wUc9PYHK1zLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:49:16.953817Z","bundle_sha256":"6097c58382ba7cb4c591ebaa77ec48004255a1bb46a66af75f6b810a83beb308"}}