{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FSNPMT75U44CZNKNPKQZIVVO77","short_pith_number":"pith:FSNPMT75","canonical_record":{"source":{"id":"1102.5181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T07:58:03Z","cross_cats_sorted":[],"title_canon_sha256":"d74603c797c90ea3b7f3b33127a0a54e5c9b5269ea2f5f44b8d0f3ba5c44eac3","abstract_canon_sha256":"4599381528a03fd0726abddd11661327493c076aaa66aa9c399f70d5468e6132"},"schema_version":"1.0"},"canonical_sha256":"2c9af64ffda7382cb54d7aa19456aeffd2e1d2f32cd907d297fab0bfd248c866","source":{"kind":"arxiv","id":"1102.5181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5181","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5181v1","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5181","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"FSNPMT75U44C","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FSNPMT75U44CZNKN","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FSNPMT75","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FSNPMT75U44CZNKNPKQZIVVO77","target":"record","payload":{"canonical_record":{"source":{"id":"1102.5181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T07:58:03Z","cross_cats_sorted":[],"title_canon_sha256":"d74603c797c90ea3b7f3b33127a0a54e5c9b5269ea2f5f44b8d0f3ba5c44eac3","abstract_canon_sha256":"4599381528a03fd0726abddd11661327493c076aaa66aa9c399f70d5468e6132"},"schema_version":"1.0"},"canonical_sha256":"2c9af64ffda7382cb54d7aa19456aeffd2e1d2f32cd907d297fab0bfd248c866","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:56.117744Z","signature_b64":"Q3CDNO/Ggd2SnVhwVZXEnHDFdUfIkppWAaBCh+YWJlhFg3VKn6i0Wsfrm70Zi2OTRQhecG+cUupYsBVazkRjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c9af64ffda7382cb54d7aa19456aeffd2e1d2f32cd907d297fab0bfd248c866","last_reissued_at":"2026-05-18T04:27:56.117083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:56.117083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.5181","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:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkC1Bh3LeKrhSvkuQAw0y2InzEGD5XEEfAC+M3231UMcr3PJvDKtvWxdCJr3LrAtEUy/P7F46R7oop/THpL4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:40:29.717038Z"},"content_sha256":"9232f3273c5f509b3e9120f417ab21eaec97c30da02b991c9a2513a31410c261","schema_version":"1.0","event_id":"sha256:9232f3273c5f509b3e9120f417ab21eaec97c30da02b991c9a2513a31410c261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FSNPMT75U44CZNKNPKQZIVVO77","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the edge connectivity of direct products with dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei Wang, Zhidan Yan","submitted_at":"2011-02-25T07:58:03Z","abstract_excerpt":"Let $\\kappa'(G)$ be the edge connectivity of $G$ and $G\\times H$ the direct product of $G$ and $H$. Let $H$ be an arbitrary dense graph with minimal degree $\\delta(H)>|H|/2$. We prove that for any graph $G$, $\\kappa'(G\\times H)=\\textup{min}\\{2\\kappa'(G)e(H),\\delta(G)\\delta(H)\\}$, where $e(H)$ denotes the number of edges in $H$. In addition, the structure of minimum edge cuts is described. As an application, we present a necessary and sufficient condition for $G\\times K_n(n\\ge3)$ to be super edge connected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5181","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:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNDBKttdv9oVL6Xfu0DDfCDIw8xkVyxbjN/RPrYV9l+ffomS+o4u4N2G1J+KJrMZyTe6r4kydSMb2lZIKVkiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:40:29.717394Z"},"content_sha256":"0f21810393a3cd1c765b62970b587cc10079fe0309b65d7b53294562841778cc","schema_version":"1.0","event_id":"sha256:0f21810393a3cd1c765b62970b587cc10079fe0309b65d7b53294562841778cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSNPMT75U44CZNKNPKQZIVVO77/bundle.json","state_url":"https://pith.science/pith/FSNPMT75U44CZNKNPKQZIVVO77/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSNPMT75U44CZNKNPKQZIVVO77/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-24T22:40:29Z","links":{"resolver":"https://pith.science/pith/FSNPMT75U44CZNKNPKQZIVVO77","bundle":"https://pith.science/pith/FSNPMT75U44CZNKNPKQZIVVO77/bundle.json","state":"https://pith.science/pith/FSNPMT75U44CZNKNPKQZIVVO77/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSNPMT75U44CZNKNPKQZIVVO77/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FSNPMT75U44CZNKNPKQZIVVO77","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":"4599381528a03fd0726abddd11661327493c076aaa66aa9c399f70d5468e6132","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T07:58:03Z","title_canon_sha256":"d74603c797c90ea3b7f3b33127a0a54e5c9b5269ea2f5f44b8d0f3ba5c44eac3"},"schema_version":"1.0","source":{"id":"1102.5181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5181","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5181v1","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5181","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"FSNPMT75U44C","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FSNPMT75U44CZNKN","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FSNPMT75","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:0f21810393a3cd1c765b62970b587cc10079fe0309b65d7b53294562841778cc","target":"graph","created_at":"2026-05-18T04:27:56Z","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":"Let $\\kappa'(G)$ be the edge connectivity of $G$ and $G\\times H$ the direct product of $G$ and $H$. Let $H$ be an arbitrary dense graph with minimal degree $\\delta(H)>|H|/2$. We prove that for any graph $G$, $\\kappa'(G\\times H)=\\textup{min}\\{2\\kappa'(G)e(H),\\delta(G)\\delta(H)\\}$, where $e(H)$ denotes the number of edges in $H$. In addition, the structure of minimum edge cuts is described. As an application, we present a necessary and sufficient condition for $G\\times K_n(n\\ge3)$ to be super edge connected.","authors_text":"Wei Wang, Zhidan Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T07:58:03Z","title":"On the edge connectivity of direct products with dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5181","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:9232f3273c5f509b3e9120f417ab21eaec97c30da02b991c9a2513a31410c261","target":"record","created_at":"2026-05-18T04:27:56Z","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":"4599381528a03fd0726abddd11661327493c076aaa66aa9c399f70d5468e6132","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T07:58:03Z","title_canon_sha256":"d74603c797c90ea3b7f3b33127a0a54e5c9b5269ea2f5f44b8d0f3ba5c44eac3"},"schema_version":"1.0","source":{"id":"1102.5181","kind":"arxiv","version":1}},"canonical_sha256":"2c9af64ffda7382cb54d7aa19456aeffd2e1d2f32cd907d297fab0bfd248c866","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c9af64ffda7382cb54d7aa19456aeffd2e1d2f32cd907d297fab0bfd248c866","first_computed_at":"2026-05-18T04:27:56.117083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:56.117083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q3CDNO/Ggd2SnVhwVZXEnHDFdUfIkppWAaBCh+YWJlhFg3VKn6i0Wsfrm70Zi2OTRQhecG+cUupYsBVazkRjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:56.117744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9232f3273c5f509b3e9120f417ab21eaec97c30da02b991c9a2513a31410c261","sha256:0f21810393a3cd1c765b62970b587cc10079fe0309b65d7b53294562841778cc"],"state_sha256":"4e5595bfbade53d95a180a0ae0295237c5acc8497056efb51a657dbb4e7031af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mfe1xawRexlYTEPLQt3UGJgwsdHJKzXCYPhcSJJvaFCYm/A8RC/tTDOmn+qFNx0EsNxz5XZsT02df7E4gUMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:40:29.719298Z","bundle_sha256":"406ec069995d3fa18ef29fe87b5d6cdbe4d446a91bf4acaccd1abcf59a6e3c62"}}