{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RZ5PAQNXK6DHJXWJVF4KSVUNGW","short_pith_number":"pith:RZ5PAQNX","canonical_record":{"source":{"id":"1305.4909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T18:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"e56efd84abf21aeb5470a6ef7c783bc71a5d4fd480127b36f49324d405da0abc","abstract_canon_sha256":"bf91457db1daf8e94a970a6cfad8b29676b8cb3b4967ed67fdee81de2c454e20"},"schema_version":"1.0"},"canonical_sha256":"8e7af041b7578674dec9a978a9568d3580a4d350bd3385e7deea373d139587f0","source":{"kind":"arxiv","id":"1305.4909","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4909","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4909v2","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4909","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"RZ5PAQNXK6DH","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RZ5PAQNXK6DHJXWJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RZ5PAQNX","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RZ5PAQNXK6DHJXWJVF4KSVUNGW","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T18:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"e56efd84abf21aeb5470a6ef7c783bc71a5d4fd480127b36f49324d405da0abc","abstract_canon_sha256":"bf91457db1daf8e94a970a6cfad8b29676b8cb3b4967ed67fdee81de2c454e20"},"schema_version":"1.0"},"canonical_sha256":"8e7af041b7578674dec9a978a9568d3580a4d350bd3385e7deea373d139587f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:27.029235Z","signature_b64":"GSOvxwKBzl0+1vt9p9nbqT88Y5WWkHtI61RUH4ksbpt69+H2IDpxNVsnagjJvDNKu3E6hqYrko4aLw590gUYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e7af041b7578674dec9a978a9568d3580a4d350bd3385e7deea373d139587f0","last_reissued_at":"2026-05-18T02:53:27.028549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:27.028549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4909","source_version":2,"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-18T02:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTzFcZS0LLY6qG6E2DAMf9bAvjYn9jaoPuEGDOvL51LnoPdhUpA6azsPW9vZtc+Hfbk3snBM9S6DlfjYVpX0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:15:28.811086Z"},"content_sha256":"e9b40a01840d7ac60c023892eeef56d75ecc0153c4f0a36387798cd8fd4da29f","schema_version":"1.0","event_id":"sha256:e9b40a01840d7ac60c023892eeef56d75ecc0153c4f0a36387798cd8fd4da29f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RZ5PAQNXK6DHJXWJVF4KSVUNGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Canonical tree-decompositions of finite graphs II. Essential parts","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-21T18:37:12Z","abstract_excerpt":"In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these decompositions that contain no such block or tangle, and determine conditions under which such parts contain nothing but a k-block."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4909","kind":"arxiv","version":2},"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-18T02:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdgM/HSeMhj5tdU/Ivz+wmNwrupCr8/c656VL7Rl7yqsbQmZitofHZAmbgwXM5iMc30ezNVpVTNXs5tTE1BYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:15:28.811813Z"},"content_sha256":"b0c767f5cc5d8d9cac43032a3f3c48ff71e8b212a598613493246170aaf2bcb9","schema_version":"1.0","event_id":"sha256:b0c767f5cc5d8d9cac43032a3f3c48ff71e8b212a598613493246170aaf2bcb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZ5PAQNXK6DHJXWJVF4KSVUNGW/bundle.json","state_url":"https://pith.science/pith/RZ5PAQNXK6DHJXWJVF4KSVUNGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZ5PAQNXK6DHJXWJVF4KSVUNGW/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-06T18:15:28Z","links":{"resolver":"https://pith.science/pith/RZ5PAQNXK6DHJXWJVF4KSVUNGW","bundle":"https://pith.science/pith/RZ5PAQNXK6DHJXWJVF4KSVUNGW/bundle.json","state":"https://pith.science/pith/RZ5PAQNXK6DHJXWJVF4KSVUNGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZ5PAQNXK6DHJXWJVF4KSVUNGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RZ5PAQNXK6DHJXWJVF4KSVUNGW","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":"bf91457db1daf8e94a970a6cfad8b29676b8cb3b4967ed67fdee81de2c454e20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T18:37:12Z","title_canon_sha256":"e56efd84abf21aeb5470a6ef7c783bc71a5d4fd480127b36f49324d405da0abc"},"schema_version":"1.0","source":{"id":"1305.4909","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4909","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4909v2","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4909","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"RZ5PAQNXK6DH","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RZ5PAQNXK6DHJXWJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RZ5PAQNX","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:b0c767f5cc5d8d9cac43032a3f3c48ff71e8b212a598613493246170aaf2bcb9","target":"graph","created_at":"2026-05-18T02:53:27Z","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":"In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these decompositions that contain no such block or tangle, and determine conditions under which such parts contain nothing but a k-block.","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-21T18:37:12Z","title":"Canonical tree-decompositions of finite graphs II. Essential parts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4909","kind":"arxiv","version":2},"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:e9b40a01840d7ac60c023892eeef56d75ecc0153c4f0a36387798cd8fd4da29f","target":"record","created_at":"2026-05-18T02:53:27Z","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":"bf91457db1daf8e94a970a6cfad8b29676b8cb3b4967ed67fdee81de2c454e20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-21T18:37:12Z","title_canon_sha256":"e56efd84abf21aeb5470a6ef7c783bc71a5d4fd480127b36f49324d405da0abc"},"schema_version":"1.0","source":{"id":"1305.4909","kind":"arxiv","version":2}},"canonical_sha256":"8e7af041b7578674dec9a978a9568d3580a4d350bd3385e7deea373d139587f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e7af041b7578674dec9a978a9568d3580a4d350bd3385e7deea373d139587f0","first_computed_at":"2026-05-18T02:53:27.028549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:27.028549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GSOvxwKBzl0+1vt9p9nbqT88Y5WWkHtI61RUH4ksbpt69+H2IDpxNVsnagjJvDNKu3E6hqYrko4aLw590gUYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:27.029235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4909","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9b40a01840d7ac60c023892eeef56d75ecc0153c4f0a36387798cd8fd4da29f","sha256:b0c767f5cc5d8d9cac43032a3f3c48ff71e8b212a598613493246170aaf2bcb9"],"state_sha256":"1f4abaa7d3851ae527a9c9fff80bdfa92a5ee7daaf2497a93fdf8cb92a2ab36b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCTTnvlEiTSNwTMefLrbDk0Gz7tjN/7xBoAjlf3HwyVgOYW4oRERANHImDSF7YKOz7oHqCddY7sbwbg6iVDRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:15:28.815653Z","bundle_sha256":"16ac9190ddbf9da42b7fff9151cca3760dd2cc35ba1d568f8980454404e5b3cc"}}