{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TAQM52JABYZWCQN46E56LJDJ5M","short_pith_number":"pith:TAQM52JA","canonical_record":{"source":{"id":"1305.4711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-21T05:02:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"190e760a14fda57459bc1879a6bd984bf1bff6b312e9cee0212ab525c4b0d408","abstract_canon_sha256":"a13f4c179beb97953bdd5685778864c799bfd29ddb9a2a2d02e9c15577ff8b4c"},"schema_version":"1.0"},"canonical_sha256":"9820cee9200e336141bcf13be5a469eb035d564b828cdc3616c97c9c1f0796c4","source":{"kind":"arxiv","id":"1305.4711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4711","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4711v1","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4711","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"pith_short_12","alias_value":"TAQM52JABYZW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"TAQM52JABYZWCQN4","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"TAQM52JA","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TAQM52JABYZWCQN46E56LJDJ5M","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-21T05:02:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"190e760a14fda57459bc1879a6bd984bf1bff6b312e9cee0212ab525c4b0d408","abstract_canon_sha256":"a13f4c179beb97953bdd5685778864c799bfd29ddb9a2a2d02e9c15577ff8b4c"},"schema_version":"1.0"},"canonical_sha256":"9820cee9200e336141bcf13be5a469eb035d564b828cdc3616c97c9c1f0796c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:15.405390Z","signature_b64":"/SdteengntQKuiZ3WdIdMtSxZ0gN3GnUX0PXlkv4V8AVt9Ryb6MaTzkSd1MSHs0SXDrth0yfDiSS5OF2bqDwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9820cee9200e336141bcf13be5a469eb035d564b828cdc3616c97c9c1f0796c4","last_reissued_at":"2026-05-18T03:25:15.404448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:15.404448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4711","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-18T03:25:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/CzegA9dOiKWg5TTkd339cUx3cWkxLcWyy5PyaqYBVe36yfWrh3ie8DpUyQ2CbKTvRpG/IJhfQ+xUmjmnZ0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:29:20.567672Z"},"content_sha256":"14ac8df30da65ec9d414ac8a5e10025d6ca2642485469c45b87852cd2950b462","schema_version":"1.0","event_id":"sha256:14ac8df30da65ec9d414ac8a5e10025d6ca2642485469c45b87852cd2950b462"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TAQM52JABYZWCQN46E56LJDJ5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On BC-trees and BC-subtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Deqiang Wang, Hongbo Liu, Hua Wang, Yu Yang","submitted_at":"2013-05-21T05:02:37Z","abstract_excerpt":"A BC-tree (block-cutpoint-tree) is a tree (with at least two vertices) where the distance between any two leaves is even. Motivated from the study of the \"core\" of a graph, BC-trees provide an interesting class of trees. We consider questions related to BC-trees as an effort to make modest progress towards the understanding of this concept. Constructive algorithms are provided for BC-trees with given order and number of leaves whenever possible. The concept of BC-subtrees is naturally introduced. Inspired by analogous work on trees and subtrees, we also present some extremal results and briefl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4711","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-18T03:25:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2F6Q871c4rziR/kazIiizzirlH4YzUdWJ3oUDpaYRCnF+QWghobKlxTjQJD3pP3YxaZhAXySskPQOQ1Ar4hdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:29:20.568020Z"},"content_sha256":"39873a1b7de1f9b28b84243205c3414ed462e2e56f3699e00fe1b18680cc8699","schema_version":"1.0","event_id":"sha256:39873a1b7de1f9b28b84243205c3414ed462e2e56f3699e00fe1b18680cc8699"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAQM52JABYZWCQN46E56LJDJ5M/bundle.json","state_url":"https://pith.science/pith/TAQM52JABYZWCQN46E56LJDJ5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAQM52JABYZWCQN46E56LJDJ5M/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-06-26T14:29:20Z","links":{"resolver":"https://pith.science/pith/TAQM52JABYZWCQN46E56LJDJ5M","bundle":"https://pith.science/pith/TAQM52JABYZWCQN46E56LJDJ5M/bundle.json","state":"https://pith.science/pith/TAQM52JABYZWCQN46E56LJDJ5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAQM52JABYZWCQN46E56LJDJ5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TAQM52JABYZWCQN46E56LJDJ5M","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":"a13f4c179beb97953bdd5685778864c799bfd29ddb9a2a2d02e9c15577ff8b4c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-21T05:02:37Z","title_canon_sha256":"190e760a14fda57459bc1879a6bd984bf1bff6b312e9cee0212ab525c4b0d408"},"schema_version":"1.0","source":{"id":"1305.4711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4711","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4711v1","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4711","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"pith_short_12","alias_value":"TAQM52JABYZW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"TAQM52JABYZWCQN4","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"TAQM52JA","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:39873a1b7de1f9b28b84243205c3414ed462e2e56f3699e00fe1b18680cc8699","target":"graph","created_at":"2026-05-18T03:25:15Z","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 BC-tree (block-cutpoint-tree) is a tree (with at least two vertices) where the distance between any two leaves is even. Motivated from the study of the \"core\" of a graph, BC-trees provide an interesting class of trees. We consider questions related to BC-trees as an effort to make modest progress towards the understanding of this concept. Constructive algorithms are provided for BC-trees with given order and number of leaves whenever possible. The concept of BC-subtrees is naturally introduced. Inspired by analogous work on trees and subtrees, we also present some extremal results and briefl","authors_text":"Deqiang Wang, Hongbo Liu, Hua Wang, Yu Yang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-21T05:02:37Z","title":"On BC-trees and BC-subtrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4711","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:14ac8df30da65ec9d414ac8a5e10025d6ca2642485469c45b87852cd2950b462","target":"record","created_at":"2026-05-18T03:25:15Z","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":"a13f4c179beb97953bdd5685778864c799bfd29ddb9a2a2d02e9c15577ff8b4c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-21T05:02:37Z","title_canon_sha256":"190e760a14fda57459bc1879a6bd984bf1bff6b312e9cee0212ab525c4b0d408"},"schema_version":"1.0","source":{"id":"1305.4711","kind":"arxiv","version":1}},"canonical_sha256":"9820cee9200e336141bcf13be5a469eb035d564b828cdc3616c97c9c1f0796c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9820cee9200e336141bcf13be5a469eb035d564b828cdc3616c97c9c1f0796c4","first_computed_at":"2026-05-18T03:25:15.404448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:15.404448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/SdteengntQKuiZ3WdIdMtSxZ0gN3GnUX0PXlkv4V8AVt9Ryb6MaTzkSd1MSHs0SXDrth0yfDiSS5OF2bqDwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:15.405390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14ac8df30da65ec9d414ac8a5e10025d6ca2642485469c45b87852cd2950b462","sha256:39873a1b7de1f9b28b84243205c3414ed462e2e56f3699e00fe1b18680cc8699"],"state_sha256":"48ea71c9fd4fcd63d6475d20d3d5182b374d17b138d8d85223b672f6ebd2720e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQMtzQHWWwnmm250/Ulm3xD2ZCJ3/AIC1q6VjS+3DzGIUXFoS6WjrhHG+X+U4GwgitbOJNNG5mpKgIskQTY0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:29:20.570034Z","bundle_sha256":"c3dd8e8ef63cdfe930d2947762b42c18ad4a06bd1966f4ba546123ef7adf2f99"}}