{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5G2JNR24CYBJRHN5GPST5JEUI3","short_pith_number":"pith:5G2JNR24","schema_version":"1.0","canonical_sha256":"e9b496c75c1602989dbd33e53ea49446d9c28219da41103790063c1d7cc55ccd","source":{"kind":"arxiv","id":"1408.3977","version":1},"attestation_state":"computed","paper":{"title":"Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"B.Supraja, N.Sadagopan, P.Renjith, S.Hima Bindhu, Vandhana.C","submitted_at":"2014-08-18T11:19:02Z","abstract_excerpt":"For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator $S$ is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal vertex separator of least cardinality. A {\\em clique} is a set of mutually adjacent vertices. A 2-tree is a connected graph in which every maximal clique is of size three and every minimal vertex separator is of size two. A spanning tree of a graph $G$ is a connected and an acyclic subgraph of $G$. In this paper, we focus our attention on two enumeration pr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1408.3977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-18T11:19:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"41e4cb6778f9594590c1e84f7a573ddfb94a57916a1d45d6a522a48ea861d8fa","abstract_canon_sha256":"5a35587522b594707aa238025e8fef639f78f00714d1d5295ca070285d9de4b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:57.489695Z","signature_b64":"dLemSB3Fn3iluXf9gDgumlp1NcTtLjLfkYAj5npx2kx+MFel2w2GoxqA+WIKtWuT6PM3P3B79O/n8tHH+YywBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9b496c75c1602989dbd33e53ea49446d9c28219da41103790063c1d7cc55ccd","last_reissued_at":"2026-05-18T02:44:57.489251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:57.489251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"B.Supraja, N.Sadagopan, P.Renjith, S.Hima Bindhu, Vandhana.C","submitted_at":"2014-08-18T11:19:02Z","abstract_excerpt":"For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator $S$ is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal vertex separator of least cardinality. A {\\em clique} is a set of mutually adjacent vertices. A 2-tree is a connected graph in which every maximal clique is of size three and every minimal vertex separator is of size two. A spanning tree of a graph $G$ is a connected and an acyclic subgraph of $G$. In this paper, we focus our attention on two enumeration pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3977","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.3977","created_at":"2026-05-18T02:44:57.489326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3977v1","created_at":"2026-05-18T02:44:57.489326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3977","created_at":"2026-05-18T02:44:57.489326+00:00"},{"alias_kind":"pith_short_12","alias_value":"5G2JNR24CYBJ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5G2JNR24CYBJRHN5","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5G2JNR24","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3","json":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3.json","graph_json":"https://pith.science/api/pith-number/5G2JNR24CYBJRHN5GPST5JEUI3/graph.json","events_json":"https://pith.science/api/pith-number/5G2JNR24CYBJRHN5GPST5JEUI3/events.json","paper":"https://pith.science/paper/5G2JNR24"},"agent_actions":{"view_html":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3","download_json":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3.json","view_paper":"https://pith.science/paper/5G2JNR24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3977&json=true","fetch_graph":"https://pith.science/api/pith-number/5G2JNR24CYBJRHN5GPST5JEUI3/graph.json","fetch_events":"https://pith.science/api/pith-number/5G2JNR24CYBJRHN5GPST5JEUI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3/action/storage_attestation","attest_author":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3/action/author_attestation","sign_citation":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3/action/citation_signature","submit_replication":"https://pith.science/pith/5G2JNR24CYBJRHN5GPST5JEUI3/action/replication_record"}},"created_at":"2026-05-18T02:44:57.489326+00:00","updated_at":"2026-05-18T02:44:57.489326+00:00"}