{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3HA7ACJ3HAMJAANXKYRAXEVOMD","short_pith_number":"pith:3HA7ACJ3","schema_version":"1.0","canonical_sha256":"d9c1f0093b38189001b756220b92ae60f53f4a36243caf071792e7ee1951cd8e","source":{"kind":"arxiv","id":"1101.4927","version":1},"attestation_state":"computed","paper":{"title":"Blocks and Cut Vertices of the Buneman Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.W.W. Dress, J. Koolen, K.T. Huber, V. Moulton","submitted_at":"2011-01-25T20:49:54Z","abstract_excerpt":"Given a set $\\Sg$ of bipartitions of some finite set $X$ of cardinality at least 2, one can associate to $\\Sg$ a canonical $X$-labeled graph $\\B(\\Sg)$, called the Buneman graph. This graph has several interesting mathematical properties - for example, it is a median network and therefore an isometric subgraph of a hypercube. It is commonly used as a tool in studies of DNA sequences gathered from populations. In this paper, we present some results concerning the {\\em cut vertices} of $\\B(\\Sg)$, i.e., vertices whose removal disconnect the graph, as well as its {\\em blocks} or 2-{\\em connected co"},"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":"1101.4927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-25T20:49:54Z","cross_cats_sorted":[],"title_canon_sha256":"f15e7a92a040ddd8665418a68689abc2ba3e7ca68cda9e827b3f36732fbf2b9f","abstract_canon_sha256":"c9bbcb970c6d3fa8dec6f503a92f3fdffc532735b3cd0ab008a657fc8f1cece1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:58.664432Z","signature_b64":"7Z9PLkbGrKXmMNMZq1c4udEXNRnO30xW3zbusJNecRDrhFM23oQuAUg4B1GA27qPZyQhULJ7G/Ln9or2c+zODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9c1f0093b38189001b756220b92ae60f53f4a36243caf071792e7ee1951cd8e","last_reissued_at":"2026-05-18T04:30:58.663457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:58.663457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blocks and Cut Vertices of the Buneman Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.W.W. Dress, J. Koolen, K.T. Huber, V. Moulton","submitted_at":"2011-01-25T20:49:54Z","abstract_excerpt":"Given a set $\\Sg$ of bipartitions of some finite set $X$ of cardinality at least 2, one can associate to $\\Sg$ a canonical $X$-labeled graph $\\B(\\Sg)$, called the Buneman graph. This graph has several interesting mathematical properties - for example, it is a median network and therefore an isometric subgraph of a hypercube. It is commonly used as a tool in studies of DNA sequences gathered from populations. In this paper, we present some results concerning the {\\em cut vertices} of $\\B(\\Sg)$, i.e., vertices whose removal disconnect the graph, as well as its {\\em blocks} or 2-{\\em connected co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4927","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":"1101.4927","created_at":"2026-05-18T04:30:58.663570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4927v1","created_at":"2026-05-18T04:30:58.663570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4927","created_at":"2026-05-18T04:30:58.663570+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HA7ACJ3HAMJ","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HA7ACJ3HAMJAANX","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HA7ACJ3","created_at":"2026-05-18T12:26:18.847500+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/3HA7ACJ3HAMJAANXKYRAXEVOMD","json":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD.json","graph_json":"https://pith.science/api/pith-number/3HA7ACJ3HAMJAANXKYRAXEVOMD/graph.json","events_json":"https://pith.science/api/pith-number/3HA7ACJ3HAMJAANXKYRAXEVOMD/events.json","paper":"https://pith.science/paper/3HA7ACJ3"},"agent_actions":{"view_html":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD","download_json":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD.json","view_paper":"https://pith.science/paper/3HA7ACJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4927&json=true","fetch_graph":"https://pith.science/api/pith-number/3HA7ACJ3HAMJAANXKYRAXEVOMD/graph.json","fetch_events":"https://pith.science/api/pith-number/3HA7ACJ3HAMJAANXKYRAXEVOMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/action/storage_attestation","attest_author":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/action/author_attestation","sign_citation":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/action/citation_signature","submit_replication":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/action/replication_record"}},"created_at":"2026-05-18T04:30:58.663570+00:00","updated_at":"2026-05-18T04:30:58.663570+00:00"}