{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GWZFMLM3BKOHLWJCGX4UUSCTW5","short_pith_number":"pith:GWZFMLM3","canonical_record":{"source":{"id":"1103.4686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-24T06:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"298b07d6f0ead8f2452b32889b7d60b4a5fa0b7f844fb87ca8936d8b511c04df","abstract_canon_sha256":"145196c8f5e13831fc7d8a11a5e65d2bca2489212527b47aba63ba9bbcfad394"},"schema_version":"1.0"},"canonical_sha256":"35b2562d9b0a9c75d92235f94a4853b76f4081614065d4921bd77b6596bba207","source":{"kind":"arxiv","id":"1103.4686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4686","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4686v1","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4686","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"GWZFMLM3BKOH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GWZFMLM3BKOHLWJC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GWZFMLM3","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GWZFMLM3BKOHLWJCGX4UUSCTW5","target":"record","payload":{"canonical_record":{"source":{"id":"1103.4686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-24T06:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"298b07d6f0ead8f2452b32889b7d60b4a5fa0b7f844fb87ca8936d8b511c04df","abstract_canon_sha256":"145196c8f5e13831fc7d8a11a5e65d2bca2489212527b47aba63ba9bbcfad394"},"schema_version":"1.0"},"canonical_sha256":"35b2562d9b0a9c75d92235f94a4853b76f4081614065d4921bd77b6596bba207","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:01.082124Z","signature_b64":"hsDf4NcIdzyxKziuqCq6PGcxmq8CVNaUQW0nbWJvEjd7EfPfil7c0X+vocO1kA/hgaYrSNBJ9DrR8rw85Ac5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35b2562d9b0a9c75d92235f94a4853b76f4081614065d4921bd77b6596bba207","last_reissued_at":"2026-05-18T04:26:01.081591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:01.081591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.4686","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:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3U+Cz68vc/708A8tATJ2Cr/tjcZTTFhsQjzn3ZptvuKV+VkEPwbkiNAqLx/7id+ZjJ8pWDg6kt8FbBXlau5kAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:21:38.529418Z"},"content_sha256":"ad68457f862c601dfa992c8d4eeb132d8117b5523e537fb6f150161feaad7048","schema_version":"1.0","event_id":"sha256:ad68457f862c601dfa992c8d4eeb132d8117b5523e537fb6f150161feaad7048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GWZFMLM3BKOHLWJCGX4UUSCTW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on minimally k-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"R Rama, Suresh Badarla","submitted_at":"2011-03-24T06:35:29Z","abstract_excerpt":"A k-tree is either a complete graph on (k+1) vertices or given a k-tree G' with n vertices, a k-tree G with (n+1) vertices can be constructed by introducing a new vertex v and picking a k-clique Q in G' and then joining each vertex u in Q. A graph G is k-edge-connected if the graph remains connected even after deleting fewer edges than k from the graph. A k-edge-connected graph G is said to be minimally k-connected if G \\ {e} is no longer k-edge-connected for any edge e belongs to E(G) where E(G) denotes the set of edges of G. In this paper we find two separate O (n2) algorithms so that a mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4686","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:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMTjHw74hPlQXhG9XJCjhNXmYHPDw5aZrQ5GEnjFJuhjVBbCNA92nxysjFKKbRqARd7tM6rr2+F3VW3Trs2HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:21:38.530110Z"},"content_sha256":"9376aecaf8c300968af101c6e12264ba346c468019a9427040a06a86fc68320d","schema_version":"1.0","event_id":"sha256:9376aecaf8c300968af101c6e12264ba346c468019a9427040a06a86fc68320d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWZFMLM3BKOHLWJCGX4UUSCTW5/bundle.json","state_url":"https://pith.science/pith/GWZFMLM3BKOHLWJCGX4UUSCTW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWZFMLM3BKOHLWJCGX4UUSCTW5/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-08T21:21:38Z","links":{"resolver":"https://pith.science/pith/GWZFMLM3BKOHLWJCGX4UUSCTW5","bundle":"https://pith.science/pith/GWZFMLM3BKOHLWJCGX4UUSCTW5/bundle.json","state":"https://pith.science/pith/GWZFMLM3BKOHLWJCGX4UUSCTW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWZFMLM3BKOHLWJCGX4UUSCTW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GWZFMLM3BKOHLWJCGX4UUSCTW5","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":"145196c8f5e13831fc7d8a11a5e65d2bca2489212527b47aba63ba9bbcfad394","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-24T06:35:29Z","title_canon_sha256":"298b07d6f0ead8f2452b32889b7d60b4a5fa0b7f844fb87ca8936d8b511c04df"},"schema_version":"1.0","source":{"id":"1103.4686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4686","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4686v1","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4686","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"GWZFMLM3BKOH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GWZFMLM3BKOHLWJC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GWZFMLM3","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:9376aecaf8c300968af101c6e12264ba346c468019a9427040a06a86fc68320d","target":"graph","created_at":"2026-05-18T04:26:01Z","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-tree is either a complete graph on (k+1) vertices or given a k-tree G' with n vertices, a k-tree G with (n+1) vertices can be constructed by introducing a new vertex v and picking a k-clique Q in G' and then joining each vertex u in Q. A graph G is k-edge-connected if the graph remains connected even after deleting fewer edges than k from the graph. A k-edge-connected graph G is said to be minimally k-connected if G \\ {e} is no longer k-edge-connected for any edge e belongs to E(G) where E(G) denotes the set of edges of G. In this paper we find two separate O (n2) algorithms so that a mini","authors_text":"R Rama, Suresh Badarla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-24T06:35:29Z","title":"Note on minimally k-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4686","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:ad68457f862c601dfa992c8d4eeb132d8117b5523e537fb6f150161feaad7048","target":"record","created_at":"2026-05-18T04:26:01Z","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":"145196c8f5e13831fc7d8a11a5e65d2bca2489212527b47aba63ba9bbcfad394","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-24T06:35:29Z","title_canon_sha256":"298b07d6f0ead8f2452b32889b7d60b4a5fa0b7f844fb87ca8936d8b511c04df"},"schema_version":"1.0","source":{"id":"1103.4686","kind":"arxiv","version":1}},"canonical_sha256":"35b2562d9b0a9c75d92235f94a4853b76f4081614065d4921bd77b6596bba207","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35b2562d9b0a9c75d92235f94a4853b76f4081614065d4921bd77b6596bba207","first_computed_at":"2026-05-18T04:26:01.081591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:01.081591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hsDf4NcIdzyxKziuqCq6PGcxmq8CVNaUQW0nbWJvEjd7EfPfil7c0X+vocO1kA/hgaYrSNBJ9DrR8rw85Ac5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:01.082124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad68457f862c601dfa992c8d4eeb132d8117b5523e537fb6f150161feaad7048","sha256:9376aecaf8c300968af101c6e12264ba346c468019a9427040a06a86fc68320d"],"state_sha256":"9e02a5de13e93181b1acfa1bd3f697d619bc03feea94f0e78a3093d62e93f658"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAhvQxyNSph7DYmA00fTFku4//s8zfwUxSd6PBqMcqx8o+CB/VbfbHT8EEXpmMo1hz+FVJRZlM9xkmxc9kpYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:21:38.534674Z","bundle_sha256":"834d9882eebaebaeaaeebf33d0c725cbd3750ec3ef66f42deaf75b1107f46ee0"}}