{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YK26WBGHGNUFSM45OOUOYGGXP3","short_pith_number":"pith:YK26WBGH","canonical_record":{"source":{"id":"1711.09655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-27T12:38:45Z","cross_cats_sorted":[],"title_canon_sha256":"cc219fb1ac2fcacb6f557153f6ba85c69607d7a1058fd2e94331ca7001b21200","abstract_canon_sha256":"86e43edbf78280bd2883ca1442a28738c954b3c2919f30232afb0a59e785c089"},"schema_version":"1.0"},"canonical_sha256":"c2b5eb04c7336859339d73a8ec18d77ef266fd6edb42fc525d0cf27b3a4a3071","source":{"kind":"arxiv","id":"1711.09655","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09655","created_at":"2026-05-18T00:29:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09655v1","created_at":"2026-05-18T00:29:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09655","created_at":"2026-05-18T00:29:34Z"},{"alias_kind":"pith_short_12","alias_value":"YK26WBGHGNUF","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YK26WBGHGNUFSM45","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YK26WBGH","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YK26WBGHGNUFSM45OOUOYGGXP3","target":"record","payload":{"canonical_record":{"source":{"id":"1711.09655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-27T12:38:45Z","cross_cats_sorted":[],"title_canon_sha256":"cc219fb1ac2fcacb6f557153f6ba85c69607d7a1058fd2e94331ca7001b21200","abstract_canon_sha256":"86e43edbf78280bd2883ca1442a28738c954b3c2919f30232afb0a59e785c089"},"schema_version":"1.0"},"canonical_sha256":"c2b5eb04c7336859339d73a8ec18d77ef266fd6edb42fc525d0cf27b3a4a3071","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:34.911121Z","signature_b64":"UwEzyz/7QnPvQbSUTtNggPNhBWO5yemsKILRKnzJCWW4VgPlWecwB1j7ZAAEU48PX1GdH/lMbLWIOBp58CJtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b5eb04c7336859339d73a8ec18d77ef266fd6edb42fc525d0cf27b3a4a3071","last_reissued_at":"2026-05-18T00:29:34.910482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:34.910482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.09655","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-18T00:29:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avxEDwK14bymyhIDVkP45XapovhPC7oxUH5qOMQr1ZExJ1WvmJUFkMRKU21kApzyMEyhXvoMJZh1HY8I2ORVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:34:10.547932Z"},"content_sha256":"66fccc591c7d594ae3beeebc2a11bc278fa127579075135855e91e3a7055a42c","schema_version":"1.0","event_id":"sha256:66fccc591c7d594ae3beeebc2a11bc278fa127579075135855e91e3a7055a42c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YK26WBGHGNUFSM45OOUOYGGXP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inverse Perron values and connectivity of a uniform hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Changjiang Bu, Haifeng Li, Jiang Zhou","submitted_at":"2017-11-27T12:38:45Z","abstract_excerpt":"In this paper, we show that a uniform hypergraph $\\mathcal{G}$ is connected if and only if one of its inverse Perron values is larger than $0$. We give some bounds on the bipartition width, isoperimetric number and eccentricities of $\\mathcal{G}$ in terms of inverse Perron values. By using the inverse Perron values, we give an estimation of the edge connectivity of a $2$-design, and determine the explicit edge connectivity of a symmetric design. Moreover, relations between the inverse Perron values and resistance distance of a connected graph are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09655","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-18T00:29:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npHgG7ZPlOqQQWkaDrALmoQlMd/osjHU9CE229YTkq1HgRwM8naMO5pM6m5B8uE8famabwYgEjOzmV2VfR7cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:34:10.548591Z"},"content_sha256":"1efe21baf45fc2e03170f2e539758095aa739b9b87aa9b5c4cefa69dde513d90","schema_version":"1.0","event_id":"sha256:1efe21baf45fc2e03170f2e539758095aa739b9b87aa9b5c4cefa69dde513d90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YK26WBGHGNUFSM45OOUOYGGXP3/bundle.json","state_url":"https://pith.science/pith/YK26WBGHGNUFSM45OOUOYGGXP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YK26WBGHGNUFSM45OOUOYGGXP3/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-30T12:34:10Z","links":{"resolver":"https://pith.science/pith/YK26WBGHGNUFSM45OOUOYGGXP3","bundle":"https://pith.science/pith/YK26WBGHGNUFSM45OOUOYGGXP3/bundle.json","state":"https://pith.science/pith/YK26WBGHGNUFSM45OOUOYGGXP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YK26WBGHGNUFSM45OOUOYGGXP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YK26WBGHGNUFSM45OOUOYGGXP3","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":"86e43edbf78280bd2883ca1442a28738c954b3c2919f30232afb0a59e785c089","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-27T12:38:45Z","title_canon_sha256":"cc219fb1ac2fcacb6f557153f6ba85c69607d7a1058fd2e94331ca7001b21200"},"schema_version":"1.0","source":{"id":"1711.09655","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09655","created_at":"2026-05-18T00:29:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09655v1","created_at":"2026-05-18T00:29:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09655","created_at":"2026-05-18T00:29:34Z"},{"alias_kind":"pith_short_12","alias_value":"YK26WBGHGNUF","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YK26WBGHGNUFSM45","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YK26WBGH","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:1efe21baf45fc2e03170f2e539758095aa739b9b87aa9b5c4cefa69dde513d90","target":"graph","created_at":"2026-05-18T00:29:34Z","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 this paper, we show that a uniform hypergraph $\\mathcal{G}$ is connected if and only if one of its inverse Perron values is larger than $0$. We give some bounds on the bipartition width, isoperimetric number and eccentricities of $\\mathcal{G}$ in terms of inverse Perron values. By using the inverse Perron values, we give an estimation of the edge connectivity of a $2$-design, and determine the explicit edge connectivity of a symmetric design. Moreover, relations between the inverse Perron values and resistance distance of a connected graph are presented.","authors_text":"Changjiang Bu, Haifeng Li, Jiang Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-27T12:38:45Z","title":"Inverse Perron values and connectivity of a uniform hypergraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09655","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:66fccc591c7d594ae3beeebc2a11bc278fa127579075135855e91e3a7055a42c","target":"record","created_at":"2026-05-18T00:29:34Z","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":"86e43edbf78280bd2883ca1442a28738c954b3c2919f30232afb0a59e785c089","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-27T12:38:45Z","title_canon_sha256":"cc219fb1ac2fcacb6f557153f6ba85c69607d7a1058fd2e94331ca7001b21200"},"schema_version":"1.0","source":{"id":"1711.09655","kind":"arxiv","version":1}},"canonical_sha256":"c2b5eb04c7336859339d73a8ec18d77ef266fd6edb42fc525d0cf27b3a4a3071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2b5eb04c7336859339d73a8ec18d77ef266fd6edb42fc525d0cf27b3a4a3071","first_computed_at":"2026-05-18T00:29:34.910482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:34.910482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UwEzyz/7QnPvQbSUTtNggPNhBWO5yemsKILRKnzJCWW4VgPlWecwB1j7ZAAEU48PX1GdH/lMbLWIOBp58CJtDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:34.911121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09655","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66fccc591c7d594ae3beeebc2a11bc278fa127579075135855e91e3a7055a42c","sha256:1efe21baf45fc2e03170f2e539758095aa739b9b87aa9b5c4cefa69dde513d90"],"state_sha256":"d71c30d77a71cad77a425b998493601610eb95ef2391c5a9342cc96bd12bc87e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMgQkPHE/HaGKAZgSuTZRu2GiTwRNvCGxdhppSS+XIlUNB4vFGhZamlcV4cUPXKWIvGSgcZ9loIgEIwYnGWvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:34:10.550876Z","bundle_sha256":"1a02c3f79b7227e11fac230a45deea163b323b3222feef551df7e703cad77456"}}