{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3HA7ACJ3HAMJAANXKYRAXEVOMD","short_pith_number":"pith:3HA7ACJ3","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"},"canonical_sha256":"d9c1f0093b38189001b756220b92ae60f53f4a36243caf071792e7ee1951cd8e","source":{"kind":"arxiv","id":"1101.4927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4927","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4927v1","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4927","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"pith_short_12","alias_value":"3HA7ACJ3HAMJ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3HA7ACJ3HAMJAANX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3HA7ACJ3","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3HA7ACJ3HAMJAANXKYRAXEVOMD","target":"record","payload":{"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"},"canonical_sha256":"d9c1f0093b38189001b756220b92ae60f53f4a36243caf071792e7ee1951cd8e","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"},"source_kind":"arxiv","source_id":"1101.4927","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-18T04:30:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WG1OA8463uP5K8TkdbL+JM79TdrHj4E5DlvYHm9HV8gsvHCjO7zJSUCjUm57/IanJqUc8JAfi0p35iUsjoLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:48:11.509425Z"},"content_sha256":"6ee99f05fc4c17dd3feb473be3c0bf7d03812231e9a727df6e68c760e004a0af","schema_version":"1.0","event_id":"sha256:6ee99f05fc4c17dd3feb473be3c0bf7d03812231e9a727df6e68c760e004a0af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3HA7ACJ3HAMJAANXKYRAXEVOMD","target":"graph","payload":{"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"},"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-18T04:30:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1TzKIGs/dmHQyD586F1okWD93hukBJzp/aPvxOa7bSvT6z1cFTAmMqDjmQjSggjz86r+EXmJDsZJGH3t6j4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:48:11.509779Z"},"content_sha256":"923212939640d9429d04bf8006935787913b35045445b79a05f3d3856c571e17","schema_version":"1.0","event_id":"sha256:923212939640d9429d04bf8006935787913b35045445b79a05f3d3856c571e17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/bundle.json","state_url":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/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-11T11:48:11Z","links":{"resolver":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD","bundle":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/bundle.json","state":"https://pith.science/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HA7ACJ3HAMJAANXKYRAXEVOMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3HA7ACJ3HAMJAANXKYRAXEVOMD","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":"c9bbcb970c6d3fa8dec6f503a92f3fdffc532735b3cd0ab008a657fc8f1cece1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-25T20:49:54Z","title_canon_sha256":"f15e7a92a040ddd8665418a68689abc2ba3e7ca68cda9e827b3f36732fbf2b9f"},"schema_version":"1.0","source":{"id":"1101.4927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4927","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4927v1","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4927","created_at":"2026-05-18T04:30:58Z"},{"alias_kind":"pith_short_12","alias_value":"3HA7ACJ3HAMJ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3HA7ACJ3HAMJAANX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3HA7ACJ3","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:923212939640d9429d04bf8006935787913b35045445b79a05f3d3856c571e17","target":"graph","created_at":"2026-05-18T04:30:58Z","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":"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","authors_text":"A.W.W. Dress, J. Koolen, K.T. Huber, V. Moulton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-25T20:49:54Z","title":"Blocks and Cut Vertices of the Buneman Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4927","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:6ee99f05fc4c17dd3feb473be3c0bf7d03812231e9a727df6e68c760e004a0af","target":"record","created_at":"2026-05-18T04:30:58Z","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":"c9bbcb970c6d3fa8dec6f503a92f3fdffc532735b3cd0ab008a657fc8f1cece1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-25T20:49:54Z","title_canon_sha256":"f15e7a92a040ddd8665418a68689abc2ba3e7ca68cda9e827b3f36732fbf2b9f"},"schema_version":"1.0","source":{"id":"1101.4927","kind":"arxiv","version":1}},"canonical_sha256":"d9c1f0093b38189001b756220b92ae60f53f4a36243caf071792e7ee1951cd8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9c1f0093b38189001b756220b92ae60f53f4a36243caf071792e7ee1951cd8e","first_computed_at":"2026-05-18T04:30:58.663457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:58.663457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Z9PLkbGrKXmMNMZq1c4udEXNRnO30xW3zbusJNecRDrhFM23oQuAUg4B1GA27qPZyQhULJ7G/Ln9or2c+zODw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:58.664432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ee99f05fc4c17dd3feb473be3c0bf7d03812231e9a727df6e68c760e004a0af","sha256:923212939640d9429d04bf8006935787913b35045445b79a05f3d3856c571e17"],"state_sha256":"d0599cff691dd622a760e7a1076421e765c1fffca82ba241557acdb48d30ce8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKB8sbQPe+Nycl/XSypyCqInd5+d84OxP60PH3tMO/WuaN2Mjum+jJGkZTt+jx6ytCuVl0BAE8pu7UxWASiLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:48:11.511736Z","bundle_sha256":"34e099eacc1415b9f7e2de31cab6a00bdf28fc83f53e618056752487b03fd13d"}}