{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UDR7JD5TEA3PRC2PLXIHQZUPC7","short_pith_number":"pith:UDR7JD5T","canonical_record":{"source":{"id":"1012.2928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T04:40:40Z","cross_cats_sorted":[],"title_canon_sha256":"2dbdd56334b7f5800645709ca7af3bc2920eeea82288bff510522fa3e9c2d41b","abstract_canon_sha256":"e6836ea437b22526cd08fb37c89d052428c54b5426c0ac0d7063a9769823d8d5"},"schema_version":"1.0"},"canonical_sha256":"a0e3f48fb32036f88b4f5dd078668f17fc38e3f4d67741e20c178315ea52efbf","source":{"kind":"arxiv","id":"1012.2928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2928","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2928v2","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2928","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"UDR7JD5TEA3P","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UDR7JD5TEA3PRC2P","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UDR7JD5T","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UDR7JD5TEA3PRC2PLXIHQZUPC7","target":"record","payload":{"canonical_record":{"source":{"id":"1012.2928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T04:40:40Z","cross_cats_sorted":[],"title_canon_sha256":"2dbdd56334b7f5800645709ca7af3bc2920eeea82288bff510522fa3e9c2d41b","abstract_canon_sha256":"e6836ea437b22526cd08fb37c89d052428c54b5426c0ac0d7063a9769823d8d5"},"schema_version":"1.0"},"canonical_sha256":"a0e3f48fb32036f88b4f5dd078668f17fc38e3f4d67741e20c178315ea52efbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:35.022537Z","signature_b64":"wWE7QONbAXEGFCF4bK7TUr2HbXYTp2L0oTtix/D00xZQjDDY8Dv9wFEejyNEyLT1jW8hggwDsNaB81rNxBWVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0e3f48fb32036f88b4f5dd078668f17fc38e3f4d67741e20c178315ea52efbf","last_reissued_at":"2026-05-18T04:24:35.022114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:35.022114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.2928","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjfMCJ0kDDZoMEsd6oe7z0xvU7b/2gH0K16ykzmPWqK8t+4oHbow9SWvWGEMKmPTUcV8ZzQTkTHcIGiZFRU7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:51:51.436980Z"},"content_sha256":"296693b3712c7ae6c3e3460dbec855c0db9b4a6d17c9ab885776237924272e49","schema_version":"1.0","event_id":"sha256:296693b3712c7ae6c3e3460dbec855c0db9b4a6d17c9ab885776237924272e49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UDR7JD5TEA3PRC2PLXIHQZUPC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uncoverings on graphs and network reliability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett Stevens, Robert F. Bailey","submitted_at":"2010-12-14T04:40:40Z","abstract_excerpt":"We propose a network protocol similar to the $k$-tree protocol of Itai and Rodeh [{\\em Inform.\\ and Comput.}\\ {\\bf 79} (1988), 43--59]. To do this, we define an {\\em $t$-uncovering-by-bases} for a connected graph $G$ to be a collection $\\mathcal{U}$ of spanning trees for $G$ such that any $t$-subset of edges of $G$ is disjoint from at least one tree in $\\mathcal{U}$, where $t$ is some integer strictly less than the edge connectivity of $G$. We construct examples of these for some infinite families of graphs. Many of these infinite families utilise factorisations or decompositions of graphs. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2928","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsTLAKMetxiK/uJ3QC5pGt+uxR3z1aL+P5o+c3Mv9mr/YLQjlJKvvvnB1/xP69lM6+Qog19QsTfNe27PlSGSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:51:51.437329Z"},"content_sha256":"5f4b3bbcbf60006194888f966f0fe695feddb2bfc6fcecaa9993e8b9c9e83a2b","schema_version":"1.0","event_id":"sha256:5f4b3bbcbf60006194888f966f0fe695feddb2bfc6fcecaa9993e8b9c9e83a2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDR7JD5TEA3PRC2PLXIHQZUPC7/bundle.json","state_url":"https://pith.science/pith/UDR7JD5TEA3PRC2PLXIHQZUPC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDR7JD5TEA3PRC2PLXIHQZUPC7/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:51:51Z","links":{"resolver":"https://pith.science/pith/UDR7JD5TEA3PRC2PLXIHQZUPC7","bundle":"https://pith.science/pith/UDR7JD5TEA3PRC2PLXIHQZUPC7/bundle.json","state":"https://pith.science/pith/UDR7JD5TEA3PRC2PLXIHQZUPC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDR7JD5TEA3PRC2PLXIHQZUPC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UDR7JD5TEA3PRC2PLXIHQZUPC7","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":"e6836ea437b22526cd08fb37c89d052428c54b5426c0ac0d7063a9769823d8d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T04:40:40Z","title_canon_sha256":"2dbdd56334b7f5800645709ca7af3bc2920eeea82288bff510522fa3e9c2d41b"},"schema_version":"1.0","source":{"id":"1012.2928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2928","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2928v2","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2928","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"UDR7JD5TEA3P","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UDR7JD5TEA3PRC2P","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UDR7JD5T","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:5f4b3bbcbf60006194888f966f0fe695feddb2bfc6fcecaa9993e8b9c9e83a2b","target":"graph","created_at":"2026-05-18T04:24:35Z","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":"We propose a network protocol similar to the $k$-tree protocol of Itai and Rodeh [{\\em Inform.\\ and Comput.}\\ {\\bf 79} (1988), 43--59]. To do this, we define an {\\em $t$-uncovering-by-bases} for a connected graph $G$ to be a collection $\\mathcal{U}$ of spanning trees for $G$ such that any $t$-subset of edges of $G$ is disjoint from at least one tree in $\\mathcal{U}$, where $t$ is some integer strictly less than the edge connectivity of $G$. We construct examples of these for some infinite families of graphs. Many of these infinite families utilise factorisations or decompositions of graphs. In","authors_text":"Brett Stevens, Robert F. Bailey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T04:40:40Z","title":"Uncoverings on graphs and network reliability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2928","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:296693b3712c7ae6c3e3460dbec855c0db9b4a6d17c9ab885776237924272e49","target":"record","created_at":"2026-05-18T04:24:35Z","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":"e6836ea437b22526cd08fb37c89d052428c54b5426c0ac0d7063a9769823d8d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T04:40:40Z","title_canon_sha256":"2dbdd56334b7f5800645709ca7af3bc2920eeea82288bff510522fa3e9c2d41b"},"schema_version":"1.0","source":{"id":"1012.2928","kind":"arxiv","version":2}},"canonical_sha256":"a0e3f48fb32036f88b4f5dd078668f17fc38e3f4d67741e20c178315ea52efbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0e3f48fb32036f88b4f5dd078668f17fc38e3f4d67741e20c178315ea52efbf","first_computed_at":"2026-05-18T04:24:35.022114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:35.022114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wWE7QONbAXEGFCF4bK7TUr2HbXYTp2L0oTtix/D00xZQjDDY8Dv9wFEejyNEyLT1jW8hggwDsNaB81rNxBWVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:35.022537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:296693b3712c7ae6c3e3460dbec855c0db9b4a6d17c9ab885776237924272e49","sha256:5f4b3bbcbf60006194888f966f0fe695feddb2bfc6fcecaa9993e8b9c9e83a2b"],"state_sha256":"533aaa25e6c63aa04980ece3c487d6e33cd4982a2ddbb7ea4aabc2c314f2a7d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dRoDr8h3BL10CD+CuHnaFkDwDkhZeML/JPO3HlnaZ/nvlBY3DY2qou+BLyqND30nQ0zi9BhK6SJbzkFi8VQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:51:51.439460Z","bundle_sha256":"52640d64ba4fd8467dedc8eb4d3229de2a2f88cf8e442d3a32f4309f6a9a1bc6"}}