{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MGFOUZQJU63ZCR5DP4U6N66K42","short_pith_number":"pith:MGFOUZQJ","canonical_record":{"source":{"id":"1305.4557","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:34:13Z","cross_cats_sorted":[],"title_canon_sha256":"bc740c28abea764e81cbfec51d371dc0911ecd6cbfa813e50837ade2f0d57e37","abstract_canon_sha256":"c7dfcc55f6761bbe323631322a988c8029c837ff1ecb497690c8ea79b86a70ae"},"schema_version":"1.0"},"canonical_sha256":"618aea6609a7b79147a37f29e6fbcae68f935ae08d131699a68e1b45eec56173","source":{"kind":"arxiv","id":"1305.4557","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4557","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4557v4","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4557","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"MGFOUZQJU63Z","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MGFOUZQJU63ZCR5D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MGFOUZQJ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MGFOUZQJU63ZCR5DP4U6N66K42","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4557","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:34:13Z","cross_cats_sorted":[],"title_canon_sha256":"bc740c28abea764e81cbfec51d371dc0911ecd6cbfa813e50837ade2f0d57e37","abstract_canon_sha256":"c7dfcc55f6761bbe323631322a988c8029c837ff1ecb497690c8ea79b86a70ae"},"schema_version":"1.0"},"canonical_sha256":"618aea6609a7b79147a37f29e6fbcae68f935ae08d131699a68e1b45eec56173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.939541Z","signature_b64":"OLH4/zUmxWAVG5fE4Y1V5T8fRvbpB9r0aAZPDOByt9P+KfRRAaFvz2YTXSkK7ILJdTU0sLjO4Bx1qQk392dxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"618aea6609a7b79147a37f29e6fbcae68f935ae08d131699a68e1b45eec56173","last_reissued_at":"2026-05-18T01:25:55.938810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.938810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4557","source_version":4,"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:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbPH2qJSK0zr2d5xg+Bu7kHi5RwoZZtG2BqhqM93IwUKY0R81w+ldka9s7EfzAO5zdj5nvjmS+UXM1xIvOcqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:59:40.230685Z"},"content_sha256":"e92ad07468e1c283c8445f297fe5afd2296c9e65790c2e79b343bd911d511428","schema_version":"1.0","event_id":"sha256:e92ad07468e1c283c8445f297fe5afd2296c9e65790c2e79b343bd911d511428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MGFOUZQJU63ZCR5DP4U6N66K42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$k$-Blocks: a connectivity invariant for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fabian Hundertmark, Johannes Carmesin, Matthias Hamann, Reinhard Diestel","submitted_at":"2013-05-20T15:34:13Z","abstract_excerpt":"A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by fewer than $k$ other vertices. The block number $\\beta(G)$ of $G$ is the largest integer $k$ such that $G$ has a $k$-block.\n  We investigate how $\\beta$ interacts with density invariants of graphs, such as their minimum or average degree. We further present algorithms that decide whether a graph has a $k$-block, or which find all its $k$-blocks.\n  The connectivity invariant $\\beta(G)$ has a dual width invariant, the block-width ${\\rm bw}(G)$ of $G$. Our algorithms imply the duality t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4557","kind":"arxiv","version":4},"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:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWJroBv11zK/Ib4n1Zkc0pXskOl3l34E0lnHutjVTEYzwdRabtY4fngxxRhMPezByK85FWPeQ8iPwHHWf6dWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:59:40.231347Z"},"content_sha256":"3bd68e210911b247ac7631f9aa2082183384b7ce5fcdbce9ca8107d596234f22","schema_version":"1.0","event_id":"sha256:3bd68e210911b247ac7631f9aa2082183384b7ce5fcdbce9ca8107d596234f22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/bundle.json","state_url":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGFOUZQJU63ZCR5DP4U6N66K42/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-26T20:59:40Z","links":{"resolver":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42","bundle":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/bundle.json","state":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGFOUZQJU63ZCR5DP4U6N66K42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MGFOUZQJU63ZCR5DP4U6N66K42","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":"c7dfcc55f6761bbe323631322a988c8029c837ff1ecb497690c8ea79b86a70ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:34:13Z","title_canon_sha256":"bc740c28abea764e81cbfec51d371dc0911ecd6cbfa813e50837ade2f0d57e37"},"schema_version":"1.0","source":{"id":"1305.4557","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4557","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4557v4","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4557","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"MGFOUZQJU63Z","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MGFOUZQJU63ZCR5D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MGFOUZQJ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:3bd68e210911b247ac7631f9aa2082183384b7ce5fcdbce9ca8107d596234f22","target":"graph","created_at":"2026-05-18T01:25:55Z","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 $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by fewer than $k$ other vertices. The block number $\\beta(G)$ of $G$ is the largest integer $k$ such that $G$ has a $k$-block.\n  We investigate how $\\beta$ interacts with density invariants of graphs, such as their minimum or average degree. We further present algorithms that decide whether a graph has a $k$-block, or which find all its $k$-blocks.\n  The connectivity invariant $\\beta(G)$ has a dual width invariant, the block-width ${\\rm bw}(G)$ of $G$. Our algorithms imply the duality t","authors_text":"Fabian Hundertmark, Johannes Carmesin, Matthias Hamann, Reinhard Diestel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:34:13Z","title":"$k$-Blocks: a connectivity invariant for graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4557","kind":"arxiv","version":4},"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:e92ad07468e1c283c8445f297fe5afd2296c9e65790c2e79b343bd911d511428","target":"record","created_at":"2026-05-18T01:25:55Z","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":"c7dfcc55f6761bbe323631322a988c8029c837ff1ecb497690c8ea79b86a70ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:34:13Z","title_canon_sha256":"bc740c28abea764e81cbfec51d371dc0911ecd6cbfa813e50837ade2f0d57e37"},"schema_version":"1.0","source":{"id":"1305.4557","kind":"arxiv","version":4}},"canonical_sha256":"618aea6609a7b79147a37f29e6fbcae68f935ae08d131699a68e1b45eec56173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"618aea6609a7b79147a37f29e6fbcae68f935ae08d131699a68e1b45eec56173","first_computed_at":"2026-05-18T01:25:55.938810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:55.938810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OLH4/zUmxWAVG5fE4Y1V5T8fRvbpB9r0aAZPDOByt9P+KfRRAaFvz2YTXSkK7ILJdTU0sLjO4Bx1qQk392dxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:55.939541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4557","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e92ad07468e1c283c8445f297fe5afd2296c9e65790c2e79b343bd911d511428","sha256:3bd68e210911b247ac7631f9aa2082183384b7ce5fcdbce9ca8107d596234f22"],"state_sha256":"30f28055ddab782da1490d893e53b37ddcc32df254ccd05e082fa1821f63440c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XupZug5gxJbAwCc6n1cx8LJehq2udcsQK3wsjK9iCZhaEBN81fKeo+lWvvuJ3xP84mYaVTVm54n4YI49TfUNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:59:40.234759Z","bundle_sha256":"105d4711a781e39cf0c88ae5a935b8c73615aab09e21feee15b4991f403527bc"}}