{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FEC3AJ5Z2NKEEX4CFFJRZWLI3F","short_pith_number":"pith:FEC3AJ5Z","canonical_record":{"source":{"id":"1607.05817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-20T04:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"7f29ce8a91f5df5a3325d848a62685951b58caa050ba6483f129741c56ddb8f6","abstract_canon_sha256":"517e8e71792e958fc0e2a64cbc8595a49975987da97c56b72c6f9895704a6b3b"},"schema_version":"1.0"},"canonical_sha256":"2905b027b9d354425f8229531cd968d948fbc76a250b9c4a45791be4c719d50d","source":{"kind":"arxiv","id":"1607.05817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05817","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05817v1","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05817","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"FEC3AJ5Z2NKE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEC3AJ5Z2NKEEX4C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEC3AJ5Z","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FEC3AJ5Z2NKEEX4CFFJRZWLI3F","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-20T04:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"7f29ce8a91f5df5a3325d848a62685951b58caa050ba6483f129741c56ddb8f6","abstract_canon_sha256":"517e8e71792e958fc0e2a64cbc8595a49975987da97c56b72c6f9895704a6b3b"},"schema_version":"1.0"},"canonical_sha256":"2905b027b9d354425f8229531cd968d948fbc76a250b9c4a45791be4c719d50d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:45.210809Z","signature_b64":"ScOaHqBo0M9DDcx+qltsBWjYjnUyDmD9Wrq0qc4gRFGRdXH+e6l+VBL/m400o/YZBvWs9fmiDI+rna/MWWOdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2905b027b9d354425f8229531cd968d948fbc76a250b9c4a45791be4c719d50d","last_reissued_at":"2026-05-18T01:10:45.210417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:45.210417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05817","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-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":"Cv2z+z+pXSNbNYXjKsD8ymE8GCBn1gm1ehRrLH6t0XxfebIEaW3Wa1WJ8Vy1wAjUkf9xCuY10jB/p9yx6JgwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:20.290901Z"},"content_sha256":"be62bc1cad571f9436c5062f6263c74d58a1eb769f0857bc605cc23e6172b7da","schema_version":"1.0","event_id":"sha256:be62bc1cad571f9436c5062f6263c74d58a1eb769f0857bc605cc23e6172b7da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FEC3AJ5Z2NKEEX4CFFJRZWLI3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning Trees in 2-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Douglas B. West, N. Sadagopan, P. Renjith","submitted_at":"2016-07-20T04:22:37Z","abstract_excerpt":"A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood consists of two adjacent vertices. We use this construction order both to inductively list the spanning trees without repetition and to give bounds on the number of them. We determine the $n$-vertex $2$-trees having the most and the fewest spanning trees. The $2$-tree with the fewest is unique; it has $n-2$ vertices of degree $2$ and has $n2^{n-3}$ spanning t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05817","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-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":"qvPE+HrEdnoFFPtHD5GR34TpLoy8mwTYVZ9Bl4x4yvZh1gjC1rC1Rv+jQbLNwwDR1MTu8PbX+AjkXWUKSRqsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:20.291248Z"},"content_sha256":"63aa826186c6057aef175477a3f577111e858ff1e17f0176950240d256dd13fe","schema_version":"1.0","event_id":"sha256:63aa826186c6057aef175477a3f577111e858ff1e17f0176950240d256dd13fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEC3AJ5Z2NKEEX4CFFJRZWLI3F/bundle.json","state_url":"https://pith.science/pith/FEC3AJ5Z2NKEEX4CFFJRZWLI3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEC3AJ5Z2NKEEX4CFFJRZWLI3F/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-30T06:09:20Z","links":{"resolver":"https://pith.science/pith/FEC3AJ5Z2NKEEX4CFFJRZWLI3F","bundle":"https://pith.science/pith/FEC3AJ5Z2NKEEX4CFFJRZWLI3F/bundle.json","state":"https://pith.science/pith/FEC3AJ5Z2NKEEX4CFFJRZWLI3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEC3AJ5Z2NKEEX4CFFJRZWLI3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FEC3AJ5Z2NKEEX4CFFJRZWLI3F","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":"517e8e71792e958fc0e2a64cbc8595a49975987da97c56b72c6f9895704a6b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-20T04:22:37Z","title_canon_sha256":"7f29ce8a91f5df5a3325d848a62685951b58caa050ba6483f129741c56ddb8f6"},"schema_version":"1.0","source":{"id":"1607.05817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05817","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05817v1","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05817","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"FEC3AJ5Z2NKE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEC3AJ5Z2NKEEX4C","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEC3AJ5Z","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:63aa826186c6057aef175477a3f577111e858ff1e17f0176950240d256dd13fe","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":"A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood consists of two adjacent vertices. We use this construction order both to inductively list the spanning trees without repetition and to give bounds on the number of them. We determine the $n$-vertex $2$-trees having the most and the fewest spanning trees. The $2$-tree with the fewest is unique; it has $n-2$ vertices of degree $2$ and has $n2^{n-3}$ spanning t","authors_text":"Douglas B. West, N. Sadagopan, P. Renjith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-20T04:22:37Z","title":"Spanning Trees in 2-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05817","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:be62bc1cad571f9436c5062f6263c74d58a1eb769f0857bc605cc23e6172b7da","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":"517e8e71792e958fc0e2a64cbc8595a49975987da97c56b72c6f9895704a6b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-20T04:22:37Z","title_canon_sha256":"7f29ce8a91f5df5a3325d848a62685951b58caa050ba6483f129741c56ddb8f6"},"schema_version":"1.0","source":{"id":"1607.05817","kind":"arxiv","version":1}},"canonical_sha256":"2905b027b9d354425f8229531cd968d948fbc76a250b9c4a45791be4c719d50d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2905b027b9d354425f8229531cd968d948fbc76a250b9c4a45791be4c719d50d","first_computed_at":"2026-05-18T01:10:45.210417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:45.210417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ScOaHqBo0M9DDcx+qltsBWjYjnUyDmD9Wrq0qc4gRFGRdXH+e6l+VBL/m400o/YZBvWs9fmiDI+rna/MWWOdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:45.210809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be62bc1cad571f9436c5062f6263c74d58a1eb769f0857bc605cc23e6172b7da","sha256:63aa826186c6057aef175477a3f577111e858ff1e17f0176950240d256dd13fe"],"state_sha256":"ad273219f4371720d56b5a8ae5a5724e6ac74cb0c4e34bbc308135ec19e4f904"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGTJtD8gMruacDqZUxBg46MFvqJX6RCFHIIgIgx0Ac+YPMnYLzr7Lt8AeMgxgNML5GSfz9V6Nh/rxVQ+ncMtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:09:20.293241Z","bundle_sha256":"be18679a56970ebccb5912ada0a4c9c5288a6893c6d7057c370b40a09c49b224"}}